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
);
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.

Parameters

in
uplo

Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored

in
n

The order of the matrix A. n >= 0.

in
A

Double precision array, dimension (lda, n). The N-by-N symmetric matrix whose scaling factors are to be computed.

in
lda

The leading dimension of the array A. lda >= max(1,n).

out
S

Double precision array, dimension (n). If info = 0, S contains the scale factors for A.

out
scond

If info = 0, S contains the ratio of the smallest S(i) to the largest S(i). If scond >= 0.1 and amax is neither too large nor too small, it is not worth scaling by S.

out
amax

Largest absolute value of any matrix element. If amax is very close to overflow or very close to underflow, the matrix should be scaled.

out
work

Double precision array, dimension (2*n).

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

  • > 0: if info = i, the i-th diagonal element is nonpositive. References: Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.

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
);
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.

Parameters

in
uplo

Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored

in
n

The order of the matrix A. n >= 0.

in
A

Double precision array, dimension (lda, n). The N-by-N symmetric matrix whose scaling factors are to be computed.

in
lda

The leading dimension of the array A. lda >= max(1,n).

out
S

Double precision array, dimension (n). If info = 0, S contains the scale factors for A.

out
scond

If info = 0, S contains the ratio of the smallest S(i) to the largest S(i). If scond >= 0.1 and amax is neither too large nor too small, it is not worth scaling by S.

out
amax

Largest absolute value of any matrix element. If amax is very close to overflow or very close to underflow, the matrix should be scaled.

out
work

Double precision array, dimension (2*n).

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

  • > 0: if info = i, the i-th diagonal element is nonpositive. References: Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.

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
);
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.

Parameters

in
uplo

Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored

in
n

The order of the matrix A. n >= 0.

in
A

Complex*16 array, dimension (lda, n). The N-by-N symmetric matrix whose scaling factors are to be computed.

in
lda

The leading dimension of the array A. lda >= max(1,n).

out
S

Single precision array, dimension (n). If info = 0, S contains the scale factors for A.

out
scond

If info = 0, S contains the ratio of the smallest S(i) to the largest S(i). If scond >= 0.1 and amax is neither too large nor too small, it is not worth scaling by S.

out
amax

Largest absolute value of any matrix element. If amax is very close to overflow or very close to underflow, the matrix should be scaled.

out
work

Complex*16 array, dimension (2*n).

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

  • > 0: if info = i, the i-th diagonal element is nonpositive. References: Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.

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
);
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.

Parameters

in
uplo

Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = ‘U’: Upper triangle of A is stored = ‘L’: Lower triangle of A is stored

in
n

The order of the matrix A. n >= 0.

in
A

Complex*16 array, dimension (lda, n). The N-by-N symmetric matrix whose scaling factors are to be computed.

in
lda

The leading dimension of the array A. lda >= max(1,n).

out
S

Double precision array, dimension (n). If info = 0, S contains the scale factors for A.

out
scond

If info = 0, S contains the ratio of the smallest S(i) to the largest S(i). If scond >= 0.1 and amax is neither too large nor too small, it is not worth scaling by S.

out
amax

Largest absolute value of any matrix element. If amax is very close to overflow or very close to underflow, the matrix should be scaled.

out
work

Complex*16 array, dimension (2*n).

out
info

  • = 0: successful exit

  • < 0: if info = -i, the i-th argument had an illegal value

  • > 0: if info = i, the i-th diagonal element is nonpositive. References: Livne, O.E. and Golub, G.H., “Scaling by Binormalization”, Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.