pbequ#
Functions
-
void spbequ(const char *uplo, const INT n, const INT kd, const f32 *restrict AB, const INT ldab, f32 *restrict S, f32 *scond, f32 *amax, INT *info)#
SPBEQU computes row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm).
S contains the scale factors, S(i) = 1/sqrt(A(i,i)), chosen so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has ones on the diagonal. This choice of S puts the condition number of B within a factor N of the smallest possible condition number over all possible diagonal scalings.
Parameters
inuplo'U': Upper triangular of A is stored'L': Lower triangular of A is stored
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.inABArray of dimension (
ldab,n). The upper or lower triangle of the symmetric band matrix A, stored in the firstkd+1rows of the array. The j-th column of A is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = A(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = A(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.outSArray of dimension
n. Ifinfo=0,Scontains the scale factors for A.outscondIf
info=0,Scontains the ratio of the smallest S(i) to the largest S(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling byS.outamaxAbsolute value of largest matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal valueinfo>0: ifinfo=i, the i-th diagonal element is nonpositive.
void spbequ(
const char* uplo,
const INT n,
const INT kd,
const f32* restrict AB,
const INT ldab,
f32* restrict S,
f32* scond,
f32* amax,
INT* info
);
Functions
-
void dpbequ(const char *uplo, const INT n, const INT kd, const f64 *restrict AB, const INT ldab, f64 *restrict S, f64 *scond, f64 *amax, INT *info)#
DPBEQU computes row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm).
S contains the scale factors, S(i) = 1/sqrt(A(i,i)), chosen so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has ones on the diagonal. This choice of S puts the condition number of B within a factor N of the smallest possible condition number over all possible diagonal scalings.
Parameters
inuplo'U': Upper triangular of A is stored'L': Lower triangular of A is stored
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.inABArray of dimension (
ldab,n). The upper or lower triangle of the symmetric band matrix A, stored in the firstkd+1rows of the array. The j-th column of A is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = A(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = A(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.outSArray of dimension
n. Ifinfo=0,Scontains the scale factors for A.outscondIf
info=0,Scontains the ratio of the smallest S(i) to the largest S(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling byS.outamaxAbsolute value of largest matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal valueinfo>0: ifinfo=i, the i-th diagonal element is nonpositive.
void dpbequ(
const char* uplo,
const INT n,
const INT kd,
const f64* restrict AB,
const INT ldab,
f64* restrict S,
f64* scond,
f64* amax,
INT* info
);
Functions
-
void cpbequ(const char *uplo, const INT n, const INT kd, const c64 *restrict AB, const INT ldab, f32 *restrict S, f32 *scond, f32 *amax, INT *info)#
CPBEQU computes row and column scalings intended to equilibrate a Hermitian positive definite band matrix A and reduce its condition number (with respect to the two-norm).
S contains the scale factors, S(i) = 1/sqrt(A(i,i)), chosen so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has ones on the diagonal. This choice of S puts the condition number of B within a factor N of the smallest possible condition number over all possible diagonal scalings.
Parameters
inuplo'U': Upper triangular of A is stored'L': Lower triangular of A is stored
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.inABArray of dimension (
ldab,n). The upper or lower triangle of the Hermitian band matrix A, stored in the firstkd+1rows of the array. The j-th column of A is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = A(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = A(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.outSArray of dimension
n. Ifinfo=0,Scontains the scale factors for A.outscondIf
info=0,Scontains the ratio of the smallest S(i) to the largest S(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling byS.outamaxAbsolute value of largest matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal valueinfo>0: ifinfo=i, the i-th diagonal element is nonpositive.
void cpbequ(
const char* uplo,
const INT n,
const INT kd,
const c64* restrict AB,
const INT ldab,
f32* restrict S,
f32* scond,
f32* amax,
INT* info
);
Functions
-
void zpbequ(const char *uplo, const INT n, const INT kd, const c128 *restrict AB, const INT ldab, f64 *restrict S, f64 *scond, f64 *amax, INT *info)#
ZPBEQU computes row and column scalings intended to equilibrate a Hermitian positive definite band matrix A and reduce its condition number (with respect to the two-norm).
S contains the scale factors, S(i) = 1/sqrt(A(i,i)), chosen so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has ones on the diagonal. This choice of S puts the condition number of B within a factor N of the smallest possible condition number over all possible diagonal scalings.
Parameters
inuplo'U': Upper triangular of A is stored'L': Lower triangular of A is stored
innThe order of the matrix A.
n>=0.inkdThe number of superdiagonals of the matrix A if
uplo='U', or the number of subdiagonals ifuplo='L'.kd>=0.inABArray of dimension (
ldab,n). The upper or lower triangle of the Hermitian band matrix A, stored in the firstkd+1rows of the array. The j-th column of A is stored in the j-th column of the array AB as follows: ifuplo='U',AB[kd+i-j + j*ldab] = A(i,j)formax(0,j-kd)<=i<=j; ifuplo='L',AB[i-j + j*ldab] = A(i,j)forj<=i<=min(n-1,j+kd).inldabThe leading dimension of the array
AB.ldab>=kd+1.outSArray of dimension
n. Ifinfo=0,Scontains the scale factors for A.outscondIf
info=0,Scontains the ratio of the smallest S(i) to the largest S(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling byS.outamaxAbsolute value of largest matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outinfoinfo=0: successful exitinfo<0: ifinfo=-i, the i-th argument had an illegal valueinfo>0: ifinfo=i, the i-th diagonal element is nonpositive.
void zpbequ(
const char* uplo,
const INT n,
const INT kd,
const c128* restrict AB,
const INT ldab,
f64* restrict S,
f64* scond,
f64* amax,
INT* info
);