72 INTEGER I, INFO, J, RANK
75 REAL A( NMAX, NMAX ), WORK( 2*NMAX )
87 COMMON / infoc / infot, nout, ok, lerr
88 COMMON / srnamc / srnamt
96 WRITE( nout, fmt = * )
102 a( i, j ) = 1.0 / real( i+j )
120 CALL spstrf(
'/', 0, a, 1, piv, rank, -1.0, work, info )
121 CALL chkxer(
'SPSTRF', infot, nout, lerr, ok )
123 CALL spstrf(
'U', -1, a, 1, piv, rank, -1.0, work, info )
124 CALL chkxer(
'SPSTRF', infot, nout, lerr, ok )
126 CALL spstrf(
'U', 2, a, 1, piv, rank, -1.0, work, info )
127 CALL chkxer(
'SPSTRF', infot, nout, lerr, ok )
133 CALL spstf2(
'/', 0, a, 1, piv, rank, -1.0, work, info )
134 CALL chkxer(
'SPSTF2', infot, nout, lerr, ok )
136 CALL spstf2(
'U', -1, a, 1, piv, rank, -1.0, work, info )
139 CALL SPSTF2( 'u
', 2, A, 1, PIV, RANK, -1.0, WORK, INFO )
140 CALL CHKXER( 'spstf2', INFOT, NOUT, LERR, OK )
145 CALL ALAESM( PATH, OK, NOUT )
subroutine spstf2(uplo, n, a, lda, piv, rank, tol, work, info)
SPSTF2 computes the Cholesky factorization with complete pivoting of a real symmetric positive semide...
subroutine spstrf(uplo, n, a, lda, piv, rank, tol, work, info)
SPSTRF computes the Cholesky factorization with complete pivoting of a real symmetric positive semide...