sbgst#
Functions
-
void ssbgst(const char *vect, const char *uplo, const INT n, const INT ka, const INT kb, f32 *restrict AB, const INT ldab, const f32 *restrict BB, const INT ldbb, f32 *restrict X, const INT ldx, f32 *restrict work, INT *info)#
SSBGST reduces a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, such that C has the same bandwidth as A.
B must have been previously factorized as S**T*S by SPBSTF, using a split Cholesky factorization. A is overwritten by C = X**T*A*X, where X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the bandwidth of A.
Parameters
invect= ‘N’: do not form the transformation matrix X = ‘V’: form X
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrices A and B. n >= 0.
inkaThe number of superdiagonals (if uplo=’U’) or subdiagonals (if uplo=’L’) of A. ka >= 0.
inkbThe number of superdiagonals (if uplo=’U’) or subdiagonals (if uplo=’L’) of B. ka >= kb >= 0.
inoutABThe banded matrix A. Array of dimension (ldab, n). On exit, the transformed matrix C.
inldabThe leading dimension of AB. ldab >= ka+1.
inBBThe banded factor S from the split Cholesky factorization of B. Array of dimension (ldbb, n).
inldbbThe leading dimension of BB. ldbb >= kb+1.
outXIf vect=’V’, the n-by-n transformation matrix X. Array of dimension (ldx, n).
inldxThe leading dimension of X. ldx >= max(1,n) if vect=’V’; ldx >= 1 otherwise.
outworkWorkspace array of dimension (2*n).
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
void ssbgst(
const char* vect,
const char* uplo,
const INT n,
const INT ka,
const INT kb,
f32* restrict AB,
const INT ldab,
const f32* restrict BB,
const INT ldbb,
f32* restrict X,
const INT ldx,
f32* restrict work,
INT* info
);
Functions
-
void dsbgst(const char *vect, const char *uplo, const INT n, const INT ka, const INT kb, f64 *restrict AB, const INT ldab, const f64 *restrict BB, const INT ldbb, f64 *restrict X, const INT ldx, f64 *restrict work, INT *info)#
DSBGST reduces a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, such that C has the same bandwidth as A.
B must have been previously factorized as S**T*S by DPBSTF, using a split Cholesky factorization. A is overwritten by C = X**T*A*X, where X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the bandwidth of A.
Parameters
invect= ‘N’: do not form the transformation matrix X = ‘V’: form X
inuplo= ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored
innThe order of the matrices A and B. n >= 0.
inkaThe number of superdiagonals (if uplo=’U’) or subdiagonals (if uplo=’L’) of A. ka >= 0.
inkbThe number of superdiagonals (if uplo=’U’) or subdiagonals (if uplo=’L’) of B. ka >= kb >= 0.
inoutABThe banded matrix A. Array of dimension (ldab, n). On exit, the transformed matrix C.
inldabThe leading dimension of AB. ldab >= ka+1.
inBBThe banded factor S from the split Cholesky factorization of B. Array of dimension (ldbb, n).
inldbbThe leading dimension of BB. ldbb >= kb+1.
outXIf vect=’V’, the n-by-n transformation matrix X. Array of dimension (ldx, n).
inldxThe leading dimension of X. ldx >= max(1,n) if vect=’V’; ldx >= 1 otherwise.
outworkWorkspace array of dimension (2*n).
outinfo= 0: successful exit
< 0: if info = -i, the i-th argument had an illegal value
void dsbgst(
const char* vect,
const char* uplo,
const INT n,
const INT ka,
const INT kb,
f64* restrict AB,
const INT ldab,
const f64* restrict BB,
const INT ldbb,
f64* restrict X,
const INT ldx,
f64* restrict work,
INT* info
);