75 INTEGER i, info,
j, rank
78 COMPLEX a( nmax, nmax )
91 COMMON / infoc / infot, nout, ok, lerr
92 COMMON / srnamc / srnamt
100 WRITE( nout, fmt = * )
106 a( i,
j ) = 1.0 /
REAL( i+
j )
124 CALL
cpstrf(
'/', 0, a, 1, piv, rank, -1.0, rwork, info )
125 CALL
chkxer(
'CPSTRF', infot, nout, lerr, ok )
127 CALL
cpstrf(
'U', -1, a, 1, piv, rank, -1.0, rwork, info )
128 CALL
chkxer(
'CPSTRF', infot, nout, lerr, ok )
130 CALL
cpstrf(
'U', 2, a, 1, piv, rank, -1.0, rwork, info )
131 CALL
chkxer(
'CPSTRF', infot, nout, lerr, ok )
137 CALL
cpstf2(
'/', 0, a, 1, piv, rank, -1.0, rwork, info )
138 CALL
chkxer(
'CPSTF2', infot, nout, lerr, ok )
140 CALL
cpstf2(
'U', -1, a, 1, piv, rank, -1.0, rwork, info )
141 CALL
chkxer(
'CPSTF2', infot, nout, lerr, ok )
143 CALL
cpstf2(
'U', 2, a, 1, piv, rank, -1.0, rwork, info )
144 CALL
chkxer(
'CPSTF2', infot, nout, lerr, ok )
149 CALL
alaesm( path, ok, nout )
subroutine cpstf2(UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO)
CPSTF2 computes the Cholesky factorization with complete pivoting of a real symmetric or complex Herm...
subroutine chkxer(SRNAMT, INFOT, NOUT, LERR, OK)
subroutine cpstrf(UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO)
CPSTRF
set ue cd $ADTTMP cat<< EOF > tmp f Program LinearEquations Implicit none Real j
subroutine alaesm(PATH, OK, NOUT)
ALAESM
subroutine cerrps(PATH, NUNIT)
CERRPS