summaryrefslogtreecommitdiff
path: root/SRC/zpstrf.f
diff options
context:
space:
mode:
Diffstat (limited to 'SRC/zpstrf.f')
-rw-r--r--SRC/zpstrf.f24
1 files changed, 11 insertions, 13 deletions
diff --git a/SRC/zpstrf.f b/SRC/zpstrf.f
index 4be6d127..19b1da90 100644
--- a/SRC/zpstrf.f
+++ b/SRC/zpstrf.f
@@ -15,8 +15,8 @@
*> [TXT]</a>
*> \endhtmlonly
*
-* Definition
-* ==========
+* Definition:
+* ===========
*
* SUBROUTINE ZPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
*
@@ -31,11 +31,11 @@
* INTEGER PIV( N )
* ..
*
-* Purpose
-* =======
*
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+* =============
+*>
+*> \verbatim
*>
*> ZPSTRF computes the Cholesky factorization with complete
*> pivoting of a complex Hermitian positive semidefinite matrix A.
@@ -48,11 +48,10 @@
*>
*> This algorithm does not attempt to check that A is positive
*> semidefinite. This version of the algorithm calls level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
*
-* Arguments
-* =========
+* Arguments:
+* ==========
*
*> \param[in] UPLO
*> \verbatim
@@ -126,10 +125,9 @@
*> as returned in RANK, or is indefinite. See Section 7 of
*> LAPACK Working Note #161 for further information.
*> \endverbatim
-*>
*
-* Authors
-* =======
+* Authors:
+* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley