f08jhc computes all the eigenvalues and, optionally, all the eigenvectors of a real symmetric tridiagonal matrix, or of a real full or banded symmetric matrix which has been reduced to tridiagonal form.
When only eigenvalues are required then this function calls f08jfc to compute the eigenvalues of the tridiagonal matrix , but when eigenvectors of are also required and the matrix is not too small, then a divide and conquer method is used, which can be much faster than f08jec, although more storage is required.
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
1: – Nag_OrderTypeInput
On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by . See Section 3.1.3 in the Introduction to the NAG Library CL Interface for a more detailed explanation of the use of this argument.
2: – Nag_ComputeEigVecsTypeInput
On entry: indicates whether the eigenvectors are to be computed.
Only the eigenvalues are computed (and the array z is not referenced).
The eigenvalues and eigenvectors of are computed (and the array z must contain the matrix on entry).
The eigenvalues and eigenvectors of are computed (and the array z is initialized by the function).
, or .
3: – IntegerInput
On entry: , the order of the symmetric tridiagonal matrix .
4: – doubleInput/Output
Note: the dimension, dim, of the array d
must be at least
On entry: the diagonal elements of the tridiagonal matrix.
On exit: if NE_NOERROR, the eigenvalues in ascending order.
5: – doubleInput/Output
Note: the dimension, dim, of the array e
must be at least
On entry: the subdiagonal elements of the tridiagonal matrix.
On entry: the stride separating row or column elements (depending on the value of order) in the array z.
if or , ;
8: – NagError *Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).
6Error Indicators and Warnings
Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
On entry, argument had an illegal value.
The algorithm failed to compute an eigenvalue while working on the submatrix lying in rows and columns through .
On entry, , and .
Constraint: if or , ;
On entry, .
On entry, . Constraint: .
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
The computed eigenvalues and eigenvectors are exact for a nearby matrix , where
and is the machine precision.
If is an exact eigenvalue and is the corresponding computed value, then
where is a modestly increasing function of .
If is the corresponding exact eigenvector, and is the corresponding computed eigenvector, then the angle between them is bounded as follows:
Thus the accuracy of a computed eigenvector depends on the gap between its eigenvalue and all the other eigenvalues.
Background information to multithreading can be found in the Multithreading documentation.
f08jhc is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08jhc 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 function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.
If only eigenvalues are required, the total number of floating-point operations is approximately proportional to . When eigenvectors are required the number of operations is bounded above by approximately the same number of operations as f08jec, but for large matrices f08jhc is usually much faster.