1 files changed, 16 insertions, 15 deletions
diff --git a/SRC/sptsvx.f b/SRC/sptsvx.f
index abd3080f..9fda5212 100644
--- a/SRC/sptsvx.f
+++ b/SRC/sptsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX,
 *                          RCOND, FERR, BERR, WORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTSVX uses the factorization A = L*D*L**T to compute the solution
 *> to a real system of linear equations A*X = B, where A is an N-by-N
@@ -45,9 +45,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -70,11 +73,10 @@
 *> 4. Iterative refinement is applied to improve the computed solution
 *>    matrix and calculate error bounds and backward error estimates
 *>    for it.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -209,10 +211,9 @@
 *>                       computed solution can be more accurate than the
 *>                       value of RCOND would suggest.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley