naginterfaces.library.lapackeig.zgeevx

naginterfaces.library.lapackeig.zgeevx(balanc, jobvl, jobvr, sense, a)

zgeevx computes the eigenvalues and, optionally, the left and/or right eigenvectors for an $n\times n$ complex nonsymmetric matrix $A$.

Optionally, it also computes a balancing transformation to improve the conditioning of the eigenvalues and eigenvectors, reciprocal condition numbers for the eigenvalues, and reciprocal condition numbers for the right eigenvectors.

For full information please refer to the NAG Library document for f08np

https://support.nag.com/numeric/nl/nagdoc_30.2/flhtml/f08/f08npf.html

Parameters

balancstr, length 1

Indicates how the input matrix should be diagonally scaled and/or permuted to improve the conditioning of its eigenvalues.

$balanc=\text{'N'}$

Do not diagonally scale or permute.

$balanc=\text{'P'}$

Perform permutations to make the matrix more nearly upper triangular. Do not diagonally scale.

$balanc=\text{'S'}$

Diagonally scale the matrix, i.e., replace $A\times DA{D}^{-1}$, where $D$ is a diagonal matrix chosen to make the rows and columns of $A$ more equal in norm. Do not permute.

$balanc=\text{'B'}$

Both diagonally scale and permute $A$.

Computed reciprocal condition numbers will be for the matrix after balancing and/or permuting.

Permuting does not change condition numbers (in exact arithmetic), but balancing does.

jobvlstr, length 1

If $jobvl=\text{'N'}$, the left eigenvectors of $A$ are not computed.

If $jobvl=\text{'V'}$, the left eigenvectors of $A$ are computed.

If $sense=\text{'E'}$ or $\text{'B'}$, $jobvl$ must be set to $jobvl=\text{'V'}$.

jobvrstr, length 1

If $jobvr=\text{'N'}$, the right eigenvectors of $A$ are not computed.

If $jobvr=\text{'V'}$, the right eigenvectors of $A$ are computed.

If $sense=\text{'E'}$ or $\text{'B'}$, $jobvr$ must be set to $jobvr=\text{'V'}$.

sensestr, length 1

Determines which reciprocal condition numbers are computed.

$sense=\text{'N'}$

None are computed.

$sense=\text{'E'}$

Computed for eigenvalues only.

$sense=\text{'V'}$

Computed for right eigenvectors only.

$sense=\text{'B'}$

Computed for eigenvalues and right eigenvectors.

If $sense=\text{'E'}$ or $\text{'B'}$, both left and right eigenvectors must also be computed ($jobvl=\text{'V'}$ and $jobvr=\text{'V'}$).

acomplex, array-like, shape $(n,n)$

The $n\times n$ matrix $A$.

Returns

acomplex, ndarray, shape $(n,n)$

$a$ has been overwritten. If $jobvl=\text{'V'}$ or $jobvr=\text{'V'}$, $A$ contains the Schur form of the balanced version of the matrix $A$.

wcomplex, ndarray, shape $\left(n\right)$

Contains the computed eigenvalues.

vlcomplex, ndarray, shape $(:,:)$

If $jobvl=\text{'V'}$, the left eigenvectors $u_j$ are stored one after another in the columns of $vl$, in the same order as their corresponding eigenvalues; that is $u_j=vl[\text{i}-1,j-1]$, for $\text{i}=1,2,\dots ,n$.

If $jobvl=\text{'N'}$, $vl$ is not referenced.

vrcomplex, ndarray, shape $(:,:)$

If $jobvr=\text{'V'}$, the right eigenvectors $v_j$ are stored one after another in the columns of $vr$, in the same order as their corresponding eigenvalues; that is $v_j=vr[\text{i}-1,j-1]$, for $\text{i}=1,2,\dots ,n$.

If $jobvr=\text{'N'}$, $vr$ is not referenced.

iloint

$ilo$ and $ihi$ are integer values determined when $A$ was balanced. The balanced $A$ has $a_{ij}=0$ if $i>j$ and $j=1,2,\dots ,ilo-1$ or $i=ihi+1,\dots ,n$.

ihiint

$ilo$ and $ihi$ are integer values determined when $A$ was balanced. The balanced $A$ has $a_{ij}=0$ if $i>j$ and $j=1,2,\dots ,ilo-1$ or $i=ihi+1,\dots ,n$.

scalefloat, ndarray, shape $\left(n\right)$

Details of the permutations and scaling factors applied when balancing $A$.

If $p_j$ is the index of the row and column interchanged with row and column $j$, and $d_j$ is the scaling factor applied to row and column $j$, then

$scale[\text{j}-1]=p_{\text{j}}$, for $\text{j}=1,2,\dots ,ilo-1$;

$scale[\text{j}-1]=d_{\text{j}}$, for $\text{j}=ilo,\dots ,ihi$;

$scale[\text{j}-1]=p_{\text{j}}$, for $\text{j}=ihi+1,\dots ,n$.

The order in which the interchanges are made is $\text{n}$ to $ihi+1$, then $1$ to $ilo-1$.

abnrmfloat

The $1$-norm of the balanced matrix (the maximum of the sum of absolute values of elements of any column).

rcondefloat, ndarray, shape $\left(n\right)$

$rconde[j-1]$ is the reciprocal condition number of the $j$th eigenvalue.

rcondvfloat, ndarray, shape $\left(n\right)$

$rcondv[j-1]$ is the reciprocal condition number of the $j$th right eigenvector.

Raises

NagValueError

(errno $-1$)

On entry, error in parameter $balanc$.

Constraint: $balanc=\text{'N'}$, $\text{'P'}$, $\text{'S'}$ or $\text{'B'}$.

(errno $-2$)

On entry, error in parameter $jobvl$.

Constraint: $jobvl=\text{'N'}$ or $\text{'V'}$.

(errno $-3$)

On entry, error in parameter $jobvr$.

Constraint: $jobvr=\text{'N'}$ or $\text{'V'}$.

(errno $-4$)

On entry, error in parameter $sense$.

Constraint: $sense=\text{'N'}$, $\text{'E'}$, $\text{'V'}$ or $\text{'B'}$.

(errno $-5$)

On entry, error in parameter $\text{n}$.

Constraint: $n\ge 0$.

Warns

NagAlgorithmicWarning

(errno $i>0$)

The $QR$ algorithm failed to compute all the eigenvalues, and no eigenvectors or condition numbers have been computed; elements $1$ to $ilo-1$ and $⟨value⟩$ to $\text{n}$ of $w$ contain eigenvalues which have converged.

Notes

The right eigenvector $v_j$ of $A$ satisfies

$$A{v}_j={\lambda }_j{v}_j$$

where ${\lambda }_j$ is the $j$th eigenvalue of $A$. The left eigenvector $u_j$ of $A$ satisfies

$$u_j^{H}A={\lambda }_j{u}_j^H$$

where $u_j^H$ denotes the conjugate transpose of $u_j$.

Balancing a matrix means permuting the rows and columns to make it more nearly upper triangular, and applying a diagonal similarity transformation $DA{D}^{-1}$, where $D$ is a diagonal matrix, with the aim of making its rows and columns closer in norm and the condition numbers of its eigenvalues and eigenvectors smaller. The computed reciprocal condition numbers correspond to the balanced matrix. Permuting rows and columns will not change the condition numbers (in exact arithmetic) but diagonal scaling will. For further explanation of balancing, see Section 4.8.1.2 of Anderson et al. (1999).

Following the optional balancing, the matrix $A$ is first reduced to upper Hessenberg form by means of unitary similarity transformations, and the $QR$ algorithm is then used to further reduce the matrix to upper triangular Schur form, $T$, from which the eigenvalues are computed. Optionally, the eigenvectors of $T$ are also computed and backtransformed to those of $A$.

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, https://www.netlib.org/lapack/lug

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