f08wb computes for a pair of by real nonsymmetric matrices the generalized eigenvalues and, optionally, the left and/or right generalized eigenvectors using the algorithm.
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.
Syntax
C# |
---|
public static void f08wb( string balanc, string jobvl, string jobvr, string sense, int n, double[,] a, double[,] b, double[] alphar, double[] alphai, double[] beta, double[,] vl, double[,] vr, out int ilo, out int ihi, double[] lscale, double[] rscale, out double abnrm, out double bbnrm, double[] rconde, double[] rcondv, out int info ) |
Visual Basic |
---|
Public Shared Sub f08wb ( _ balanc As String, _ jobvl As String, _ jobvr As String, _ sense As String, _ n As Integer, _ a As Double(,), _ b As Double(,), _ alphar As Double(), _ alphai As Double(), _ beta As Double(), _ vl As Double(,), _ vr As Double(,), _ <OutAttribute> ByRef ilo As Integer, _ <OutAttribute> ByRef ihi As Integer, _ lscale As Double(), _ rscale As Double(), _ <OutAttribute> ByRef abnrm As Double, _ <OutAttribute> ByRef bbnrm As Double, _ rconde As Double(), _ rcondv As Double(), _ <OutAttribute> ByRef info As Integer _ ) |
Visual C++ |
---|
public: static void f08wb( String^ balanc, String^ jobvl, String^ jobvr, String^ sense, int n, array<double,2>^ a, array<double,2>^ b, array<double>^ alphar, array<double>^ alphai, array<double>^ beta, array<double,2>^ vl, array<double,2>^ vr, [OutAttribute] int% ilo, [OutAttribute] int% ihi, array<double>^ lscale, array<double>^ rscale, [OutAttribute] double% abnrm, [OutAttribute] double% bbnrm, array<double>^ rconde, array<double>^ rcondv, [OutAttribute] int% info ) |
F# |
---|
static member f08wb : balanc : string * jobvl : string * jobvr : string * sense : string * n : int * a : float[,] * b : float[,] * alphar : float[] * alphai : float[] * beta : float[] * vl : float[,] * vr : float[,] * ilo : int byref * ihi : int byref * lscale : float[] * rscale : float[] * abnrm : float byref * bbnrm : float byref * rconde : float[] * rcondv : float[] * info : int byref -> unit |
Parameters
- balanc
- Type: System..::..StringOn entry: specifies the balance option to be performed.
- Do not diagonally scale or permute.
- Permute only.
- Scale only.
- Both permute and scale.
Computed reciprocal condition numbers will be for the matrices after permuting and/or balancing. Permuting does not change condition numbers (in exact arithmetic), but balancing does. In the absence of other information, is recommended.Constraint: , , or .
- jobvl
- Type: System..::..StringOn entry: if , do not compute the left generalized eigenvectors.If , compute the left generalized eigenvectors.Constraint: or .
- jobvr
- Type: System..::..StringOn entry: if , do not compute the right generalized eigenvectors.If , compute the right generalized eigenvectors.Constraint: or .
- sense
- Type: System..::..StringOn entry: determines which reciprocal condition numbers are computed.
- None are computed.
- Computed for eigenvalues only.
- Computed for eigenvectors only.
- Computed for eigenvalues and eigenvectors.
Constraint: , , or .
- n
- Type: System..::..Int32On entry: , the order of the matrices and .Constraint: .
- a
- Type: array<System..::..Double,2>[,](,)[,][,]An array of size [dim1, dim2]Note: dim1 must satisfy the constraint:Note: the second dimension of the array a must be at least .On entry: the matrix in the pair .On exit: a has been overwritten. If or or both, then contains the first part of the real Schur form of the ‘balanced’ versions of the input and .
- b
- Type: array<System..::..Double,2>[,](,)[,][,]An array of size [dim1, dim2]Note: dim1 must satisfy the constraint:Note: the second dimension of the array b must be at least .On entry: the matrix in the pair .On exit: b has been overwritten.
- alphar
- Type: array<System..::..Double>[]()[][]An array of size [n]On exit: the element contains the real part of .
- alphai
- Type: array<System..::..Double>[]()[][]An array of size [n]On exit: the element contains the imaginary part of .
- beta
- Type: array<System..::..Double>[]()[][]An array of size [n]On exit: , for , will be the generalized eigenvalues.If is zero, then the th eigenvalue is real; if positive, then the th and st eigenvalues are a complex conjugate pair, with negative.Note: the quotients and may easily overflow or underflow, and may even be zero. Thus, you should avoid naively computing the ratio . However, will always be less than and usually comparable with in magnitude, and will always be less than and usually comparable with .
- vl
- Type: array<System..::..Double,2>[,](,)[,][,]An array of size [dim1, dim2]Note: dim1 must satisfy the constraint:
- if , ;
- otherwise .
Note: the second dimension of the array vl must be at least if , and at least otherwise.
- vr
- Type: array<System..::..Double,2>[,](,)[,][,]An array of size [dim1, dim2]Note: dim1 must satisfy the constraint:
- if , ;
- otherwise .
Note: the second dimension of the array vr must be at least if , and at least otherwise.
- ilo
- Type: System..::..Int32%
- ihi
- Type: System..::..Int32%
- lscale
- Type: array<System..::..Double>[]()[][]An array of size [n]On exit: details of the permutations and scaling factors applied to the left side of and .If is the index of the row interchanged with row , and is the scaling factor applied to row , then:
- , for ;
- , for ;
- , for .
The order in which the interchanges are made is n to , then to .
- rscale
- Type: array<System..::..Double>[]()[][]An array of size [n]On exit: details of the permutations and scaling factors applied to the right side of and .If is the index of the column interchanged with column , and is the scaling factor applied to column , then:
- , for ;
- if , for ;
- if , for .
The order in which the interchanges are made is n to , then to .
- abnrm
- Type: System..::..Double%On exit: the -norm of the balanced matrix .
- bbnrm
- Type: System..::..Double%On exit: the -norm of the balanced matrix .
- rconde
- Type: array<System..::..Double>[]()[][]An array of size [dim1]Note: the dimension of the array rconde must be at least .On exit: if or , the reciprocal condition numbers of the eigenvalues, stored in consecutive elements of the array. For a complex conjugate pair of eigenvalues two consecutive elements of rconde are set to the same value. Thus , , and the th columns of vl and vr all correspond to the th eigenpair.If , rconde is not referenced.
- rcondv
- Type: array<System..::..Double>[]()[][]An array of size [dim1]Note: the dimension of the array rcondv must be at least .
- info
- Type: System..::..Int32%On exit: unless the method detects an error (see [Error Indicators and Warnings]).
Description
A generalized eigenvalue for a pair of matrices is a scalar or a ratio , such that is singular. It is usually represented as the pair , as there is a reasonable interpretation for , and even for both being zero.
The right eigenvector corresponding to the eigenvalue of satisfies
The left eigenvector corresponding to the eigenvalue of satisfies
where is the conjugate-transpose of .
All the eigenvalues and, if required, all the eigenvectors of the generalized eigenproblem , where and are real, square matrices, are determined using the algorithm. The algorithm consists of four stages:
1. | is reduced to upper Hessenberg form and at the same time is reduced to upper triangular form. | ||
2. | is further reduced to quasi-triangular form while the triangular form of is maintained. This is the real generalized Schur form of the pair . | ||
3. | The quasi-triangular form of is reduced to triangular form and the eigenvalues extracted. This method does not actually produce the eigenvalues , but instead returns and such that
|
||
4. | If the eigenvectors are required they are obtained from the triangular matrices and then transformed back into the original coordinate system. |
For details of the balancing option, see [Description] in f08wh.
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
Wilkinson J H (1979) Kronecker's canonical form and the algorithm Linear Algebra Appl. 28 285–303
Error Indicators and Warnings
Some error messages may refer to parameters that are dropped from this interface
(LDA, LDB, LDVL, LDVR) In these
cases, an error in another parameter has usually caused an incorrect value to be inferred.
- If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
- The iteration failed. No eigenvectors have been calculated, but , , and should be correct for .
- Unexpected error returned from f08xe.
- Error returned from f08yk.
Accuracy
The computed eigenvalues and eigenvectors are exact for a nearby matrices and , where
and is the machine precision.
An approximate error bound on the chordal distance between the th computed generalized eigenvalue and the corresponding exact eigenvalue is
An approximate error bound for the angle between the th computed eigenvector or is given by
For further explanation of the reciprocal condition numbers rconde and rcondv, see Section 4.11 of Anderson et al. (1999).
Note: interpretation of results obtained with the algorithm often requires a clear understanding of the effects of small changes in the original data. These effects are reviewed in Wilkinson (1979), in relation to the significance of small values of and . It should be noted that if and are both small for any , it may be that no reliance can be placed on any of the computed eigenvalues . You are recommended to study Wilkinson (1979) and, if in difficulty, to seek expert advice on determining the sensitivity of the eigenvalues to perturbations in the data.
Parallelism and Performance
None.
Further Comments
The total number of floating-point operations is proportional to .
The complex analogue of this method is f08wp.
Example
This example finds all the eigenvalues and right eigenvectors of the matrix pair ,
where
together with estimates of the condition number and forward error bounds for each eigenvalue and eigenvector. The option to balance the matrix pair is used.
Example program (C#): f08wbe.cs