cpoequb (l)  Linux Man Pages
cpoequb: computes row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the twonorm)
Command to display cpoequb
manual in Linux: $ man l cpoequb
NAME
CPOEQUB  computes row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the twonorm)
SYNOPSIS
 SUBROUTINE CPOEQUB(

N, A, LDA, S, SCOND, AMAX, INFO )

IMPLICIT
NONE

INTEGER
INFO, LDA, N

REAL
AMAX, SCOND

COMPLEX
A( LDA, * )

REAL
S( * )
PURPOSE
CPOEQUB computes row and column scalings intended to equilibrate a
symmetric positive definite matrix A and reduce its condition number
(with respect to the twonorm). 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 NbyN symmetric positive definite 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 ith argument had an illegal value
> 0: if INFO = i, the ith diagonal element is nonpositive.
Pages related to cpoequb
 cpoequb (3)
 cpoequ (l)  computes row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the twonorm)
 cpocon (l)  estimates the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
 cporfs (l)  improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
 cporfsx (l)  CPORFSX improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, and provides error bounds and backward error estimates for the solution
 cposv (l)  computes the solution to a complex system of linear equations A * X = B,
 cposvx (l)  uses the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A * X = B,
 cposvxx (l)  CPOSVXX use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a complex system of linear equations A * X = B, where A is an NbyN symmetric positive definite matrix and X and B are NbyNRHS matrices