csyequb (l) - Linux Manuals
csyequb: computes row and column scalings intended to equilibrate a symmetric matrix A and reduce its condition number (with respect to the two-norm)
Command to display csyequb
manual in Linux: $ man l csyequb
NAME
CSYEQUB - computes row and column scalings intended to equilibrate a symmetric matrix A and reduce its condition number (with respect to the two-norm)
SYNOPSIS
- SUBROUTINE CSYEQUB(
-
UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
-
IMPLICIT
NONE
-
INTEGER
INFO, LDA, N
-
REAL
AMAX, SCOND
-
CHARACTER
UPLO
-
COMPLEX
A( LDA, * ), WORK( * )
-
REAL
S( * )
PURPOSE
CSYEQUB computes row and column scalings intended to equilibrate a
symmetric 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.
ARGUMENTS
- N (input) INTEGER
-
The order of the matrix A. N >= 0.
- A (input) COMPLEX array, dimension (LDA,N)
-
The N-by-N symmetric matrix whose scaling
factors are to be computed. Only the diagonal elements of A
are referenced.
- LDA (input) INTEGER
-
The leading dimension of the array A. LDA >= max(1,N).
- S (output) REAL array, dimension (N)
-
If INFO = 0, S contains the scale factors for A.
- SCOND (output) REAL
-
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.
- AMAX (output) REAL
-
Absolute value of largest matrix element. If AMAX is very
close to overflow or very close to underflow, the matrix
should be scaled.
INFO (output) INTEGER
= 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.
Pages related to csyequb
- csyequb (3)
- csycon (l) - estimates the reciprocal of the condition number (in the 1-norm) of a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF
- csymm (l) - performs one of the matrix-matrix operations C := alpha*A*B + beta*C,
- csymv (l) - performs the matrix-vector operation y := alpha*A*x + beta*y,
- csyr (l) - performs the symmetric rank 1 operation A := alpha*x*( xaq ) + A,
- csyr2k (l) - performs one of the symmetric rank 2k operations C := alpha*A*Baq + alpha*B*Aaq + beta*C,
- csyrfs (l) - improves the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution
- csyrfsx (l) - CSYRFSX improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution