.TH "TESTING/LIN/cpst01.f" 3 "Version 3.12.0" "LAPACK" \" -*- nroff -*-
.ad l
.nh
.SH NAME
TESTING/LIN/cpst01.f
.SH SYNOPSIS
.br
.PP
.SS "Functions/Subroutines"

.in +1c
.ti -1c
.RI "subroutine \fBcpst01\fP (uplo, n, a, lda, afac, ldafac, perm, ldperm, piv, rwork, resid, rank)"
.br
.RI "\fBCPST01\fP "
.in -1c
.SH "Function/Subroutine Documentation"
.PP 
.SS "subroutine cpst01 (character uplo, integer n, complex, dimension( lda, * ) a, integer lda, complex, dimension( ldafac, * ) afac, integer ldafac, complex, dimension( ldperm, * ) perm, integer ldperm, integer, dimension( * ) piv, real, dimension( * ) rwork, real resid, integer rank)"

.PP
\fBCPST01\fP 
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
 CPST01 reconstructs an Hermitian positive semidefinite matrix A
 from its L or U factors and the permutation matrix P and computes
 the residual
    norm( P*L*L'*P' - A ) / ( N * norm(A) * EPS ) or
    norm( P*U'*U*P' - A ) / ( N * norm(A) * EPS ),
 where EPS is the machine epsilon, L' is the conjugate transpose of L,
 and U' is the conjugate transpose of U\&.
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIUPLO\fP 
.PP
.nf
          UPLO is CHARACTER*1
          Specifies whether the upper or lower triangular part of the
          Hermitian matrix A is stored:
          = 'U':  Upper triangular
          = 'L':  Lower triangular
.fi
.PP
.br
\fIN\fP 
.PP
.nf
          N is INTEGER
          The number of rows and columns of the matrix A\&.  N >= 0\&.
.fi
.PP
.br
\fIA\fP 
.PP
.nf
          A is COMPLEX array, dimension (LDA,N)
          The original Hermitian matrix A\&.
.fi
.PP
.br
\fILDA\fP 
.PP
.nf
          LDA is INTEGER
          The leading dimension of the array A\&.  LDA >= max(1,N)
.fi
.PP
.br
\fIAFAC\fP 
.PP
.nf
          AFAC is COMPLEX array, dimension (LDAFAC,N)
          The factor L or U from the L*L' or U'*U
          factorization of A\&.
.fi
.PP
.br
\fILDAFAC\fP 
.PP
.nf
          LDAFAC is INTEGER
          The leading dimension of the array AFAC\&.  LDAFAC >= max(1,N)\&.
.fi
.PP
.br
\fIPERM\fP 
.PP
.nf
          PERM is COMPLEX array, dimension (LDPERM,N)
          Overwritten with the reconstructed matrix, and then with the
          difference P*L*L'*P' - A (or P*U'*U*P' - A)
.fi
.PP
.br
\fILDPERM\fP 
.PP
.nf
          LDPERM is INTEGER
          The leading dimension of the array PERM\&.
          LDAPERM >= max(1,N)\&.
.fi
.PP
.br
\fIPIV\fP 
.PP
.nf
          PIV is INTEGER array, dimension (N)
          PIV is such that the nonzero entries are
          P( PIV( K ), K ) = 1\&.
.fi
.PP
.br
\fIRWORK\fP 
.PP
.nf
          RWORK is REAL array, dimension (N)
.fi
.PP
.br
\fIRESID\fP 
.PP
.nf
          RESID is REAL
          If UPLO = 'L', norm(L*L' - A) / ( N * norm(A) * EPS )
          If UPLO = 'U', norm(U'*U - A) / ( N * norm(A) * EPS )
.fi
.PP
.br
\fIRANK\fP 
.PP
.nf
          RANK is INTEGER
          number of nonzero singular values of A\&.
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 
.PP
Univ\&. of California Berkeley 
.PP
Univ\&. of Colorado Denver 
.PP
NAG Ltd\&. 
.RE
.PP

.PP
Definition at line \fB134\fP of file \fBcpst01\&.f\fP\&.
.SH "Author"
.PP 
Generated automatically by Doxygen for LAPACK from the source code\&.