Integer, Intent (In)	::	n, lda, ldvl, ldvr, lwork
Integer, Intent (Out)	::	info
Real (Kind=nag_wp), Intent (Inout)	::	a(lda,), wr(), wi(), vl(ldvl,), vr(ldvr,*)
Real (Kind=nag_wp), Intent (Out)	::	work(max(1,lwork))
Character (1), Intent (In)	::	jobvl, jobvr

C Header Interface

#include nagmk26.h

void	f08naf_ ( const char jobvl, const char jobvr, const Integer n, double a[], const Integer lda, double wr[], double wi[], double vl[], const Integer ldvl, double vr[], const Integer ldvr, double work[], const Integer lwork, Integer info, const Charlen length_jobvl, const Charlen length_jobvr)

The routine may be called by its LAPACK name dgeev.

3

Description

The right eigenvector

v_{j}

A

satisfies

A v_{j} = λ_{j} v_{j}

where

λ_{j}

is the

j

th eigenvalue of

A

. The left eigenvector

u_{j}

A

satisfies

u_{j}^{H} A = λ_{j} u_{j}^{H}

where

u_{j}^{H}

denotes the conjugate transpose of

u_{j}

The matrix

A

is first reduced to upper Hessenberg form by means of orthogonal similarity transformations, and the

Q R

algorithm is then used to further reduce the matrix to upper quasi-triangular Schur form,

T

, with

1

1

and

2

2

blocks on the main diagonal. The eigenvalues are computed from

T

, the

2

2

blocks corresponding to complex conjugate pairs and, optionally, the eigenvectors of

T

are computed and backtransformed to the eigenvectors of

A

4

References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia http://www.netlib.org/lapack/lug

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5

Arguments

1: $jobvl$ – Character(1)Input

On entry: if

jobvl ='N'

, the left eigenvectors of

A

are not computed.

jobvl ='V'

, the left eigenvectors of

A

are computed.

Constraint:

jobvl ='N'

'V'

2: $jobvr$ – Character(1)Input

On entry: if

jobvr ='N'

, the right eigenvectors of

A

are not computed.

jobvr ='V'

, the right eigenvectors of

A

are computed.

Constraint:

jobvr ='N'

'V'

3: $n$ – IntegerInput

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 0

4: $a (lda *)$ – Real (Kind=nag_wp) arrayInput/Output

Note: the second dimension of the array a must be at least

\max (1, n)

On entry: the

n

n

matrix

A

On exit: a has been overwritten.

5: $lda$ – IntegerInput

On entry: the first dimension of the array a as declared in the (sub)program from which f08naf (dgeev) is called.

Constraint:

lda \geq \max (1, n)

6: $wr (*)$ – Real (Kind=nag_wp) arrayOutput

7: $wi (*)$ – Real (Kind=nag_wp) arrayOutput

Note: the dimension of the arrays wr and wi must be at least

\max (1, n)

On exit: wr and wi contain the real and imaginary parts, respectively, of the computed eigenvalues. Complex conjugate pairs of eigenvalues appear consecutively with the eigenvalue having the positive imaginary part first.

8: $vl (ldvl *)$ – Real (Kind=nag_wp) arrayOutput

Note: the second dimension of the array vl must be at least

\max (1, n)

jobvl ='V'

, and at least

1

otherwise.

On exit: if

jobvl ='V'

, the left eigenvectors

u_{j}

are stored one after another in the columns of vl, in the same order as their corresponding eigenvalues. If the

j

th eigenvalue is real, then

u_{j} = vl (: j)

, the

j

th column of vl. If the

j

th and

(j + 1)

st eigenvalues form a complex conjugate pair, then

u_{j} = vl (: j) + i \times vl (: j + 1)

and

u_{j + 1} = vl (: j) - i \times vl (: j + 1)

jobvl ='N'

, vl is not referenced.

9: $ldvl$ – IntegerInput

On entry: the first dimension of the array vl as declared in the (sub)program from which f08naf (dgeev) is called.

Constraints:

if $jobvl ='V'$ , $ldvl \geq \max (1, n)$ ;
otherwise $ldvl \geq 1$ .

10: $vr (ldvr *)$ – Real (Kind=nag_wp) arrayOutput

Note: the second dimension of the array vr must be at least

\max (1, n)

jobvr ='V'

, and at least

1

otherwise.

On exit: if

jobvr ='V'

, the right eigenvectors

v_{j}

are stored one after another in the columns of vr, in the same order as their corresponding eigenvalues. If the

j

th eigenvalue is real, then

v_{j} = vr (: j)

, the

j

th column of vr. If the

j

th and

(j + 1)

st eigenvalues form a complex conjugate pair, then

v_{j} = vr (: j) + i \times vr (: j + 1)

and

v_{j + 1} = vr (: j) - i \times vr (: j + 1)

jobvr ='N'

, vr is not referenced.

11: $ldvr$ – IntegerInput

On entry: the first dimension of the array vr as declared in the (sub)program from which f08naf (dgeev) is called.

Constraints:

if $jobvr ='V'$ , $ldvr \geq \max (1, n)$ ;
otherwise $ldvr \geq 1$ .

12: $work (\max (1, lwork))$ – Real (Kind=nag_wp) arrayWorkspace

On exit: if

info = 0

work (1)

contains the minimum value of lwork required for optimal performance.

13: $lwork$ – IntegerInput

On entry: the dimension of the array work as declared in the (sub)program from which f08naf (dgeev) is called.

lwork = - 1

, a workspace query is assumed; the routine only calculates the optimal size of the work array, returns this value as the first entry of the work array, and no error message related to lwork is issued.

Suggested value: for optimal performance, lwork must generally be larger than the minimum, say,

4 \times n + nb \times n

, where

nb

is the optimal block size of f08nef (dgehrd).

Constraints:

if $jobvl ='V'$ or $jobvr ='V'$ , $lwork \geq 4 \times n$ ;
otherwise $lwork \geq \max (1, 3 \times n)$ .

14: $info$ – IntegerOutput

On exit:

info = 0

unless the routine detects an error (see Section 6).

6

Error Indicators and Warnings

$info < 0$: If $info = - i$ , argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

$info > 0$: The $Q R$ algorithm failed to compute all the eigenvalues, and no eigenvectors have been computed; elements $〈value〉$ to n of wr and wi contain eigenvalues which have converged.

7

Accuracy

The computed eigenvalues and eigenvectors are exact for a nearby matrix

(A + E)

, where

{‖E‖}_{2} = O (ε) {‖A‖}_{2},

and

ε

is the machine precision. See Section 4.8 of Anderson et al. (1999) for further details.

8

Parallelism and Performance

f08naf (dgeev) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f08naf (dgeev) makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

Each eigenvector is normalized to have Euclidean norm equal to unity and the element of largest absolute value real.

The total number of floating-point operations is proportional to

n^{3}

The complex analogue of this routine is f08nnf (zgeev).

10

Example

This example finds all the eigenvalues and right eigenvectors of the matrix

A = (\begin{array}{r} 0.35 & 0.45 & - 0.14 & - 0.17 \\ 0.09 & 0.07 & - 0.54 & 0.35 \\ - 0.44 & - 0.33 & - 0.03 & 0.17 \\ 0.25 & - 0.32 & - 0.13 & 0.11 \end{array}) .

Note that the block size (NB) of

64

assumed in this example is not realistic for such a small problem, but should be suitable for large problems.

NAG Library Routine Document

f08naf (dgeev)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results