CHBGVX(3)
π NAME π
This is the CHBGVX(3) page from the Library Functions Manual, bestie, and the source file it points at is exactly:
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/chbgvx.f
π¦ SYNOPSIS π¦
π§ Functions/Subroutines π§
subroutine CHBGVX (jobz, range, uplo, n, ka, kb, ab, ldab, bb, ldbb, q,
ldq, vl, vu, il, iu, abstol, m, w, z, ldz, work, rwork, iwork,
ifail, info)
CHBGVX
π Function/Subroutine Documentation π
πΈ subroutine CHBGVX πΈ
subroutine CHBGVX (character jobz, character range, character uplo, integer
n, integer ka, integer kb, complex, dimension( ldab, * ) ab, integer
ldab, complex, dimension( ldbb, * ) bb, integer ldbb, complex,
dimension( ldq, * ) q, integer ldq, real vl, real vu, integer il,
integer iu, real abstol, integer m, real, dimension( * ) w, complex,
dimension( ldz, * ) z, integer ldz, complex, dimension( * ) work, real,
dimension( * ) rwork, integer, dimension( * ) iwork, integer, dimension(
* ) ifail, integer info)
CHBGVX
β¨ Purpose β¨
Okay so CHBGVX computes all the eigenvalues, and optionally the eigenvectors, of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x. Here A and B are assumed to be Hermitian and banded, and B is also positive definite. Eigenvalues and eigenvectors can be selected by specifying either all eigenvalues, a range of values, or a range of indices for the desired eigenvalues. Slay. π
π Parameters π
π
JOBZ
JOBZ is CHARACTER*1
= 'N': Compute eigenvalues only;= 'V': Compute eigenvalues and eigenvectors.
πΈ RANGE
RANGE is CHARACTER*1
= 'A': all eigenvalues will be found;= 'V': all eigenvalues in the half-open interval(VL,VU]will be found;= 'I': theIL-th throughIU-th eigenvalues will be found.
π¦ UPLO
UPLO is CHARACTER*1
= 'U': Upper triangles ofAandBare stored;= 'L': Lower triangles ofAandBare stored.
β N
N is INTEGER
The order of the matrices A and B. N >= 0.
π KA
KA is INTEGER
The number of superdiagonals of the matrix A if UPLO = 'U', or the number of subdiagonals if UPLO = 'L'. KA >= 0.
π KB
KB is INTEGER
The number of superdiagonals of the matrix B if UPLO = 'U', or the number of subdiagonals if UPLO = 'L'. KB >= 0.
π AB
AB is COMPLEX array, dimension (LDAB, N)
On entry, the upper or lower triangle of the Hermitian band matrix A, stored in the first ka+1 rows of the array. The j-th column of A is stored in the j-th column of the array AB as follows:
if UPLO = 'U', AB(ka+1+i-j,j) = A(i,j) for max(1,j-ka)<=i<=j;
if UPLO = 'L', AB(1+i-j,j) = A(i,j) for j<=i<=min(n,j+ka).
On exit, the contents of AB are destroyed. Not dramatic, just facts. π
π LDAB
LDAB is INTEGER
The leading dimension of the array AB. LDAB >= KA+1.
π BB
BB is COMPLEX array, dimension (LDBB, N)
On entry, the upper or lower triangle of the Hermitian band matrix B, stored in the first kb+1 rows of the array. The j-th column of B is stored in the j-th column of the array BB as follows:
if UPLO = 'U', BB(kb+1+i-j,j) = B(i,j) for max(1,j-kb)<=i<=j;
if UPLO = 'L', BB(1+i-j,j) = B(i,j) for j<=i<=min(n,j+kb).
On exit, the factor S from the split Cholesky factorization B = S**H*S, as returned by CPBSTF.
π LDBB
LDBB is INTEGER
The leading dimension of the array BB. LDBB >= KB+1.
π Q
Q is COMPLEX array, dimension (LDQ, N)
If JOBZ = 'V', the n-by-n matrix used in the reduction of A*x = (lambda)*B*x to standard form, i.e. C*x = (lambda)*x, and consequently C to tridiagonal form. If JOBZ = 'N', the array Q is not referenced.
π LDQ
LDQ is INTEGER
The leading dimension of the array Q. If JOBZ = 'N', LDQ >= 1. If JOBZ = 'V', LDQ >= max(1,N).
π¦ VL
VL is REAL
If RANGE='V', the lower bound of the interval to be searched for eigenvalues. VL < VU. Not referenced if RANGE = 'A' or 'I'.
π¦ VU
VU is REAL
If RANGE='V', the upper bound of the interval to be searched for eigenvalues. VL < VU. Not referenced if RANGE = 'A' or 'I'.
π§ IL
IL is INTEGER
If RANGE='I', the index of the smallest eigenvalue to be returned. 1 <= IL <= IU <= N, if N > 0; IL = 1 and IU = 0 if N = 0. Not referenced if RANGE = 'A' or 'V'.
π§ IU
IU is INTEGER
If RANGE='I', the index of the largest eigenvalue to be returned. 1 <= IL <= IU <= N, if N > 0; IL = 1 and IU = 0 if N = 0. Not referenced if RANGE = 'A' or 'V'.
π₯ ABSTOL
ABSTOL is REAL
The absolute error tolerance for the eigenvalues. An approximate eigenvalue is accepted as converged when it is determined to lie in an interval [a,b] of width less than or equal to
ABSTOL + EPS * max( |a|,|b| ) ,
where EPS is the machine precision. If ABSTOL is less than or equal to zero, then EPS*|T| will be used in its place, where |T| is the 1-norm of the tridiagonal matrix obtained by reducing AP to tridiagonal form.
Eigenvalues will be computed most accurately when ABSTOL is set to twice the underflow threshold 2*SLAMCH('S'), not zero. If this routine returns with INFO>0, indicating that some eigenvectors did not converge, try setting ABSTOL to 2*SLAMCH('S').
π M
M is INTEGER
The total number of eigenvalues found. 0 <= M <= N. If RANGE = 'A', M = N, and if RANGE = 'I', M = IU-IL+1.
β¨ W
W is REAL array, dimension (N)
If INFO = 0, the eigenvalues in ascending order.
π Z
Z is COMPLEX array, dimension (LDZ, N)
If JOBZ = 'V', then if INFO = 0, Z contains the matrix Z of eigenvectors, with the i-th column of Z holding the eigenvector associated with W(i). The eigenvectors are normalized so that Z**H*B*Z = I. If JOBZ = 'N', then Z is not referenced.
π LDZ
LDZ is INTEGER
The leading dimension of the array Z. LDZ >= 1, and if JOBZ = 'V', LDZ >= N.
π«Ά WORK
WORK is COMPLEX array, dimension (N)
π«Ά RWORK
RWORK is REAL array, dimension (7*N)
π«Ά IWORK
IWORK is INTEGER array, dimension (5*N)
π IFAIL
IFAIL is INTEGER array, dimension (N)
If JOBZ = 'V', then if INFO = 0, the first M elements of IFAIL are zero. If INFO > 0, then IFAIL contains the indices of the eigenvectors that failed to converge. If JOBZ = 'N', then IFAIL is not referenced.
π INFO
INFO is INTEGER
= 0: successful exit< 0: ifINFO = -i, thei-th argument had an illegal value> 0: ifINFO = i, andiis:<= N: thenieigenvectors failed to converge. Their indices are stored in arrayIFAIL.> N: ifINFO = N + i, for1 <= i <= N, thenCPBSTFreturnedINFO = i:Bis not positive definite. The factorization ofBcould not be completed and no eigenvalues or eigenvectors were computed.
That last one is the big red flag, bestie: no eigenvalues or eigenvectors were computed. Not a vibe. π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Contributors: π
Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
Definition at line 297 of file chbgvx.f.
β¨ Author β¨
Generated automatically by Doxygen for LAPACK from the source code.
xoxo bestie π β this whole vibe check is from LAPACK Version 3.12.0, footer source /home/abui...RC/chbgvx.f(3). Periodt. π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms