|
|
|
complib/cheev(3) -- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
|
|
CHEEV computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A. |
|
complib/cheevd(3) -- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
|
|
CHEEVD computes all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A. If eigenvectors are desired, it uses a divide and conquer algorithm. The divide and conquer algorithm makes very mild assumptions about floating point arithmetic. It will work on machines with a guard digit in add/subtract, or on those binary machines without guard digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. It could conceivably fail on hexadecimal or decimal machines wit... |
|
|
complib/cheevx(3) -- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
|
|
CHEEVX computes selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A. Eigenvalues and eigenvectors can be selected by specifying either a range of values or a range of indices for the desired eigenvalues. |
|
complib/chegs2(3) -- reduce a complex Hermitian-definite generalized eigenproblem to standard form
|
|
CHEGS2 reduces a complex Hermitian-definite generalized eigenproblem to standard form. If ITYPE = 1, the problem is A*x = lambda*B*x, and A is overwritten by inv(U')*A*inv(U) or inv(L)*A*inv(L') If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or B*A*x = lambda*x, and A is overwritten by U*A*U` or L'*A*L. B must have been previously factorized as U'*U or L*L' by CPOTRF. |
|
complib/chegst(3) -- reduce a complex Hermitian-definite generalized eigenproblem to standard form
|
|
CHEGST reduces a complex Hermitian-definite generalized eigenproblem to standard form. If ITYPE = 1, the problem is A*x = lambda*B*x, and A is overwritten by inv(U**H)*A*inv(U) or inv(L)*A*inv(L**H) If ITYPE = 2 or 3, the problem is A*B*x = lambda*x or B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L. B must have been previously factorized as U**H*U or L*L**H by CPOTRF. |
|
complib/chegv(3) -- a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x
|
|
CHEGV computes all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x. Here A and B are assumed to be Hermitian and B is also positive definite. |
|
complib/cherfs(3) -- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefin
|
|
CHERFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates for the solution. |
|
complib/chesv(3) -- X = B,
|
|
CHESV computes the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian matrix and X and B are Nby-NRHS matrices. The diagonal pivoting method is used to factor A as A = U * D * U**H, if UPLO = 'U', or A = L * D * L**H, if UPLO = 'L', where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. The factored form of A is then used to solve the system of... |
|
complib/chesvx(3) -- to a complex system of linear equations A * X = B,
|
|
CHESVX uses the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian matrix and X and B are N-by-NRHS matrices. Error bounds on the solution and a condition estimate are also provided. |
|
complib/chetd2(3) -- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformatio
|
|
CHETD2 reduces a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation: Q' * A * Q = T. |
|
complib/chetf2(3) -- the Bunch-Kaufman diagonal pivoting method
|
|
CHETF2 computes the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method: A = U*D*U' or A = L*D*L' where U (or L) is a product of permutation and unit upper (lower) triangular matrices, U' is the conjugate transpose of U, and D is Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This is the unblocked version of the algorithm, calling Level 2 BLAS.... |
|
complib/chetrd(3) -- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformatio
|
|
CHETRD reduces a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation: Q**H * A * Q = T. |
|
complib/chetrf(3) -- the Bunch-Kaufman diagonal pivoting method
|
|
CHETRF computes the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method. The form of the factorization is A = U*D*U**H or A = L*D*L**H where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks. This is the blocked version of the algorithm, calling Level 3 BLAS.... |
|
complib/chetri(3) -- compute the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D
|
|
CHETRI computes the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF. |
|
complib/chetrs(3) -- solve a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U
|
|
CHETRS solves a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF. |
