syequb#
Functions
-
void ssyequb(const char *uplo, const INT n, const f32 *restrict A, const INT lda, f32 *restrict S, f32 *scond, f32 *amax, f32 *restrict work, INT *info)#
SSYEQUB computes row and column scalings intended to equilibrate a symmetric matrix A (with respect to the Euclidean norm) and reduce its condition number.
The scale factors S are computed by the BIN algorithm (see references) so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has a condition number within a factor N of the smallest possible condition number over all possible diagonal scalings.
- References:
Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. DOI 10.1023/B:NUMA.0000016606.32820.69
Parameters
inuplo'U': Upper triangle of A is stored'L': Lower triangle of A is stored
innThe order of the matrix A.
n>=0.inAArray of dimension
(lda,n). Then-by-nsymmetric matrix whose scaling factors are to be computed.inldaThe leading dimension of the array A.
lda>=max(1,n).outSArray of dimension
n. Ifinfo=0, S contains the scale factors for A.outscondIf
info=0, S contains the ratio of the smallestS(i)to the largestS(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling by S.outamaxLargest absolute value of any matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outworkArray of dimension
2*n.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 ssyequb(
const char* uplo,
const INT n,
const f32* restrict A,
const INT lda,
f32* restrict S,
f32* scond,
f32* amax,
f32* restrict work,
INT* info
);
Functions
-
void dsyequb(const char *uplo, const INT n, const f64 *restrict A, const INT lda, f64 *restrict S, f64 *scond, f64 *amax, f64 *restrict work, INT *info)#
DSYEQUB computes row and column scalings intended to equilibrate a symmetric matrix A (with respect to the Euclidean norm) and reduce its condition number.
The scale factors S are computed by the BIN algorithm (see references) so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has a condition number within a factor N of the smallest possible condition number over all possible diagonal scalings.
- References:
Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. DOI 10.1023/B:NUMA.0000016606.32820.69
Parameters
inuplo'U': Upper triangle of A is stored'L': Lower triangle of A is stored
innThe order of the matrix A.
n>=0.inAArray of dimension
(lda,n). Then-by-nsymmetric matrix whose scaling factors are to be computed.inldaThe leading dimension of the array A.
lda>=max(1,n).outSArray of dimension
n. Ifinfo=0, S contains the scale factors for A.outscondIf
info=0, S contains the ratio of the smallestS(i)to the largestS(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling by S.outamaxLargest absolute value of any matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outworkArray of dimension
2*n.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 dsyequb(
const char* uplo,
const INT n,
const f64* restrict A,
const INT lda,
f64* restrict S,
f64* scond,
f64* amax,
f64* restrict work,
INT* info
);
Functions
-
void csyequb(const char *uplo, const INT n, const c64 *restrict A, const INT lda, f32 *restrict S, f32 *scond, f32 *amax, c64 *restrict work, INT *info)#
CSYEQUB computes row and column scalings intended to equilibrate a symmetric matrix A (with respect to the Euclidean norm) and reduce its condition number.
The scale factors S are computed by the BIN algorithm (see references) so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has a condition number within a factor N of the smallest possible condition number over all possible diagonal scalings.
- References:
Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. DOI 10.1023/B:NUMA.0000016606.32820.69
Parameters
inuplo'U': Upper triangle of A is stored'L': Lower triangle of A is stored
innThe order of the matrix A.
n>=0.inAComplex array of dimension
(lda,n). Then-by-nsymmetric matrix whose scaling factors are to be computed.inldaThe leading dimension of the array A.
lda>=max(1,n).outSArray of dimension
n. Ifinfo=0, S contains the scale factors for A.outscondIf
info=0, S contains the ratio of the smallestS(i)to the largestS(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling by S.outamaxLargest absolute value of any matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outworkComplex array of dimension
2*n.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 csyequb(
const char* uplo,
const INT n,
const c64* restrict A,
const INT lda,
f32* restrict S,
f32* scond,
f32* amax,
c64* restrict work,
INT* info
);
Functions
-
void zsyequb(const char *uplo, const INT n, const c128 *restrict A, const INT lda, f64 *restrict S, f64 *scond, f64 *amax, c128 *restrict work, INT *info)#
ZSYEQUB computes row and column scalings intended to equilibrate a symmetric matrix A (with respect to the Euclidean norm) and reduce its condition number.
The scale factors S are computed by the BIN algorithm (see references) so that the scaled matrix B with elements B(i,j) = S(i)*A(i,j)*S(j) has a condition number within a factor N of the smallest possible condition number over all possible diagonal scalings.
- References:
Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. DOI 10.1023/B:NUMA.0000016606.32820.69
Parameters
inuplo'U': Upper triangle of A is stored'L': Lower triangle of A is stored
innThe order of the matrix A.
n>=0.inAComplex array of dimension
(lda,n). Then-by-nsymmetric matrix whose scaling factors are to be computed.inldaThe leading dimension of the array A.
lda>=max(1,n).outSArray of dimension
n. Ifinfo=0, S contains the scale factors for A.outscondIf
info=0, S contains the ratio of the smallestS(i)to the largestS(i). Ifscond>=0.1andamaxis neither too large nor too small, it is not worth scaling by S.outamaxLargest absolute value of any matrix element. If
amaxis very close to overflow or very close to underflow, the matrix should be scaled.outworkComplex array of dimension
2*n.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 zsyequb(
const char* uplo,
const INT n,
const c128* restrict A,
const INT lda,
f64* restrict S,
f64* scond,
f64* amax,
c128* restrict work,
INT* info
);