chetrs (l)  Linux Man Pages
chetrs: solves a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF
Command to display chetrs
manual in Linux: $ man l chetrs
NAME
CHETRS  solves a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF
SYNOPSIS
 SUBROUTINE CHETRS(

UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )

CHARACTER
UPLO

INTEGER
INFO, LDA, LDB, N, NRHS

INTEGER
IPIV( * )

COMPLEX
A( LDA, * ), B( LDB, * )
PURPOSE
CHETRS solves a system of linear equations A*X = B with a complex
Hermitian matrix A using the factorization A = U*D*U**H or
A = L*D*L**H computed by CHETRF.
ARGUMENTS
 UPLO (input) CHARACTER*1

Specifies whether the details of the factorization are stored
as an upper or lower triangular matrix.
= aqUaq: Upper triangular, form is A = U*D*U**H;
= aqLaq: Lower triangular, form is A = L*D*L**H.
 N (input) INTEGER

The order of the matrix A. N >= 0.
 NRHS (input) INTEGER

The number of right hand sides, i.e., the number of columns
of the matrix B. NRHS >= 0.
 A (input) COMPLEX array, dimension (LDA,N)

The block diagonal matrix D and the multipliers used to
obtain the factor U or L as computed by CHETRF.
 LDA (input) INTEGER

The leading dimension of the array A. LDA >= max(1,N).
 IPIV (input) INTEGER array, dimension (N)

Details of the interchanges and the block structure of D
as determined by CHETRF.
 B (input/output) COMPLEX array, dimension (LDB,NRHS)

On entry, the right hand side matrix B.
On exit, the solution matrix X.
 LDB (input) INTEGER

The leading dimension of the array B. LDB >= max(1,N).
 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
Pages related to chetrs
 chetrs (3)
 chetrd (l)  reduces a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
 chetrf (l)  computes the factorization of a complex Hermitian matrix A using the BunchKaufman diagonal pivoting method
 chetri (l)  computes the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF
 chetd2 (l)  reduces a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
 chetf2 (l)  computes the factorization of a complex Hermitian matrix A using the BunchKaufman diagonal pivoting method
 checon (l)  estimates the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF
 cheequb (l)  computes row and column scalings intended to equilibrate a symmetric matrix A and reduce its condition number (with respect to the twonorm)