72      INTEGER            I, INFO, J, RANK
 
   75      DOUBLE PRECISION   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.d0 / dble( i+j )
 
  107         work( nmax+j ) = 0.d0
 
  120      CALL dpstrf( 
'/', 0, a, 1, piv, rank, -1.d0, work, info )
 
  121      CALL chkxer( 
'DPSTRF', infot, nout, lerr, ok )
 
  123      CALL dpstrf( 
'U', -1, a, 1, piv, rank, -1.d0, work, info )
 
  124      CALL chkxer( 
'DPSTRF', infot, nout, lerr, ok )
 
  126      CALL dpstrf( 
'U', 2, a, 1, piv, rank, -1.d0, work, info )
 
  127      CALL chkxer( 
'DPSTRF', infot, nout, lerr, ok )
 
  133      CALL dpstf2( 
'/', 0, a, 1, piv, rank, -1.d0, work, info )
 
  134      CALL chkxer( 
'DPSTF2', infot, nout, lerr, ok )
 
  136      CALL dpstf2( 
'U', -1, a, 1, piv, rank, -1.d0, work, info )
 
  137      CALL chkxer( 
'DPSTF2', infot, nout, lerr, ok )
 
  139      CALL dpstf2( 
'U', 2, a, 1, piv, rank, -1.d0, work, info )
 
  140      CALL chkxer( 
'DPSTF2', infot, nout, lerr, ok )
 
  145      CALL alaesm( path, ok, nout )
 
 
subroutine dpstf2(uplo, n, a, lda, piv, rank, tol, work, info)
DPSTF2 computes the Cholesky factorization with complete pivoting of a real symmetric positive semide...
subroutine dpstrf(uplo, n, a, lda, piv, rank, tol, work, info)
DPSTRF computes the Cholesky factorization with complete pivoting of a real symmetric positive semide...