Cosmetic changes in Doxygen presentation.

Use \par instead of \details for section.

add a Contributors Section and a Reference Section.
Remove (some) verbatim section when not needed.
Those changes have been done by hand so I am not sure I manage to catch them all.

1695 files changed, 22873 insertions, 27582 deletions

diff --git a/SRC/VARIANTS/cholesky/RL/cpotrf.f b/SRC/VARIANTS/cholesky/RL/cpotrf.f
index cdc182ea..0f45856a 100644
--- a/SRC/VARIANTS/cholesky/RL/cpotrf.f
+++ b/SRC/VARIANTS/cholesky/RL/cpotrf.f
@@ -5,8 +5,8 @@ C> \brief \b CPOTRF VARIANT: right looking block version of the algorithm, calli
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/cholesky/RL/dpotrf.f b/SRC/VARIANTS/cholesky/RL/dpotrf.f
index f0614393..ce323b4b 100644
--- a/SRC/VARIANTS/cholesky/RL/dpotrf.f
+++ b/SRC/VARIANTS/cholesky/RL/dpotrf.f
@@ -5,8 +5,8 @@ C> \brief \b DPOTRF VARIANT: right looking block version of the algorithm, calli
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/cholesky/RL/spotrf.f b/SRC/VARIANTS/cholesky/RL/spotrf.f
index f388a361..21b0b41a 100644
--- a/SRC/VARIANTS/cholesky/RL/spotrf.f
+++ b/SRC/VARIANTS/cholesky/RL/spotrf.f
@@ -5,8 +5,8 @@ C> \brief \b SPOTRF VARIANT: right looking block version of the algorithm, calli
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/cholesky/RL/zpotrf.f b/SRC/VARIANTS/cholesky/RL/zpotrf.f
index db1fff78..39e72c83 100644
--- a/SRC/VARIANTS/cholesky/RL/zpotrf.f
+++ b/SRC/VARIANTS/cholesky/RL/zpotrf.f
@@ -5,8 +5,8 @@ C> \brief \b ZPOTRF VARIANT: right looking block version of the algorithm, calli
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the right looking block version of the algorithm, calling Level 3 BLA
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/cholesky/TOP/cpotrf.f b/SRC/VARIANTS/cholesky/TOP/cpotrf.f
index 365eb162..e42a78f9 100644
--- a/SRC/VARIANTS/cholesky/TOP/cpotrf.f
+++ b/SRC/VARIANTS/cholesky/TOP/cpotrf.f
@@ -5,8 +5,8 @@ C> \brief \b CPOTRF VARIANT: top-looking block version of the algorithm, calling
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/cholesky/TOP/dpotrf.f b/SRC/VARIANTS/cholesky/TOP/dpotrf.f
index eccf4f8f..c91669b5 100644
--- a/SRC/VARIANTS/cholesky/TOP/dpotrf.f
+++ b/SRC/VARIANTS/cholesky/TOP/dpotrf.f
@@ -5,8 +5,8 @@ C> \brief \b DPOTRF VARIANT: top-looking block version of the algorithm, calling
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/cholesky/TOP/spotrf.f b/SRC/VARIANTS/cholesky/TOP/spotrf.f
index 65b6a8eb..4a46f723 100644
--- a/SRC/VARIANTS/cholesky/TOP/spotrf.f
+++ b/SRC/VARIANTS/cholesky/TOP/spotrf.f
@@ -5,8 +5,8 @@ C> \brief \b SPOTRF VARIANT: top-looking block version of the algorithm, calling
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/cholesky/TOP/zpotrf.f b/SRC/VARIANTS/cholesky/TOP/zpotrf.f
index 7614246e..9d4f636a 100644
--- a/SRC/VARIANTS/cholesky/TOP/zpotrf.f
+++ b/SRC/VARIANTS/cholesky/TOP/zpotrf.f
@@ -5,8 +5,8 @@ C> \brief \b ZPOTRF VARIANT: top-looking block version of the algorithm, calling
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOTRF ( UPLO, N, A, LDA, INFO )
 * 
@@ -36,8 +36,8 @@ C> This is the top-looking block version of the algorithm, calling Level 3 BLAS.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] UPLO
 C> \verbatim
@@ -85,8 +85,8 @@ C>                completed.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/CR/cgetrf.f b/SRC/VARIANTS/lu/CR/cgetrf.f
index 1446a8db..665ef82d 100644
--- a/SRC/VARIANTS/lu/CR/cgetrf.f
+++ b/SRC/VARIANTS/lu/CR/cgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b CGETRF VARIANT: Crout Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/CR/dgetrf.f b/SRC/VARIANTS/lu/CR/dgetrf.f
index 1de7c106..d6381567 100644
--- a/SRC/VARIANTS/lu/CR/dgetrf.f
+++ b/SRC/VARIANTS/lu/CR/dgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b DGETRF VARIANT: Crout Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/CR/sgetrf.f b/SRC/VARIANTS/lu/CR/sgetrf.f
index c70871b1..d5aeae46 100644
--- a/SRC/VARIANTS/lu/CR/sgetrf.f
+++ b/SRC/VARIANTS/lu/CR/sgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b SGETRF VARIANT: Crout Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/CR/zgetrf.f b/SRC/VARIANTS/lu/CR/zgetrf.f
index 0a36b212..3178aacf 100644
--- a/SRC/VARIANTS/lu/CR/zgetrf.f
+++ b/SRC/VARIANTS/lu/CR/zgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b ZGETRF VARIANT: Crout Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the Crout Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/LL/cgetrf.f b/SRC/VARIANTS/lu/LL/cgetrf.f
index 2765dfd1..9787f43b 100644
--- a/SRC/VARIANTS/lu/LL/cgetrf.f
+++ b/SRC/VARIANTS/lu/LL/cgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b CGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/LL/dgetrf.f b/SRC/VARIANTS/lu/LL/dgetrf.f
index a4628142..3df00dcb 100644
--- a/SRC/VARIANTS/lu/LL/dgetrf.f
+++ b/SRC/VARIANTS/lu/LL/dgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b DGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/LL/sgetrf.f b/SRC/VARIANTS/lu/LL/sgetrf.f
index 0e97e015..c36d8e78 100644
--- a/SRC/VARIANTS/lu/LL/sgetrf.f
+++ b/SRC/VARIANTS/lu/LL/sgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b SGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/LL/zgetrf.f b/SRC/VARIANTS/lu/LL/zgetrf.f
index b4b7d915..3b2199bf 100644
--- a/SRC/VARIANTS/lu/LL/zgetrf.f
+++ b/SRC/VARIANTS/lu/LL/zgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b ZGETRF VARIANT: left-looking Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETRF ( M, N, A, LDA, IPIV, INFO)
 * 
@@ -37,8 +37,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -85,8 +85,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/REC/cgetrf.f b/SRC/VARIANTS/lu/REC/cgetrf.f
index 8b457095..a46bad11 100644
--- a/SRC/VARIANTS/lu/REC/cgetrf.f
+++ b/SRC/VARIANTS/lu/REC/cgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b CGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -119,8 +119,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/REC/dgetrf.f b/SRC/VARIANTS/lu/REC/dgetrf.f
index 7263a5bb..318c166d 100644
--- a/SRC/VARIANTS/lu/REC/dgetrf.f
+++ b/SRC/VARIANTS/lu/REC/dgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b DGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -119,8 +119,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/REC/sgetrf.f b/SRC/VARIANTS/lu/REC/sgetrf.f
index 11eb7811..9df7d5b9 100644
--- a/SRC/VARIANTS/lu/REC/sgetrf.f
+++ b/SRC/VARIANTS/lu/REC/sgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b SGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -119,8 +119,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/lu/REC/zgetrf.f b/SRC/VARIANTS/lu/REC/zgetrf.f
index 19137fb9..fe698e1c 100644
--- a/SRC/VARIANTS/lu/REC/zgetrf.f
+++ b/SRC/VARIANTS/lu/REC/zgetrf.f
@@ -5,8 +5,8 @@ C> \brief \b ZGETRF VARIANT: iterative version of Sivan Toledo's recursive LU al
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -71,8 +71,8 @@ C> 1065-1081. http://dx.doi.org/10.1137/S0895479896297744
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -119,8 +119,8 @@ C>                to solve a system of equations.
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/qr/LL/cgeqrf.f b/SRC/VARIANTS/qr/LL/cgeqrf.f
index 08af07f5..8a79ebea 100644
--- a/SRC/VARIANTS/qr/LL/cgeqrf.f
+++ b/SRC/VARIANTS/qr/LL/cgeqrf.f
@@ -5,8 +5,8 @@ C> \brief \b CGEQRF VARIANT: left-looking Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -115,8 +115,8 @@ C>          < 0:  if INFO = -i, the i-th argument had an illegal value
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
@@ -127,7 +127,6 @@ C> \date November 2011
 *
 C> \ingroup variantsGEcomputational
 *
-*
 *  Further Details
 *  ===============
 C>\details \b Further \b Details
diff --git a/SRC/VARIANTS/qr/LL/dgeqrf.f b/SRC/VARIANTS/qr/LL/dgeqrf.f
index 2249720c..b6fa5ace 100644
--- a/SRC/VARIANTS/qr/LL/dgeqrf.f
+++ b/SRC/VARIANTS/qr/LL/dgeqrf.f
@@ -5,8 +5,8 @@ C> \brief \b DGEQRF VARIANT: left-looking Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -115,8 +115,8 @@ C>          < 0:  if INFO = -i, the i-th argument had an illegal value
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
@@ -127,7 +127,6 @@ C> \date November 2011
 *
 C> \ingroup variantsGEcomputational
 *
-*
 *  Further Details
 *  ===============
 C>\details \b Further \b Details
diff --git a/SRC/VARIANTS/qr/LL/sceil.f b/SRC/VARIANTS/qr/LL/sceil.f
index f988e6be..397b7df2 100644
--- a/SRC/VARIANTS/qr/LL/sceil.f
+++ b/SRC/VARIANTS/qr/LL/sceil.f
@@ -5,8 +5,8 @@ C> \brief \b SCEIL
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SCEIL( A )
 * 
@@ -39,12 +39,12 @@ C>\details \b Purpose:
 C>\verbatim
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
diff --git a/SRC/VARIANTS/qr/LL/sgeqrf.f b/SRC/VARIANTS/qr/LL/sgeqrf.f
index a74272bd..1d22897e 100644
--- a/SRC/VARIANTS/qr/LL/sgeqrf.f
+++ b/SRC/VARIANTS/qr/LL/sgeqrf.f
@@ -5,8 +5,8 @@ C> \brief \b SGEQRF VARIANT: left-looking Level 3 BLAS version of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -115,8 +115,8 @@ C>          < 0:  if INFO = -i, the i-th argument had an illegal value
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
@@ -127,7 +127,6 @@ C> \date November 2011
 *
 C> \ingroup variantsGEcomputational
 *
-*
 *  Further Details
 *  ===============
 C>\details \b Further \b Details
diff --git a/SRC/VARIANTS/qr/LL/zgeqrf.f b/SRC/VARIANTS/qr/LL/zgeqrf.f
index 2f6b7097..576d9fa2 100644
--- a/SRC/VARIANTS/qr/LL/zgeqrf.f
+++ b/SRC/VARIANTS/qr/LL/zgeqrf.f
@@ -5,8 +5,8 @@ C> \brief \b ZGEQRF VARIANT: left-looking Level 3 BLAS of the algorithm.
 * Online html documentation available at 
 *            http://www.netlib.org/lapack/explore-html/ 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQRF ( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -30,8 +30,8 @@ C> This is the left-looking Level 3 BLAS version of the algorithm.
 C>
 C>\endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 C> \param[in] M
 C> \verbatim
@@ -115,8 +115,8 @@ C>          < 0:  if INFO = -i, the i-th argument had an illegal value
 C> \endverbatim
 C>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 C> \author Univ. of Tennessee 
 C> \author Univ. of California Berkeley 
@@ -127,7 +127,6 @@ C> \date November 2011
 *
 C> \ingroup variantsGEcomputational
 *
-*
 *  Further Details
 *  ===============
 C>\details \b Further \b Details
diff --git a/SRC/cbbcsd.f b/SRC/cbbcsd.f
index 91254a91..4c9b2eb9 100644
--- a/SRC/cbbcsd.f
+++ b/SRC/cbbcsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q,
 *                          THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T,
@@ -35,11 +35,11 @@
 *      $                   V2T( LDV2T, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CBBCSD computes the CS decomposition of a unitary matrix in
 *> bidiagonal-block form,
@@ -68,11 +68,10 @@
 *> The unitary matrices U1, U2, V1T, and V2T are input/output.
 *> The input matrices are pre- or post-multiplied by the appropriate
 *> singular vector matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -297,25 +296,26 @@
 *>          > 0:  if CBBCSD did not converge, INFO specifies the number
 *>                of nonzero entries in PHI, and B11D, B11E, etc.,
 *>                contain the partially reduced matrix.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Reference
-*>  =========
-*>
-*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
-*>      Algorithms, 50(1):33-65, 2009.
-*>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  REAL, default = MAX(10,MIN(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they
 *>          are within TOLMUL*EPS of either bound.
 *> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
+*>      Algorithms, 50(1):33-65, 2009.
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cbdsqr.f b/SRC/cbdsqr.f
index c9423b93..7121d07a 100644
--- a/SRC/cbdsqr.f
+++ b/SRC/cbdsqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,
 *                          LDU, C, LDC, RWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            C( LDC, * ), U( LDU, * ), VT( LDVT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CBDSQR computes the singular values and, optionally, the right and/or
 *> left singular vectors from the singular value decomposition (SVD) of
@@ -65,11 +65,10 @@
 *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics
 *> Department, University of California at Berkeley, July 1992
 *> for a detailed description of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -180,10 +179,12 @@
 *>                elements of a bidiagonal matrix which is orthogonally
 *>                similar to the input matrix B;  if INFO = i, i
 *>                elements of E have not converged to zero.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  REAL, default = max(10,min(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          If it is positive, TOLMUL*EPS is the desired relative
@@ -205,10 +206,9 @@
 *>          (and so fails to converge) if the number of passes
 *>          through the inner loop exceeds MAXITR*N**2.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbbrd.f b/SRC/cgbbrd.f
index 2b5b4f41..0c5f8b70 100644
--- a/SRC/cgbbrd.f
+++ b/SRC/cgbbrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q,
 *                          LDQ, PT, LDPT, C, LDC, WORK, RWORK, INFO )
@@ -31,22 +31,21 @@
 *      $                   Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBBRD reduces a complex general m-by-n band matrix A to real upper
 *> bidiagonal form B by a unitary transformation: Q**H * A * P = B.
 *>
 *> The routine computes B, and optionally forms Q or P**H, or computes
 *> Q**H*C for a given matrix C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -177,10 +176,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbcon.f b/SRC/cgbcon.f
index d7e564c3..d944df3b 100644
--- a/SRC/cgbcon.f
+++ b/SRC/cgbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND,
 *                          WORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *       COMPLEX            AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBCON estimates the reciprocal of the condition number of a complex
 *> general band matrix A, in either the 1-norm or the infinity-norm,
@@ -45,11 +45,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbequ.f b/SRC/cgbequ.f
index 01e81786..6d64efba 100644
--- a/SRC/cgbequ.f
+++ b/SRC/cgbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBEQU computes row and column scalings intended to equilibrate an
 *> M-by-N band matrix A and reduce its condition number.  R returns the
@@ -46,11 +46,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -138,10 +137,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbequb.f b/SRC/cgbequb.f
index 65385f0a..db110e65 100644
--- a/SRC/cgbequb.f
+++ b/SRC/cgbequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                           AMAX, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -53,11 +53,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -145,10 +144,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbrfs.f b/SRC/cgbrfs.f
index 1bff7c13..a1390505 100644
--- a/SRC/cgbrfs.f
+++ b/SRC/cgbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK,
@@ -33,20 +33,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is banded, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -181,16 +180,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbrfsx.f b/SRC/cgbrfsx.f
index 7448f1e4..0d0e751d 100644
--- a/SRC/cgbrfsx.f
+++ b/SRC/cgbrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CGBRFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -58,11 +56,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -423,10 +420,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbsv.f b/SRC/cgbsv.f
index 4529a15a..283e9a69 100644
--- a/SRC/cgbsv.f
+++ b/SRC/cgbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBSV computes the solution to a complex system of linear equations
 *> A * X = B, where A is a band matrix of order N with KL subdiagonals
@@ -43,11 +43,10 @@
 *> and unit lower triangular matrices with KL subdiagonals, and U is
 *> upper triangular with KL+KU superdiagonals.  The factored form of A
 *> is then used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -125,10 +124,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,10 +137,9 @@
 *
 *> \ingroup complexGBsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -160,7 +157,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgbsvx.f b/SRC/cgbsvx.f
index 890112da..5308dc62 100644
--- a/SRC/cgbsvx.f
+++ b/SRC/cgbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                          LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBSVX uses the LU factorization to compute the solution to a complex
 *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed by this subroutine:
 *>
@@ -88,11 +91,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -350,10 +352,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 
diff --git a/SRC/cgbsvxx.f b/SRC/cgbsvxx.f
index 3684e81b..d55fef72 100644
--- a/SRC/cgbsvxx.f
+++ b/SRC/cgbsvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CGBSVXX uses the LU factorization to compute the solution to a
 *>    complex system of linear equations  A * X = B,  where A is an
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what CGBSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -109,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -543,10 +543,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgbtf2.f b/SRC/cgbtf2.f
index b01bad78..fcce0b69 100644
--- a/SRC/cgbtf2.f
+++ b/SRC/cgbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBTF2 computes an LU factorization of a complex m-by-n band matrix
 *> A using partial pivoting with row interchanges.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup complexGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -143,7 +140,6 @@
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U, because of fill-in resulting from the row
 *>  interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgbtrf.f b/SRC/cgbtrf.f
index 17a238b6..6cd4b58d 100644
--- a/SRC/cgbtrf.f
+++ b/SRC/cgbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBTRF computes an LU factorization of a complex m-by-n band matrix A
 *> using partial pivoting with row interchanges.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup complexGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -142,7 +139,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgbtrs.f b/SRC/cgbtrs.f
index 2166ce66..52cba824 100644
--- a/SRC/cgbtrs.f
+++ b/SRC/cgbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX            AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGBTRS solves a system of linear equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B
 *> with a general band matrix A using the LU factorization computed
 *> by CGBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgebak.f b/SRC/cgebak.f
index 48870c8b..cc063a09 100644
--- a/SRC/cgebak.f
+++ b/SRC/cgebak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV,
 *                          INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX            V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEBAK forms the right or left eigenvectors of a complex general
 *> matrix by backward transformation on the computed eigenvectors of the
 *> balanced matrix output by CGEBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgebal.f b/SRC/cgebal.f
index 276137fc..ee8ba6be 100644
--- a/SRC/cgebal.f
+++ b/SRC/cgebal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEBAL balances a general complex matrix A.  This involves, first,
 *> permuting A by a similarity transformation to isolate eigenvalues
@@ -44,11 +44,10 @@
 *>
 *> Balancing may reduce the 1-norm of the matrix, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -128,10 +126,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The permutations consist of row and column interchanges which put
@@ -159,7 +156,6 @@
 *>
 *>  Modified by Tzu-Yi Chen, Computer Science Division, University of
 *>    California at Berkeley, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgebd2.f b/SRC/cgebd2.f
index 4adf2e8b..dc2a8238 100644
--- a/SRC/cgebd2.f
+++ b/SRC/cgebd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEBD2 reduces a complex general m by n matrix A to upper or lower
 *> real bidiagonal form B by a unitary transformation: Q**H * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0: successful exit 
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,10 +137,9 @@
 *> \ingroup complexGEcomputational
 * @precisions normal c -> s d z
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -188,7 +185,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgebrd.f b/SRC/cgebrd.f
index 798e027e..4d9f2f18 100644
--- a/SRC/cgebrd.f
+++ b/SRC/cgebrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK,
 *                          INFO )
@@ -30,21 +30,20 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEBRD reduces a general complex M-by-N matrix A to upper or lower
 *> bidiagonal form B by a unitary transformation: Q**H * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -140,10 +139,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -154,10 +152,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -203,7 +200,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgecon.f b/SRC/cgecon.f
index bc538b04..848908a2 100644
--- a/SRC/cgecon.f
+++ b/SRC/cgecon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, RWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGECON estimates the reciprocal of the condition number of a general
 *> complex matrix A, in either the 1-norm or the infinity-norm, using
@@ -44,11 +44,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgeequ.f b/SRC/cgeequ.f
index e38b1be8..a8138c14 100644
--- a/SRC/cgeequ.f
+++ b/SRC/cgeequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEEQU computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -46,11 +46,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgeequb.f b/SRC/cgeequb.f
index d4c353c1..d9b75a1c 100644
--- a/SRC/cgeequb.f
+++ b/SRC/cgeequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                           INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -53,11 +53,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -131,10 +130,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgees.f b/SRC/cgees.f
index 0c5199c9..24cde6fd 100644
--- a/SRC/cgees.f
+++ b/SRC/cgees.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, W, VS,
 *                         LDVS, WORK, LWORK, RWORK, BWORK, INFO )
@@ -35,11 +35,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEES computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur
@@ -51,11 +51,10 @@
 *> invariant subspace corresponding to the selected eigenvalues.
 *>
 *> A complex matrix is in Schur form if it is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -181,10 +180,9 @@
 *>                      SELECT = .TRUE..  This could also be caused by
 *>                      underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgeesx.f b/SRC/cgeesx.f
index c4c24f32..145c2e0f 100644
--- a/SRC/cgeesx.f
+++ b/SRC/cgeesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, W,
 *                          VS, LDVS, RCONDE, RCONDV, WORK, LWORK, RWORK,
@@ -37,11 +37,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEESX computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur
@@ -60,11 +60,10 @@
 *> these quantities are called s and sep respectively).
 *>
 *> A complex matrix is in Schur form if it is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -222,10 +221,9 @@
 *>                   the Schur form no longer satisfy SELECT=.TRUE.  This
 *>                   could also be caused by underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgeev.f b/SRC/cgeev.f
index bad77c57..a41b50e3 100644
--- a/SRC/cgeev.f
+++ b/SRC/cgeev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEEV( JOBVL, JOBVR, N, A, LDA, W, VL, LDVL, VR, LDVR,
 *                         WORK, LWORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEEV computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -49,11 +49,10 @@
 *>
 *> The computed eigenvectors are normalized to have Euclidean norm
 *> equal to 1 and largest component real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -161,10 +160,9 @@
 *>                elements and i+1:N of W contain eigenvalues which have
 *>                converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgeevx.f b/SRC/cgeevx.f
index 8f37a566..a2354ead 100644
--- a/SRC/cgeevx.f
+++ b/SRC/cgeevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL,
 *                          LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE,
@@ -34,11 +34,11 @@
 *      $                   W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEEVX computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -69,11 +69,10 @@
 *> (in exact arithmetic) but diagonal scaling will.  For further
 *> explanation of balancing, see section 4.10.2 of the LAPACK
 *> Users' Guide.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -268,10 +267,9 @@
 *>                have been computed; elements 1:ILO-1 and i+1:N of W
 *>                contain eigenvalues which have converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgegs.f b/SRC/cgegs.f
index 90d2e345..f0e9c955 100644
--- a/SRC/cgegs.f
+++ b/SRC/cgegs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHA, BETA,
 *                         VSL, LDVSL, VSR, LDVSR, WORK, LWORK, RWORK,
@@ -33,11 +33,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine CGGES.
 *>
@@ -56,11 +56,10 @@
 *> CGEGV should be used instead.  See CGEGV for a description of the
 *> eigenvalues of the generalized nonsymmetric eigenvalue problem
 *> (GNEP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -208,10 +207,9 @@
 *>                =N+8: error return from CGGBAK (computing VSR)
 *>                =N+9: error return from CLASCL (various places)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgegv.f b/SRC/cgegv.f
index 69fc8295..7c2396f6 100644
--- a/SRC/cgegv.f
+++ b/SRC/cgegv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA,
 *                         VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine CGGEV.
 *>
@@ -64,11 +64,10 @@
 *> are left eigenvectors of (A,B).
 *>
 *> Note: this routine performs "full balancing" on A and B
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -234,10 +233,9 @@
 *>                =N+9: error return from CGGBAK (computing VR)
 *>                =N+10: error return from CLASCL (various calls)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -248,10 +246,9 @@
 *
 *> \ingroup complexGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing
@@ -279,7 +276,6 @@
 *>  are computed, then only the diagonal blocks will be correct.
 *>
 *>  [*] In other words, upper triangular form.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgehd2.f b/SRC/cgehd2.f
index b7fe0841..2e3085e7 100644
--- a/SRC/cgehd2.f
+++ b/SRC/cgehd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEHD2 reduces a complex general matrix A to upper Hessenberg form H
 *> by a unitary similarity transformation:  Q**H * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -112,10 +110,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -147,7 +144,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgehrd.f b/SRC/cgehrd.f
index 363c9a84..9c0032fa 100644
--- a/SRC/cgehrd.f
+++ b/SRC/cgehrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEHRD reduces a complex general matrix A to upper Hessenberg form H by
 *> an unitary similarity transformation:  Q**H * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,10 +125,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -166,7 +163,6 @@
 *>  This file is a slight modification of LAPACK-3.0's DGEHRD
 *>  subroutine incorporating improvements proposed by Quintana-Orti and
 *>  Van de Geijn (2006). (See DLAHR2.)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgelq2.f b/SRC/cgelq2.f
index 2e915459..32fa0c72 100644
--- a/SRC/cgelq2.f
+++ b/SRC/cgelq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGELQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGELQ2 computes an LQ factorization of a complex m by n matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in
 *>  A(i,i+1:n), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgelqf.f b/SRC/cgelqf.f
index f88e5257..b5973f65 100644
--- a/SRC/cgelqf.f
+++ b/SRC/cgelqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGELQF computes an LQ factorization of a complex M-by-N matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -133,7 +130,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in
 *>  A(i,i+1:n), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgels.f b/SRC/cgels.f
index 29bb2aba..7b9e95d3 100644
--- a/SRC/cgels.f
+++ b/SRC/cgels.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK,
 *                         INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGELS solves overdetermined or underdetermined complex linear systems
 *> involving an M-by-N matrix A, or its conjugate-transpose, using a QR
@@ -59,11 +59,10 @@
 *> handled in a single call; they are stored as the columns of the
 *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution
 *> matrix X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -166,10 +165,9 @@
 *>                full rank; the least squares solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgelsd.f b/SRC/cgelsd.f
index 4ec0862d..fd6df63f 100644
--- a/SRC/cgelsd.f
+++ b/SRC/cgelsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
 *                          WORK, LWORK, RWORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGELSD computes the minimum-norm solution to a real linear least
 *> squares problem:
@@ -66,11 +66,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -202,10 +201,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -216,19 +214,13 @@
 *
 *> \ingroup complexGEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE CGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
      $                   WORK, LWORK, RWORK, IWORK, INFO )
diff --git a/SRC/cgelss.f b/SRC/cgelss.f
index e2540780..85c4f989 100644
--- a/SRC/cgelss.f
+++ b/SRC/cgelss.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
 *                          WORK, LWORK, RWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGELSS computes the minimum norm solution to a complex linear
 *> least squares problem:
@@ -52,11 +52,10 @@
 *> The effective rank of A is determined by treating as zero those
 *> singular values which are less than RCOND times the largest singular
 *> value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -162,10 +161,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgelsx.f b/SRC/cgelsx.f
index 706bc331..ad65a7a4 100644
--- a/SRC/cgelsx.f
+++ b/SRC/cgelsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine CGELSY.
 *>
@@ -66,11 +66,10 @@
 *>    X = P * Z**H [ inv(T11)*Q1**H*B ]
 *>                 [        0         ]
 *> where Q1 consists of the first RANK columns of Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -168,10 +167,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgelsy.f b/SRC/cgelsy.f
index 8e8261c6..ef67bcd0 100644
--- a/SRC/cgelsy.f
+++ b/SRC/cgelsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, LWORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGELSY computes the minimum-norm solution to a complex linear least
 *> squares problem:
@@ -73,11 +73,10 @@
 *>     the call to the subroutine xGEQP3. This subroutine is a Blas-3
 *>     version of the QR factorization with column pivoting.
 *>   o Matrix B (the right hand side) is updated with Blas-3.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -187,10 +186,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -201,18 +199,12 @@
 *
 *> \ingroup complexGEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>
-*> \endverbatim
+*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n 
+*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
+*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
 *>
 *  =====================================================================
       SUBROUTINE CGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
diff --git a/SRC/cgemqrt.f b/SRC/cgemqrt.f
index e036e71f..e118f013 100644
--- a/SRC/cgemqrt.f
+++ b/SRC/cgemqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, 
 *                          C, LDC, WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX   V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEMQRT overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> generated using the compact WY representation as returned by CGEQRT. 
 *>
 *> Q is of order M if SIDE = 'L' and of order N  if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgeql2.f b/SRC/cgeql2.f
index 3830626d..40c1bad4 100644
--- a/SRC/cgeql2.f
+++ b/SRC/cgeql2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQL2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQL2 computes a QL factorization of a complex m by n matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqlf.f b/SRC/cgeqlf.f
index a3db5bbc..8c77e96c 100644
--- a/SRC/cgeqlf.f
+++ b/SRC/cgeqlf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQLF computes a QL factorization of a complex M-by-N matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqp3.f b/SRC/cgeqp3.f
index 7c1dc195..a41ed01c 100644
--- a/SRC/cgeqp3.f
+++ b/SRC/cgeqp3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK,
 *                          INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQP3 computes a QR factorization with column pivoting of a
 *> matrix A:  A*P = Q*R  using Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -119,10 +118,9 @@
 *>          = 0: successful exit.
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -133,10 +131,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -150,13 +147,14 @@
 *>  where tau is a real/complex scalar, and v is a real/complex vector
 *>  with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in
 *>  A(i+1:m,i), and tau in TAU(i).
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK,
      $                   INFO )
diff --git a/SRC/cgeqpf.f b/SRC/cgeqpf.f
index 937afbae..9bd9ca67 100644
--- a/SRC/cgeqpf.f
+++ b/SRC/cgeqpf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine CGEQP3.
 *>
 *> CGEQPF computes a QR factorization with column pivoting of a
 *> complex M-by-N matrix A: A*P = Q*R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -120,10 +118,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -146,7 +143,6 @@
 *>    University of Zagreb, Croatia.
 *>  -- April 2011                                                      --
 *>  For more details see LAPACK Working Note 176.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqr2.f b/SRC/cgeqr2.f
index 029bcf6b..a255950c 100644
--- a/SRC/cgeqr2.f
+++ b/SRC/cgeqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQR2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQR2 computes a QR factorization of a complex m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqr2p.f b/SRC/cgeqr2p.f
index 7d059683..94ceb243 100644
--- a/SRC/cgeqr2p.f
+++ b/SRC/cgeqr2p.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQR2P( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQR2P computes a QR factorization of a complex m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqrf.f b/SRC/cgeqrf.f
index cc76e06e..eada7d4b 100644
--- a/SRC/cgeqrf.f
+++ b/SRC/cgeqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQRF computes a QR factorization of a complex M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqrfp.f b/SRC/cgeqrfp.f
index d734cc4c..a84c44a7 100644
--- a/SRC/cgeqrfp.f
+++ b/SRC/cgeqrfp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQRFP computes a QR factorization of a complex M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqrt.f b/SRC/cgeqrt.f
index 2f87d6bf..1aa62722 100644
--- a/SRC/cgeqrt.f
+++ b/SRC/cgeqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX A( LDA, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQRT computes a blocked QR factorization of a complex M-by-N matrix A
 *> using the compact WY representation of Q.  
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,11 +112,11 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
 *>  below the diagonal. For example, if M=5 and N=3, the matrix V is
 *>
@@ -138,7 +136,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = (T1 T2 ... TB).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqrt2.f b/SRC/cgeqrt2.f
index 8ad882a0..b2bf285e 100644
--- a/SRC/cgeqrt2.f
+++ b/SRC/cgeqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGEQRT2( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQRT2 computes a QR factorization of a complex M-by-N matrix A, 
 *> using the compact WY representation of Q. 
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -125,7 +122,6 @@
 *>               H = I - V * T * V**H
 *>
 *>  where V**H is the conjugate transpose of V.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgeqrt3.f b/SRC/cgeqrt3.f
index 3b28ea1c..d4b33835 100644
--- a/SRC/cgeqrt3.f
+++ b/SRC/cgeqrt3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE CGEQRT3( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,22 +27,21 @@
 *       COMPLEX   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGEQRT3 recursively computes a QR factorization of a complex M-by-N matrix A, 
 *> using the compact WY representation of Q. 
 *>
 *> Based on the algorithm of Elmroth and Gustavson, 
 *> IBM J. Res. Develop. Vol 44 No. 4 July 2000.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -106,10 +104,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -130,7 +127,6 @@
 *>  where V**H is the conjugate transpose of V.
 *>
 *>  For details of the algorithm, see Elmroth and Gustavson (cited above).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgerfs.f b/SRC/cgerfs.f
index f06fd213..acd63924 100644
--- a/SRC/cgerfs.f
+++ b/SRC/cgerfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -32,20 +32,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGERFS improves the computed solution to a system of linear
 *> equations and provides error bounds and backward error estimates for
 *> the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -162,16 +161,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgerfsx.f b/SRC/cgerfsx.f
index e43b36c6..795a201b 100644
--- a/SRC/cgerfsx.f
+++ b/SRC/cgerfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CGERFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -398,10 +395,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgerq2.f b/SRC/cgerq2.f
index aae722ce..9e85e9f3 100644
--- a/SRC/cgerq2.f
+++ b/SRC/cgerq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGERQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGERQ2 computes an RQ factorization of a complex m by n matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on
 *>  exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgerqf.f b/SRC/cgerqf.f
index 3cc0966b..c790d69c 100644
--- a/SRC/cgerqf.f
+++ b/SRC/cgerqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGERQF computes an RQ factorization of a complex M-by-N matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on
 *>  exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgesc2.f b/SRC/cgesc2.f
index 152ddef7..6bdc105f 100644
--- a/SRC/cgesc2.f
+++ b/SRC/cgesc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), RHS( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGESC2 solves a system of linear equations
 *>
@@ -42,11 +42,10 @@
 *> with a general N-by-N matrix A using the LU factorization with
 *> complete pivoting computed by CGETC2.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -94,10 +93,9 @@
 *>           On exit, SCALE contains the scale factor. SCALE is chosen
 *>           0 <= SCALE <= 1 to prevent owerflow in the solution.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -108,18 +106,12 @@
 *
 *> \ingroup complexGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 *
diff --git a/SRC/cgesdd.f b/SRC/cgesdd.f
index 994428f2..d14bd1e2 100644
--- a/SRC/cgesdd.f
+++ b/SRC/cgesdd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT,
 *                          WORK, LWORK, RWORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGESDD computes the singular value decomposition (SVD) of a complex
 *> M-by-N matrix A, optionally computing the left and/or right singular
@@ -59,11 +59,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -200,10 +199,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  The updating process of SBDSDC did not converge.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -214,18 +212,12 @@
 *
 *> \ingroup complexGEsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT,
      $                   WORK, LWORK, RWORK, IWORK, INFO )
diff --git a/SRC/cgesv.f b/SRC/cgesv.f
index 1d0714e6..5e04976f 100644
--- a/SRC/cgesv.f
+++ b/SRC/cgesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGESV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -44,11 +44,10 @@
 *> where P is a permutation matrix, L is unit lower triangular, and U is
 *> upper triangular.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -107,10 +106,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgesvd.f b/SRC/cgesvd.f
index 9abb7632..c1158d67 100644
--- a/SRC/cgesvd.f
+++ b/SRC/cgesvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT,
 *                          WORK, LWORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGESVD computes the singular value decomposition (SVD) of a complex
 *> M-by-N matrix A, optionally computing the left and/or right singular
@@ -51,11 +51,10 @@
 *> U and V are the left and right singular vectors of A.
 *>
 *> Note that the routine returns V**H, not V.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -198,10 +197,9 @@
 *>                did not converge to zero. See the description of RWORK
 *>                above for details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgesvx.f b/SRC/cgesvx.f
index 17dc4ade..37c5e9ec 100644
--- a/SRC/cgesvx.f
+++ b/SRC/cgesvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                          EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGESVX uses the LU factorization to compute the solution to a complex
 *> system of linear equations
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -87,11 +90,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -330,10 +332,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 
diff --git a/SRC/cgesvxx.f b/SRC/cgesvxx.f
index 543a52c5..a349f372 100644
--- a/SRC/cgesvxx.f
+++ b/SRC/cgesvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CGESVXX uses the LU factorization to compute the solution to a
 *>    complex system of linear equations  A * X = B,  where A is an
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what CGESVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -109,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -523,10 +523,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgetc2.f b/SRC/cgetc2.f
index d9bf6a01..85230e41 100644
--- a/SRC/cgetc2.f
+++ b/SRC/cgetc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETC2( N, A, LDA, IPIV, JPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGETC2 computes an LU factorization, using complete pivoting, of the
 *> n-by-n matrix A. The factorization has the form A = P * L * U * Q,
@@ -40,11 +40,10 @@
 *> unit diagonal elements and U is upper triangular.
 *>
 *> This is a level 1 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>                one tries to solve for x in Ax = b. So U is perturbed
 *>                to avoid the overflow.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,18 +102,12 @@
 *
 *> \ingroup complexGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CGETC2( N, A, LDA, IPIV, JPIV, INFO )
 *
diff --git a/SRC/cgetf2.f b/SRC/cgetf2.f
index bd9f20aa..8d5e12c1 100644
--- a/SRC/cgetf2.f
+++ b/SRC/cgetf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETF2( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGETF2 computes an LU factorization of a general m-by-n matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgetrf.f b/SRC/cgetrf.f
index 95addd44..21f01a01 100644
--- a/SRC/cgetrf.f
+++ b/SRC/cgetrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGETRF computes an LU factorization of a general M-by-N matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgetri.f b/SRC/cgetri.f
index feb3a381..c316486e 100644
--- a/SRC/cgetri.f
+++ b/SRC/cgetri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -28,22 +28,21 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGETRI computes the inverse of a matrix using the LU factorization
 *> computed by CGETRF.
 *>
 *> This method inverts U and then computes inv(A) by solving the system
 *> inv(A)*L = inv(U) for inv(A).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0:  if INFO = i, U(i,i) is exactly zero; the matrix is
 *>                singular and its inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgetrs.f b/SRC/cgetrs.f
index 433c5bdb..0e676b45 100644
--- a/SRC/cgetrs.f
+++ b/SRC/cgetrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGETRS solves a system of linear equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B
 *> with a general N-by-N matrix A using the LU factorization computed
 *> by CGETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cggbak.f b/SRC/cggbak.f
index f561c60f..c129f1bc 100644
--- a/SRC/cggbak.f
+++ b/SRC/cggbak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V,
 *                          LDV, INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX            V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGBAK forms the right or left eigenvectors of a complex generalized
 *> eigenvalue problem A*x = lambda*B*x, by backward transformation on
 *> the computed eigenvectors of the balanced pair of matrices output by
 *> CGGBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -123,10 +122,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -137,15 +135,13 @@
 *
 *> \ingroup complexGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. Ward, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cggbal.f b/SRC/cggbal.f
index 41c4910a..e8434330 100644
--- a/SRC/cggbal.f
+++ b/SRC/cggbal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE,
 *                          RSCALE, WORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGBAL balances a pair of general complex matrices (A,B).  This
 *> involves, first, permuting A and B by similarity transformations to
@@ -46,11 +46,10 @@
 *> Balancing may reduce the 1-norm of the matrices, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors in the
 *> generalized eigenvalue problem A*x = lambda*B*x.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -166,15 +164,13 @@
 *
 *> \ingroup complexGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. WARD, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgges.f b/SRC/cgges.f
index 723c61fd..27fd606c 100644
--- a/SRC/cgges.f
+++ b/SRC/cgges.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB,
 *                         SDIM, ALPHA, BETA, VSL, LDVSL, VSR, LDVSR, WORK,
@@ -38,11 +38,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGES computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, the generalized complex Schur
@@ -70,11 +70,10 @@
 *> A pair of matrices (S,T) is in generalized complex Schur form if S
 *> and T are upper triangular and, in addition, the diagonal elements
 *> of T are non-negative real numbers.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -253,10 +252,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering falied in CTGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cggesx.f b/SRC/cggesx.f
index d2073a19..b5fa8e31 100644
--- a/SRC/cggesx.f
+++ b/SRC/cggesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA,
 *                          B, LDB, SDIM, ALPHA, BETA, VSL, LDVSL, VSR,
@@ -41,11 +41,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGESX computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, the complex Schur form (S,T),
@@ -74,11 +74,10 @@
 *> A pair of matrices (S,T) is in generalized complex Schur form if T is
 *> upper triangular with non-negative diagonal and S is upper
 *> triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -312,10 +311,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering failed in CTGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cggev.f b/SRC/cggev.f
index 69cb6fc2..1d6619f0 100644
--- a/SRC/cggev.f
+++ b/SRC/cggev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA,
 *                         VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGEV computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, and optionally, the left and/or
@@ -59,11 +59,10 @@
 *>              u(j)**H * A = lambda(j) * u(j)**H * B
 *>
 *> where u(j)**H is the conjugate-transpose of u(j).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -201,10 +200,9 @@
 *>          > N:  =N+1: other then QZ iteration failed in SHGEQZ,
 *>                =N+2: error return from STGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cggevx.f b/SRC/cggevx.f
index 011ff1f6..85bc8553 100644
--- a/SRC/cggevx.f
+++ b/SRC/cggevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB,
 *                          ALPHA, BETA, VL, LDVL, VR, LDVR, ILO, IHI,
@@ -38,11 +38,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGEVX computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B) the generalized eigenvalues, and optionally, the left and/or
@@ -68,11 +68,10 @@
 *>                  u(j)**H * A  = lambda(j) * u(j)**H * B.
 *> where u(j)**H is the conjugate-transpose of u(j).
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -327,10 +326,9 @@
 *>          > N:  =N+1: other than QZ iteration failed in CHGEQZ.
 *>                =N+2: error return from CTGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -341,10 +339,9 @@
 *
 *> \ingroup complexGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing a matrix pair (A,B) includes, first, permuting rows and
@@ -369,7 +366,6 @@
 *>
 *>  For further explanation of the reciprocal condition numbers RCONDE
 *>  and RCONDV, see section 4.11 of LAPACK User's Guide.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cggglm.f b/SRC/cggglm.f
index 16d74fc3..09175da4 100644
--- a/SRC/cggglm.f
+++ b/SRC/cggglm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGGLM solves a general Gauss-Markov linear model (GLM) problem:
 *>
@@ -61,11 +61,10 @@
 *>                  x
 *>
 *> where inv(B) denotes the inverse of B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -169,10 +168,9 @@
 *>                rank( A B ) < N; the least squares solution could not
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgghrd.f b/SRC/cgghrd.f
index 46c6b285..cb98fef2 100644
--- a/SRC/cgghrd.f
+++ b/SRC/cgghrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q,
 *                          LDQ, Z, LDZ, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGHRD reduces a pair of complex matrices (A,B) to generalized upper
 *> Hessenberg form using unitary transformations, where A is a
@@ -61,11 +61,10 @@
 *> If Q1 is the unitary matrix from the QR factorization of B in the
 *> original equation A*x = lambda*B*x, then CGGHRD reduces the original
 *> problem to generalized Hessenberg form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -178,10 +177,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -192,16 +190,14 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine reduces A to Hessenberg and B to triangular form by
 *>  an unblocked reduction, as described in _Matrix_Computations_,
 *>  by Golub and van Loan (Johns Hopkins Press).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cgglse.f b/SRC/cgglse.f
index 4a62fd4d..cfef336a 100644
--- a/SRC/cgglse.f
+++ b/SRC/cgglse.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGLSE solves the linear equality-constrained least squares (LSE)
 *> problem:
@@ -52,11 +52,10 @@
 *> matrices (B, A) given by
 *>
 *>    B = (0 R)*Q,   A = Z*T*Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>                    ( (B) )
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cggqrf.f b/SRC/cggqrf.f
index 34b7f77b..59b9ce9f 100644
--- a/SRC/cggqrf.f
+++ b/SRC/cggqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGQRF computes a generalized QR factorization of an N-by-M matrix A
 *> and an N-by-P matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z' denotes the
 *> conjugate transpose of matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -165,10 +164,9 @@
 *>           = 0:  successful exit
 *>           < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,10 +177,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -212,7 +209,6 @@
 *>  B(n-k+i,1:p-k+i-1), and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine CUNGRQ.
 *>  To use Z to update another matrix, use LAPACK subroutine CUNMRQ.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cggrqf.f b/SRC/cggrqf.f
index a9309301..6b8eabbe 100644
--- a/SRC/cggrqf.f
+++ b/SRC/cggrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGRQF computes a generalized RQ factorization of an M-by-N matrix A
 *> and a P-by-N matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z**H denotes the
 *> conjugate transpose of the matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO=-i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -178,10 +176,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -211,7 +208,6 @@
 *>  and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine CUNGQR.
 *>  To use Z to update another matrix, use LAPACK subroutine CUNMQR.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cggsvd.f b/SRC/cggsvd.f
index 2280d3fc..962fa05b 100644
--- a/SRC/cggsvd.f
+++ b/SRC/cggsvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
 *                          LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
@@ -33,11 +33,11 @@
 *      $                   U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGSVD computes the generalized singular value decomposition (GSVD)
 *> of an M-by-N complex matrix A and P-by-N complex matrix B:
@@ -117,11 +117,10 @@
 *>
 *>                       X = Q*(  I   0    )
 *>                             (  0 inv(R) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -298,10 +297,12 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, the Jacobi-type procedure failed to
 *>                converge.  For further details, see subroutine CTGSJA.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLA    REAL
 *>  TOLB    REAL
 *>          TOLA and TOLB are the thresholds to determine the effective
@@ -311,10 +312,9 @@
 *>          The size of TOLA and TOLB may affect the size of backward
 *>          errors of the decomposition.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -325,18 +325,12 @@
 *
 *> \ingroup complexOTHERsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  2-96 Based on modifications by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
      $                   LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
diff --git a/SRC/cggsvp.f b/SRC/cggsvp.f
index dd98adc1..3ab5fa8f 100644
--- a/SRC/cggsvp.f
+++ b/SRC/cggsvp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB,
 *                          TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ,
@@ -34,11 +34,11 @@
 *      $                   TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGGSVP computes unitary matrices U, V and Q such that
 *>
@@ -63,11 +63,10 @@
 *> This decomposition is the preprocessing step for computing the
 *> Generalized Singular Value Decomposition (GSVD), see subroutine
 *> CGGSVD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -236,10 +235,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -250,18 +248,13 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
 *>  The subroutine uses LAPACK subroutine CGEQPF for the QR factorization
 *>  with column pivoting to detect the effective numerical rank of the
 *>  a matrix. It may be replaced by a better rank determination strategy.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB,
      $                   TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ,
diff --git a/SRC/cgtcon.f b/SRC/cgtcon.f
index e07b048e..6319b376 100644
--- a/SRC/cgtcon.f
+++ b/SRC/cgtcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND,
 *                          WORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            D( * ), DL( * ), DU( * ), DU2( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGTCON estimates the reciprocal of the condition number of a complex
 *> tridiagonal matrix A using the LU factorization as computed by
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgtrfs.f b/SRC/cgtrfs.f
index de8ed77d..8addb1d2 100644
--- a/SRC/cgtrfs.f
+++ b/SRC/cgtrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK,
@@ -34,20 +34,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is tridiagonal, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -185,16 +184,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgtsv.f b/SRC/cgtsv.f
index 2556dff3..0454074f 100644
--- a/SRC/cgtsv.f
+++ b/SRC/cgtsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGTSV( N, NRHS, DL, D, DU, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            B( LDB, * ), D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGTSV  solves the equation
 *>
@@ -42,11 +42,10 @@
 *>
 *> Note that the equation  A**T *X = B  may be solved by interchanging the
 *> order of the arguments DU and DL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                has not been computed.  The factorization has not been
 *>                completed unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgtsvx.f b/SRC/cgtsvx.f
index 27667e1c..a3b2c77c 100644
--- a/SRC/cgtsvx.f
+++ b/SRC/cgtsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF,
 *                          DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGTSVX uses the LU factorization to compute the solution to a complex
 *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -72,11 +75,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
@@ -274,10 +276,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 
diff --git a/SRC/cgttrf.f b/SRC/cgttrf.f
index 17d40172..c3efc946 100644
--- a/SRC/cgttrf.f
+++ b/SRC/cgttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGTTRF( N, DL, D, DU, DU2, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGTTRF computes an LU factorization of a complex tridiagonal matrix A
 *> using elimination with partial pivoting and row interchanges.
@@ -42,11 +42,10 @@
 *> where L is a product of permutation and unit lower bidiagonal
 *> matrices and U is upper triangular with nonzeros in only the main
 *> diagonal and first two superdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgttrs.f b/SRC/cgttrs.f
index 2c015b0d..270a6363 100644
--- a/SRC/cgttrs.f
+++ b/SRC/cgttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX            B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGTTRS solves one of the systems of equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by CGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cgtts2.f b/SRC/cgtts2.f
index 1a68ef77..0c09aab9 100644
--- a/SRC/cgtts2.f
+++ b/SRC/cgtts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CGTTS2 solves one of the systems of equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by CGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITRANS
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chbev.f b/SRC/chbev.f
index 49c0a344..7b33521d 100644
--- a/SRC/chbev.f
+++ b/SRC/chbev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                         RWORK, INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX            AB( LDAB, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBEV computes all the eigenvalues and, optionally, eigenvectors of
 *> a complex Hermitian band matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -136,10 +135,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chbevd.f b/SRC/chbevd.f
index 42b1a565..3e4dc390 100644
--- a/SRC/chbevd.f
+++ b/SRC/chbevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                          LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AB( LDAB, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBEVD computes all the eigenvalues and, optionally, eigenvectors of
 *> a complex Hermitian band matrix A.  If eigenvectors are desired, it
@@ -47,11 +47,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -199,10 +198,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chbevx.f b/SRC/chbevx.f
index 74cc1b48..074ef010 100644
--- a/SRC/chbevx.f
+++ b/SRC/chbevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL,
 *                          VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK,
@@ -34,21 +34,20 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian band matrix A.  Eigenvalues and eigenvectors
 *> can be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -243,10 +242,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chbgst.f b/SRC/chbgst.f
index 7ca26620..ba6ce595 100644
--- a/SRC/chbgst.f
+++ b/SRC/chbgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X,
 *                          LDX, WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBGST reduces a complex Hermitian-definite banded generalized
 *> eigenproblem  A*x = lambda*B*x  to standard form  C*y = lambda*y,
@@ -45,11 +45,10 @@
 *> split Cholesky factorization. A is overwritten by C = X**H*A*X, where
 *> X = S**(-1)*Q and Q is a unitary matrix chosen to preserve the
 *> bandwidth of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -149,10 +148,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chbgv.f b/SRC/chbgv.f
index fcb39ee6..83462b36 100644
--- a/SRC/chbgv.f
+++ b/SRC/chbgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z,
 *                         LDZ, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite banded eigenproblem, of
 *> the form A*x=(lambda)*B*x. Here A and B are assumed to be Hermitian
 *> and banded, and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -167,10 +166,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chbgvd.f b/SRC/chbgvd.f
index 68eed18f..241b68d6 100644
--- a/SRC/chbgvd.f
+++ b/SRC/chbgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
 *                          Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK,
@@ -34,11 +34,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite banded eigenproblem, of
@@ -52,11 +52,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -230,10 +229,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -244,17 +242,11 @@
 *
 *> \ingroup complexOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
      $                   Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK,
diff --git a/SRC/chbgvx.f b/SRC/chbgvx.f
index 451ffc35..5942afdd 100644
--- a/SRC/chbgvx.f
+++ b/SRC/chbgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
 *                          LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBGVX computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite banded eigenproblem, of
@@ -47,11 +47,10 @@
 *> and banded, and B is also positive definite.  Eigenvalues and
 *> eigenvectors can be selected by specifying either all eigenvalues,
 *> a range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -269,10 +268,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -283,17 +281,11 @@
 *
 *> \ingroup complexOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
      $                   LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
diff --git a/SRC/chbtrd.f b/SRC/chbtrd.f
index 1e2ec2d8..a6f31262 100644
--- a/SRC/chbtrd.f
+++ b/SRC/chbtrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ,
 *                          WORK, INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX            AB( LDAB, * ), Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHBTRD reduces a complex Hermitian band matrix A to real symmetric
 *> tridiagonal form T by a unitary similarity transformation:
 *> Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -139,10 +138,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -153,14 +151,12 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by Linda Kaufman, Bell Labs.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/checon.f b/SRC/checon.f
index 36120617..f0b60132 100644
--- a/SRC/checon.f
+++ b/SRC/checon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHECON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHECON estimates the reciprocal of the condition number of a complex
 *> Hermitian matrix A using the factorization A = U*D*U**H or
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cheequb.f b/SRC/cheequb.f
index 9381436a..fc27ff4f 100644
--- a/SRC/cheequb.f
+++ b/SRC/cheequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       REAL               S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYEQUB computes row and column scalings intended to equilibrate a
 *> symmetric matrix A and reduce its condition number
@@ -44,11 +44,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cheev.f b/SRC/cheev.f
index fc702c1f..df93600c 100644
--- a/SRC/cheev.f
+++ b/SRC/cheev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
 *                         INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEEV computes all eigenvalues and, optionally, eigenvectors of a
 *> complex Hermitian matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cheevd.f b/SRC/cheevd.f
index 817ed7b6..0156e9ba 100644
--- a/SRC/cheevd.f
+++ b/SRC/cheevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
 *                          LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEEVD computes all eigenvalues and, optionally, eigenvectors of a
 *> complex Hermitian matrix A.  If eigenvectors are desired, it uses a
@@ -47,11 +47,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -178,10 +177,9 @@
 *>                lying in rows and columns INFO/(N+1) through
 *>                mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -192,18 +190,16 @@
 *
 *> \ingroup complexHEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
+*> \par Further Details:
+*  =====================
 *>
 *>  Modified description of INFO. Sven, 16 Feb 05.
-*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
 *>
 *  =====================================================================
       SUBROUTINE CHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
diff --git a/SRC/cheevr.f b/SRC/cheevr.f
index 64b2513a..b78403f4 100644
--- a/SRC/cheevr.f
+++ b/SRC/cheevr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK,
@@ -34,11 +34,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEEVR computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian matrix A.  Eigenvalues and eigenvectors can
@@ -97,11 +97,10 @@
 *> hence may abort due to a floating point exception in environments
 *> which do not handle NaNs and infinities in the ieee standard default
 *> manner.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -321,10 +320,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  Internal error
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -335,21 +333,15 @@
 *
 *> \ingroup complexHEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
+*>     Inderjit Dhillon, IBM Almaden, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
 *>     Ken Stanley, Computer Science Division, University of
-*>       California at Berkeley, USA
+*>       California at Berkeley, USA \n
 *>     Jason Riedy, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>
-*> \endverbatim
+*>       California at Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE CHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
diff --git a/SRC/cheevx.f b/SRC/cheevx.f
index f2d41f68..9c404e67 100644
--- a/SRC/cheevx.f
+++ b/SRC/cheevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, LWORK, RWORK,
@@ -33,21 +33,20 @@
 *       COMPLEX            A( LDA, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian matrix A.  Eigenvalues and eigenvectors can
 *> be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -235,10 +234,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chegs2.f b/SRC/chegs2.f
index dd09df1c..c7ad1f6a 100644
--- a/SRC/chegs2.f
+++ b/SRC/chegs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEGS2 reduces a complex Hermitian-definite generalized
 *> eigenproblem to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H *A*L.
 *>
 *> B must have been previously factorized as U**H *U or L*L**H by ZPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chegst.f b/SRC/chegst.f
index 400252f5..be0f6084 100644
--- a/SRC/chegst.f
+++ b/SRC/chegst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEGST reduces a complex Hermitian-definite generalized
 *> eigenproblem to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L.
 *>
 *> B must have been previously factorized as U**H*U or L*L**H by CPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chegv.f b/SRC/chegv.f
index 4c5dbeb2..723a6518 100644
--- a/SRC/chegv.f
+++ b/SRC/chegv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                         LWORK, RWORK, INFO )
@@ -30,22 +30,21 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be Hermitian and B is also
 *> positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -165,10 +164,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chegvd.f b/SRC/chegvd.f
index 88e9de1a..ff2c86b5 100644
--- a/SRC/chegvd.f
+++ b/SRC/chegvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                          LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -49,11 +49,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -217,10 +216,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -231,20 +229,21 @@
 *
 *> \ingroup complexHEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  Based on contributions by
-*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
+*> \verbatim
 *>
 *>  Modified so that no backsubstitution is performed if CHEEVD fails to
 *>  converge (NEIG in old code could be greater than N causing out of
 *>  bounds reference to A - reported by Ralf Meyer).  Also corrected the
 *>  description of INFO and the test on ITYPE. Sven, 16 Feb 05.
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
 *>
 *  =====================================================================
       SUBROUTINE CHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
diff --git a/SRC/chegvx.f b/SRC/chegvx.f
index ca395bc4..aaaaf808 100644
--- a/SRC/chegvx.f
+++ b/SRC/chegvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
 *                          VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
@@ -34,11 +34,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHEGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -46,11 +46,10 @@
 *> B are assumed to be Hermitian and B is also positive definite.
 *> Eigenvalues and eigenvectors can be selected by specifying either a
 *> range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -276,10 +275,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -290,17 +288,11 @@
 *
 *> \ingroup complexHEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
      $                   VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
diff --git a/SRC/cherfs.f b/SRC/cherfs.f
index 38afe80b..a4c58288 100644
--- a/SRC/cherfs.f
+++ b/SRC/cherfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHERFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -32,20 +32,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHERFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian indefinite, and
 *> provides error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -168,16 +167,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cherfsx.f b/SRC/cherfsx.f
index 33a58533..32c1112a 100644
--- a/SRC/cherfsx.f
+++ b/SRC/cherfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHERFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -37,13 +37,11 @@
 *      $                   ERR_BNDS_NORM( NRHS, * ),
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CHERFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is Hermitian indefinite, and
@@ -56,11 +54,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -385,10 +382,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chesv.f b/SRC/chesv.f
index ffc0a76a..35414e6e 100644
--- a/SRC/chesv.f
+++ b/SRC/chesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHESV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK,
 *                         LWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHESV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -48,11 +48,10 @@
 *> triangular matrices, and D is Hermitian and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.  The factored form of A is then
 *> used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chesvx.f b/SRC/chesvx.f
index cf38ff88..bbbf81dc 100644
--- a/SRC/chesvx.f
+++ b/SRC/chesvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHESVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B,
 *                          LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHESVX uses the diagonal pivoting factorization to compute the
 *> solution to a complex system of linear equations A * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -74,11 +77,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
@@ -265,10 +267,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 
diff --git a/SRC/chesvxx.f b/SRC/chesvxx.f
index 9c6ac832..b0e83ddc 100644
--- a/SRC/chesvxx.f
+++ b/SRC/chesvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHESVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,11 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CHESVXX uses the diagonal pivoting factorization to compute the
 *>    solution to a complex system of linear equations A * X = B, where
@@ -63,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what CHESVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -106,11 +109,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(R) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -488,10 +490,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cheswapr.f b/SRC/cheswapr.f
index bb4a17f3..efebddcb 100644
--- a/SRC/cheswapr.f
+++ b/SRC/cheswapr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHESWAPR( UPLO, N, A, LDA, I1, I2)
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       COMPLEX          A( LDA, N )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHESWAPR applies an elementary permutation on the rows and the columns of
 *> a hermitian matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          I2 is INTEGER
 *>          Index of the second row to swap
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chetd2.f b/SRC/chetd2.f
index ccb78674..f3af224c 100644
--- a/SRC/chetd2.f
+++ b/SRC/chetd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETD2( UPLO, N, A, LDA, D, E, TAU, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETD2 reduces a complex Hermitian matrix A to real symmetric
 *> tridiagonal form T by a unitary similarity transformation:
 *> Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -128,10 +126,9 @@
 *
 *> \ingroup complexHEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -173,7 +170,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chetf2.f b/SRC/chetf2.f
index 76d62511..d0d43928 100644
--- a/SRC/chetf2.f
+++ b/SRC/chetf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETF2( UPLO, N, A, LDA, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETF2 computes the factorization of a complex Hermitian matrix A
 *> using the Bunch-Kaufman diagonal pivoting method:
@@ -45,11 +45,10 @@
 *> Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -110,10 +109,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -124,10 +122,9 @@
 *
 *> \ingroup complexHEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  09-29-06 - patch from
@@ -175,7 +172,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chetrd.f b/SRC/chetrd.f
index 0c1927f6..2734b9d9 100644
--- a/SRC/chetrd.f
+++ b/SRC/chetrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETRD reduces a complex Hermitian matrix A to real symmetric
 *> tridiagonal form T by a unitary similarity transformation:
 *> Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -145,10 +143,9 @@
 *
 *> \ingroup complexHEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -190,7 +187,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chetrf.f b/SRC/chetrf.f
index 7f14b7d6..5732d490 100644
--- a/SRC/chetrf.f
+++ b/SRC/chetrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETRF computes the factorization of a complex Hermitian matrix A
 *> using the Bunch-Kaufman diagonal pivoting method.  The form of the
@@ -46,11 +46,10 @@
 *> 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -122,10 +121,9 @@
 *>                exactly singular, and division by zero will occur if it
 *>                is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,10 +134,9 @@
 *
 *> \ingroup complexHEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**H, where
@@ -175,7 +172,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chetri.f b/SRC/chetri.f
index 4c916ce7..4b9981bf 100644
--- a/SRC/chetri.f
+++ b/SRC/chetri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETRI( UPLO, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETRI computes the inverse of a complex Hermitian indefinite matrix
 *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by
 *> CHETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chetri2.f b/SRC/chetri2.f
index 02fd41c3..ad1ce7e3 100644
--- a/SRC/chetri2.f
+++ b/SRC/chetri2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETRI2 computes the inverse of a COMPLEX hermitian indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> CHETRF. CHETRI2 set the LEADING DIMENSION of the workspace
 *> before calling CHETRI2X that actually computes the inverse.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chetri2x.f b/SRC/chetri2x.f
index a065a6b5..58e8ea39 100644
--- a/SRC/chetri2x.f
+++ b/SRC/chetri2x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), WORK( N+NB+1,* )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETRI2X computes the inverse of a complex Hermitian indefinite matrix
 *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by
 *> CHETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chetrs.f b/SRC/chetrs.f
index 75d6ed97..0752cdcf 100644
--- a/SRC/chetrs.f
+++ b/SRC/chetrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETRS solves a system of linear equations A*X = B with a complex
 *> Hermitian matrix A using the factorization A = U*D*U**H or
 *> A = L*D*L**H computed by CHETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chetrs2.f b/SRC/chetrs2.f
index 1decf246..c8ab77ee 100644
--- a/SRC/chetrs2.f
+++ b/SRC/chetrs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHETRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, 
 *                           WORK, INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHETRS2 solves a system of linear equations A*X = B with a complex
 *> Hermitian matrix A using the factorization A = U*D*U**H or
 *> A = L*D*L**H computed by CHETRF and converted by CSYCONV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chfrk.f b/SRC/chfrk.f
index a289f828..45541623 100644
--- a/SRC/chfrk.f
+++ b/SRC/chfrk.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA,
 *                         C )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * ), C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for C in RFP Format.
 *>
@@ -49,11 +49,10 @@
 *> where alpha and beta are real scalars, C is an n--by--n Hermitian
 *> matrix and A is an n--by--k matrix in the first case and a k--by--n
 *> matrix in the second case.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -152,10 +151,9 @@
 *>           parts of the diagonal elements need not be set, they are
 *>           assumed to be zero, and on exit they are set to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chgeqz.f b/SRC/chgeqz.f
index 52cf95dd..95a8c3c6 100644
--- a/SRC/chgeqz.f
+++ b/SRC/chgeqz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT,
 *                          ALPHA, BETA, Q, LDQ, Z, LDZ, WORK, LWORK,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHGEQZ computes the eigenvalues of a complex matrix pair (H,T),
 *> where H is an upper Hessenberg matrix and T is upper triangular,
@@ -81,11 +81,10 @@
 *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix
 *>      Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973),
 *>      pp. 241--256.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -258,10 +257,9 @@
 *>                     in Schur form, but ALPHA(i) and BETA(i),
 *>                     i=INFO-N+1,...,N should be correct.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -272,15 +270,13 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We assume that complex ABS works as long as its value is less than
 *>  overflow.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chla_transtype.f b/SRC/chla_transtype.f
index b7073686..1f75a655 100644
--- a/SRC/chla_transtype.f
+++ b/SRC/chla_transtype.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       CHARACTER*1 FUNCTION CHLA_TRANSTYPE( TRANS )
 * 
@@ -24,11 +24,11 @@
 *       INTEGER            TRANS
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine translates from a BLAST-specified integer constant to
 *> the character string specifying a transposition operation.
@@ -37,15 +37,14 @@
 *> then input is not an integer indicating a transposition operator.
 *> Otherwise CHLA_TRANSTYPE returns the constant value corresponding to
 *> TRANS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpcon.f b/SRC/chpcon.f
index be5072b0..a9a2e2d1 100644
--- a/SRC/chpcon.f
+++ b/SRC/chpcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX            AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPCON estimates the reciprocal of the condition number of a complex
 *> Hermitian packed matrix A using the factorization A = U*D*U**H or
@@ -42,11 +42,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpev.f b/SRC/chpev.f
index 16d72408..b49aa5fa 100644
--- a/SRC/chpev.f
+++ b/SRC/chpev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, RWORK,
 *                         INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX            AP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPEV computes all the eigenvalues and, optionally, eigenvectors of a
 *> complex Hermitian matrix in packed storage.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -122,10 +121,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpevd.f b/SRC/chpevd.f
index e5b446fa..47161409 100644
--- a/SRC/chpevd.f
+++ b/SRC/chpevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK,
 *                          RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPEVD computes all the eigenvalues and, optionally, eigenvectors of
 *> a complex Hermitian matrix A in packed storage.  If eigenvectors are
@@ -47,11 +47,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -184,10 +183,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpevx.f b/SRC/chpevx.f
index 4634b340..fd05a136 100644
--- a/SRC/chpevx.f
+++ b/SRC/chpevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, RWORK, IWORK,
@@ -33,21 +33,20 @@
 *       COMPLEX            AP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian matrix A in packed storage.
 *> Eigenvalues/vectors can be selected by specifying either a range of
 *> values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -216,10 +215,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpgst.f b/SRC/chpgst.f
index 1368e71a..1ff14809 100644
--- a/SRC/chpgst.f
+++ b/SRC/chpgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPGST( ITYPE, UPLO, N, AP, BP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AP( * ), BP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPGST reduces a complex Hermitian-definite generalized
 *> eigenproblem to standard form, using packed storage.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L.
 *>
 *> B must have been previously factorized as U**H*U or L*L**H by CPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpgv.f b/SRC/chpgv.f
index faa9b782..642c689f 100644
--- a/SRC/chpgv.f
+++ b/SRC/chpgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                         RWORK, INFO )
@@ -30,22 +30,21 @@
 *       COMPLEX            AP( * ), BP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPGV computes all the eigenvalues and, optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be Hermitian, stored in packed format,
 *> and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -149,10 +148,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpgvd.f b/SRC/chpgvd.f
index b873f5a5..73f1eb65 100644
--- a/SRC/chpgvd.f
+++ b/SRC/chpgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                          LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AP( * ), BP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPGVD computes all the eigenvalues and, optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -50,11 +50,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -210,10 +209,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -224,17 +222,11 @@
 *
 *> \ingroup complexOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
      $                   LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/chpgvx.f b/SRC/chpgvx.f
index a1d0b904..7abed68f 100644
--- a/SRC/chpgvx.f
+++ b/SRC/chpgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
 *                          IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK,
@@ -33,11 +33,11 @@
 *       COMPLEX            AP( * ), BP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPGVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -46,11 +46,10 @@
 *> positive definite.  Eigenvalues and eigenvectors can be selected by
 *> specifying either a range of values or a range of indices for the
 *> desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -246,10 +245,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -260,17 +258,11 @@
 *
 *> \ingroup complexOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
      $                   IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK,
diff --git a/SRC/chprfs.f b/SRC/chprfs.f
index 863f6aee..08ce496b 100644
--- a/SRC/chprfs.f
+++ b/SRC/chprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -32,21 +32,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian indefinite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -156,16 +155,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chpsv.f b/SRC/chpsv.f
index 6f3ff6d7..181f2830 100644
--- a/SRC/chpsv.f
+++ b/SRC/chpsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -47,11 +47,10 @@
 *> triangular matrices, D is Hermitian and block diagonal with 1-by-1
 *> and 2-by-2 diagonal blocks.  The factored form of A is then used to
 *> solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, so the solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -160,7 +157,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chpsvx.f b/SRC/chpsvx.f
index 3fe0aea5..3b8d8570 100644
--- a/SRC/chpsvx.f
+++ b/SRC/chpsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X,
 *                          LDX, RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPSVX uses the diagonal pivoting factorization A = U*D*U**H or
 *> A = L*D*L**H to compute the solution to a complex system of linear
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -72,11 +75,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
@@ -238,10 +240,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 
@@ -252,10 +253,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -271,7 +271,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chptrd.f b/SRC/chptrd.f
index 32c57a26..e3b299e6 100644
--- a/SRC/chptrd.f
+++ b/SRC/chptrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPTRD( UPLO, N, AP, D, E, TAU, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPTRD reduces a complex Hermitian matrix A stored in packed form to
 *> real symmetric tridiagonal form T by a unitary similarity
 *> transformation: Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -104,10 +103,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -118,10 +116,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -149,7 +146,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP,
 *>  overwriting A(i+2:n,i), and tau is stored in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chptrf.f b/SRC/chptrf.f
index e78d98e6..d912a77c 100644
--- a/SRC/chptrf.f
+++ b/SRC/chptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPTRF( UPLO, N, AP, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPTRF computes the factorization of a complex Hermitian packed
 *> matrix A using the Bunch-Kaufman diagonal pivoting method:
@@ -43,11 +43,10 @@
 *> where U (or L) is a product of permutation and unit upper (lower)
 *> triangular matrices, and D is Hermitian and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,14 +111,10 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  5-96 - Based on modifications by J. Lewis, Boeing Computer Services
-*>         Company
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**H, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -155,8 +149,12 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>  J. Lewis, Boeing Computer Services Company
 *>
 *  =====================================================================
       SUBROUTINE CHPTRF( UPLO, N, AP, IPIV, INFO )
diff --git a/SRC/chptri.f b/SRC/chptri.f
index 69dbc560..680d6e2f 100644
--- a/SRC/chptri.f
+++ b/SRC/chptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPTRI( UPLO, N, AP, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPTRI computes the inverse of a complex Hermitian indefinite matrix
 *> A in packed storage using the factorization A = U*D*U**H or
 *> A = L*D*L**H computed by CHPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chptrs.f b/SRC/chptrs.f
index 79405afb..d2fa3f3e 100644
--- a/SRC/chptrs.f
+++ b/SRC/chptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHPTRS solves a system of linear equations A*X = B with a complex
 *> Hermitian matrix A stored in packed format using the factorization
 *> A = U*D*U**H or A = L*D*L**H computed by CHPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/chsein.f b/SRC/chsein.f
index b46e7cbf..c6de12aa 100644
--- a/SRC/chsein.f
+++ b/SRC/chsein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, W, VL,
 *                          LDVL, VR, LDVR, MM, M, WORK, RWORK, IFAILL,
@@ -34,11 +34,11 @@
 *      $                   W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CHSEIN uses inverse iteration to find specified right and/or left
 *> eigenvectors of a complex upper Hessenberg matrix H.
@@ -49,11 +49,10 @@
 *>              H * x = w * x,     y**h * H = w * y**h
 *>
 *> where y**h denotes the conjugate transpose of the vector y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -217,10 +216,9 @@
 *>                failed to converge; see IFAILL and IFAILR for further
 *>                details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -231,16 +229,14 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x|+|y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/chseqr.f b/SRC/chseqr.f
index b1e2423c..8acbb52c 100644
--- a/SRC/chseqr.f
+++ b/SRC/chseqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ,
 *                          WORK, LWORK, INFO )
@@ -28,13 +28,12 @@
 *       .. Array Arguments ..
 *       COMPLEX            H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
-*  Purpose
-*  =======
+*  
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CHSEQR computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -45,11 +44,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the unitary matrix Q:  A = Q*H*Q**H = (QZ)*H*(QZ)**H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -209,10 +207,9 @@
 *>                If INFO .GT. 0 and COMPZ = 'N', then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -223,6 +220,81 @@
 *
 *> \ingroup complexOTHERcomputational
 *
+*> \par Contributors:
+*  ==================
+*>
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
+*>
+*>             Default values supplied by
+*>             ILAENV(ISPEC,'CHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
+*>             It is suggested that these defaults be adjusted in order
+*>             to attain best performance in each particular
+*>             computational environment.
+*>
+*>            ISPEC=12: The CLAHQR vs CLAQR0 crossover point.
+*>                      Default: 75. (Must be at least 11.)
+*>
+*>            ISPEC=13: Recommended deflation window size.
+*>                      This depends on ILO, IHI and NS.  NS is the
+*>                      number of simultaneous shifts returned
+*>                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
+*>                      The default for (IHI-ILO+1).LE.500 is NS.
+*>                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
+*>
+*>            ISPEC=14: Nibble crossover point. (See IPARMQ for
+*>                      details.)  Default: 14% of deflation window
+*>                      size.
+*>
+*>            ISPEC=15: Number of simultaneous shifts in a multishift
+*>                      QR iteration.
+*>
+*>                      If IHI-ILO+1 is ...
+*>
+*>                      greater than      ...but less    ... the
+*>                      or equal to ...      than        default is
+*>
+*>                           1               30          NS =   2(+)
+*>                          30               60          NS =   4(+)
+*>                          60              150          NS =  10(+)
+*>                         150              590          NS =  **
+*>                         590             3000          NS =  64
+*>                        3000             6000          NS = 128
+*>                        6000             infinity      NS = 256
+*>
+*>                  (+)  By default some or all matrices of this order
+*>                       are passed to the implicit double shift routine
+*>                       CLAHQR and this parameter is ignored.  See
+*>                       ISPEC=12 above and comments in IPARMQ for
+*>                       details.
+*>
+*>                 (**)  The asterisks (**) indicate an ad-hoc
+*>                       function of N increasing from 10 to 64.
+*>
+*>            ISPEC=16: Select structured matrix multiply.
+*>                      If the number of simultaneous shifts (specified
+*>                      by ISPEC=15) is less than 14, then the default
+*>                      for ISPEC=16 is 0.  Otherwise the default for
+*>                      ISPEC=16 is 2.
+*> \endverbatim
+*
+*> \par References:
+*  ================
+*>
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
+*> \n
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
+*>       of Matrix Analysis, volume 23, pages 948--973, 2002.
+*
 *  =====================================================================
       SUBROUTINE CHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ,
      $                   WORK, LWORK, INFO )
@@ -239,75 +311,9 @@
 *     .. Array Arguments ..
       COMPLEX            H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * )
 *     ..
-*  ================================================================
-*             Default values supplied by
-*             ILAENV(ISPEC,'CHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
-*             It is suggested that these defaults be adjusted in order
-*             to attain best performance in each particular
-*             computational environment.
-*
-*            ISPEC=12: The CLAHQR vs CLAQR0 crossover point.
-*                      Default: 75. (Must be at least 11.)
-*
-*            ISPEC=13: Recommended deflation window size.
-*                      This depends on ILO, IHI and NS.  NS is the
-*                      number of simultaneous shifts returned
-*                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
-*                      The default for (IHI-ILO+1).LE.500 is NS.
-*                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
-*
-*            ISPEC=14: Nibble crossover point. (See IPARMQ for
-*                      details.)  Default: 14% of deflation window
-*                      size.
-*
-*            ISPEC=15: Number of simultaneous shifts in a multishift
-*                      QR iteration.
-*
-*                      If IHI-ILO+1 is ...
-*
-*                      greater than      ...but less    ... the
-*                      or equal to ...      than        default is
-*
-*                           1               30          NS =   2(+)
-*                          30               60          NS =   4(+)
-*                          60              150          NS =  10(+)
-*                         150              590          NS =  **
-*                         590             3000          NS =  64
-*                        3000             6000          NS = 128
-*                        6000             infinity      NS = 256
-*
-*                  (+)  By default some or all matrices of this order
-*                       are passed to the implicit double shift routine
-*                       CLAHQR and this parameter is ignored.  See
-*                       ISPEC=12 above and comments in IPARMQ for
-*                       details.
-*
-*                 (**)  The asterisks (**) indicate an ad-hoc
-*                       function of N increasing from 10 to 64.
-*
-*            ISPEC=16: Select structured matrix multiply.
-*                      If the number of simultaneous shifts (specified
-*                      by ISPEC=15) is less than 14, then the default
-*                      for ISPEC=16 is 0.  Otherwise the default for
-*                      ISPEC=16 is 2.
-*
-*  ================================================================
-*     Based on contributions by
-*        Karen Braman and Ralph Byers, Department of Mathematics,
-*        University of Kansas, USA
-*
-*  ================================================================
-*     References:
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
-*       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
-*       929--947, 2002.
-*
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
-*       of Matrix Analysis, volume 23, pages 948--973, 2002.
-*
-*  ================================================================
+*
+*  =====================================================================
+*
 *     .. Parameters ..
 *
 *     ==== Matrices of order NTINY or smaller must be processed by
diff --git a/SRC/cla_gbamv.f b/SRC/cla_gbamv.f
index 3a22bca6..2e452d95 100644
--- a/SRC/cla_gbamv.f
+++ b/SRC/cla_gbamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X,
 *                             INCX, BETA, Y, INCY )
@@ -30,11 +30,11 @@
 *       REAL               Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_GBAMV  performs one of the matrix-vector operations
 *>
@@ -52,11 +52,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -170,10 +169,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gbrcond_c.f b/SRC/cla_gbrcond_c.f
index 3453dc18..41a93c34 100644
--- a/SRC/cla_gbrcond_c.f
+++ b/SRC/cla_gbrcond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_GBRCOND_C( TRANS, N, KL, KU, AB, LDAB, AFB,
 *                                    LDAFB, IPIV, C, CAPPLY, INFO, WORK,
@@ -33,19 +33,18 @@
 *       REAL               C( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_GBRCOND_C Computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a REAL vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -144,10 +143,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gbrcond_x.f b/SRC/cla_gbrcond_x.f
index 1fc3a736..a8105e3b 100644
--- a/SRC/cla_gbrcond_x.f
+++ b/SRC/cla_gbrcond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_GBRCOND_X( TRANS, N, KL, KU, AB, LDAB, AFB,
 *                                    LDAFB, IPIV, X, INFO, WORK, RWORK )
@@ -32,19 +32,18 @@
 *       REAL               RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_GBRCOND_X Computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -137,10 +136,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gbrfsx_extended.f b/SRC/cla_gbrfsx_extended.f
index 71ece7c2..9ae69c24 100644
--- a/SRC/cla_gbrfsx_extended.f
+++ b/SRC/cla_gbrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_GBRFSX_EXTENDED ( PREC_TYPE, TRANS_TYPE, N, KL, KU,
 *                                       NRHS, AB, LDAB, AFB, LDAFB, IPIV,
@@ -41,11 +41,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_GBRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -391,10 +390,9 @@
 *>       < 0:  if INFO = -i, the ith argument to CGBTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gbrpvgrw.f b/SRC/cla_gbrpvgrw.f
index 00760da2..09c5f760 100644
--- a/SRC/cla_gbrpvgrw.f
+++ b/SRC/cla_gbrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_GBRPVGRW( N, KL, KU, NCOLS, AB, LDAB, AFB,
 *                                   LDAFB )
@@ -28,11 +28,11 @@
 *       COMPLEX            AB( LDAB, * ), AFB( LDAFB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_GBRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -40,11 +40,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          LDAFB is INTEGER
 *>     The leading dimension of the array AFB.  LDAFB >= 2*KL+KU+1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_geamv.f b/SRC/cla_geamv.f
index 09eb5b05..b78c0117 100644
--- a/SRC/cla_geamv.f
+++ b/SRC/cla_geamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA,
 *                              Y, INCY )
@@ -31,11 +31,11 @@
 *       REAL               Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_GEAMV  performs one of the matrix-vector operations
 *>
@@ -53,11 +53,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -159,10 +158,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gercond_c.f b/SRC/cla_gercond_c.f
index 3b14afd0..e789260b 100644
--- a/SRC/cla_gercond_c.f
+++ b/SRC/cla_gercond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_GERCOND_C( TRANS, N, A, LDA, AF, LDAF, IPIV, C,
 *                                    CAPPLY, INFO, WORK, RWORK )
@@ -32,19 +32,19 @@
 *       REAL               C( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *>    CLA_GERCOND_C computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a REAL vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -125,10 +125,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gercond_x.f b/SRC/cla_gercond_x.f
index c9b2b142..9eb75d50 100644
--- a/SRC/cla_gercond_x.f
+++ b/SRC/cla_gercond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_GERCOND_X( TRANS, N, A, LDA, AF, LDAF, IPIV, X,
 *                                    INFO, WORK, RWORK )
@@ -31,19 +31,19 @@
 *       REAL               RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *>    CLA_GERCOND_X computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -118,10 +118,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gerfsx_extended.f b/SRC/cla_gerfsx_extended.f
index 438b424f..c91914ca 100644
--- a/SRC/cla_gerfsx_extended.f
+++ b/SRC/cla_gerfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A,
 *                                       LDA, AF, LDAF, IPIV, COLEQU, C, B,
@@ -40,11 +40,12 @@
 *      $                   ERRS_N( NRHS, * ), ERRS_C( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> CLA_GERFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -55,11 +56,10 @@
 *> and ERRS_C for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERRS_N and ERRS_C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -376,10 +376,9 @@
 *>       < 0:  if INFO = -i, the ith argument to CGETRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_gerpvgrw.f b/SRC/cla_gerpvgrw.f
index a3427b73..fd8ee85d 100644
--- a/SRC/cla_gerpvgrw.f
+++ b/SRC/cla_gerpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_GERPVGRW( N, NCOLS, A, LDA, AF, LDAF )
 * 
@@ -27,11 +27,12 @@
 *       COMPLEX            A( LDA, * ), AF( LDAF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> CLA_GERPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -39,11 +40,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -82,10 +82,9 @@
 *>          LDAF is INTEGER
 *>     The leading dimension of the array AF.  LDAF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_heamv.f b/SRC/cla_heamv.f
index ea7acd0a..c33760c9 100644
--- a/SRC/cla_heamv.f
+++ b/SRC/cla_heamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_HEAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y,
 *                             INCY )
@@ -30,11 +30,11 @@
 *       REAL               Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_SYAMV  performs the matrix-vector operation
 *>
@@ -51,11 +51,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -146,10 +145,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -160,10 +158,9 @@
 *
 *> \ingroup complexHEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Level 2 Blas routine.
@@ -175,7 +172,6 @@
 *>     Richard Hanson, Sandia National Labs.
 *>  -- Modified for the absolute-value product, April 2006
 *>     Jason Riedy, UC Berkeley
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cla_hercond_c.f b/SRC/cla_hercond_c.f
index 612e7609..69867cc3 100644
--- a/SRC/cla_hercond_c.f
+++ b/SRC/cla_hercond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_HERCOND_C( UPLO, N, A, LDA, AF, LDAF, IPIV, C,
 *                                    CAPPLY, INFO, WORK, RWORK )
@@ -32,19 +32,18 @@
 *       REAL               C ( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_HERCOND_C computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a REAL vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_hercond_x.f b/SRC/cla_hercond_x.f
index a405309e..8f5bfaf1 100644
--- a/SRC/cla_hercond_x.f
+++ b/SRC/cla_hercond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_HERCOND_X( UPLO, N, A, LDA, AF, LDAF, IPIV, X,
 *                                    INFO, WORK, RWORK )
@@ -31,19 +31,18 @@
 *       REAL               RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_HERCOND_X computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_herfsx_extended.f b/SRC/cla_herfsx_extended.f
index 91f58993..bd6e31e9 100644
--- a/SRC/cla_herfsx_extended.f
+++ b/SRC/cla_herfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_HERFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, IPIV, COLEQU, C, B, LDB,
@@ -42,11 +42,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_HERFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -57,11 +57,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -377,10 +376,9 @@
 *>       < 0:  if INFO = -i, the ith argument to CHETRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_herpvgrw.f b/SRC/cla_herpvgrw.f
index b9d7d1d2..2cb38606 100644
--- a/SRC/cla_herpvgrw.f
+++ b/SRC/cla_herpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_HERPVGRW( UPLO, N, INFO, A, LDA, AF, LDAF, IPIV,
 *                                   WORK )
@@ -31,11 +31,12 @@
 *       REAL               WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> CLA_HERPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -43,11 +44,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +106,9 @@
 *> \verbatim
 *>          WORK is COMPLEX array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_lin_berr.f b/SRC/cla_lin_berr.f
index adf02814..90316a96 100644
--- a/SRC/cla_lin_berr.f
+++ b/SRC/cla_lin_berr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR )
 * 
@@ -28,22 +28,21 @@
 *       COMPLEX            RES( N, NRHS )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_LIN_BERR computes componentwise relative backward error from
 *>    the formula
 *>        max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) )
 *>    where abs(Z) is the componentwise absolute value of the matrix
 *>    or vector Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -86,10 +85,9 @@
 *>          BERR is COMPLEX array, dimension (NRHS)
 *>     The componentwise relative backward error from the formula above.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_porcond_c.f b/SRC/cla_porcond_c.f
index d9a64162..7a6f3237 100644
--- a/SRC/cla_porcond_c.f
+++ b/SRC/cla_porcond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_PORCOND_C( UPLO, N, A, LDA, AF, LDAF, C, CAPPLY,
 *                                    INFO, WORK, RWORK )
@@ -31,19 +31,18 @@
 *       REAL               C( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_PORCOND_C Computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_porcond_x.f b/SRC/cla_porcond_x.f
index f0043f50..af39edda 100644
--- a/SRC/cla_porcond_x.f
+++ b/SRC/cla_porcond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_PORCOND_X( UPLO, N, A, LDA, AF, LDAF, X, INFO,
 *                                    WORK, RWORK )
@@ -30,19 +30,18 @@
 *       REAL               RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_PORCOND_X Computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -107,10 +106,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_porfsx_extended.f b/SRC/cla_porfsx_extended.f
index ac8428c6..1e6d93bc 100644
--- a/SRC/cla_porfsx_extended.f
+++ b/SRC/cla_porfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, COLEQU, C, B, LDB, Y,
@@ -41,11 +41,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_PORFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -369,10 +368,9 @@
 *>       < 0:  if INFO = -i, the ith argument to CPOTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_porpvgrw.f b/SRC/cla_porpvgrw.f
index 156f8092..8d57ff6e 100644
--- a/SRC/cla_porpvgrw.f
+++ b/SRC/cla_porpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, LDAF, WORK )
 * 
@@ -29,11 +29,12 @@
 *       REAL               WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> CLA_PORPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -41,11 +42,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +89,9 @@
 *> \verbatim
 *>          WORK is COMPLEX array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_syamv.f b/SRC/cla_syamv.f
index c738954a..07f563ce 100644
--- a/SRC/cla_syamv.f
+++ b/SRC/cla_syamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y,
 *                             INCY )
@@ -31,11 +31,11 @@
 *       REAL               Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_SYAMV  performs the matrix-vector operation
 *>
@@ -52,11 +52,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -147,10 +146,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -161,10 +159,9 @@
 *
 *> \ingroup complexSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Level 2 Blas routine.
@@ -176,7 +173,6 @@
 *>     Richard Hanson, Sandia National Labs.
 *>  -- Modified for the absolute-value product, April 2006
 *>     Jason Riedy, UC Berkeley
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cla_syrcond_c.f b/SRC/cla_syrcond_c.f
index 1cb8dfc8..a73671e2 100644
--- a/SRC/cla_syrcond_c.f
+++ b/SRC/cla_syrcond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_SYRCOND_C( UPLO, N, A, LDA, AF, LDAF, IPIV, C,
 *                                    CAPPLY, INFO, WORK, RWORK )
@@ -32,19 +32,18 @@
 *       REAL               C( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_SYRCOND_C Computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a REAL vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_syrcond_x.f b/SRC/cla_syrcond_x.f
index 77691994..f3d6592e 100644
--- a/SRC/cla_syrcond_x.f
+++ b/SRC/cla_syrcond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_SYRCOND_X( UPLO, N, A, LDA, AF, LDAF, IPIV, X,
 *                                    INFO, WORK, RWORK )
@@ -31,19 +31,18 @@
 *       REAL               RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_SYRCOND_X Computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          RWORK is REAL array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_syrfsx_extended.f b/SRC/cla_syrfsx_extended.f
index 44a90b34..b60fcdac 100644
--- a/SRC/cla_syrfsx_extended.f
+++ b/SRC/cla_syrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, IPIV, COLEQU, C, B, LDB,
@@ -42,11 +42,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLA_SYRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -57,11 +57,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -377,10 +376,9 @@
 *>       < 0:  if INFO = -i, the ith argument to CSYTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_syrpvgrw.f b/SRC/cla_syrpvgrw.f
index 810348ff..2d3af6b9 100644
--- a/SRC/cla_syrpvgrw.f
+++ b/SRC/cla_syrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF, LDAF, IPIV,
 *                                   WORK )
@@ -31,11 +31,12 @@
 *       INTEGER            IPIV( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> CLA_SYRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -43,11 +44,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +106,9 @@
 *> \verbatim
 *>          WORK is COMPLEX array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cla_wwaddw.f b/SRC/cla_wwaddw.f
index b56caa11..32c89d14 100644
--- a/SRC/cla_wwaddw.f
+++ b/SRC/cla_wwaddw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLA_WWADDW( N, X, Y, W )
 * 
@@ -27,23 +27,20 @@
 *       COMPLEX            X( * ), Y( * ), W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLA_WWADDW adds a vector W into a doubled-single vector (X, Y).
 *>
 *>    This works for all extant IBM's hex and binary floating point
 *>    arithmetics, but not for decimal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -68,10 +65,9 @@
 *>          W is COMPLEX array, dimension (N)
 *>            The vector to be added.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clabrd.f b/SRC/clabrd.f
index a51c010e..3e7eed41 100644
--- a/SRC/clabrd.f
+++ b/SRC/clabrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y,
 *                          LDY )
@@ -30,11 +30,11 @@
 *      $                   Y( LDY, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLABRD reduces the first NB rows and columns of a complex general
 *> m by n matrix A to upper or lower real bidiagonal form by a unitary
@@ -45,11 +45,10 @@
 *> bidiagonal form.
 *>
 *> This is an auxiliary routine called by CGEBRD
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -149,10 +148,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -163,10 +161,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -209,7 +206,6 @@
 *>  where a denotes an element of the original matrix which is unchanged,
 *>  vi denotes an element of the vector defining H(i), and ui an element
 *>  of the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clacgv.f b/SRC/clacgv.f
index 7c7559ce..9485b502 100644
--- a/SRC/clacgv.f
+++ b/SRC/clacgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLACGV( N, X, INCX )
 * 
@@ -27,18 +27,17 @@
 *       COMPLEX            X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> CLACGV conjugates a complex vector of length N.
+*> \verbatim
 *>
-*>\endverbatim
+*> CLACGV conjugates a complex vector of length N.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -59,10 +58,9 @@
 *>          INCX is INTEGER
 *>          The spacing between successive elements of X.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clacn2.f b/SRC/clacn2.f
index 7c71088f..c39cd382 100644
--- a/SRC/clacn2.f
+++ b/SRC/clacn2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLACN2( N, V, X, EST, KASE, ISAVE )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX            V( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLACN2 estimates the 1-norm of a square, complex matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          ISAVE is INTEGER array, dimension (3)
 *>         ISAVE is used to save variables between calls to SLACN2
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,19 +100,13 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
-*>  Contributed by Nick Higham, University of Manchester.
 *>  Originally named CONEST, dated March 16, 1988.
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
-*>  a real or complex matrix, with applications to condition estimation",
-*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
-*>
 *>  Last modified:  April, 1999
 *>
 *>  This is a thread safe version of CLACON, which uses the array ISAVE
@@ -124,8 +116,19 @@
 *>      JUMP     ISAVE(1)
 *>      J        ISAVE(2)
 *>      ITER     ISAVE(3)
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Nick Higham, University of Manchester
+*
+*> \par References:
+*  ================
+*>
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  a real or complex matrix, with applications to condition estimation",
+*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
 *  =====================================================================
       SUBROUTINE CLACN2( N, V, X, EST, KASE, ISAVE )
diff --git a/SRC/clacon.f b/SRC/clacon.f
index acd2b34f..abefb227 100644
--- a/SRC/clacon.f
+++ b/SRC/clacon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLACON( N, V, X, EST, KASE )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            V( N ), X( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLACON estimates the 1-norm of a square, complex matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -81,10 +80,9 @@
 *>         whether X should be overwritten by A * X  or A**H * X.
 *>         On the final return from CLACON, KASE will again be 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -95,23 +93,24 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
+*> \par Further Details:
+*  =====================
+*>
+*>  Originally named CONEST, dated March 16, 1988. \n
+*>  Last modified:  April, 1999
 *
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Contributed by Nick Higham, University of Manchester.
-*>  Originally named CONEST, dated March 16, 1988.
+*>     Nick Higham, University of Manchester
+*
+*> \par References:
+*  ================
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
 *>  a real or complex matrix, with applications to condition estimation",
 *>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
-*>  Last modified:  April, 1999
-*>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CLACON( N, V, X, EST, KASE )
 *
diff --git a/SRC/clacp2.f b/SRC/clacp2.f
index f9c182fe..4f89c4ae 100644
--- a/SRC/clacp2.f
+++ b/SRC/clacp2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLACP2( UPLO, M, N, A, LDA, B, LDB )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX            B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLACP2 copies all or part of a real two-dimensional matrix A to a
 *> complex matrix B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clacpy.f b/SRC/clacpy.f
index f7469d15..af943bc0 100644
--- a/SRC/clacpy.f
+++ b/SRC/clacpy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLACPY( UPLO, M, N, A, LDA, B, LDB )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLACPY copies all or part of a two-dimensional matrix A to another
 *> matrix B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clacrm.f b/SRC/clacrm.f
index d0446105..ff82e3d5 100644
--- a/SRC/clacrm.f
+++ b/SRC/clacrm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLACRM( M, N, A, LDA, B, LDB, C, LDC, RWORK )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            A( LDA, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLACRM performs a very simple matrix-matrix multiplication:
 *>          C := A * B,
 *> where A is M by N and complex; B is N by N and real;
 *> C is M by N and complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *> \verbatim
 *>          RWORK is REAL array, dimension (2*M*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clacrt.f b/SRC/clacrt.f
index 4df167e3..d782c6f7 100644
--- a/SRC/clacrt.f
+++ b/SRC/clacrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLACRT( N, CX, INCX, CY, INCY, C, S )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            CX( * ), CY( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLACRT performs the operation
 *>
@@ -40,11 +40,10 @@
 *>    ( -s  c )( y )      ( y )
 *>
 *> where c and s are complex and the vectors x and y are complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>             [  C   S  ].
 *>             [ -S   C  ]
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cladiv.f b/SRC/cladiv.f
index 9af6cfcb..9ae257af 100644
--- a/SRC/cladiv.f
+++ b/SRC/cladiv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       COMPLEX FUNCTION CLADIV( X, Y )
 * 
@@ -24,20 +24,19 @@
 *       COMPLEX            X, Y
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLADIV := X / Y, where X and Y are complex.  The computation of X / Y
 *> will not overflow on an intermediary step unless the results
 *> overflows.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -49,10 +48,9 @@
 *>          Y is COMPLEX
 *>          The complex scalars X and Y.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claed0.f b/SRC/claed0.f
index c338d1c6..01cd9859 100644
--- a/SRC/claed0.f
+++ b/SRC/claed0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAED0( QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, RWORK,
 *                          IWORK, INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX            Q( LDQ, * ), QSTORE( LDQS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Using the divide and conquer method, CLAED0 computes all eigenvalues
 *> of a symmetric tridiagonal matrix which is one diagonal block of
 *> those from reducing a dense or band Hermitian matrix and
 *> corresponding eigenvectors of the dense or band matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] QSIZ
 *> \verbatim
@@ -129,10 +128,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claed7.f b/SRC/claed7.f
index 4c6bb807..45f9e36d 100644
--- a/SRC/claed7.f
+++ b/SRC/claed7.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAED7( N, CUTPNT, QSIZ, TLVLS, CURLVL, CURPBM, D, Q,
 *                          LDQ, RHO, INDXQ, QSTORE, QPTR, PRMPTR, PERM,
@@ -35,11 +35,11 @@
 *       COMPLEX            Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAED7 computes the updated eigensystem of a diagonal
 *> matrix after modification by a rank-one symmetric matrix. This
@@ -71,11 +71,10 @@
 *>       directly using the updated eigenvalues.  The eigenvectors for
 *>       the current problem are multiplied with the eigenvectors from
 *>       the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -231,10 +230,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claed8.f b/SRC/claed8.f
index 8ab605b8..636dca6d 100644
--- a/SRC/claed8.f
+++ b/SRC/claed8.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAED8( K, N, QSIZ, Q, LDQ, D, RHO, CUTPNT, Z, DLAMDA,
 *                          Q2, LDQ2, W, INDXP, INDX, INDXQ, PERM, GIVPTR,
@@ -34,11 +34,11 @@
 *       COMPLEX            Q( LDQ, * ), Q2( LDQ2, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAED8 merges the two sets of eigenvalues together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -46,11 +46,10 @@
 *> eigenvalues are close together or if there is a tiny element in the
 *> Z vector.  For each such occurrence the order of the related secular
 *> equation problem is reduced by one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[out] K
 *> \verbatim
@@ -211,10 +210,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claein.f b/SRC/claein.f
index df1d0145..a7c6e8f6 100644
--- a/SRC/claein.f
+++ b/SRC/claein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAEIN( RIGHTV, NOINIT, N, H, LDH, W, V, B, LDB, RWORK,
 *                          EPS3, SMLNUM, INFO )
@@ -32,20 +32,19 @@
 *       COMPLEX            B( LDB, * ), H( LDH, * ), V( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAEIN uses inverse iteration to find a right or left eigenvector
 *> corresponding to the eigenvalue W of a complex upper Hessenberg
 *> matrix H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RIGHTV
 *> \verbatim
@@ -133,10 +132,9 @@
 *>          = 1:  inverse iteration did not converge; V is set to the
 *>                last iterate.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claesy.f b/SRC/claesy.f
index ea02a943..900939cd 100644
--- a/SRC/claesy.f
+++ b/SRC/claesy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAESY( A, B, C, RT1, RT2, EVSCAL, CS1, SN1 )
 * 
@@ -24,11 +24,11 @@
 *       COMPLEX            A, B, C, CS1, EVSCAL, RT1, RT2, SN1
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAESY computes the eigendecomposition of a 2-by-2 symmetric matrix
 *>    ( ( A, B );( B, C ) )
@@ -41,11 +41,10 @@
 *>
 *> [  CS1     SN1   ] . [ A  B ] . [ CS1    -SN1   ] = [ RT1  0  ]
 *> [ -SN1     CS1   ]   [ B  C ]   [ SN1     CS1   ]   [  0  RT2 ]
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          If EVSCAL .NE. 0,  ( CS1, SN1 ) is the unit right eigenvector
 *>          for RT1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claev2.f b/SRC/claev2.f
index 16359b81..586f8526 100644
--- a/SRC/claev2.f
+++ b/SRC/claev2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAEV2( A, B, C, RT1, RT2, CS1, SN1 )
 * 
@@ -25,11 +25,11 @@
 *       COMPLEX            A, B, C, SN1
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAEV2 computes the eigendecomposition of a 2-by-2 Hermitian matrix
 *>    [  A         B  ]
@@ -40,11 +40,10 @@
 *>
 *> [ CS1  CONJG(SN1) ] [    A     B ] [ CS1 -CONJG(SN1) ] = [ RT1  0  ]
 *> [-SN1     CS1     ] [ CONJG(B) C ] [ SN1     CS1     ]   [  0  RT2 ].
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          SN1 is COMPLEX
 *>         The vector (CS1, SN1) is a unit right eigenvector for RT1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,10 +99,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  RT1 is accurate to a few ulps barring over/underflow.
@@ -119,7 +116,6 @@
 *>  Overflow is possible only if RT1 is within a factor of 5 of overflow.
 *>  Underflow is harmless if the input data is 0 or exceeds
 *>     underflow_threshold / macheps.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clag2z.f b/SRC/clag2z.f
index 8fdc9abf..74733d70 100644
--- a/SRC/clag2z.f
+++ b/SRC/clag2z.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAG2Z( M, N, SA, LDSA, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAG2Z converts a COMPLEX matrix, SA, to a COMPLEX*16 matrix, A.
 *>
@@ -41,11 +41,10 @@
 *> converting from single to double.
 *>
 *> This is an auxiliary routine so there is no argument checking.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clags2.f b/SRC/clags2.f
index 1d840fb8..84a1d4af 100644
--- a/SRC/clags2.f
+++ b/SRC/clags2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV,
 *                          SNV, CSQ, SNQ )
@@ -27,11 +27,11 @@
 *       COMPLEX            A2, B2, SNQ, SNU, SNV
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAGS2 computes 2-by-2 unitary matrices U, V and Q, such
 *> that if ( UPPER ) then
@@ -63,11 +63,10 @@
 *> then the transformed (2,2) element of B is not zero, except when the
 *> first rows of input A and B are parallel and the second rows are
 *> zero.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPPER
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          SNQ is COMPLEX
 *>          The desired unitary matrix Q.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clagtm.f b/SRC/clagtm.f
index ea0bf48e..6b010e48 100644
--- a/SRC/clagtm.f
+++ b/SRC/clagtm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA,
 *                          B, LDB )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAGTM performs a matrix-vector product of the form
 *>
@@ -44,11 +44,10 @@
 *> where A is a tridiagonal matrix of order N, B and X are N by NRHS
 *> matrices, and alpha and beta are real scalars, each of which may be
 *> 0., 1., or -1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -129,10 +128,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(N,1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clahef.f b/SRC/clahef.f
index 34c4bcaf..7acfdfa8 100644
--- a/SRC/clahef.f
+++ b/SRC/clahef.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAHEF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAHEF computes a partial factorization of a complex Hermitian
 *> matrix A using the Bunch-Kaufman diagonal pivoting method. The
@@ -52,11 +52,10 @@
 *> CLAHEF is an auxiliary routine called by CHETRF. It uses blocked code
 *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or
 *> A22 (if UPLO = 'L').
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -142,10 +141,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clahqr.f b/SRC/clahqr.f
index 8e32a189..141f16bd 100644
--- a/SRC/clahqr.f
+++ b/SRC/clahqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
 *                          IHIZ, Z, LDZ, INFO )
@@ -29,23 +29,20 @@
 *       COMPLEX            H( LDH, * ), W( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLAHQR is an auxiliary routine called by CHSEQR to update the
 *>    eigenvalues and Schur decomposition already computed by CHSEQR, by
 *>    dealing with the Hessenberg submatrix in rows and columns ILO to
 *>    IHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -165,10 +162,9 @@
 *>                  where U is the orthogonal matrix in (*)
 *>                  (regardless of the value of WANTT.)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,10 +175,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Contributors:
+*  ==================
+*>
 *> \verbatim
 *>
 *>     02-96 Based on modifications by
@@ -194,7 +189,6 @@
 *>     It is (1) more robust against overflow and underflow and
 *>     (2) adopts the more conservative Ahues & Tisseur stopping
 *>     criterion (LAWN 122, 1997).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clahr2.f b/SRC/clahr2.f
index 28e0bc11..2e48fbf3 100644
--- a/SRC/clahr2.f
+++ b/SRC/clahr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAHR2 reduces the first NB columns of A complex general n-BY-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -41,11 +41,10 @@
 *> Q as a block reflector I - V*T*v**H, and also the matrix Y = A * V * T.
 *>
 *> This is an auxiliary routine called by CGEHRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -129,10 +127,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -172,16 +169,15 @@
 *>  Gejin. Note that the entries of A(1:K,2:NB) differ from those
 *>  returned by the original LAPACK-3.0's DLAHRD routine. (This
 *>  subroutine is not backward compatible with LAPACK-3.0's DLAHRD.)
-*>
-*>  References
-*>  ==========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  Gregorio Quintana-Orti and Robert van de Geijn, "Improving the
 *>  performance of reduction to Hessenberg form," ACM Transactions on
 *>  Mathematical Software, 32(2):180-194, June 2006.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 *
diff --git a/SRC/clahrd.f b/SRC/clahrd.f
index 5372cd2f..8d5fda84 100644
--- a/SRC/clahrd.f
+++ b/SRC/clahrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAHRD reduces the first NB columns of a complex general n-by-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -43,11 +43,10 @@
 *> This is an OBSOLETE auxiliary routine. 
 *> This routine will be 'deprecated' in a  future release.
 *> Please use the new routine CLAHR2 instead.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -130,10 +128,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -167,7 +164,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/claic1.f b/SRC/claic1.f
index 6567452f..29f307d3 100644
--- a/SRC/claic1.f
+++ b/SRC/claic1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            W( J ), X( J )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAIC1 applies one step of incremental condition estimation in
 *> its simplest version:
@@ -60,11 +60,10 @@
 *>                                           [ conjg(gamma) ]
 *>
 *> where  alpha =  x**H*w.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -120,10 +119,9 @@
 *>          C is COMPLEX
 *>          Cosine needed in forming xhat.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clals0.f b/SRC/clals0.f
index 3bc79e3f..ca6ce179 100644
--- a/SRC/clals0.f
+++ b/SRC/clals0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
 *                          PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
@@ -35,11 +35,11 @@
 *       COMPLEX            B( LDB, * ), BX( LDBX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLALS0 applies back the multiplying factors of either the left or the
 *> right singular vector matrix of a diagonal matrix appended by a row
@@ -70,11 +70,10 @@
 *> (3R) The inverse transformation of (2L).
 *>
 *> (4R) The inverse transformation of (1L).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -246,10 +245,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -260,19 +258,13 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE CLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
      $                   PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
diff --git a/SRC/clalsa.f b/SRC/clalsa.f
index 6065fe14..e76ef4f1 100644
--- a/SRC/clalsa.f
+++ b/SRC/clalsa.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
 *                          LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
@@ -36,11 +36,11 @@
 *       COMPLEX            B( LDB, * ), BX( LDBX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLALSA is an itermediate step in solving the least squares problem
 *> by computing the SVD of the coefficient matrix in compact form (The
@@ -52,11 +52,10 @@
 *> ICOMPQ = 1, CLALSA applies the right singular vector matrix to the
 *> right hand side. The singular vector matrices were generated in
 *> compact form by CLALSA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -243,10 +242,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -257,19 +255,13 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE CLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
      $                   LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
diff --git a/SRC/clalsd.f b/SRC/clalsd.f
index 60aae674..238dd33b 100644
--- a/SRC/clalsd.f
+++ b/SRC/clalsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
 *                          RANK, WORK, RWORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *       COMPLEX            B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLALSD uses the singular value decomposition of A to solve the least
 *> squares problem of finding X to minimize the Euclidean norm of each
@@ -54,11 +54,10 @@
 *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -163,10 +162,9 @@
 *>               working on the submatrix lying in rows and columns
 *>               INFO/(N+1) through MOD(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -177,19 +175,13 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE CLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
      $                   RANK, WORK, RWORK, IWORK, INFO )
diff --git a/SRC/clangb.f b/SRC/clangb.f
index 33857200..f1efad56 100644
--- a/SRC/clangb.f
+++ b/SRC/clangb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANGB( NORM, N, KL, KU, AB, LDAB,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANGB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n band matrix  A,  with kl sub-diagonals and ku super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANGB returns the value
+*> \return CLANGB
+*> \verbatim
 *>
 *>    CLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -110,10 +108,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clange.f b/SRC/clange.f
index 1b798b66..af30a2a1 100644
--- a/SRC/clange.f
+++ b/SRC/clange.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANGE( NORM, M, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANGE  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANGE returns the value
+*> \return CLANGE
+*> \verbatim
 *>
 *>    CLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -101,10 +99,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clangt.f b/SRC/clangt.f
index 31ae38a3..73de683f 100644
--- a/SRC/clangt.f
+++ b/SRC/clangt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANGT( NORM, N, DL, D, DU )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANGT  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANGT returns the value
+*> \return CLANGT
+*> \verbatim
 *>
 *>    CLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -92,10 +90,9 @@
 *>          DU is COMPLEX array, dimension (N-1)
 *>          The (n-1) super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clanhb.f b/SRC/clanhb.f
index ce866cd8..b8688e57 100644
--- a/SRC/clanhb.f
+++ b/SRC/clanhb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANHB( NORM, UPLO, N, K, AB, LDAB,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANHB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n hermitian band matrix A,  with k super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANHB returns the value
+*> \return CLANHB
+*> \verbatim
 *>
 *>    CLANHB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -117,10 +115,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clanhe.f b/SRC/clanhe.f
index c5b52d97..5154b610 100644
--- a/SRC/clanhe.f
+++ b/SRC/clanhe.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANHE( NORM, UPLO, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANHE  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex hermitian matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANHE returns the value
+*> \return CLANHE
+*> \verbatim
 *>
 *>    CLANHE = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -110,10 +108,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clanhf.f b/SRC/clanhf.f
index 29fcbd16..94af2a6a 100644
--- a/SRC/clanhf.f
+++ b/SRC/clanhf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION CLANHF( NORM, TRANSR, UPLO, N, A, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANHF  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex Hermitian matrix A in RFP format.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANHF returns the value
+*> \return CLANHF
+*> \verbatim
 *>
 *>    CLANHF = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a  matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -124,10 +122,9 @@
 *>            where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>            WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +135,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -245,7 +241,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clanhp.f b/SRC/clanhp.f
index dfefe685..501de4f4 100644
--- a/SRC/clanhp.f
+++ b/SRC/clanhp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANHP( NORM, UPLO, N, AP, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANHP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex hermitian matrix A,  supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANHP returns the value
+*> \return CLANHP
+*> \verbatim
 *>
 *>    CLANHP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -103,10 +101,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clanhs.f b/SRC/clanhs.f
index 541e1aee..ca0aadc9 100644
--- a/SRC/clanhs.f
+++ b/SRC/clanhs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANHS( NORM, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANHS  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> Hessenberg matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANHS returns the value
+*> \return CLANHS
+*> \verbatim
 *>
 *>    CLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -95,10 +93,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clanht.f b/SRC/clanht.f
index 9a0816e0..386af4cb 100644
--- a/SRC/clanht.f
+++ b/SRC/clanht.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANHT( NORM, N, D, E )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANHT  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex Hermitian tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANHT returns the value
+*> \return CLANHT
+*> \verbatim
 *>
 *>    CLANHT = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -87,10 +85,9 @@
 *>          E is COMPLEX array, dimension (N-1)
 *>          The (n-1) sub-diagonal or super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clansb.f b/SRC/clansb.f
index f5ab9ca5..1b08bb44 100644
--- a/SRC/clansb.f
+++ b/SRC/clansb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANSB( NORM, UPLO, N, K, AB, LDAB,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANSB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n symmetric band matrix A,  with k super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANSB returns the value
+*> \return CLANSB
+*> \verbatim
 *>
 *>    CLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -115,10 +113,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clansp.f b/SRC/clansp.f
index 5054f005..335e7f4f 100644
--- a/SRC/clansp.f
+++ b/SRC/clansp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANSP( NORM, UPLO, N, AP, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANSP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex symmetric matrix A,  supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANSP returns the value
+*> \return CLANSP
+*> \verbatim
 *>
 *>    CLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -101,10 +99,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clansy.f b/SRC/clansy.f
index acea7a04..0addf51a 100644
--- a/SRC/clansy.f
+++ b/SRC/clansy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANSY( NORM, UPLO, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANSY  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex symmetric matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANSY returns the value
+*> \return CLANSY
+*> \verbatim
 *>
 *>    CLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -109,10 +107,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clantb.f b/SRC/clantb.f
index 5428da31..17c13ef0 100644
--- a/SRC/clantb.f
+++ b/SRC/clantb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANTB( NORM, UPLO, DIAG, N, K, AB,
 *                        LDAB, WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANTB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n triangular band matrix A,  with ( k + 1 ) diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANTB returns the value
+*> \return CLANTB
+*> \verbatim
 *>
 *>    CLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -126,10 +124,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clantp.f b/SRC/clantp.f
index b1736439..782a8db5 100644
--- a/SRC/clantp.f
+++ b/SRC/clantp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANTP( NORM, UPLO, DIAG, N, AP, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANTP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> triangular matrix A, supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANTP returns the value
+*> \return CLANTP
+*> \verbatim
 *>
 *>    CLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -111,10 +109,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clantr.f b/SRC/clantr.f
index db6b98ba..03ed07c7 100644
--- a/SRC/clantr.f
+++ b/SRC/clantr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION CLANTR( NORM, UPLO, DIAG, M, N, A, LDA,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLANTR  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> trapezoidal or triangular matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> CLANTR returns the value
+*> \return CLANTR
+*> \verbatim
 *>
 *>    CLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -127,10 +125,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clapll.f b/SRC/clapll.f
index 01507b5d..c9ae99f7 100644
--- a/SRC/clapll.f
+++ b/SRC/clapll.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAPLL( N, X, INCX, Y, INCY, SSMIN )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given two column vectors X and Y, let
 *>
@@ -42,11 +42,10 @@
 *> and then computes the SVD of the 2-by-2 upper triangular matrix R.
 *> The smaller singular value of R is returned in SSMIN, which is used
 *> as the measurement of the linear dependency of the vectors X and Y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -85,10 +84,9 @@
 *>          SSMIN is REAL
 *>          The smallest singular value of the N-by-2 matrix A = ( X Y ).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clapmr.f b/SRC/clapmr.f
index 4264c60a..6faca931 100644
--- a/SRC/clapmr.f
+++ b/SRC/clapmr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAPMR( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAPMR rearranges the rows of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(I,*) is moved to X(K(I),*) for I = 1,2,...,M.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clapmt.f b/SRC/clapmt.f
index 35fb9e91..966028b3 100644
--- a/SRC/clapmt.f
+++ b/SRC/clapmt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAPMT( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAPMT rearranges the columns of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqgb.f b/SRC/claqgb.f
index 642ff10a..846069a1 100644
--- a/SRC/claqgb.f
+++ b/SRC/claqgb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, EQUED )
@@ -31,20 +31,19 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQGB equilibrates a general M by N band matrix A with KL
 *> subdiagonals and KU superdiagonals using the row and scaling factors
 *> in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -129,10 +128,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -142,10 +143,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqge.f b/SRC/claqge.f
index 902dec0d..d8be08ac 100644
--- a/SRC/claqge.f
+++ b/SRC/claqge.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          EQUED )
@@ -31,19 +31,18 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQGE equilibrates a general M by N matrix A using the row and
 *> column scaling factors in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -125,10 +126,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqhb.f b/SRC/claqhb.f
index 562acf34..15c25a9a 100644
--- a/SRC/claqhb.f
+++ b/SRC/claqhb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQHB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQHB equilibrates an Hermitian band matrix A using the scaling
 *> factors in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -124,10 +125,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqhe.f b/SRC/claqhe.f
index fceb3f74..61ee38c4 100644
--- a/SRC/claqhe.f
+++ b/SRC/claqhe.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQHE( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQHE equilibrates a Hermitian matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -117,10 +118,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqhp.f b/SRC/claqhp.f
index c4d8f0aa..9b1824c6 100644
--- a/SRC/claqhp.f
+++ b/SRC/claqhp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQHP( UPLO, N, AP, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQHP equilibrates a Hermitian matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -109,10 +110,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqp2.f b/SRC/claqp2.f
index cdbab2e6..3084e34a 100644
--- a/SRC/claqp2.f
+++ b/SRC/claqp2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
 *                          WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQP2 computes a QR factorization with column pivoting of
 *> the block A(OFFSET+1:M,1:N).
 *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -114,10 +113,9 @@
 *> \verbatim
 *>          WORK is COMPLEX array, dimension (N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -128,23 +126,25 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
-*>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE CLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
      $                   WORK )
diff --git a/SRC/claqps.f b/SRC/claqps.f
index 88dfeeee..8b95e16f 100644
--- a/SRC/claqps.f
+++ b/SRC/claqps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
 *                          VN2, AUXV, F, LDF )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * ), AUXV( * ), F( LDF, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQPS computes a step of QR factorization with column pivoting
 *> of a complex M-by-N matrix A by using Blas-3.  It tries to factorize
@@ -46,11 +46,10 @@
 *> columns is returned in KB.
 *>
 *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          LDF is INTEGER
 *>          The leading dimension of the array F. LDF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -156,23 +154,26 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
 *>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE CLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
      $                   VN2, AUXV, F, LDF )
diff --git a/SRC/claqr0.f b/SRC/claqr0.f
index be73778e..6b28becd 100644
--- a/SRC/claqr0.f
+++ b/SRC/claqr0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
 *                          IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLAQR0 computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -44,11 +44,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the unitary matrix Q:  A = Q*H*Q**H = (QZ)*H*(QZ)**H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -206,10 +205,9 @@
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -220,28 +218,24 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
      $                   IHIZ, Z, LDZ, WORK, LWORK, INFO )
diff --git a/SRC/claqr1.f b/SRC/claqr1.f
index 8b468a65..d183c2df 100644
--- a/SRC/claqr1.f
+++ b/SRC/claqr1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQR1( N, H, LDH, S1, S2, V )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            H( LDH, * ), V( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>      Given a 2-by-2 or 3-by-3 matrix H, CLAQR1 sets v to a
 *>      scalar multiple of the first column of the product
@@ -43,11 +43,10 @@
 *>
 *>      This is useful for starting double implicit shift bulges
 *>      in the QR algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -86,10 +85,9 @@
 *>              A scalar multiple of the first column of the
 *>              matrix K in (*).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -100,17 +98,11 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE CLAQR1( N, H, LDH, S1, S2, V )
diff --git a/SRC/claqr2.f b/SRC/claqr2.f
index 5fc0555c..a6ef1cbd 100644
--- a/SRC/claqr2.f
+++ b/SRC/claqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT,
@@ -32,11 +32,11 @@
 *      $                   WORK( * ), WV( LDWV, * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLAQR2 is identical to CLAQR3 except that it avoids
 *>    recursion by calling CLAHQR instead of CLAQR4.
@@ -51,11 +51,10 @@
 *>    an unitary similarity transformation of H.  It is to be
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -246,10 +245,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -260,17 +258,11 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE CLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/claqr3.f b/SRC/claqr3.f
index 185be7ed..45ba1c4e 100644
--- a/SRC/claqr3.f
+++ b/SRC/claqr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT,
@@ -32,11 +32,11 @@
 *      $                   WORK( * ), WV( LDWV, * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    Aggressive early deflation:
 *>
@@ -48,11 +48,10 @@
 *>    an unitary similarity transformation of H.  It is to be
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -243,10 +242,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -257,17 +255,11 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE CLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/claqr4.f b/SRC/claqr4.f
index d7a96d8f..8ba6ef3a 100644
--- a/SRC/claqr4.f
+++ b/SRC/claqr4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
 *                          IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *       ..
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLAQR4 implements one level of recursion for CLAQR0.
 *>    It is a complete implementation of the small bulge multi-shift
@@ -52,11 +52,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the unitary matrix Q:  A = Q*H*Q**H = (QZ)*H*(QZ)**H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -215,10 +214,9 @@
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -229,28 +227,24 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
      $                   IHIZ, Z, LDZ, WORK, LWORK, INFO )
diff --git a/SRC/claqr5.f b/SRC/claqr5.f
index 5967121a..6bd29a16 100644
--- a/SRC/claqr5.f
+++ b/SRC/claqr5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S,
 *                          H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, LDU, NV,
@@ -32,19 +32,18 @@
 *      $                   WH( LDWH, * ), WV( LDWV, * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CLAQR5 called by CLAQR0 performs a
 *>    single small-bulge multi-shift QR sweep.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -220,10 +219,9 @@
 *>             LDWV is the leading dimension of WV as declared in the
 *>             in the calling subroutine.  LDWV.GE.NV.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -234,24 +232,19 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*> \par Contributors:
+*  ==================
 *>
-*>     Reference:
-*>
-*>     K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*>     Algorithm Part I: Maintaining Well Focused Shifts, and
-*>     Level 3 Performance, SIAM Journal of Matrix Analysis,
-*>     volume 23, pages 929--947, 2002.
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*> \endverbatim
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
 *>
 *  =====================================================================
       SUBROUTINE CLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S,
diff --git a/SRC/claqsb.f b/SRC/claqsb.f
index 22d92c12..cdb9e916 100644
--- a/SRC/claqsb.f
+++ b/SRC/claqsb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQSB equilibrates a symmetric band matrix A using the scaling
 *> factors in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -124,10 +125,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqsp.f b/SRC/claqsp.f
index 31f68d14..15d3b68e 100644
--- a/SRC/claqsp.f
+++ b/SRC/claqsp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQSP equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -109,10 +110,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claqsy.f b/SRC/claqsy.f
index 80b46968..d3dd3bec 100644
--- a/SRC/claqsy.f
+++ b/SRC/claqsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAQSY equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -117,10 +118,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clar1v.f b/SRC/clar1v.f
index ed6d3120..d4179f7f 100644
--- a/SRC/clar1v.f
+++ b/SRC/clar1v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
 *                  PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
@@ -35,11 +35,11 @@
 *       COMPLEX          Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAR1V computes the (scaled) r-th column of the inverse of
 *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix
@@ -56,11 +56,10 @@
 *> (d) Computation of the (scaled) r-th column of the inverse using the
 *>     twisted factorization obtained by combining the top part of the
 *>     the stationary and the bottom part of the progressive transform.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -204,10 +203,9 @@
 *> \verbatim
 *>          WORK is REAL array, dimension (4*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -218,21 +216,15 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE CLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
      $           PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
diff --git a/SRC/clar2v.f b/SRC/clar2v.f
index d614432e..29abba57 100644
--- a/SRC/clar2v.f
+++ b/SRC/clar2v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAR2V( N, X, Y, Z, INCX, C, S, INCC )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            S( * ), X( * ), Y( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAR2V applies a vector of complex plane rotations with real cosines
 *> from both sides to a sequence of 2-by-2 complex Hermitian matrices,
@@ -43,11 +43,10 @@
 *>
 *>      (  c(i) conjg(s(i)) ) (       x(i)  z(i) ) ( c(i) -conjg(s(i)) )
 *>      ( -s(i)       c(i)  ) ( conjg(z(i)) y(i) ) ( s(i)        c(i)  )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -96,10 +95,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clarcm.f b/SRC/clarcm.f
index b6fd399d..191da9d2 100644
--- a/SRC/clarcm.f
+++ b/SRC/clarcm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARCM( M, N, A, LDA, B, LDB, C, LDC, RWORK )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            B( LDB, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARCM performs a very simple matrix-matrix multiplication:
 *>          C := A * B,
 *> where A is M by M and real; B is M by N and complex;
 *> C is M by N and complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *> \verbatim
 *>          RWORK is REAL array, dimension (2*M*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clarf.f b/SRC/clarf.f
index 2c0dd761..c6ded92b 100644
--- a/SRC/clarf.f
+++ b/SRC/clarf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARF applies a complex elementary reflector H to a complex M-by-N
 *> matrix C, from either the left or the right. H is represented in the
@@ -47,11 +47,10 @@
 *>
 *> To apply H**H (the conjugate transpose of H), supply conjg(tau) instead
 *> tau.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -113,10 +112,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clarfb.f b/SRC/clarfb.f
index 335023ac..0d27814a 100644
--- a/SRC/clarfb.f
+++ b/SRC/clarfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV,
 *                          T, LDT, C, LDC, WORK, LDWORK )
@@ -30,19 +30,18 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARFB applies a complex block reflector H or its transpose H**H to a
 *> complex M-by-N matrix C, from either the left or the right.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,10 +163,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -192,7 +189,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clarfg.f b/SRC/clarfg.f
index cc977f04..5b8dffdc 100644
--- a/SRC/clarfg.f
+++ b/SRC/clarfg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARFG( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARFG generates a complex elementary reflector H of order n, such
 *> that
@@ -53,11 +53,10 @@
 *> and H is taken to be the unit matrix.
 *>
 *> Otherwise  1 <= real(tau) <= 2  and  abs(tau-1) <= 1 .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          TAU is COMPLEX
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clarfgp.f b/SRC/clarfgp.f
index cbad5fc7..9d50bd3c 100644
--- a/SRC/clarfgp.f
+++ b/SRC/clarfgp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARFGP( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARFGP generates a complex elementary reflector H of order n, such
 *> that
@@ -51,11 +51,10 @@
 *>
 *> If the elements of x are all zero and alpha is real, then tau = 0
 *> and H is taken to be the unit matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          TAU is COMPLEX
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clarft.f b/SRC/clarft.f
index b2a74b63..be794688 100644
--- a/SRC/clarft.f
+++ b/SRC/clarft.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARFT forms the triangular factor T of a complex block reflector H
 *> of order n, which is defined as a product of k elementary reflectors.
@@ -50,11 +50,10 @@
 *> H(i) is stored in the i-th row of the array V, and
 *>
 *>    H  =  I - V**H * T * V
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,10 +134,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -163,7 +160,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clarfx.f b/SRC/clarfx.f
index cbd57a65..eef60719 100644
--- a/SRC/clarfx.f
+++ b/SRC/clarfx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARFX( SIDE, M, N, V, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARFX applies a complex elementary reflector H to a complex m by n
 *> matrix C, from either the left or the right. H is represented in the
@@ -46,11 +46,10 @@
 *> If tau = 0, then H is taken to be the unit matrix
 *>
 *> This version uses inline code if H has order < 11.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -104,10 +103,9 @@
 *>                                            or (M) if SIDE = 'R'
 *>          WORK is not referenced if H has order < 11.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clargv.f b/SRC/clargv.f
index 059a1f9e..b32ee6b7 100644
--- a/SRC/clargv.f
+++ b/SRC/clargv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARGV( N, X, INCX, Y, INCY, C, INCC )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARGV generates a vector of complex plane rotations with real
 *> cosines, determined by elements of the complex vectors x and y.
@@ -47,11 +47,10 @@
 *> but differ from the BLAS1 routine CROTG):
 *>    If y(i)=0, then c(i)=1 and s(i)=0.
 *>    If x(i)=0, then c(i)=0 and s(i) is chosen so that r(i) is real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -96,10 +95,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -110,17 +108,15 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  6-6-96 - Modified with a new algorithm by W. Kahan and J. Demmel
 *>
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clarnv.f b/SRC/clarnv.f
index 7fb79870..f6724d81 100644
--- a/SRC/clarnv.f
+++ b/SRC/clarnv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARNV( IDIST, ISEED, N, X )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARNV returns a vector of n random complex numbers from a uniform or
 *> normal distribution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IDIST
 *> \verbatim
@@ -73,10 +72,9 @@
 *>          X is COMPLEX array, dimension (N)
 *>          The generated random numbers.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -87,17 +85,15 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine calls the auxiliary routine SLARUV to generate random
 *>  real numbers from a uniform (0,1) distribution, in batches of up to
 *>  128 using vectorisable code. The Box-Muller method is used to
 *>  transform numbers from a uniform to a normal distribution.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clarrv.f b/SRC/clarrv.f
index fc3b914a..a6606fb4 100644
--- a/SRC/clarrv.f
+++ b/SRC/clarrv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARRV( N, VL, VU, D, L, PIVMIN,
 *                          ISPLIT, M, DOL, DOU, MINRGP,
@@ -36,20 +36,19 @@
 *       COMPLEX           Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARRV computes the eigenvectors of the tridiagonal matrix
 *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.
 *> The input eigenvalues should have been computed by SLARRE.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -255,10 +254,9 @@
 *>          = 5:  The Rayleigh Quotient Iteration failed to converge to
 *>                full accuracy in MAXITR steps.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -269,21 +267,15 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE CLARRV( N, VL, VU, D, L, PIVMIN,
      $                   ISPLIT, M, DOL, DOU, MINRGP,
diff --git a/SRC/clarscl2.f b/SRC/clarscl2.f
index f3564c8f..76990d3b 100644
--- a/SRC/clarscl2.f
+++ b/SRC/clarscl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARSCL2 ( M, N, D, X, LDX )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARSCL2 performs a reciprocal diagonal scaling on an vector:
 *>   x <-- inv(D) * x
@@ -40,11 +40,10 @@
 *>
 *> Eventually to be replaced by BLAS_cge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -76,10 +75,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clartg.f b/SRC/clartg.f
index 83746493..a5bfb806 100644
--- a/SRC/clartg.f
+++ b/SRC/clartg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARTG( F, G, CS, SN, R )
 * 
@@ -25,11 +25,11 @@
 *       COMPLEX            F, G, R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARTG generates a plane rotation so that
 *>
@@ -42,11 +42,10 @@
 *>    F and G are unchanged on return.
 *>    If G=0, then CS=1 and SN=0.
 *>    If F=0, then CS=0 and SN is chosen so that R is real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -77,10 +76,9 @@
 *>          R is COMPLEX
 *>          The nonzero component of the rotated vector.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -91,17 +89,15 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  3-5-96 - Modified with a new algorithm by W. Kahan and J. Demmel
 *>
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clartv.f b/SRC/clartv.f
index 5977e0ec..3925ed37 100644
--- a/SRC/clartv.f
+++ b/SRC/clartv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARTV( N, X, INCX, Y, INCY, C, S, INCC )
 * 
@@ -28,22 +28,21 @@
 *       COMPLEX            S( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARTV applies a vector of complex plane rotations with real cosines
 *> to elements of the complex vectors x and y. For i = 1,2,...,n
 *>
 *>    ( x(i) ) := (        c(i)   s(i) ) ( x(i) )
 *>    ( y(i) )    ( -conjg(s(i))  c(i) ) ( y(i) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clarz.f b/SRC/clarz.f
index 27f222e9..f0e26ab3 100644
--- a/SRC/clarz.f
+++ b/SRC/clarz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARZ applies a complex elementary reflector H to a complex
 *> M-by-N matrix C, from either the left or the right. H is represented
@@ -49,11 +49,10 @@
 *> tau.
 *>
 *> H is a product of k elementary reflectors as returned by CTZRZF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -121,10 +120,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -135,15 +133,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clarzb.f b/SRC/clarzb.f
index 9be52496..3ff98c8c 100644
--- a/SRC/clarzb.f
+++ b/SRC/clarzb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V,
 *                          LDV, T, LDT, C, LDC, WORK, LDWORK )
@@ -30,21 +30,20 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARZB applies a complex block reflector H or its transpose H**H
 *> to a complex distributed M-by-N  C from the left or the right.
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -170,15 +168,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clarzt.f b/SRC/clarzt.f
index 16c8e96a..20e1c658 100644
--- a/SRC/clarzt.f
+++ b/SRC/clarzt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLARZT forms the triangular factor T of a complex block reflector
 *> H of order > n, which is defined as a product of k elementary
@@ -53,11 +53,10 @@
 *>    H  =  I - V**H * T * V
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,14 +137,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
 *>  the H(i) is best illustrated by the following example with n = 5 and
@@ -181,7 +180,6 @@
 *>     V = ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clascl.f b/SRC/clascl.f
index d5039e97..a6e62b28 100644
--- a/SRC/clascl.f
+++ b/SRC/clascl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO )
 * 
@@ -29,22 +29,21 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLASCL multiplies the M by N complex matrix A by the real scalar
 *> CTO/CFROM.  This is done without over/underflow as long as the final
 *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that
 *> A may be full, upper triangular, lower triangular, upper Hessenberg,
 *> or banded.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TYPE
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          0  - successful exit
 *>          <0 - if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clascl2.f b/SRC/clascl2.f
index 8d2db221..811bae4b 100644
--- a/SRC/clascl2.f
+++ b/SRC/clascl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLASCL2 ( M, N, D, X, LDX )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLASCL2 performs a diagonal scaling on a vector:
 *>   x <-- D * x
@@ -40,11 +40,10 @@
 *>
 *> Eventually to be replaced by BLAS_cge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -76,10 +75,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claset.f b/SRC/claset.f
index c7501992..f5089eff 100644
--- a/SRC/claset.f
+++ b/SRC/claset.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLASET( UPLO, M, N, ALPHA, BETA, A, LDA )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLASET initializes a 2-D array A to BETA on the diagonal and
 *> ALPHA on the offdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clasr.f b/SRC/clasr.f
index d84f820b..99612e1e 100644
--- a/SRC/clasr.f
+++ b/SRC/clasr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLASR applies a sequence of real plane rotations to a complex matrix
 *> A, from either the left or the right.
@@ -106,11 +106,10 @@
 *> 
 *> where R(k) appears in rows and columns k and z.  The rotations are
 *> performed without ever forming P(k) explicitly.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -185,10 +184,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/classq.f b/SRC/classq.f
index f104edea..b32f1bcf 100644
--- a/SRC/classq.f
+++ b/SRC/classq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLASSQ( N, X, INCX, SCALE, SUMSQ )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLASSQ returns the values scl and ssq such that
 *>
@@ -52,11 +52,10 @@
 *> SCALE and SUMSQ are overwritten by scl and ssq respectively.
 *>
 *> The routine makes only one pass through the vector X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          On entry, the value  sumsq  in the equation above.
 *>          On exit, SUMSQ is overwritten with the value  ssq .
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/claswp.f b/SRC/claswp.f
index cd167898..464b3e6c 100644
--- a/SRC/claswp.f
+++ b/SRC/claswp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLASWP( N, A, LDA, K1, K2, IPIV, INCX )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLASWP performs a series of row interchanges on the matrix A.
 *> One row interchange is initiated for each of rows K1 through K2 of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          The increment between successive values of IPIV.  If IPIV
 *>          is negative, the pivots are applied in reverse order.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,15 +102,13 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by
 *>   R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clasyf.f b/SRC/clasyf.f
index 0d9a4dff..c103a820 100644
--- a/SRC/clasyf.f
+++ b/SRC/clasyf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLASYF computes a partial factorization of a complex symmetric matrix
 *> A using the Bunch-Kaufman diagonal pivoting method. The partial
@@ -52,11 +52,10 @@
 *> CLASYF is an auxiliary routine called by CSYTRF. It uses blocked code
 *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or
 *> A22 (if UPLO = 'L').
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -142,10 +141,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clatbs.f b/SRC/clatbs.f
index 1e7dcce5..159d75df 100644
--- a/SRC/clatbs.f
+++ b/SRC/clatbs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X,
 *                          SCALE, CNORM, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AB( LDAB, * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLATBS solves one of the triangular systems
 *>
@@ -49,11 +49,10 @@
 *> overflow, the Level 2 BLAS routine CTBSV is called.  If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -169,10 +167,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, CTBSV
@@ -240,7 +237,6 @@
 *>
 *>  and we can safely call CTBSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clatdf.f b/SRC/clatdf.f
index 9b6b4eab..5b9993fd 100644
--- a/SRC/clatdf.f
+++ b/SRC/clatdf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
 *                          JPIV )
@@ -30,11 +30,11 @@
 *       COMPLEX            RHS( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLATDF computes the contribution to the reciprocal Dif-estimate
 *> by solving for x in Z * x = b, where b is chosen such that the norm
@@ -45,11 +45,10 @@
 *> The factorization of Z returned by CGETC2 has the form
 *> Z = P * L * U * Q, where P and Q are permutation matrices. L is lower
 *> triangular with unit diagonal elements and U is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -126,10 +125,9 @@
 *>          The pivot indices; for 1 <= j <= N, column j of the
 *>          matrix has been interchanged with column JPIV(j).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -140,18 +138,20 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
+*> \par Further Details:
+*  =====================
+*>
+*>  This routine is a further developed implementation of algorithm
+*>  BSOLVE in [1] using complete pivoting in the LU factorization.
 *
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*>  This routine is a further developed implementation of algorithm
-*>  BSOLVE in [1] using complete pivoting in the LU factorization.
+*
+*> \par References:
+*  ================
 *>
 *>   [1]   Bo Kagstrom and Lars Westin,
 *>         Generalized Schur Methods with Condition Estimators for
@@ -164,9 +164,7 @@
 *>         Condition Estimation. Report UMINF-95.05, Department of
 *>         Computing Science, Umea University, S-901 87 Umea, Sweden,
 *>         1995.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
      $                   JPIV )
diff --git a/SRC/clatps.f b/SRC/clatps.f
index 5c36c905..d96b252c 100644
--- a/SRC/clatps.f
+++ b/SRC/clatps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE,
 *                          CNORM, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AP( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLATPS solves one of the triangular systems
 *>
@@ -50,11 +50,10 @@
 *> overflow, the Level 2 BLAS routine CTPSV is called. If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -157,10 +155,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, CTPSV
@@ -228,7 +225,6 @@
 *>
 *>  and we can safely call CTPSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clatrd.f b/SRC/clatrd.f
index 32b2648c..348c16c5 100644
--- a/SRC/clatrd.f
+++ b/SRC/clatrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLATRD reduces NB rows and columns of a complex Hermitian matrix A to
 *> Hermitian tridiagonal form by a unitary similarity
@@ -46,11 +46,10 @@
 *> matrix, of which the lower triangle is supplied.
 *>
 *> This is an auxiliary routine called by CHETRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -132,10 +131,9 @@
 *>          LDW is INTEGER
 *>          The leading dimension of the array W. LDW >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -146,10 +144,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -197,7 +194,6 @@
 *>  where d denotes a diagonal element of the reduced matrix, a denotes
 *>  an element of the original matrix that is unchanged, and vi denotes
 *>  an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clatrs.f b/SRC/clatrs.f
index 675550f9..4c5cd4c5 100644
--- a/SRC/clatrs.f
+++ b/SRC/clatrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE,
 *                          CNORM, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLATRS solves one of the triangular systems
 *>
@@ -49,11 +49,10 @@
 *> unscaled problem will not cause overflow, the Level 2 BLAS routine
 *> CTRSV is called. If the matrix A is singular (A(j,j) = 0 for some j),
 *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,10 +163,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, CTRSV
@@ -236,7 +233,6 @@
 *>
 *>  and we can safely call CTRSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clatrz.f b/SRC/clatrz.f
index f2185f44..9baf615f 100644
--- a/SRC/clatrz.f
+++ b/SRC/clatrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLATRZ( M, N, L, A, LDA, TAU, WORK )
 * 
@@ -27,21 +27,20 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLATRZ factors the M-by-(M+L) complex upper trapezoidal matrix
 *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R  0 ) * Z by means
 *> of unitary transformations, where  Z is an (M+L)-by-(M+L) unitary
 *> matrix and, R and A1 are M-by-M upper triangular matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *> \verbatim
 *>          WORK is COMPLEX array, dimension (M)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,14 +101,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -136,7 +135,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/clatzm.f b/SRC/clatzm.f
index d0915dfb..3e08ddf1 100644
--- a/SRC/clatzm.f
+++ b/SRC/clatzm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine CUNMRZ.
 *>
@@ -54,11 +54,10 @@
 *>        C = [ C1, C2 ] m
 *>               1  n-1
 *> Then C is overwritten by C*P.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -137,10 +136,9 @@
 *>                      (N) if SIDE = 'L'
 *>                      (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clauu2.f b/SRC/clauu2.f
index 5ae62884..4741e46e 100644
--- a/SRC/clauu2.f
+++ b/SRC/clauu2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAUU2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAUU2 computes the product U * U**H or L**H * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the unblocked form of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/clauum.f b/SRC/clauum.f
index d1058faa..7ee248e2 100644
--- a/SRC/clauum.f
+++ b/SRC/clauum.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CLAUUM( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CLAUUM computes the product U * U**H or L**H * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the blocked form of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpbcon.f b/SRC/cpbcon.f
index 21737104..73cefdf9 100644
--- a/SRC/cpbcon.f
+++ b/SRC/cpbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK,
 *                          RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex Hermitian positive definite band matrix using
@@ -44,11 +44,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -117,10 +116,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpbequ.f b/SRC/cpbequ.f
index 81d85b67..61c41a89 100644
--- a/SRC/cpbequ.f
+++ b/SRC/cpbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBEQU computes row and column scalings intended to equilibrate a
 *> Hermitian positive definite band matrix A and reduce its condition
@@ -44,11 +44,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpbrfs.f b/SRC/cpbrfs.f
index 9ac4f70a..de9fcbd9 100644
--- a/SRC/cpbrfs.f
+++ b/SRC/cpbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite
 *> and banded, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -165,16 +164,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpbstf.f b/SRC/cpbstf.f
index 3f4cf113..5fe54272 100644
--- a/SRC/cpbstf.f
+++ b/SRC/cpbstf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBSTF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBSTF computes a split Cholesky factorization of a complex
 *> Hermitian positive definite band matrix A.
@@ -47,11 +47,10 @@
 *>
 *> where U is upper triangular of order m = (n+kd)/2, and L is lower
 *> triangular of order n-m.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               because the updated element a(i,i) was negative; the
 *>               matrix A is not positive definite.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -151,7 +148,6 @@
 *>
 *>  Array elements marked * are not used by the routine; s12**H denotes
 *>  conjg(s12); the diagonal elements of S are real.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpbsv.f b/SRC/cpbsv.f
index 627cfc36..4e3b36c8 100644
--- a/SRC/cpbsv.f
+++ b/SRC/cpbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -46,11 +46,10 @@
 *> triangular band matrix, with the same number of superdiagonals or
 *> subdiagonals as A.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -162,7 +159,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpbsvx.f b/SRC/cpbsvx.f
index 05c99895..69b77d61 100644
--- a/SRC/cpbsvx.f
+++ b/SRC/cpbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB,
 *                          EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -33,11 +33,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to
 *> compute the solution to a complex system of linear equations
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -85,11 +88,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -290,10 +292,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 
@@ -304,10 +305,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -335,7 +335,6 @@
 *>     a31  a42  a53  a64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpbtf2.f b/SRC/cpbtf2.f
index 883edfaa..c026573e 100644
--- a/SRC/cpbtf2.f
+++ b/SRC/cpbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBTF2( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBTF2 computes the Cholesky factorization of a complex Hermitian
 *> positive definite band matrix A.
@@ -44,11 +44,10 @@
 *> of U, and L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -140,7 +137,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpbtrf.f b/SRC/cpbtrf.f
index 8a11a5c7..ef3c019c 100644
--- a/SRC/cpbtrf.f
+++ b/SRC/cpbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite band matrix A.
@@ -41,11 +41,10 @@
 *>    A = U**H * U,  if UPLO = 'U', or
 *>    A = L  * L**H,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -135,12 +132,13 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
-*>  Contributed by
-*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
+*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
+*
 *  =====================================================================
       SUBROUTINE CPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 *
diff --git a/SRC/cpbtrs.f b/SRC/cpbtrs.f
index 7686d960..14bde13d 100644
--- a/SRC/cpbtrs.f
+++ b/SRC/cpbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPBTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite band matrix A using the Cholesky factorization
 *> A = U**H*U or A = L*L**H computed by CPBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpftrf.f b/SRC/cpftrf.f
index 647d596c..8790c2fc 100644
--- a/SRC/cpftrf.f
+++ b/SRC/cpftrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPFTRF( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,11 +27,11 @@
 *       .. Array Arguments ..
 *       COMPLEX            A( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPFTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A.
@@ -42,11 +42,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -196,10 +195,9 @@
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpftri.f b/SRC/cpftri.f
index 5937effc..40a58a7e 100644
--- a/SRC/cpftri.f
+++ b/SRC/cpftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPFTRI( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,20 +27,19 @@
 *       COMPLEX            A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPFTRI computes the inverse of a complex Hermitian positive definite
 *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
 *> computed by CPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -210,7 +207,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpftrs.f b/SRC/cpftrs.f
index 83fc928c..4260b74e 100644
--- a/SRC/cpftrs.f
+++ b/SRC/cpftrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            A( 0: * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPFTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite matrix A using the Cholesky factorization
 *> A = U**H*U or A = L*L**H computed by CPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -218,7 +215,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpocon.f b/SRC/cpocon.f
index 15daf86a..8bce0562 100644
--- a/SRC/cpocon.f
+++ b/SRC/cpocon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, RWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex Hermitian positive definite matrix using the
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpoequ.f b/SRC/cpoequ.f
index 1aebf9c7..01d7bb1f 100644
--- a/SRC/cpoequ.f
+++ b/SRC/cpoequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOEQU( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOEQU computes row and column scalings intended to equilibrate a
 *> Hermitian positive definite matrix A and reduce its condition number
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpoequb.f b/SRC/cpoequb.f
index 969c911f..e26f65b1 100644
--- a/SRC/cpoequb.f
+++ b/SRC/cpoequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOEQUB computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A and reduce its condition number
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cporfs.f b/SRC/cporfs.f
index 580ab10f..190243c2 100644
--- a/SRC/cporfs.f
+++ b/SRC/cporfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPORFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite,
 *> and provides error bounds and backward error estimates for the
 *> solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,16 +158,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cporfsx.f b/SRC/cporfsx.f
index 2ba6cefa..7fa79e92 100644
--- a/SRC/cporfsx.f
+++ b/SRC/cporfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B,
 *                           LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -37,13 +37,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CPORFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric positive
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -377,10 +374,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cposv.f b/SRC/cposv.f
index 4b73f6c0..488c46ba 100644
--- a/SRC/cposv.f
+++ b/SRC/cposv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and  L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cposvx.f b/SRC/cposvx.f
index ef3d591d..2983dc87 100644
--- a/SRC/cposvx.f
+++ b/SRC/cposvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                          S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK,
@@ -33,11 +33,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to
 *> compute the solution to a complex system of linear equations
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -85,11 +88,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -286,10 +288,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 
diff --git a/SRC/cposvxx.f b/SRC/cposvxx.f
index fb1c6df8..ed9b8076 100644
--- a/SRC/cposvxx.f
+++ b/SRC/cposvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                           S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -37,13 +37,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T
 *>    to compute the solution to a complex system of linear equations
@@ -64,9 +62,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what CPOSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -104,11 +105,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -477,10 +477,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpotf2.f b/SRC/cpotf2.f
index a9f5efef..c6a90234 100644
--- a/SRC/cpotf2.f
+++ b/SRC/cpotf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOTF2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOTF2 computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpotrf.f b/SRC/cpotrf.f
index 0d20bb0d..76f49664 100644
--- a/SRC/cpotrf.f
+++ b/SRC/cpotrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOTRF( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -92,10 +91,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpotri.f b/SRC/cpotri.f
index d8b8970f..c36abe25 100644
--- a/SRC/cpotri.f
+++ b/SRC/cpotri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOTRI( UPLO, N, A, LDA, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOTRI computes the inverse of a complex Hermitian positive definite
 *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
 *> computed by CPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -80,10 +79,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpotrs.f b/SRC/cpotrs.f
index 2eae0ab1..b2b56dd5 100644
--- a/SRC/cpotrs.f
+++ b/SRC/cpotrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPOTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite matrix A using the Cholesky factorization 
 *> A = U**H*U or A = L*L**H computed by CPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cppcon.f b/SRC/cppcon.f
index e04a5397..d4ef84c0 100644
--- a/SRC/cppcon.f
+++ b/SRC/cppcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPCON( UPLO, N, AP, ANORM, RCOND, WORK, RWORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX            AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPCON estimates the reciprocal of the condition number (in the 
 *> 1-norm) of a complex Hermitian positive definite packed matrix using
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cppequ.f b/SRC/cppequ.f
index 6fc241a7..c031a30a 100644
--- a/SRC/cppequ.f
+++ b/SRC/cppequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPEQU computes row and column scalings intended to equilibrate a
 *> Hermitian positive definite matrix A in packed storage and reduce
@@ -44,11 +44,10 @@
 *> This choice of S puts the condition number of B within a factor N of
 *> the smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpprfs.f b/SRC/cpprfs.f
index a5c26651..cfccd713 100644
--- a/SRC/cpprfs.f
+++ b/SRC/cpprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR,
 *                          BERR, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -147,16 +146,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cppsv.f b/SRC/cppsv.f
index 5aa477de..3d3a44dc 100644
--- a/SRC/cppsv.f
+++ b/SRC/cppsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPSV( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -123,10 +121,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -142,7 +139,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cppsvx.f b/SRC/cppsvx.f
index b9051a6e..af42f6dc 100644
--- a/SRC/cppsvx.f
+++ b/SRC/cppsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB,
 *                          X, LDX, RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to
 *> compute the solution to a complex system of linear equations
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -84,11 +87,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -272,10 +274,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 
@@ -286,10 +287,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -305,7 +305,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpptrf.f b/SRC/cpptrf.f
index e99f0339..60763f66 100644
--- a/SRC/cpptrf.f
+++ b/SRC/cpptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPTRF( UPLO, N, AP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A stored in packed format.
@@ -41,11 +41,10 @@
 *>    A = U**H * U,  if UPLO = 'U', or
 *>    A = L  * L**H,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -84,10 +83,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -117,7 +114,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpptri.f b/SRC/cpptri.f
index dcfbae5e..f6b5662f 100644
--- a/SRC/cpptri.f
+++ b/SRC/cpptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPTRI( UPLO, N, AP, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPTRI computes the inverse of a complex Hermitian positive definite
 *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
 *> computed by CPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -78,10 +77,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpptrs.f b/SRC/cpptrs.f
index b9d85ac5..28a9b63c 100644
--- a/SRC/cpptrs.f
+++ b/SRC/cpptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPPTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite matrix A in packed storage using the Cholesky
 *> factorization A = U**H*U or A = L*L**H computed by CPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpstf2.f b/SRC/cpstf2.f
index 4ec6ea79..3478a392 100644
--- a/SRC/cpstf2.f
+++ b/SRC/cpstf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 * 
@@ -31,11 +31,11 @@
 *       INTEGER            PIV( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPSTF2 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 2 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 
diff --git a/SRC/cpstrf.f b/SRC/cpstrf.f
index 976fd5e9..d751c443 100644
--- a/SRC/cpstrf.f
+++ b/SRC/cpstrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 * 
@@ -31,11 +31,11 @@
 *       INTEGER            PIV( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPSTRF 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 
diff --git a/SRC/cptcon.f b/SRC/cptcon.f
index fc014add..a398b5c0 100644
--- a/SRC/cptcon.f
+++ b/SRC/cptcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTCON( N, D, E, ANORM, RCOND, RWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTCON computes the reciprocal of the condition number (in the
 *> 1-norm) of a complex Hermitian positive definite tridiagonal matrix
@@ -43,11 +43,10 @@
 *> Norm(inv(A)) is computed by a direct method, and the reciprocal of
 *> the condition number is computed as
 *>                  RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -108,16 +106,14 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The method used is described in Nicholas J. Higham, "Efficient
 *>  Algorithms for Computing the Condition Number of a Tridiagonal
 *>  Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cpteqr.f b/SRC/cpteqr.f
index 15a07e03..e3164d76 100644
--- a/SRC/cpteqr.f
+++ b/SRC/cpteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric positive definite tridiagonal matrix by first factoring the
@@ -52,11 +52,10 @@
 *> tridiagonal form, however, may preclude the possibility of obtaining
 *> high relative accuracy in the small eigenvalues of the original
 *> matrix, if these eigenvalues range over many orders of magnitude.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                      if INFO = N+i, i off-diagonal elements of the
 *>                      bidiagonal factor did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cptrfs.f b/SRC/cptrfs.f
index ce1277db..3a4d3c8f 100644
--- a/SRC/cptrfs.f
+++ b/SRC/cptrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTRFS( UPLO, N, NRHS, D, E, DF, EF, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -32,21 +32,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite
 *> and tridiagonal, and provides error bounds and backward error
 *> estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,16 +158,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cptsv.f b/SRC/cptsv.f
index 11112d7a..8f622e9f 100644
--- a/SRC/cptsv.f
+++ b/SRC/cptsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTSV( N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            B( LDB, * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTSV computes the solution to a complex system of linear equations
 *> A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal
@@ -40,11 +40,10 @@
 *>
 *> A is factored as A = L*D*L**H, and the factored form of A is then
 *> used to solve the system of equations.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -100,10 +99,9 @@
 *>                computed.  The factorization has not been completed
 *>                unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cptsvx.f b/SRC/cptsvx.f
index 756c05a0..9859eed4 100644
--- a/SRC/cptsvx.f
+++ b/SRC/cptsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX,
 *                          RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTSVX uses the factorization A = L*D*L**H to compute the solution
 *> to a complex system of linear equations A*X = B, where A is an
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -71,11 +74,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
@@ -215,10 +217,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 
diff --git a/SRC/cpttrf.f b/SRC/cpttrf.f
index 264081d9..379153ea 100644
--- a/SRC/cpttrf.f
+++ b/SRC/cpttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTTRF( N, D, E, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTTRF computes the L*D*L**H factorization of a complex Hermitian
 *> positive definite tridiagonal matrix A.  The factorization may also
 *> be regarded as having the form A = U**H *D*U.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -77,10 +76,9 @@
 *>               be completed, while if k = N, the factorization was
 *>               completed, but D(N) <= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cpttrs.f b/SRC/cpttrs.f
index e8bb4ee1..bd75b46e 100644
--- a/SRC/cpttrs.f
+++ b/SRC/cpttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTTRS( UPLO, N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            B( LDB, * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTTRS solves a tridiagonal system of the form
 *>    A * X = B
@@ -41,11 +41,10 @@
 *> D is a diagonal matrix specified in the vector D, U (or L) is a unit
 *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in
 *> the vector E, and X and B are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cptts2.f b/SRC/cptts2.f
index 8603a07f..390323ae 100644
--- a/SRC/cptts2.f
+++ b/SRC/cptts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CPTTS2( IUPLO, N, NRHS, D, E, B, LDB )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            B( LDB, * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CPTTS2 solves a tridiagonal system of the form
 *>    A * X = B
@@ -40,11 +40,10 @@
 *> D is a diagonal matrix specified in the vector D, U (or L) is a unit
 *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in
 *> the vector E, and X and B are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IUPLO
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/crot.f b/SRC/crot.f
index 6a93866a..0e40045a 100644
--- a/SRC/crot.f
+++ b/SRC/crot.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CROT( N, CX, INCX, CY, INCY, C, S )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX            CX( * ), CY( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CROT   applies a plane rotation, where the cos (C) is real and the
 *> sin (S) is complex, and the vectors CX and CY are complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -88,10 +87,9 @@
 *>             [ -conjg(S)   C  ]
 *>          where C*C + S*CONJG(S) = 1.0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cspcon.f b/SRC/cspcon.f
index f799258c..40676522 100644
--- a/SRC/cspcon.f
+++ b/SRC/cspcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX            AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex symmetric packed matrix A using the
@@ -42,11 +42,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cspmv.f b/SRC/cspmv.f
index 7d3539a2..d503dc0d 100644
--- a/SRC/cspmv.f
+++ b/SRC/cspmv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPMV( UPLO, N, ALPHA, AP, X, INCX, BETA, Y, INCY )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            AP( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPMV  performs the matrix-vector operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha and beta are scalars, x and y are n element vectors and
 *> A is an n by n symmetric matrix, supplied in packed form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -136,10 +135,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cspr.f b/SRC/cspr.f
index eb282570..f1659c77 100644
--- a/SRC/cspr.f
+++ b/SRC/cspr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPR( UPLO, N, ALPHA, X, INCX, AP )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            AP( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPR    performs the symmetric rank 1 operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha is a complex scalar, x is an n element vector and A is an
 *> n by n symmetric matrix, supplied in packed form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -117,10 +116,9 @@
 *>           not be set, they are assumed to be zero, and on exit they
 *>           are set to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csprfs.f b/SRC/csprfs.f
index b84474d2..70529138 100644
--- a/SRC/csprfs.f
+++ b/SRC/csprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -32,21 +32,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -156,16 +155,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cspsv.f b/SRC/cspsv.f
index ebcde720..7102c726 100644
--- a/SRC/cspsv.f
+++ b/SRC/cspsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -47,11 +47,10 @@
 *> triangular matrices, D is symmetric and block diagonal with 1-by-1
 *> and 2-by-2 diagonal blocks.  The factored form of A is then used to
 *> solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, so the solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -160,7 +157,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cspsvx.f b/SRC/cspsvx.f
index 2c7be9d5..a3a9566b 100644
--- a/SRC/cspsvx.f
+++ b/SRC/cspsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X,
 *                          LDX, RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPSVX uses the diagonal pivoting factorization A = U*D*U**T or
 *> A = L*D*L**T to compute the solution to a complex system of linear
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -72,11 +75,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
@@ -238,10 +240,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 
@@ -252,10 +253,9 @@
 *
 *> \ingroup complexOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -271,7 +271,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/csptrf.f b/SRC/csptrf.f
index 2842bd4a..ed0c23e6 100644
--- a/SRC/csptrf.f
+++ b/SRC/csptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPTRF( UPLO, N, AP, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPTRF computes the factorization of a complex symmetric matrix A
 *> stored in packed format using the Bunch-Kaufman diagonal pivoting
@@ -44,11 +44,10 @@
 *> where U (or L) is a product of permutation and unit upper (lower)
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,10 +112,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  5-96 - Based on modifications by J. Lewis, Boeing Computer Services
@@ -156,7 +153,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/csptri.f b/SRC/csptri.f
index 0981022b..e1132c40 100644
--- a/SRC/csptri.f
+++ b/SRC/csptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPTRI( UPLO, N, AP, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPTRI computes the inverse of a complex symmetric indefinite matrix
 *> A in packed storage using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by CSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csptrs.f b/SRC/csptrs.f
index 6398c7e0..f8961678 100644
--- a/SRC/csptrs.f
+++ b/SRC/csptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSPTRS solves a system of linear equations A*X = B with a complex
 *> symmetric matrix A stored in packed format using the factorization
 *> A = U*D*U**T or A = L*D*L**T computed by CSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csrscl.f b/SRC/csrscl.f
index 3ddb05a1..485f1fcf 100644
--- a/SRC/csrscl.f
+++ b/SRC/csrscl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSRSCL( N, SA, SX, INCX )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX            SX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSRSCL multiplies an n-element complex vector x by the real scalar
 *> 1/a.  This is done without overflow or underflow as long as
 *> the final result x/a does not overflow or underflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -69,10 +68,9 @@
 *>          The increment between successive values of the vector SX.
 *>          > 0:  SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i),     1< i<= n
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cstedc.f b/SRC/cstedc.f
index 54c5d1d7..a3af7918 100644
--- a/SRC/cstedc.f
+++ b/SRC/cstedc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK,
 *                          LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSTEDC computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the divide and conquer method.
@@ -49,11 +49,10 @@
 *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.  See SLAED3 for details.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -190,10 +189,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -204,18 +202,12 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE CSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK,
      $                   LRWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/cstegr.f b/SRC/cstegr.f
index 1222baf1..86fa3658 100644
--- a/SRC/cstegr.f
+++ b/SRC/cstegr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                  ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
@@ -33,11 +33,11 @@
 *       COMPLEX            Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSTEGR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -59,11 +59,10 @@
 *> NaNs.  Normal execution may create these exceptiona values and hence
 *> may abort due to a floating point exception in environments which
 *> do not conform to the IEEE-754 standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -232,10 +231,9 @@
 *>                the nonzero error code returned by SLARRE or
 *>                CLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -246,19 +244,13 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, LBNL/NERSC, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Inderjit Dhillon, IBM Almaden, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE CSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $           ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
diff --git a/SRC/cstein.f b/SRC/cstein.f
index 691a764a..a01fce06 100644
--- a/SRC/cstein.f
+++ b/SRC/cstein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK,
 *                          IWORK, IFAIL, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSTEIN computes the eigenvectors of a real symmetric tridiagonal
 *> matrix T corresponding to specified eigenvalues, using inverse
@@ -49,11 +49,10 @@
 *> transformation to the eigenvectors of a complex Hermitian matrix
 *> which was reduced to tridiagonal form.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -153,10 +152,12 @@
 *>          > 0: if INFO = i, then i eigenvectors failed to converge
 *>               in MAXITS iterations.  Their indices are stored in
 *>               array IFAIL.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  MAXITS  INTEGER, default = 5
 *>          The maximum number of iterations performed.
 *>
@@ -164,10 +165,9 @@
 *>          The number of iterations performed after norm growth
 *>          criterion is satisfied, should be at least 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cstemr.f b/SRC/cstemr.f
index 4e605e77..dde431af 100644
--- a/SRC/cstemr.f
+++ b/SRC/cstemr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                          M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
@@ -34,11 +34,11 @@
 *       COMPLEX            Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSTEMR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -107,11 +107,10 @@
 *> Since LAPACK drivers overwrite the matrix data with the eigenvectors,
 *> CSTEMR accepts complex workspace to facilitate interoperability
 *> with CUNMTR or CUPMTR.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -303,10 +302,9 @@
 *>                the nonzero error code returned by SLARRE or
 *>                CLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -317,21 +315,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE CSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $                   M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
diff --git a/SRC/csteqr.f b/SRC/csteqr.f
index 6fb00c9c..175e0616 100644
--- a/SRC/csteqr.f
+++ b/SRC/csteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -29,22 +29,21 @@
 *       COMPLEX            Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the implicit QL or QR method.
 *> The eigenvectors of a full or band complex Hermitian matrix can also
 *> be found if CHETRD or CHPTRD or CHBTRD has been used to reduce this
 *> matrix to tridiagonal form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -117,10 +116,9 @@
 *>                matrix which is unitarily similar to the original
 *>                matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csycon.f b/SRC/csycon.f
index b2dfbc86..5d468bd0 100644
--- a/SRC/csycon.f
+++ b/SRC/csycon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex symmetric matrix A using the factorization
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csyconv.f b/SRC/csyconv.f
index cec5068b..d00e4a9a 100644
--- a/SRC/csyconv.f
+++ b/SRC/csyconv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYCONV convert A given by TRF into L and D and vice-versa.
 *> Get Non-diag elements of D (returned in workspace) and 
 *> apply or reverse permutation done in TRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csyequb.f b/SRC/csyequb.f
index 421e42a9..c4cb24a9 100644
--- a/SRC/csyequb.f
+++ b/SRC/csyequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       REAL               S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYEQUB computes row and column scalings intended to equilibrate a
 *> symmetric matrix A and reduce its condition number
@@ -44,11 +44,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,19 +125,14 @@
 *
 *> \ingroup complexSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par References:
+*  ================
 *>
-*>  Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization",
-*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.
-*>  DOI 10.1023/B:NUMA.0000016606.32820.69
+*>  Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n
+*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n
+*>  DOI 10.1023/B:NUMA.0000016606.32820.69 \n
 *>  Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 *
diff --git a/SRC/csymv.f b/SRC/csymv.f
index ee7caedf..ea8f38e9 100644
--- a/SRC/csymv.f
+++ b/SRC/csymv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, INCY )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYMV  performs the matrix-vector  operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha and beta are scalars, x and y are n element vectors and
 *> A is an n by n symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -142,10 +141,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csyr.f b/SRC/csyr.f
index b6b1ed75..fe12790a 100644
--- a/SRC/csyr.f
+++ b/SRC/csyr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYR( UPLO, N, ALPHA, X, INCX, A, LDA )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYR   performs the symmetric rank 1 operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha is a complex scalar, x is an n element vector and A is an
 *> n by n symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -120,10 +119,9 @@
 *>           max( 1, N ).
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csyrfs.f b/SRC/csyrfs.f
index bd070ffb..9d25ecdd 100644
--- a/SRC/csyrfs.f
+++ b/SRC/csyrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -32,20 +32,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite, and
 *> provides error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -168,16 +167,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csyrfsx.f b/SRC/csyrfsx.f
index 216d39f2..2444bb86 100644
--- a/SRC/csyrfsx.f
+++ b/SRC/csyrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CSYRFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric indefinite, and
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -386,10 +383,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csysv.f b/SRC/csysv.f
index f9233e40..19ab3bc0 100644
--- a/SRC/csysv.f
+++ b/SRC/csysv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK,
 *                         LWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -48,11 +48,10 @@
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.  The factored form of A is then
 *> used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csysvx.f b/SRC/csysvx.f
index 34b8688d..1977c6bf 100644
--- a/SRC/csysvx.f
+++ b/SRC/csysvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B,
 *                          LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYSVX uses the diagonal pivoting factorization to compute the
 *> solution to a complex system of linear equations A * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -74,11 +77,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
@@ -265,10 +267,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 
diff --git a/SRC/csysvxx.f b/SRC/csysvxx.f
index 652e08b8..e867c19e 100644
--- a/SRC/csysvxx.f
+++ b/SRC/csysvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    CSYSVXX uses the diagonal pivoting factorization to compute the
 *>    solution to a complex system of linear equations A * X = B, where
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what CSYSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -108,11 +109,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(R) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -490,10 +490,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csyswapr.f b/SRC/csyswapr.f
index ec98d5d2..3d7a084a 100644
--- a/SRC/csyswapr.f
+++ b/SRC/csyswapr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYSWAPR( UPLO, N, A, LDA, I1, I2)
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       COMPLEX          A( LDA, N )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYSWAPR applies an elementary permutation on the rows and the columns of
 *> a symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          I2 is INTEGER
 *>          Index of the second row to swap
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csytf2.f b/SRC/csytf2.f
index 11c0d219..4fb46657 100644
--- a/SRC/csytf2.f
+++ b/SRC/csytf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYTF2 computes the factorization of a complex symmetric matrix A
 *> using the Bunch-Kaufman diagonal pivoting method:
@@ -45,11 +45,10 @@
 *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -110,10 +109,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -124,22 +122,10 @@
 *
 *> \ingroup complexSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  09-29-06 - patch from
-*>    Bobby Cheng, MathWorks
-*>
-*>    Replace l.209 and l.377
-*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
-*>    by
-*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN
-*>
-*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
-*>         Company
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -174,9 +160,25 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*> \verbatim
+*>
+*>  09-29-06 - patch from
+*>    Bobby Cheng, MathWorks
 *>
+*>    Replace l.209 and l.377
+*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
+*>    by
+*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN
+*>
+*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
+*>         Company
+*> \endverbatim
+*
 *  =====================================================================
       SUBROUTINE CSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 *
diff --git a/SRC/csytrf.f b/SRC/csytrf.f
index f3206b38..4da43693 100644
--- a/SRC/csytrf.f
+++ b/SRC/csytrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYTRF computes the factorization of a complex symmetric matrix A
 *> using the Bunch-Kaufman diagonal pivoting method.  The form of the
@@ -46,11 +46,10 @@
 *> with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, and division by zero will occur if it
 *>                is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup complexSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
@@ -180,7 +177,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/csytri.f b/SRC/csytri.f
index c41a0615..2229dedf 100644
--- a/SRC/csytri.f
+++ b/SRC/csytri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYTRI computes the inverse of a complex symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> CSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csytri2.f b/SRC/csytri2.f
index 92f9ec7c..152187a6 100644
--- a/SRC/csytri2.f
+++ b/SRC/csytri2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYTRI2 computes the inverse of a COMPLEX hermitian indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> CSYTRF. CSYTRI2 sets the LEADING DIMENSION of the workspace
 *> before calling CSYTRI2X that actually computes the inverse.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csytri2x.f b/SRC/csytri2x.f
index fd8c32b2..d230ee8a 100644
--- a/SRC/csytri2x.f
+++ b/SRC/csytri2x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), WORK( N+NB+1,* )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYTRI2X computes the inverse of a real symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> CSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csytrs.f b/SRC/csytrs.f
index 60c11782..8fb084ea 100644
--- a/SRC/csytrs.f
+++ b/SRC/csytrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYTRS solves a system of linear equations A*X = B with a complex
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by CSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/csytrs2.f b/SRC/csytrs2.f
index 81222c04..ec1e16c4 100644
--- a/SRC/csytrs2.f
+++ b/SRC/csytrs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, 
 *                           WORK, INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CSYTRS2 solves a system of linear equations A*X = B with a COMPLEX
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by CSYTRF and converted by CSYCONV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctbcon.f b/SRC/ctbcon.f
index 4508d9f5..5def298e 100644
--- a/SRC/ctbcon.f
+++ b/SRC/ctbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK,
 *                          RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTBCON estimates the reciprocal of the condition number of a
 *> triangular band matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -127,10 +126,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctbrfs.f b/SRC/ctbrfs.f
index 67bc1b21..15c90f5a 100644
--- a/SRC/ctbrfs.f
+++ b/SRC/ctbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTBRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular band
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by CTBTRS or some other
 *> means before entering this routine.  CTBRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -172,10 +171,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctbtrs.f b/SRC/ctbtrs.f
index 906c424b..a513945e 100644
--- a/SRC/ctbtrs.f
+++ b/SRC/ctbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTBTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular band matrix of order N, and B is an
 *> N-by-NRHS matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctfsm.f b/SRC/ctfsm.f
index 8b6e15c1..df67eceb 100644
--- a/SRC/ctfsm.f
+++ b/SRC/ctfsm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A,
 *                         B, LDB )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( 0: * ), B( 0: LDB-1, 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for A in RFP Format.
 *>
@@ -50,11 +50,10 @@
 *> A is in Rectangular Full Packed (RFP) Format.
 *>
 *> The matrix X is overwritten on B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -174,10 +173,9 @@
 *>           max( 1, m ).
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -188,10 +186,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -295,7 +292,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctftri.f b/SRC/ctftri.f
index ea606490..aae8af70 100644
--- a/SRC/ctftri.f
+++ b/SRC/ctftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTFTRI( TRANSR, UPLO, DIAG, N, A, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTFTRI computes the inverse of a triangular matrix A stored in RFP
 *> format.
 *>
 *> This is a Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -112,10 +110,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -219,7 +216,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctfttp.f b/SRC/ctfttp.f
index 501194a3..5622989f 100644
--- a/SRC/ctfttp.f
+++ b/SRC/ctfttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTFTTP( TRANSR, UPLO, N, ARF, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            AP( 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTFTTP copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -85,10 +84,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -99,10 +97,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -206,7 +203,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctfttr.f b/SRC/ctfttr.f
index 71479ed8..e23e9e39 100644
--- a/SRC/ctfttr.f
+++ b/SRC/ctfttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTFTTR copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,10 +105,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -214,7 +211,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctgevc.f b/SRC/ctgevc.f
index e9ba5b03..bc0912a9 100644
--- a/SRC/ctgevc.f
+++ b/SRC/ctgevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL,
 *                          LDVL, VR, LDVR, MM, M, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *       ..
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGEVC computes some or all of the right and/or left eigenvectors of
 *> a pair of complex matrices (S,P), where S and P are upper triangular.
@@ -63,11 +63,10 @@
 *> If Q and Z are the unitary factors from the generalized Schur
 *> factorization of a matrix pair (A,B), then Z*X and Q*Y
 *> are the matrices of right and left eigenvectors of (A,B).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -203,10 +202,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctgex2.f b/SRC/ctgex2.f
index 96076b44..75d48108 100644
--- a/SRC/ctgex2.f
+++ b/SRC/ctgex2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, J1, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGEX2 swaps adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22)
 *> in an upper triangular matrix pair (A, B) by an unitary equivalence
@@ -49,11 +49,10 @@
 *>        Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H
 *>        Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -145,10 +144,9 @@
 *>                from generalized Schur form; the problem is ill-
 *>                conditioned.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -159,26 +157,28 @@
 *
 *> \ingroup complexGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
-*>     Umea University, S-901 87 Umea, Sweden.
+*> \par Further Details:
+*  =====================
 *>
 *>  In the current code both weak and strong stability tests are
 *>  performed. The user can omit the strong stability test by changing
 *>  the internal logical parameter WANDS to .FALSE.. See ref. [2] for
 *>  details.
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+*>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
+*> \n
 *>  [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
 *>      Eigenvalues of a Regular Matrix Pair (A, B) and Condition
 *>      Estimation: Theory, Algorithms and Software, Report UMINF-94.04,
@@ -186,8 +186,6 @@
 *>      Sweden, 1994. Also as LAPACK Working Note 87. To appear in
 *>      Numerical Algorithms, 1996.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
      $                   LDZ, J1, INFO )
diff --git a/SRC/ctgexc.f b/SRC/ctgexc.f
index 7faed5c4..6abffec2 100644
--- a/SRC/ctgexc.f
+++ b/SRC/ctgexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, IFST, ILST, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGEXC reorders the generalized Schur decomposition of a complex
 *> matrix pair (A,B), using an unitary equivalence transformation
@@ -49,11 +49,10 @@
 *>
 *>        Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H
 *>        Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -155,10 +154,9 @@
 *>                and ILST points to the first row of the current
 *>                position of the block being moved.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -169,28 +167,27 @@
 *
 *> \ingroup complexGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
+*> \n
 *>  [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
 *>      Eigenvalues of a Regular Matrix Pair (A, B) and Condition
 *>      Estimation: Theory, Algorithms and Software, Report
 *>      UMINF - 94.04, Department of Computing Science, Umea University,
 *>      S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87.
 *>      To appear in Numerical Algorithms, 1996.
-*>
+*> \n
 *>  [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
 *>      Separation between Regular Matrix Pairs, Report UMINF - 93.23,
@@ -199,8 +196,6 @@
 *>      Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
 *>      1996.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
      $                   LDZ, IFST, ILST, INFO )
diff --git a/SRC/ctgsen.f b/SRC/ctgsen.f
index b9a17569..491f6b49 100644
--- a/SRC/ctgsen.f
+++ b/SRC/ctgsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB,
 *                          ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF,
@@ -36,11 +36,11 @@
 *      $                   BETA( * ), Q( LDQ, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGSEN reorders the generalized Schur decomposition of a complex
 *> matrix pair (A, B) (in terms of an unitary equivalence trans-
@@ -65,11 +65,10 @@
 *> and norms of "projections" onto left and right eigenspaces w.r.t.
 *> the selected cluster in the (1,1)-block.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -282,10 +281,9 @@
 *>                (A, B) may have been partially reordered.
 *>                If requested, 0 is returned in DIF(*), PL and PR.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -296,10 +294,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  CTGSEN first collects the selected eigenvalues by computing unitary
@@ -400,26 +397,29 @@
 *>  based estimate DIF is not wanted (see CLATDF), then the parameter
 *>  IDIFJB (see below) should be changed from 3 to 4 (routine CLATDF
 *>  (IJOB = 2 will be used)). See CTGSYL for more details.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*>  References
-*>  ==========
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
+*> \n
 *>  [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
 *>      Eigenvalues of a Regular Matrix Pair (A, B) and Condition
 *>      Estimation: Theory, Algorithms and Software, Report
 *>      UMINF - 94.04, Department of Computing Science, Umea University,
 *>      S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87.
 *>      To appear in Numerical Algorithms, 1996.
-*>
+*> \n
 *>  [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
 *>      Separation between Regular Matrix Pairs, Report UMINF - 93.23,
@@ -428,8 +428,6 @@
 *>      Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
 *>      1996.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB,
      $                   ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF,
diff --git a/SRC/ctgsja.f b/SRC/ctgsja.f
index 73f0e9b5..aee342b4 100644
--- a/SRC/ctgsja.f
+++ b/SRC/ctgsja.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B,
 *                          LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV,
@@ -34,11 +34,11 @@
 *      $                   U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGSJA computes the generalized singular value decomposition (GSVD)
 *> of two complex upper triangular (or trapezoidal) matrices A and B.
@@ -124,11 +124,10 @@
 *> The computation of the unitary transformation matrices U, V or Q
 *> is optional.  These matrices may either be formed explicitly, or they
 *> may be postmultiplied into input matrices U1, V1, or Q1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -333,20 +332,19 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          = 1:  the procedure does not converge after MAXIT cycles.
 *> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*> 
 *> \verbatim
 *>  MAXIT   INTEGER
 *>          MAXIT specifies the total loops that the iterative procedure
 *>          may take. If after MAXIT cycles, the routine fails to
 *>          converge, we return INFO = 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -357,10 +355,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  CTGSJA essentially uses a variant of Kogbetliantz algorithm to reduce
@@ -375,7 +372,6 @@
 *>                C1**2 + S1**2 = I,
 *>
 *>  and R1 is an L-by-L nonsingular upper triangular matrix.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctgsna.f b/SRC/ctgsna.f
index 474fbd8d..b864eda3 100644
--- a/SRC/ctgsna.f
+++ b/SRC/ctgsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL,
 *                          LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK,
@@ -34,22 +34,21 @@
 *      $                   VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or eigenvectors of a matrix pair (A, B).
 *>
 *> (A, B) must be in generalized Schur canonical form, that is, A and
 *> B are both upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -205,10 +204,9 @@
 *>          = 0: Successful exit
 *>          < 0: If INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -219,10 +217,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of the i-th generalized
@@ -275,13 +272,18 @@
 *>                      EPS * norm(A, B) / DIF(i).
 *>
 *>  See ref. [2-3] for more details and further references.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
-*>  References
-*>  ==========
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -302,7 +304,6 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75.
 *>      To appear in ACM Trans. on Math. Software, Vol 22, No 1, 1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctgsy2.f b/SRC/ctgsy2.f
index 6bcda945..879b2b25 100644
--- a/SRC/ctgsy2.f
+++ b/SRC/ctgsy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
@@ -32,11 +32,11 @@
 *      $                   D( LDD, * ), E( LDE, * ), F( LDF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGSY2 solves the generalized Sylvester equation
 *>
@@ -73,11 +73,10 @@
 *> of an upper bound on the separation between to matrix pairs. Then
 *> the input (A, D), (B, E) are sub-pencils of two matrix pairs in
 *> CTGSYL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -236,10 +235,9 @@
 *>            >0: The matrix pairs (A, D) and (B, E) have common or very
 *>                close eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -250,18 +248,12 @@
 *
 *> \ingroup complexSYauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE CTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
      $                   LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
diff --git a/SRC/ctgsyl.f b/SRC/ctgsyl.f
index 79efe853..9d142cfb 100644
--- a/SRC/ctgsyl.f
+++ b/SRC/ctgsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK,
@@ -35,11 +35,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTGSYL solves the generalized Sylvester equation:
 *>
@@ -79,11 +79,10 @@
 *> reciprocal of the smallest singular value of Z.
 *>
 *> This is a level-3 BLAS algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -252,10 +251,9 @@
 *>            >0: (A, D) and (B, E) have common or very close
 *>                eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -266,15 +264,14 @@
 *
 *> \ingroup complexSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
@@ -283,18 +280,16 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75.  To appear in ACM Trans. on Math. Software, Vol 22,
 *>      No 1, 1996.
-*>
+*> \n
 *>  [2] B. Kagstrom, A Perturbation Analysis of the Generalized Sylvester
 *>      Equation (AR - LB, DR - LE ) = (C, F), SIAM J. Matrix Anal.
 *>      Appl., 15(4):1045-1060, 1994.
-*>
+*> \n
 *>  [3] B. Kagstrom and L. Westin, Generalized Schur Methods with
 *>      Condition Estimators for Solving the Generalized Sylvester
 *>      Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7,
 *>      July 1989, pp 745-751.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
      $                   LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK,
diff --git a/SRC/ctpcon.f b/SRC/ctpcon.f
index e8de46f5..116a4afe 100644
--- a/SRC/ctpcon.f
+++ b/SRC/ctpcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, RWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPCON estimates the reciprocal of the condition number of a packed
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctpmqrt.f b/SRC/ctpmqrt.f
index 91a3620c..ad820db0 100644
--- a/SRC/ctpmqrt.f
+++ b/SRC/ctpmqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT,
 *                           A, LDA, B, LDB, WORK, INFO )
@@ -30,20 +30,19 @@
 *      $          WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPMQRT applies a complex orthogonal matrix Q obtained from a 
 *> "triangular-pentagonal" complex block reflector H to a general
 *> complex matrix C, which consists of two blocks A and B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -167,10 +166,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -181,10 +179,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The columns of the pentagonal matrix V contain the elementary reflectors
@@ -213,7 +210,6 @@
 *>  If TRANS='N' and SIDE='R', C is on exit replaced with C * Q.
 *>
 *>  If TRANS='C' and SIDE='R', C is on exit replaced with C * Q**H.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctpqrt.f b/SRC/ctpqrt.f
index 3a88bc47..369ddbe4 100644
--- a/SRC/ctpqrt.f
+++ b/SRC/ctpqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK,
 *                          INFO )
@@ -28,21 +28,20 @@
 *       COMPLEX A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPQRT computes a blocked QR factorization of a complex 
 *> "triangular-pentagonal" matrix C, which is composed of a 
 *> triangular block A and pentagonal block B, using the compact 
 *> WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,11 +136,11 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The input matrix C is a (N+M)-by-N matrix  
 *>
 *>               C = [ A ]
@@ -185,7 +183,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = [T1 T2 ... TB].
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctpqrt2.f b/SRC/ctpqrt2.f
index 8a57e993..44f215e9 100644
--- a/SRC/ctpqrt2.f
+++ b/SRC/ctpqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO )
 * 
@@ -27,20 +27,19 @@
 *       COMPLEX   A( LDA, * ), B( LDB, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPQRT2 computes a QR factorization of a complex "triangular-pentagonal"
 *> matrix C, which is composed of a triangular block A and pentagonal block B, 
 *> using the compact WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,10 +123,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The input matrix C is a (N+M)-by-N matrix  
@@ -171,7 +168,6 @@
 *>
 *>  where W**H is the conjugate transpose of W and T is the upper triangular
 *>  factor of the block reflector.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctprfb.f b/SRC/ctprfb.f
index c39cb0d6..5d4d1301 100644
--- a/SRC/ctprfb.f
+++ b/SRC/ctprfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, 
 *                          V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK )
@@ -30,20 +30,20 @@
 *      $          V( LDV, * ), WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPRFB applies a complex "triangular-pentagonal" block reflector H or its 
 *> conjugate transpose H**H to a complex matrix C, which is composed of two 
 *> blocks A and B, either from the left or right.
 *> 
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -185,10 +185,9 @@
 *>          If SIDE = 'L', LDWORK >= K; 
 *>          if SIDE = 'R', LDWORK >= M.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -199,10 +198,9 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix C is a composite matrix formed from blocks A and B.
@@ -247,7 +245,6 @@
 *>  If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L.
 *>
 *>  If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctprfs.f b/SRC/ctprfs.f
index 0cf567d4..307eca82 100644
--- a/SRC/ctprfs.f
+++ b/SRC/ctprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            AP( * ), B( LDB, * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular packed
@@ -43,11 +43,10 @@
 *> The solution matrix X must be computed by CTPTRS or some other
 *> means before entering this routine.  CTPRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -158,10 +157,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctptri.f b/SRC/ctptri.f
index 2d8b2b56..49e94486 100644
--- a/SRC/ctptri.f
+++ b/SRC/ctptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPTRI( UPLO, DIAG, N, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPTRI computes the inverse of a complex upper or lower triangular
 *> matrix A stored in packed format.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -83,10 +82,9 @@
 *>          > 0:  if INFO = i, A(i,i) is exactly zero.  The triangular
 *>                matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -97,10 +95,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A triangular matrix A can be transferred to packed storage using one
@@ -115,7 +112,6 @@
 *>      1    CONTINUE                    1    CONTINUE
 *>           JC = JC + J                      JC = JC + N - J + 1
 *>      2 CONTINUE                       2 CONTINUE
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctptrs.f b/SRC/ctptrs.f
index fde15200..3f3ac057 100644
--- a/SRC/ctptrs.f
+++ b/SRC/ctptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *> where A is a triangular matrix of order N stored in packed format,
 *> and B is an N-by-NRHS matrix.  A check is made to verify that A is
 *> nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctpttf.f b/SRC/ctpttf.f
index d97e4e38..9b495913 100644
--- a/SRC/ctpttf.f
+++ b/SRC/ctpttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPTTF( TRANSR, UPLO, N, AP, ARF, INFO )
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       COMPLEX            AP( 0: * ), ARF( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPTTF copies a triangular matrix A from standard packed format (TP)
 *> to rectangular full packed format (TF).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -84,10 +83,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -205,7 +202,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctpttr.f b/SRC/ctpttr.f
index 9a3b0b82..291916ff 100644
--- a/SRC/ctpttr.f
+++ b/SRC/ctpttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTPTTR( UPLO, N, AP, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTPTTR copies a triangular matrix A from standard packed format (TP)
 *> to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrcon.f b/SRC/ctrcon.f
index bbf7ddd2..0ad0634c 100644
--- a/SRC/ctrcon.f
+++ b/SRC/ctrcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK,
 *                          RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRCON estimates the reciprocal of the condition number of a
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -121,10 +120,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrevc.f b/SRC/ctrevc.f
index acb3e54a..4f6d5843 100644
--- a/SRC/ctrevc.f
+++ b/SRC/ctrevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, MM, M, WORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTREVC computes some or all of the right and/or left eigenvectors of
 *> a complex upper triangular matrix T.
@@ -57,11 +57,10 @@
 *> input matrix.  If Q is the unitary factor that reduces a matrix A to
 *> Schur form T, then Q*X and Q*Y are the matrices of right and left
 *> eigenvectors of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -188,10 +187,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -202,10 +200,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The algorithm used in this program is basically backward (forward)
@@ -215,7 +212,6 @@
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x| + |y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctrexc.f b/SRC/ctrexc.f
index 9722600e..10ae2764 100644
--- a/SRC/ctrexc.f
+++ b/SRC/ctrexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            Q( LDQ, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTREXC reorders the Schur factorization of a complex matrix
 *> A = Q*T*Q**H, so that the diagonal element of T with row index IFST
@@ -41,11 +41,10 @@
 *> The Schur form T is reordered by a unitary similarity transformation
 *> Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by
 *> postmultplying it with Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrrfs.f b/SRC/ctrrfs.f
index ad424186..30cfc42e 100644
--- a/SRC/ctrrfs.f
+++ b/SRC/ctrrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by CTRTRS or some other
 *> means before entering this routine.  CTRRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -166,10 +165,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrsen.f b/SRC/ctrsen.f
index ef22122b..6e1b3950 100644
--- a/SRC/ctrsen.f
+++ b/SRC/ctrsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, W, M, S,
 *                          SEP, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX            Q( LDQ, * ), T( LDT, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRSEN reorders the Schur factorization of a complex matrix
 *> A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in
@@ -45,11 +45,10 @@
 *>
 *> Optionally the routine computes the reciprocal condition numbers of
 *> the cluster of eigenvalues and/or the invariant subspace.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -174,10 +173,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -188,10 +186,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  CTRSEN first collects the selected eigenvalues by computing a unitary
@@ -261,7 +258,6 @@
 *>  error in the computed right invariant subspace is
 *>
 *>                      EPS * norm(T) / SEP
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctrsna.f b/SRC/ctrsna.f
index a0902024..c076239b 100644
--- a/SRC/ctrsna.f
+++ b/SRC/ctrsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, S, SEP, MM, M, WORK, LDWORK, RWORK,
@@ -33,20 +33,19 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or right eigenvectors of a complex upper triangular
 *> matrix T (or of any matrix Q*T*Q**H with Q unitary).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -189,10 +188,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,10 +201,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of an eigenvalue lambda is
@@ -245,7 +242,6 @@
 *>  is given by
 *>
 *>                      EPS * norm(T) / SEP(i)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctrsyl.f b/SRC/ctrsyl.f
index fea187f2..8a5e08ea 100644
--- a/SRC/ctrsyl.f
+++ b/SRC/ctrsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C,
 *                          LDC, SCALE, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRSYL solves the complex Sylvester matrix equation:
 *>
@@ -45,11 +45,10 @@
 *> M-by-M and B is N-by-N; the right hand side C and the solution X are
 *> M-by-N; and scale is an output scale factor, set <= 1 to avoid
 *> overflow in X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANA
 *> \verbatim
@@ -141,10 +140,9 @@
 *>               values were used to solve the equation (but the matrices
 *>               A and B are unchanged).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrti2.f b/SRC/ctrti2.f
index 5c11fd78..3eb78019 100644
--- a/SRC/ctrti2.f
+++ b/SRC/ctrti2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRTI2( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRTI2 computes the inverse of a complex upper or lower triangular
 *> matrix.
 *>
 *> This is the Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrtri.f b/SRC/ctrtri.f
index 71f9f23f..7e6a5a62 100644
--- a/SRC/ctrtri.f
+++ b/SRC/ctrtri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRTRI( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRTRI computes the inverse of a complex upper or lower triangular
 *> matrix A.
 *>
 *> This is the Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrtrs.f b/SRC/ctrtrs.f
index 70ccad25..7e9bc9f6 100644
--- a/SRC/ctrtrs.f
+++ b/SRC/ctrtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular matrix of order N, and B is an N-by-NRHS
 *> matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>               indicating that the matrix is singular and the solutions
 *>               X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctrttf.f b/SRC/ctrttf.f
index 2fcb8daa..089efe3d 100644
--- a/SRC/ctrttf.f
+++ b/SRC/ctrttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRTTF copies a triangular matrix A from standard full format (TR)
 *> to rectangular full packed format (TF) .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,10 +105,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -214,7 +211,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctrttp.f b/SRC/ctrttp.f
index 0ed6028c..9b44f448 100644
--- a/SRC/ctrttp.f
+++ b/SRC/ctrttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTRTTP( UPLO, N, A, LDA, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX            A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTRTTP copies a triangular matrix A from full format (TR) to standard
 *> packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ctzrqf.f b/SRC/ctzrqf.f
index 918fa2e4..06805c71 100644
--- a/SRC/ctzrqf.f
+++ b/SRC/ctzrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTZRQF( M, N, A, LDA, TAU, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine CTZRZF.
 *>
@@ -44,11 +44,10 @@
 *>
 *> where Z is an N-by-N unitary matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -105,10 +103,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The  factorization is obtained by Householder's method.  The kth
@@ -136,7 +133,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ctzrzf.f b/SRC/ctzrzf.f
index 95945e18..8c27b0ed 100644
--- a/SRC/ctzrzf.f
+++ b/SRC/ctzrzf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CTZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CTZRZF reduces the M-by-N ( M<=N ) complex upper trapezoidal matrix A
 *> to upper triangular form by means of unitary transformations.
@@ -42,11 +42,10 @@
 *>
 *> where Z is an N-by-N unitary matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -122,14 +120,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -156,7 +155,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cunbdb.f b/SRC/cunbdb.f
index 1f14986f..dfa3da9b 100644
--- a/SRC/cunbdb.f
+++ b/SRC/cunbdb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
 *                          X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
@@ -34,11 +34,11 @@
 *      $                   X21( LDX21, * ), X22( LDX22, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNBDB simultaneously bidiagonalizes the blocks of an M-by-M
 *> partitioned unitary matrix X:
@@ -60,11 +60,10 @@
 *>
 *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented
 *> implicitly by angles THETA, PHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -247,10 +246,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -261,10 +259,9 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The bidiagonal blocks B11, B12, B21, and B22 are represented
@@ -277,15 +274,14 @@
 *>  P1, P2, Q1, and Q2 are represented as products of elementary
 *>  reflectors. See CUNCSD for details on generating P1, P2, Q1, and Q2
 *>  using CUNGQR and CUNGLQ.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE CUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
      $                   X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
diff --git a/SRC/cuncsd.f b/SRC/cuncsd.f
index ad81209c..26d1f008 100644
--- a/SRC/cuncsd.f
+++ b/SRC/cuncsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE CUNCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS,
 *                                    SIGNS, M, P, Q, X11, LDX11, X12,
@@ -40,11 +40,11 @@
 *      $                   * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNCSD computes the CS decomposition of an M-by-M partitioned
 *> unitary matrix X:
@@ -61,11 +61,10 @@
 *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are
 *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in
 *> which R = MIN(P,M-P,Q,M-Q).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -293,17 +292,16 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  CBBCSD did not converge. See the description of RWORK
 *>                above for details.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
-*> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cung2l.f b/SRC/cung2l.f
index 731d3583..ebe417ac 100644
--- a/SRC/cung2l.f
+++ b/SRC/cung2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNG2L( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNG2L generates an m by n complex matrix Q with orthonormal columns,
 *> which is defined as the last n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by CGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cung2r.f b/SRC/cung2r.f
index 18b129ef..01c32f1e 100644
--- a/SRC/cung2r.f
+++ b/SRC/cung2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNG2R( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNG2R generates an m by n complex matrix Q with orthonormal columns,
 *> which is defined as the first n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by CGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cungbr.f b/SRC/cungbr.f
index 13e333ce..cd76c8e4 100644
--- a/SRC/cungbr.f
+++ b/SRC/cungbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGBR generates one of the complex unitary matrices Q or P**H
 *> determined by CGEBRD when reducing a complex matrix A to bidiagonal
@@ -52,11 +52,10 @@
 *> rows of P**H, where n >= m >= k;
 *> if k >= n, P**H = G(n-1) . . . G(2) G(1) and CUNGBR returns P**H as
 *> an N-by-N matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunghr.f b/SRC/cunghr.f
index 8288e163..b160bdf2 100644
--- a/SRC/cunghr.f
+++ b/SRC/cunghr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,22 +27,21 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGHR generates a complex unitary matrix Q which is defined as the
 *> product of IHI-ILO elementary reflectors of order N, as returned by
 *> CGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cungl2.f b/SRC/cungl2.f
index 3557ff54..62330453 100644
--- a/SRC/cungl2.f
+++ b/SRC/cungl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGL2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGL2 generates an m-by-n complex matrix Q with orthonormal rows,
 *> which is defined as the first m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k)**H . . . H(2)**H H(1)**H
 *>
 *> as returned by CGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunglq.f b/SRC/cunglq.f
index 8b263bf0..174f0d9b 100644
--- a/SRC/cunglq.f
+++ b/SRC/cunglq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGLQ generates an M-by-N complex matrix Q with orthonormal rows,
 *> which is defined as the first M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k)**H . . . H(2)**H H(1)**H
 *>
 *> as returned by CGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit;
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cungql.f b/SRC/cungql.f
index 59510b6c..8ad62750 100644
--- a/SRC/cungql.f
+++ b/SRC/cungql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGQL generates an M-by-N complex matrix Q with orthonormal columns,
 *> which is defined as the last N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by CGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cungqr.f b/SRC/cungqr.f
index 71b9294f..118da00d 100644
--- a/SRC/cungqr.f
+++ b/SRC/cungqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGQR generates an M-by-N complex matrix Q with orthonormal columns,
 *> which is defined as the first N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by CGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cungr2.f b/SRC/cungr2.f
index 4189f2f8..795ccc87 100644
--- a/SRC/cungr2.f
+++ b/SRC/cungr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGR2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGR2 generates an m by n complex matrix Q with orthonormal rows,
 *> which is defined as the last m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1)**H H(2)**H . . . H(k)**H
 *>
 *> as returned by CGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cungrq.f b/SRC/cungrq.f
index f6cca67d..88332a65 100644
--- a/SRC/cungrq.f
+++ b/SRC/cungrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGRQ generates an M-by-N complex matrix Q with orthonormal rows,
 *> which is defined as the last M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1)**H H(2)**H . . . H(k)**H
 *>
 *> as returned by CGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cungtr.f b/SRC/cungtr.f
index f31fe245..99535a84 100644
--- a/SRC/cungtr.f
+++ b/SRC/cungtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNGTR generates a complex unitary matrix Q which is defined as the
 *> product of n-1 elementary reflectors of order N, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunm2l.f b/SRC/cunm2l.f
index 5467ee77..2855dd7c 100644
--- a/SRC/cunm2l.f
+++ b/SRC/cunm2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNM2L overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by CGEQLF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunm2r.f b/SRC/cunm2r.f
index 72244b77..dcd536d6 100644
--- a/SRC/cunm2r.f
+++ b/SRC/cunm2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNM2R overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by CGEQRF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmbr.f b/SRC/cunmbr.f
index 785e540c..b5e0b11f 100644
--- a/SRC/cunmbr.f
+++ b/SRC/cunmbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> If VECT = 'Q', CUNMBR overwrites the general complex M-by-N matrix C
 *> with
@@ -63,11 +63,10 @@
 *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix:
 *> if k < nq, P = G(1) G(2) . . . G(k);
 *> if k >= nq, P = G(1) G(2) . . . G(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -181,10 +180,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmhr.f b/SRC/cunmhr.f
index 4fffdeaf..4bf11d01 100644
--- a/SRC/cunmhr.f
+++ b/SRC/cunmhr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMHR overwrites the general complex M-by-N matrix C with
 *>
@@ -47,11 +47,10 @@
 *> IHI-ILO elementary reflectors, as returned by CGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -163,10 +162,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunml2.f b/SRC/cunml2.f
index 196a6539..2280f6a9 100644
--- a/SRC/cunml2.f
+++ b/SRC/cunml2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNML2 overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by CGELQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmlq.f b/SRC/cunmlq.f
index 76740467..ff98edc7 100644
--- a/SRC/cunmlq.f
+++ b/SRC/cunmlq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMLQ overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by CGELQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmql.f b/SRC/cunmql.f
index 72147b56..916d0483 100644
--- a/SRC/cunmql.f
+++ b/SRC/cunmql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMQL overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by CGEQLF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmqr.f b/SRC/cunmqr.f
index cbeb19ae..97c00332 100644
--- a/SRC/cunmqr.f
+++ b/SRC/cunmqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMQR overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by CGEQRF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmr2.f b/SRC/cunmr2.f
index 1c438c9f..ba00fcb8 100644
--- a/SRC/cunmr2.f
+++ b/SRC/cunmr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMR2 overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by CGERQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmr3.f b/SRC/cunmr3.f
index 8d763b60..7fa2bb21 100644
--- a/SRC/cunmr3.f
+++ b/SRC/cunmr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMR3 overwrites the general complex m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by CTZRZF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,15 +163,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cunmrq.f b/SRC/cunmrq.f
index 093ae0b3..de5083be 100644
--- a/SRC/cunmrq.f
+++ b/SRC/cunmrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMRQ overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by CGERQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cunmrz.f b/SRC/cunmrz.f
index 42c6e3a2..d5c427a0 100644
--- a/SRC/cunmrz.f
+++ b/SRC/cunmrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMRZ overwrites the general complex M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by CTZRZF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -176,15 +174,15 @@
 *
 *> \ingroup complexOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/cunmtr.f b/SRC/cunmtr.f
index a4247d17..11310b09 100644
--- a/SRC/cunmtr.f
+++ b/SRC/cunmtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUNMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUNMTR overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cupgtr.f b/SRC/cupgtr.f
index 3b0eb54a..0a22dbb6 100644
--- a/SRC/cupgtr.f
+++ b/SRC/cupgtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX            AP( * ), Q( LDQ, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUPGTR generates a complex unitary matrix Q which is defined as the
 *> product of n-1 elementary reflectors H(i) of order n, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/cupmtr.f b/SRC/cupmtr.f
index ca04a085..132b6f05 100644
--- a/SRC/cupmtr.f
+++ b/SRC/cupmtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE CUPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX            AP( * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> CUPMTR overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -134,10 +133,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dbbcsd.f b/SRC/dbbcsd.f
index 23aaf533..0abc7923 100644
--- a/SRC/dbbcsd.f
+++ b/SRC/dbbcsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q,
 *                          THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T,
@@ -35,11 +35,11 @@
 *      $                   V2T( LDV2T, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DBBCSD computes the CS decomposition of an orthogonal matrix in
 *> bidiagonal-block form,
@@ -68,11 +68,10 @@
 *> The orthogonal matrices U1, U2, V1T, and V2T are input/output.
 *> The input matrices are pre- or post-multiplied by the appropriate
 *> singular vector matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -297,25 +296,26 @@
 *>          > 0:  if DBBCSD did not converge, INFO specifies the number
 *>                of nonzero entries in PHI, and B11D, B11E, etc.,
 *>                contain the partially reduced matrix.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Reference
-*>  =========
-*>
-*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
-*>      Algorithms, 50(1):33-65, 2009.
-*>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  DOUBLE PRECISION, default = MAX(10,MIN(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they
 *>          are within TOLMUL*EPS of either bound.
 *> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
+*>      Algorithms, 50(1):33-65, 2009.
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dbdsdc.f b/SRC/dbdsdc.f
index 1b15b4ad..4dded10a 100644
--- a/SRC/dbdsdc.f
+++ b/SRC/dbdsdc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ,
 *                          WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DBDSDC computes the singular value decomposition (SVD) of a real
 *> N-by-N (upper or lower) bidiagonal matrix B:  B = U * S * VT,
@@ -55,11 +55,10 @@
 *> The code currently calls DLASDQ if singular values only are desired.
 *> However, it can be slightly modified to compute singular values
 *> using the divide and conquer method.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -183,10 +182,9 @@
 *>          > 0:  The algorithm failed to compute a singular value.
 *>                The update process of divide and conquer failed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -197,18 +195,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ,
      $                   WORK, IWORK, INFO )
diff --git a/SRC/dbdsqr.f b/SRC/dbdsqr.f
index cab83f3b..33deafb8 100644
--- a/SRC/dbdsqr.f
+++ b/SRC/dbdsqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,
 *                          LDU, C, LDC, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DBDSQR computes the singular values and, optionally, the right and/or
 *> left singular vectors from the singular value decomposition (SVD) of
@@ -65,11 +65,10 @@
 *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics
 *> Department, University of California at Berkeley, July 1992
 *> for a detailed description of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -187,10 +186,12 @@
 *>                   elements of a bidiagonal matrix which is orthogonally
 *>                   similar to the input matrix B;  if INFO = i, i
 *>                   elements of E have not converged to zero.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  DOUBLE PRECISION, default = max(10,min(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          If it is positive, TOLMUL*EPS is the desired relative
@@ -212,10 +213,9 @@
 *>          (and so fails to converge) if the number of passes
 *>          through the inner loop exceeds MAXITR*N**2.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ddisna.f b/SRC/ddisna.f
index 6a72e74e..5594af99 100644
--- a/SRC/ddisna.f
+++ b/SRC/ddisna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DDISNA( JOB, M, N, D, SEP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * ), SEP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DDISNA computes the reciprocal condition numbers for the eigenvectors
 *> of a real symmetric or complex Hermitian matrix or for the left or
@@ -51,11 +51,10 @@
 *>
 *> DDISNA may also be used to compute error bounds for eigenvectors of
 *> the generalized symmetric definite eigenproblem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbbrd.f b/SRC/dgbbrd.f
index 9de990a8..bdfa1bc1 100644
--- a/SRC/dgbbrd.f
+++ b/SRC/dgbbrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q,
 *                          LDQ, PT, LDPT, C, LDC, WORK, INFO )
@@ -30,22 +30,21 @@
 *      $                   PT( LDPT, * ), Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBBRD reduces a real general m-by-n band matrix A to upper
 *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B.
 *>
 *> The routine computes B, and optionally forms Q or P**T, or computes
 *> Q**T*C for a given matrix C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -171,10 +170,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbcon.f b/SRC/dgbcon.f
index 3e7debd8..776ae162 100644
--- a/SRC/dgbcon.f
+++ b/SRC/dgbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND,
 *                          WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBCON estimates the reciprocal of the condition number of a real
 *> general band matrix A, in either the 1-norm or the infinity-norm,
@@ -44,11 +44,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -130,10 +129,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbequ.f b/SRC/dgbequ.f
index 109ff11c..29feef68 100644
--- a/SRC/dgbequ.f
+++ b/SRC/dgbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBEQU computes row and column scalings intended to equilibrate an
 *> M-by-N band matrix A and reduce its condition number.  R returns the
@@ -45,11 +45,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -137,10 +136,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbequb.f b/SRC/dgbequb.f
index 7d302b21..96a22a6c 100644
--- a/SRC/dgbequb.f
+++ b/SRC/dgbequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                           AMAX, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -52,11 +52,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -144,10 +143,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbrfs.f b/SRC/dgbrfs.f
index 2dba93a0..5ddb96a0 100644
--- a/SRC/dgbrfs.f
+++ b/SRC/dgbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK,
@@ -32,20 +32,19 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is banded, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -180,16 +179,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbrfsx.f b/SRC/dgbrfsx.f
index 86839c82..1972ddf0 100644
--- a/SRC/dgbrfsx.f
+++ b/SRC/dgbrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DGBRFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -58,11 +56,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -423,10 +420,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbsv.f b/SRC/dgbsv.f
index e8db8a11..12eafd39 100644
--- a/SRC/dgbsv.f
+++ b/SRC/dgbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBSV computes the solution to a real system of linear equations
 *> A * X = B, where A is a band matrix of order N with KL subdiagonals
@@ -43,11 +43,10 @@
 *> and unit lower triangular matrices with KL subdiagonals, and U is
 *> upper triangular with KL+KU superdiagonals.  The factored form of A
 *> is then used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -125,10 +124,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,10 +137,9 @@
 *
 *> \ingroup doubleGBsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -160,7 +157,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgbsvx.f b/SRC/dgbsvx.f
index e33e31a2..2d1a7ce6 100644
--- a/SRC/dgbsvx.f
+++ b/SRC/dgbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                          LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBSVX uses the LU factorization to compute the solution to a real
 *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed by this subroutine:
 *>
@@ -87,11 +90,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -349,10 +351,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 
diff --git a/SRC/dgbsvxx.f b/SRC/dgbsvxx.f
index f35aa518..98506d09 100644
--- a/SRC/dgbsvxx.f
+++ b/SRC/dgbsvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -39,11 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DGBSVXX uses the LU factorization to compute the solution to a
 *>    double precision system of linear equations  A * X = B,  where A is an
@@ -63,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what DGBSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -107,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -538,10 +540,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgbtf2.f b/SRC/dgbtf2.f
index 174c1712..e257fd02 100644
--- a/SRC/dgbtf2.f
+++ b/SRC/dgbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBTF2 computes an LU factorization of a real m-by-n band matrix A
 *> using partial pivoting with row interchanges.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup doubleGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -143,7 +140,6 @@
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U, because of fill-in resulting from the row
 *>  interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgbtrf.f b/SRC/dgbtrf.f
index 76f57cb4..23ab50c1 100644
--- a/SRC/dgbtrf.f
+++ b/SRC/dgbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBTRF computes an LU factorization of a real m-by-n band matrix A
 *> using partial pivoting with row interchanges.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup doubleGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -142,7 +139,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgbtrs.f b/SRC/dgbtrs.f
index 5b4eacf7..1ec18a3f 100644
--- a/SRC/dgbtrs.f
+++ b/SRC/dgbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGBTRS solves a system of linear equations
 *>    A * X = B  or  A**T * X = B
 *> with a general band matrix A using the LU factorization computed
 *> by DGBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgebak.f b/SRC/dgebak.f
index 4cf10a46..8e0483eb 100644
--- a/SRC/dgebak.f
+++ b/SRC/dgebak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV,
 *                          INFO )
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   SCALE( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEBAK forms the right or left eigenvectors of a real general matrix
 *> by backward transformation on the computed eigenvectors of the
 *> balanced matrix output by DGEBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgebal.f b/SRC/dgebal.f
index c39015f5..8f8e9e80 100644
--- a/SRC/dgebal.f
+++ b/SRC/dgebal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), SCALE( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEBAL balances a general real matrix A.  This involves, first,
 *> permuting A by a similarity transformation to isolate eigenvalues
@@ -43,11 +43,10 @@
 *>
 *> Balancing may reduce the 1-norm of the matrix, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,10 +125,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The permutations consist of row and column interchanges which put
@@ -158,7 +155,6 @@
 *>
 *>  Modified by Tzu-Yi Chen, Computer Science Division, University of
 *>    California at Berkeley, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgebd2.f b/SRC/dgebd2.f
index a68b64fc..8056451e 100644
--- a/SRC/dgebd2.f
+++ b/SRC/dgebd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )
 * 
@@ -28,21 +28,20 @@
 *      $                   TAUQ( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEBD2 reduces a real general m by n matrix A to upper or lower
 *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0: successful exit.
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -187,7 +184,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgebrd.f b/SRC/dgebrd.f
index da5ba9c5..a26171a7 100644
--- a/SRC/dgebrd.f
+++ b/SRC/dgebrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK,
 *                          INFO )
@@ -29,21 +29,20 @@
 *      $                   TAUQ( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEBRD reduces a general real M-by-N matrix A to upper or lower
 *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -139,10 +138,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -153,10 +151,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -202,7 +199,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgecon.f b/SRC/dgecon.f
index 540f1107..193329da 100644
--- a/SRC/dgecon.f
+++ b/SRC/dgecon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGECON estimates the reciprocal of the condition number of a general
 *> real matrix A, in either the 1-norm or the infinity-norm, using
@@ -44,11 +44,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgeequ.f b/SRC/dgeequ.f
index 13adbfac..d9768070 100644
--- a/SRC/dgeequ.f
+++ b/SRC/dgeequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEEQU computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -45,11 +45,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -123,10 +122,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgeequb.f b/SRC/dgeequb.f
index 625458ce..23de050b 100644
--- a/SRC/dgeequb.f
+++ b/SRC/dgeequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                           INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -52,11 +52,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgees.f b/SRC/dgees.f
index d2889236..c9f4be51 100644
--- a/SRC/dgees.f
+++ b/SRC/dgees.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, WR, WI,
 *                         VS, LDVS, WORK, LWORK, BWORK, INFO )
@@ -35,11 +35,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEES computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues, the real Schur form T, and, optionally, the matrix of
@@ -57,11 +57,10 @@
 *>         [  c  a  ]
 *>
 *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -200,10 +199,9 @@
 *>                   the Schur form no longer satisfy SELECT=.TRUE.  This
 *>                   could also be caused by underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgeesx.f b/SRC/dgeesx.f
index 0f648b56..6776b2f0 100644
--- a/SRC/dgeesx.f
+++ b/SRC/dgeesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM,
 *                          WR, WI, VS, LDVS, RCONDE, RCONDV, WORK, LWORK,
@@ -38,11 +38,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEESX computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues, the real Schur form T, and, optionally, the matrix of
@@ -67,11 +67,10 @@
 *>           [  c  a  ]
 *>
 *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -264,10 +263,9 @@
 *>                   the Schur form no longer satisfy SELECT=.TRUE.  This
 *>                   could also be caused by underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgeev.f b/SRC/dgeev.f
index e1ceb714..adeeb7bc 100644
--- a/SRC/dgeev.f
+++ b/SRC/dgeev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEEV( JOBVL, JOBVR, N, A, LDA, WR, WI, VL, LDVL, VR,
 *                         LDVR, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WI( * ), WORK( * ), WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEEV computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -48,11 +48,10 @@
 *>
 *> The computed eigenvectors are normalized to have Euclidean norm
 *> equal to 1 and largest component real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -173,10 +172,9 @@
 *>                elements i+1:N of WR and WI contain eigenvalues which
 *>                have converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgeevx.f b/SRC/dgeevx.f
index fbcff637..f110f1d2 100644
--- a/SRC/dgeevx.f
+++ b/SRC/dgeevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, WR, WI,
 *                          VL, LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM,
@@ -34,11 +34,11 @@
 *      $                   WI( * ), WORK( * ), WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEEVX computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -69,11 +69,10 @@
 *> (in exact arithmetic) but diagonal scaling will.  For further
 *> explanation of balancing, see section 4.10.2 of the LAPACK
 *> Users' Guide.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -286,10 +285,9 @@
 *>                have been computed; elements 1:ILO-1 and i+1:N of WR
 *>                and WI contain eigenvalues which have converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgegs.f b/SRC/dgegs.f
index cd10b6dd..c30c2fa7 100644
--- a/SRC/dgegs.f
+++ b/SRC/dgegs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHAR,
 *                         ALPHAI, BETA, VSL, LDVSL, VSR, LDVSR, WORK,
@@ -32,11 +32,11 @@
 *      $                   VSR( LDVSR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine DGGES.
 *>
@@ -57,11 +57,10 @@
 *> DGEGV should be used instead.  See DGEGV for a description of the
 *> eigenvalues of the generalized nonsymmetric eigenvalue problem
 *> (GNEP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -210,10 +209,9 @@
 *>                =N+8: error return from DGGBAK (computing VSR)
 *>                =N+9: error return from DLASCL (various places)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgegv.f b/SRC/dgegv.f
index b22b7e58..9c355844 100644
--- a/SRC/dgegv.f
+++ b/SRC/dgegv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI,
 *                         BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine DGGEV.
 *>
@@ -67,11 +67,10 @@
 *> are left eigenvectors of (A,B).
 *>
 *> Note: this routine performs "full balancing" on A and B
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -257,10 +256,9 @@
 *>                =N+9: error return from DGGBAK (computing VR)
 *>                =N+10: error return from DLASCL (various calls)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -271,10 +269,9 @@
 *
 *> \ingroup doubleGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing
@@ -303,7 +300,6 @@
 *>
 *>  [*] See DHGEQZ, DGEGS, or read the book "Matrix Computations",
 *>      by Golub & van Loan, pub. by Johns Hopkins U. Press.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgehd2.f b/SRC/dgehd2.f
index e2ab7ffa..7c05f86c 100644
--- a/SRC/dgehd2.f
+++ b/SRC/dgehd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEHD2 reduces a real general matrix A to upper Hessenberg form H by
 *> an orthogonal similarity transformation:  Q**T * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -112,10 +110,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -147,7 +144,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgehrd.f b/SRC/dgehrd.f
index fdf8f6b2..a4b02143 100644
--- a/SRC/dgehrd.f
+++ b/SRC/dgehrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION  A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEHRD reduces a real general matrix A to upper Hessenberg form H by
 *> an orthogonal similarity transformation:  Q**T * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,10 +125,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -166,7 +163,6 @@
 *>  This file is a slight modification of LAPACK-3.0's DGEHRD
 *>  subroutine incorporating improvements proposed by Quintana-Orti and
 *>  Van de Geijn (2006). (See DLAHR2.)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgejsv.f b/SRC/dgejsv.f
index 345b6abe..98302cf8 100644
--- a/SRC/dgejsv.f
+++ b/SRC/dgejsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP,
 *                          M, N, A, LDA, SVA, U, LDU, V, LDV,
@@ -33,11 +33,11 @@
 *       CHARACTER*1 JOBA, JOBP, JOBR, JOBT, JOBU, JOBV
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEJSV computes the singular value decomposition (SVD) of a real M-by-N
 *> matrix [A], where M >= N. The SVD of [A] is written as
@@ -51,11 +51,10 @@
 *> the right singular vectors of [A], respectively. The matrices [U] and [V]
 *> are computed and stored in the arrays U and V, respectively. The diagonal
 *> of [SIGMA] is computed and stored in the array SVA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBA
 *> \verbatim
@@ -381,10 +380,9 @@
 *>           > 0 :  DGEJSV  did not converge in the maximal allowed number
 *>                  of sweeps. The computed values may be inaccurate.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -395,10 +393,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  DGEJSV implements a preconditioned Jacobi SVD algorithm. It uses DGEQP3,
@@ -439,12 +436,17 @@
 *>  this extra QRF step easily. The implementer can also improve data movement
 *>  (matrix transpose, matrix copy, matrix transposed copy) - this
 *>  implementation of DGEJSV uses only the simplest, naive data movement.
-*>
-*>  Contributors
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
 *>  Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*
+*> \par References:
+*  ================
 *>
-*>  References
+*> \verbatim
 *>
 *> [1] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I.
 *>     SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342.
@@ -459,14 +461,14 @@
 *> [4] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV,
 *>     QSVD, (H,K)-SVD computations.
 *>     Department of Mathematics, University of Zagreb, 2008.
-*>
-*>  Bugs, examples and comments
+*> \endverbatim
+*
+*>  \par Bugs, examples and comments:
+*   =================================
 *>
 *>  Please report all bugs and send interesting examples and/or comments to
 *>  drmac@math.hr. Thank you.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP,
      $                   M, N, A, LDA, SVA, U, LDU, V, LDV,
diff --git a/SRC/dgelq2.f b/SRC/dgelq2.f
index d53a278b..7b298b70 100644
--- a/SRC/dgelq2.f
+++ b/SRC/dgelq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGELQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGELQ2 computes an LQ factorization of a real m by n matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgelqf.f b/SRC/dgelqf.f
index 4ca356b0..d404f13f 100644
--- a/SRC/dgelqf.f
+++ b/SRC/dgelqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGELQF computes an LQ factorization of a real M-by-N matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -133,7 +130,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgels.f b/SRC/dgels.f
index ac76f110..056cb755 100644
--- a/SRC/dgels.f
+++ b/SRC/dgels.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK,
 *                         INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGELS solves overdetermined or underdetermined real linear systems
 *> involving an M-by-N matrix A, or its transpose, using a QR or LQ
@@ -59,11 +59,10 @@
 *> handled in a single call; they are stored as the columns of the
 *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution
 *> matrix X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -167,10 +166,9 @@
 *>                full rank; the least squares solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgelsd.f b/SRC/dgelsd.f
index 4f40929c..6a0e82b7 100644
--- a/SRC/dgelsd.f
+++ b/SRC/dgelsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
 *                          WORK, LWORK, IWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), S( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGELSD computes the minimum-norm solution to a real linear least
 *> squares problem:
@@ -65,11 +65,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -186,10 +185,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -200,19 +198,13 @@
 *
 *> \ingroup doubleGEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE DGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
      $                   WORK, LWORK, IWORK, INFO )
diff --git a/SRC/dgelss.f b/SRC/dgelss.f
index 3be272d8..60aeb8e4 100644
--- a/SRC/dgelss.f
+++ b/SRC/dgelss.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), S( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGELSS computes the minimum norm solution to a real linear least
 *> squares problem:
@@ -51,11 +51,10 @@
 *> The effective rank of A is determined by treating as zero those
 *> singular values which are less than RCOND times the largest singular
 *> value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -156,10 +155,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgelsx.f b/SRC/dgelsx.f
index 0af3de82..c75b8d5d 100644
--- a/SRC/dgelsx.f
+++ b/SRC/dgelsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine DGELSY.
 *>
@@ -65,11 +65,10 @@
 *>    X = P * Z**T [ inv(T11)*Q1**T*B ]
 *>                 [        0         ]
 *> where Q1 consists of the first RANK columns of Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgelsy.f b/SRC/dgelsy.f
index 2aa8a49f..a8c06913 100644
--- a/SRC/dgelsy.f
+++ b/SRC/dgelsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGELSY computes the minimum-norm solution to a real linear least
 *> squares problem:
@@ -72,11 +72,10 @@
 *>   o Matrix B (the right hand side) is updated with Blas-3.
 *>   o The permutation of matrix B (the right hand side) is faster and
 *>     more simple.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -181,10 +180,9 @@
 *>          = 0: successful exit
 *>          < 0: If INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -195,18 +193,12 @@
 *
 *> \ingroup doubleGEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>
-*> \endverbatim
+*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n 
+*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
+*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
 *>
 *  =====================================================================
       SUBROUTINE DGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
diff --git a/SRC/dgemqrt.f b/SRC/dgemqrt.f
index 3ff66ac9..33090b91 100644
--- a/SRC/dgemqrt.f
+++ b/SRC/dgemqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, 
 *                          C, LDC, WORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEMQRT overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> generated using the compact WY representation as returned by DGEQRT. 
 *>
 *> Q is of order M if SIDE = 'L' and of order N  if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgeql2.f b/SRC/dgeql2.f
index d085395d..1747b0b9 100644
--- a/SRC/dgeql2.f
+++ b/SRC/dgeql2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQL2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQL2 computes a QL factorization of a real m by n matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqlf.f b/SRC/dgeqlf.f
index 5c372e9d..c5339254 100644
--- a/SRC/dgeqlf.f
+++ b/SRC/dgeqlf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQLF computes a QL factorization of a real M-by-N matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqp3.f b/SRC/dgeqp3.f
index 30f2f321..e277151b 100644
--- a/SRC/dgeqp3.f
+++ b/SRC/dgeqp3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQP3 computes a QR factorization with column pivoting of a
 *> matrix A:  A*P = Q*R  using Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0: successful exit.
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -126,10 +124,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -143,13 +140,14 @@
 *>  where tau is a real/complex scalar, and v is a real/complex vector
 *>  with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in
 *>  A(i+1:m,i), and tau in TAU(i).
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO )
 *
diff --git a/SRC/dgeqpf.f b/SRC/dgeqpf.f
index d9c2bce0..077d2f92 100644
--- a/SRC/dgeqpf.f
+++ b/SRC/dgeqpf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQPF( M, N, A, LDA, JPVT, TAU, WORK, INFO )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine DGEQP3.
 *>
 *> DGEQPF computes a QR factorization with column pivoting of a
 *> real M-by-N matrix A: A*P = Q*R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,10 +112,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -140,7 +137,6 @@
 *>    University of Zagreb, Croatia.
 *>  -- April 2011                                                      --
 *>  For more details see LAPACK Working Note 176.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqr2.f b/SRC/dgeqr2.f
index b9c8f845..1498e248 100644
--- a/SRC/dgeqr2.f
+++ b/SRC/dgeqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQR2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQR2 computes a QR factorization of a real m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqr2p.f b/SRC/dgeqr2p.f
index fce83780..1e365fca 100644
--- a/SRC/dgeqr2p.f
+++ b/SRC/dgeqr2p.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQR2P( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQR2 computes a QR factorization of a real m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqrf.f b/SRC/dgeqrf.f
index 50254dc4..90b48552 100644
--- a/SRC/dgeqrf.f
+++ b/SRC/dgeqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQRF computes a QR factorization of a real M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqrfp.f b/SRC/dgeqrfp.f
index 07ce01b1..01723611 100644
--- a/SRC/dgeqrfp.f
+++ b/SRC/dgeqrfp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQRFP computes a QR factorization of a real M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqrt.f b/SRC/dgeqrt.f
index 2ef1a0e5..c1071dd3 100644
--- a/SRC/dgeqrt.f
+++ b/SRC/dgeqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION A( LDA, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQRT computes a blocked QR factorization of a real M-by-N matrix A
 *> using the compact WY representation of Q.  
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,11 +112,11 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
 *>  below the diagonal. For example, if M=5 and N=3, the matrix V is
 *>
@@ -138,7 +136,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = (T1 T2 ... TB).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqrt2.f b/SRC/dgeqrt2.f
index a82abc94..01d52330 100644
--- a/SRC/dgeqrt2.f
+++ b/SRC/dgeqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGEQRT2( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQRT2 computes a QR factorization of a real M-by-N matrix A, 
 *> using the compact WY representation of Q. 
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -125,7 +122,6 @@
 *>               H = I - V * T * V**T
 *>
 *>  where V**T is the transpose of V.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgeqrt3.f b/SRC/dgeqrt3.f
index 5e81b1a0..00e0af1f 100644
--- a/SRC/dgeqrt3.f
+++ b/SRC/dgeqrt3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE DGEQRT3( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,22 +27,21 @@
 *       DOUBLE PRECISION   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGEQRT3 recursively computes a QR factorization of a real M-by-N 
 *> matrix A, using the compact WY representation of Q. 
 *>
 *> Based on the algorithm of Elmroth and Gustavson, 
 *> IBM J. Res. Develop. Vol 44 No. 4 July 2000.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -106,10 +104,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -130,7 +127,6 @@
 *>  where V**T is the transpose of V.
 *>
 *>  For details of the algorithm, see Elmroth and Gustavson (cited above).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgerfs.f b/SRC/dgerfs.f
index 62485c0a..9a9f2f3b 100644
--- a/SRC/dgerfs.f
+++ b/SRC/dgerfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,20 +31,19 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGERFS improves the computed solution to a system of linear
 *> equations and provides error bounds and backward error estimates for
 *> the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -161,16 +160,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgerfsx.f b/SRC/dgerfsx.f
index 523cf340..144ed7b4 100644
--- a/SRC/dgerfsx.f
+++ b/SRC/dgerfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DGERFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -398,10 +395,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgerq2.f b/SRC/dgerq2.f
index 15ec9557..6f6647e6 100644
--- a/SRC/dgerq2.f
+++ b/SRC/dgerq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGERQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGERQ2 computes an RQ factorization of a real m by n matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in
 *>  A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgerqf.f b/SRC/dgerqf.f
index a97926a8..ba420914 100644
--- a/SRC/dgerqf.f
+++ b/SRC/dgerqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGERQF computes an RQ factorization of a real M-by-N matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in
 *>  A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgesc2.f b/SRC/dgesc2.f
index 7150c64a..db8e91fc 100644
--- a/SRC/dgesc2.f
+++ b/SRC/dgesc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), RHS( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGESC2 solves a system of linear equations
 *>
@@ -41,11 +41,10 @@
 *>
 *> with a general N-by-N matrix A using the LU factorization with
 *> complete pivoting computed by DGETC2.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          On exit, SCALE contains the scale factor. SCALE is chosen
 *>          0 <= SCALE <= 1 to prevent owerflow in the solution.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,18 +105,12 @@
 *
 *> \ingroup doubleGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 *
diff --git a/SRC/dgesdd.f b/SRC/dgesdd.f
index ed99f34a..1190515b 100644
--- a/SRC/dgesdd.f
+++ b/SRC/dgesdd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK,
 *                          LWORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGESDD computes the singular value decomposition (SVD) of a real
 *> M-by-N matrix A, optionally computing the left and right singular
@@ -61,11 +61,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -195,10 +194,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  DBDSDC did not converge, updating process failed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -209,18 +207,12 @@
 *
 *> \ingroup doubleGEsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK,
      $                   LWORK, IWORK, INFO )
diff --git a/SRC/dgesv.f b/SRC/dgesv.f
index 2178dc8c..74a355fc 100644
--- a/SRC/dgesv.f
+++ b/SRC/dgesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGESV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -44,11 +44,10 @@
 *> where P is a permutation matrix, L is unit lower triangular, and U is
 *> upper triangular.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -107,10 +106,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgesvd.f b/SRC/dgesvd.f
index 1b8e0f86..3ab77a08 100644
--- a/SRC/dgesvd.f
+++ b/SRC/dgesvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGESVD computes the singular value decomposition (SVD) of a real
 *> M-by-N matrix A, optionally computing the left and/or right singular
@@ -50,11 +50,10 @@
 *> U and V are the left and right singular vectors of A.
 *>
 *> Note that the routine returns V**T, not V.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -195,10 +194,9 @@
 *>                did not converge to zero. See the description of WORK
 *>                above for details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgesvj.f b/SRC/dgesvj.f
index 6e0bfdd3..9d842572 100644
--- a/SRC/dgesvj.f
+++ b/SRC/dgesvj.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V,
 *                          LDV, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( LWORK )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGESVJ computes the singular value decomposition (SVD) of a real
 *> M-by-N matrix A, where M >= N. The SVD of A is written as
@@ -45,11 +45,10 @@
 *> matrix, and V is an N-by-N orthogonal matrix. The diagonal elements
 *> of SIGMA are the singular values of A. The columns of U and V are the
 *> left and the right singular vectors of A, respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBA
 *> \verbatim
@@ -250,10 +249,9 @@
 *>                of sweeps. The output may still be useful. See the
 *>                description of WORK.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -264,10 +262,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The orthogonal N-by-N matrix V is obtained as a product of Jacobi plane
@@ -288,14 +285,22 @@
 *>  number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even
 *>  denormalized singular values can be computed with the corresponding
 *>  gradual loss of accurate digits.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*> \verbatim
 *>
-*>  Contributors
 *>  ============
 *>
 *>  Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
-*>  References
-*>  ==========
+*> \verbatim
 *>
 *> [1] A. A. Anda and H. Park: Fast plane rotations with dynamic scaling.
 *>     SIAM J. matrix Anal. Appl., Vol. 15 (1994), pp. 162-174.
@@ -315,12 +320,15 @@
 *> [7] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV,
 *>     QSVD, (H,K)-SVD computations.
 *>     Department of Mathematics, University of Zagreb, 2008.
+*> \endverbatim
+*
+*>  \par Bugs, examples and comments:
+*   =================================
 *>
-*>  Bugs, Examples and Comments
+*> \verbatim
 *>  ===========================
 *>  Please report all bugs and send interesting test examples and comments to
 *>  drmac@math.hr. Thank you.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgesvx.f b/SRC/dgesvx.f
index 798ff9f6..00be2d4a 100644
--- a/SRC/dgesvx.f
+++ b/SRC/dgesvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                          EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGESVX uses the LU factorization to compute the solution to a real
 *> system of linear equations
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -86,11 +89,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -329,10 +331,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 
diff --git a/SRC/dgesvxx.f b/SRC/dgesvxx.f
index 88411a3c..a986953c 100644
--- a/SRC/dgesvxx.f
+++ b/SRC/dgesvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW,
@@ -39,11 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DGESVXX uses the LU factorization to compute the solution to a
 *>    double precision system of linear equations  A * X = B,  where A is an
@@ -63,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what DGESVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -107,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -518,10 +520,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgetc2.f b/SRC/dgetc2.f
index a13abbc4..28ee0ab7 100644
--- a/SRC/dgetc2.f
+++ b/SRC/dgetc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETC2( N, A, LDA, IPIV, JPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGETC2 computes an LU factorization with complete pivoting of the
 *> n-by-n matrix A. The factorization has the form A = P * L * U * Q,
@@ -40,11 +40,10 @@
 *> unit diagonal elements and U is upper triangular.
 *>
 *> This is the Level 2 BLAS algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>                we try to solve for x in Ax = b. So U is perturbed to
 *>                avoid the overflow.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,18 +102,12 @@
 *
 *> \ingroup doubleGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DGETC2( N, A, LDA, IPIV, JPIV, INFO )
 *
diff --git a/SRC/dgetf2.f b/SRC/dgetf2.f
index 9cd144d4..ca786031 100644
--- a/SRC/dgetf2.f
+++ b/SRC/dgetf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETF2( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGETF2 computes an LU factorization of a general m-by-n matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgetrf.f b/SRC/dgetrf.f
index df349aac..503271ab 100644
--- a/SRC/dgetrf.f
+++ b/SRC/dgetrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGETRF computes an LU factorization of a general M-by-N matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgetri.f b/SRC/dgetri.f
index 82b32cc0..e74d34dd 100644
--- a/SRC/dgetri.f
+++ b/SRC/dgetri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -28,22 +28,21 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGETRI computes the inverse of a matrix using the LU factorization
 *> computed by DGETRF.
 *>
 *> This method inverts U and then computes inv(A) by solving the system
 *> inv(A)*L = inv(U) for inv(A).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0:  if INFO = i, U(i,i) is exactly zero; the matrix is
 *>                singular and its inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgetrs.f b/SRC/dgetrs.f
index ddebc68f..eb17b9fc 100644
--- a/SRC/dgetrs.f
+++ b/SRC/dgetrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,21 +29,20 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGETRS solves a system of linear equations
 *>    A * X = B  or  A**T * X = B
 *> with a general N-by-N matrix A using the LU factorization computed
 *> by DGETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dggbak.f b/SRC/dggbak.f
index 0b945e35..f07fe409 100644
--- a/SRC/dggbak.f
+++ b/SRC/dggbak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V,
 *                          LDV, INFO )
@@ -29,21 +29,20 @@
 *       DOUBLE PRECISION   LSCALE( * ), RSCALE( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGBAK forms the right or left eigenvectors of a real generalized
 *> eigenvalue problem A*x = lambda*B*x, by backward transformation on
 *> the computed eigenvectors of the balanced pair of matrices output by
 *> DGGBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,15 +134,13 @@
 *
 *> \ingroup doubleGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. Ward, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dggbal.f b/SRC/dggbal.f
index e8bf1cbe..3c56f888 100644
--- a/SRC/dggbal.f
+++ b/SRC/dggbal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE,
 *                          RSCALE, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   RSCALE( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGBAL balances a pair of general real matrices (A,B).  This
 *> involves, first, permuting A and B by similarity transformations to
@@ -46,11 +46,10 @@
 *> Balancing may reduce the 1-norm of the matrices, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors in the
 *> generalized eigenvalue problem A*x = lambda*B*x.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -166,15 +164,13 @@
 *
 *> \ingroup doubleGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. WARD, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgges.f b/SRC/dgges.f
index 44b8f6b1..46fb7e9c 100644
--- a/SRC/dgges.f
+++ b/SRC/dgges.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB,
 *                         SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL, VSR,
@@ -37,11 +37,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGES computes for a pair of N-by-N real nonsymmetric matrices (A,B),
 *> the generalized eigenvalues, the generalized real Schur form (S,T),
@@ -76,11 +76,10 @@
 *> and the pair of corresponding 2-by-2 blocks in S and T will have a
 *> complex conjugate pair of generalized eigenvalues.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -267,10 +266,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering failed in DTGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dggesx.f b/SRC/dggesx.f
index 4d6d6830..df832c78 100644
--- a/SRC/dggesx.f
+++ b/SRC/dggesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA,
 *                          B, LDB, SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL,
@@ -41,11 +41,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGESX computes for a pair of N-by-N real nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, the real Schur form (S,T), and,
@@ -81,11 +81,10 @@
 *> and the pair of corresponding 2-by-2 blocks in S and T will have a
 *> complex conjugate pair of generalized eigenvalues.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -329,10 +328,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering failed in DTGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -343,10 +341,9 @@
 *
 *> \ingroup doubleGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  An approximate (asymptotic) bound on the average absolute error of
@@ -360,7 +357,6 @@
 *>       EPS * norm((A, B)) / RCONDV( 2 ).
 *>
 *>  See LAPACK User's Guide, section 4.11 for more information.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dggev.f b/SRC/dggev.f
index 35278177..c3ea7e37 100644
--- a/SRC/dggev.f
+++ b/SRC/dggev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI,
 *                         BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGEV computes for a pair of N-by-N real nonsymmetric matrices (A,B)
 *> the generalized eigenvalues, and optionally, the left and/or right
@@ -59,11 +59,10 @@
 *>
 *> where u(j)**H is the conjugate-transpose of u(j).
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -210,10 +209,9 @@
 *>          > N:  =N+1: other than QZ iteration failed in DHGEQZ.
 *>                =N+2: error return from DTGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dggevx.f b/SRC/dggevx.f
index 0f4f86b0..be094fb2 100644
--- a/SRC/dggevx.f
+++ b/SRC/dggevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB,
 *                          ALPHAR, ALPHAI, BETA, VL, LDVL, VR, LDVR, ILO,
@@ -37,11 +37,11 @@
 *      $                   VL( LDVL, * ), VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGEVX computes for a pair of N-by-N real nonsymmetric matrices (A,B)
 *> the generalized eigenvalues, and optionally, the left and/or right
@@ -71,11 +71,10 @@
 *>
 *> where u(j)**H is the conjugate-transpose of u(j).
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -344,10 +343,9 @@
 *>          > N:  =N+1: other than QZ iteration failed in DHGEQZ.
 *>                =N+2: error return from DTGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -358,10 +356,9 @@
 *
 *> \ingroup doubleGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing a matrix pair (A,B) includes, first, permuting rows and
@@ -386,7 +383,6 @@
 *>
 *>  For further explanation of the reciprocal condition numbers RCONDE
 *>  and RCONDV, see section 4.11 of LAPACK User's Guide.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dggglm.f b/SRC/dggglm.f
index 945ab59f..4830af9e 100644
--- a/SRC/dggglm.f
+++ b/SRC/dggglm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGGLM solves a general Gauss-Markov linear model (GLM) problem:
 *>
@@ -61,11 +61,10 @@
 *>                  x
 *>
 *> where inv(B) denotes the inverse of B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -169,10 +168,9 @@
 *>                rank( A B ) < N; the least squares solution could not
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgghrd.f b/SRC/dgghrd.f
index 5296059f..c2a2053b 100644
--- a/SRC/dgghrd.f
+++ b/SRC/dgghrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q,
 *                          LDQ, Z, LDZ, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGHRD reduces a pair of real matrices (A,B) to generalized upper
 *> Hessenberg form using orthogonal transformations, where A is a
@@ -64,11 +64,10 @@
 *> If Q1 is the orthogonal matrix from the QR factorization of B in the
 *> original equation A*x = lambda*B*x, then DGGHRD reduces the original
 *> problem to generalized Hessenberg form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -181,10 +180,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -195,16 +193,14 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine reduces A to Hessenberg and B to triangular form by
 *>  an unblocked reduction, as described in _Matrix_Computations_,
 *>  by Golub and Van Loan (Johns Hopkins Press.)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dgglse.f b/SRC/dgglse.f
index 0f5ac04b..1a1cb823 100644
--- a/SRC/dgglse.f
+++ b/SRC/dgglse.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGLSE solves the linear equality-constrained least squares (LSE)
 *> problem:
@@ -52,11 +52,10 @@
 *> matrices (B, A) given by
 *>
 *>    B = (0 R)*Q,   A = Z*T*Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>                    ( (B) )
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dggqrf.f b/SRC/dggqrf.f
index c490b3a1..b4c3748e 100644
--- a/SRC/dggqrf.f
+++ b/SRC/dggqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGQRF computes a generalized QR factorization of an N-by-M matrix A
 *> and an N-by-P matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the
 *> transpose of the matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -165,10 +164,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,10 +177,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -212,7 +209,6 @@
 *>  B(n-k+i,1:p-k+i-1), and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine DORGRQ.
 *>  To use Z to update another matrix, use LAPACK subroutine DORMRQ.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dggrqf.f b/SRC/dggrqf.f
index 6439c678..7af4fe96 100644
--- a/SRC/dggrqf.f
+++ b/SRC/dggrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGRQF computes a generalized RQ factorization of an M-by-N matrix A
 *> and a P-by-N matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the
 *> transpose of the matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INF0= -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -178,10 +176,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -211,7 +208,6 @@
 *>  and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine DORGQR.
 *>  To use Z to update another matrix, use LAPACK subroutine DORMQR.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dggsvd.f b/SRC/dggsvd.f
index fc439389..3caeab96 100644
--- a/SRC/dggsvd.f
+++ b/SRC/dggsvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
 *                          LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
@@ -33,11 +33,11 @@
 *      $                   V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGSVD computes the generalized singular value decomposition (GSVD)
 *> of an M-by-N real matrix A and P-by-N real matrix B:
@@ -117,11 +117,10 @@
 *>
 *>                      X = Q*( I   0    )
 *>                            ( 0 inv(R) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -294,10 +293,12 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, the Jacobi-type procedure failed to
 *>                converge.  For further details, see subroutine DTGSJA.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLA    DOUBLE PRECISION
 *>  TOLB    DOUBLE PRECISION
 *>          TOLA and TOLB are the thresholds to determine the effective
@@ -307,10 +308,9 @@
 *>          The size of TOLA and TOLB may affect the size of backward
 *>          errors of the decomposition.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -321,18 +321,12 @@
 *
 *> \ingroup doubleOTHERsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  2-96 Based on modifications by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
      $                   LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
diff --git a/SRC/dggsvp.f b/SRC/dggsvp.f
index aa82939e..f77df239 100644
--- a/SRC/dggsvp.f
+++ b/SRC/dggsvp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB,
 *                          TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ,
@@ -33,11 +33,11 @@
 *      $                   TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGGSVP computes orthogonal matrices U, V and Q such that
 *>
@@ -62,11 +62,10 @@
 *> This decomposition is the preprocessing step for computing the
 *> Generalized Singular Value Decomposition (GSVD), see subroutine
 *> DGGSVD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -230,10 +229,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -244,18 +242,13 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
 *>  The subroutine uses LAPACK subroutine DGEQPF for the QR factorization
 *>  with column pivoting to detect the effective numerical rank of the
 *>  a matrix. It may be replaced by a better rank determination strategy.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB,
      $                   TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ,
diff --git a/SRC/dgsvj0.f b/SRC/dgsvj0.f
index d9e174d5..c7a2087d 100644
--- a/SRC/dgsvj0.f
+++ b/SRC/dgsvj0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS,
 *                          SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
@@ -31,35 +31,20 @@
 *      $                   WORK( LWORK )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGSVJ0 is called from DGESVJ as a pre-processor and that is its main
 *> purpose. It applies Jacobi rotations in the same way as DGESVJ does, but
 *> it does not check convergence (stopping criterion). Few tuning
 *> parameters (marked by [TP]) are available for the implementer.
-*>
-*> Further Details
-*> ~~~~~~~~~~~~~~~
-*> DGSVJ0 is used just to enable SGESVJ to call a simplified version of
-*> itself to work on a submatrix of the original matrix.
-*>
-*> Contributors
-*> ~~~~~~~~~~~~
-*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
-*>
-*> Bugs, Examples and Comments
-*> ~~~~~~~~~~~~~~~~~~~~~~~~~~~
-*> Please report all bugs and send interesting test examples and comments to
-*> drmac@math.hr. Thank you.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBV
 *> \verbatim
@@ -199,10 +184,9 @@
 *>          = 0 : successful exit.
 *>          < 0 : if INFO = -i, then the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -213,6 +197,23 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
+*> \par Further Details:
+*  =====================
+*>
+*> DGSVJ0 is used just to enable DGESVJ to call a simplified version of
+*> itself to work on a submatrix of the original matrix.
+*>
+*> \par Contributors:
+*  ==================
+*>
+*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*>
+*> \par Bugs, Examples and Comments:
+*  =================================
+*>
+*> Please report all bugs and send interesting test examples and comments to
+*> drmac@math.hr. Thank you.
+*
 *  =====================================================================
       SUBROUTINE DGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS,
      $                   SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
diff --git a/SRC/dgsvj1.f b/SRC/dgsvj1.f
index 71a86295..0636f478 100644
--- a/SRC/dgsvj1.f
+++ b/SRC/dgsvj1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV,
 *                          EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( LWORK )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGSVJ1 is called from SGESVJ as a pre-processor and that is its main
 *> purpose. It applies Jacobi rotations in the same way as SGESVJ does, but
@@ -64,15 +64,10 @@
 *> tiled using quadratic tiles of side KBL. Here, KBL is a tunning parmeter.
 *> The number of sweeps is given in NSWEEP and the orthogonality threshold
 *> is given in TOL.
-*>
-*> Contributors
-*> ~~~~~~~~~~~~
-*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBV
 *> \verbatim
@@ -219,10 +214,9 @@
 *>          = 0 : successful exit.
 *>          < 0 : if INFO = -i, then the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -233,6 +227,11 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
+*> \par Contributors:
+*  ==================
+*>
+*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*
 *  =====================================================================
       SUBROUTINE DGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV,
      $                   EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
diff --git a/SRC/dgtcon.f b/SRC/dgtcon.f
index cc202741..cab5d0c3 100644
--- a/SRC/dgtcon.f
+++ b/SRC/dgtcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND,
 *                          WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   D( * ), DL( * ), DU( * ), DU2( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGTCON estimates the reciprocal of the condition number of a real
 *> tridiagonal matrix A using the LU factorization as computed by
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -130,10 +129,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgtrfs.f b/SRC/dgtrfs.f
index 897b81a5..e292b6e9 100644
--- a/SRC/dgtrfs.f
+++ b/SRC/dgtrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK,
@@ -33,20 +33,19 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is tridiagonal, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -184,16 +183,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgtsv.f b/SRC/dgtsv.f
index 58cb98bd..9f450d3b 100644
--- a/SRC/dgtsv.f
+++ b/SRC/dgtsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGTSV( N, NRHS, DL, D, DU, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   B( LDB, * ), D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGTSV  solves the equation
 *>
@@ -42,11 +42,10 @@
 *>
 *> Note that the equation  A**T*X = B  may be solved by interchanging the
 *> order of the arguments DU and DL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -112,10 +111,9 @@
 *>               has not been computed.  The factorization has not been
 *>               completed unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgtsvx.f b/SRC/dgtsvx.f
index e7d2d1b5..85dd9bf7 100644
--- a/SRC/dgtsvx.f
+++ b/SRC/dgtsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF,
 *                          DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -34,11 +34,11 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGTSVX uses the LU factorization to compute the solution to a real
 *> system of linear equations A * X = B or A**T * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -71,11 +74,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
@@ -273,10 +275,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 
diff --git a/SRC/dgttrf.f b/SRC/dgttrf.f
index 173c1a76..d2449306 100644
--- a/SRC/dgttrf.f
+++ b/SRC/dgttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGTTRF( N, DL, D, DU, DU2, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGTTRF computes an LU factorization of a real tridiagonal matrix A
 *> using elimination with partial pivoting and row interchanges.
@@ -42,11 +42,10 @@
 *> where L is a product of permutation and unit lower bidiagonal
 *> matrices and U is upper triangular with nonzeros in only the main
 *> diagonal and first two superdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgttrs.f b/SRC/dgttrs.f
index 7cb0fe3f..0f129f61 100644
--- a/SRC/dgttrs.f
+++ b/SRC/dgttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       DOUBLE PRECISION   B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGTTRS solves one of the systems of equations
 *>    A*X = B  or  A**T*X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by DGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dgtts2.f b/SRC/dgtts2.f
index dbb48031..bf1a88d4 100644
--- a/SRC/dgtts2.f
+++ b/SRC/dgtts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DGTTS2 solves one of the systems of equations
 *>    A*X = B  or  A**T*X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by DGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITRANS
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dhgeqz.f b/SRC/dhgeqz.f
index 849b76cc..6a151c50 100644
--- a/SRC/dhgeqz.f
+++ b/SRC/dhgeqz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT,
 *                          ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, WORK,
@@ -32,11 +32,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DHGEQZ computes the eigenvalues of a real matrix pair (H,T),
 *> where H is an upper Hessenberg matrix and T is upper triangular,
@@ -92,11 +92,10 @@
 *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix
 *>      Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973),
 *>      pp. 241--256.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -274,10 +273,9 @@
 *>                     in Schur form, but ALPHAR(i), ALPHAI(i), and
 *>                     BETA(i), i=INFO-N+1,...,N should be correct.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -288,10 +286,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Iteration counters:
@@ -300,7 +297,6 @@
 *>  IITER  -- counts iterations run since ILAST was last
 *>            changed.  This is therefore reset only when a 1-by-1 or
 *>            2-by-2 block deflates off the bottom.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dhsein.f b/SRC/dhsein.f
index b59fd91f..0b83712f 100644
--- a/SRC/dhsein.f
+++ b/SRC/dhsein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, WR, WI,
 *                          VL, LDVL, VR, LDVR, MM, M, WORK, IFAILL,
@@ -33,11 +33,11 @@
 *      $                   WI( * ), WORK( * ), WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DHSEIN uses inverse iteration to find specified right and/or left
 *> eigenvectors of a real upper Hessenberg matrix H.
@@ -48,11 +48,10 @@
 *>              H * x = w * x,     y**h * H = w * y**h
 *>
 *> where y**h denotes the conjugate transpose of the vector y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -235,10 +234,9 @@
 *>                failed to converge; see IFAILL and IFAILR for further
 *>                details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -249,16 +247,14 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x|+|y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dhseqr.f b/SRC/dhseqr.f
index 9e665906..4041e6e6 100644
--- a/SRC/dhseqr.f
+++ b/SRC/dhseqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z,
 *                          LDZ, WORK, LWORK, INFO )
@@ -29,13 +29,12 @@
 *       DOUBLE PRECISION   H( LDH, * ), WI( * ), WORK( * ), WR( * ),
 *      $                   Z( LDZ, * )
 *       ..
-*  Purpose
-*  =======
+*  
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DHSEQR computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -46,11 +45,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the orthogonal matrix Q:  A = Q*H*Q**T = (QZ)*T*(QZ)**T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -226,10 +224,9 @@
 *>                If INFO .GT. 0 and COMPZ = 'N', then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -240,6 +237,81 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
+*> \par Contributors:
+*  ==================
+*>
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
+*>
+*>             Default values supplied by
+*>             ILAENV(ISPEC,'DHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
+*>             It is suggested that these defaults be adjusted in order
+*>             to attain best performance in each particular
+*>             computational environment.
+*>
+*>            ISPEC=12: The DLAHQR vs DLAQR0 crossover point.
+*>                      Default: 75. (Must be at least 11.)
+*>
+*>            ISPEC=13: Recommended deflation window size.
+*>                      This depends on ILO, IHI and NS.  NS is the
+*>                      number of simultaneous shifts returned
+*>                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
+*>                      The default for (IHI-ILO+1).LE.500 is NS.
+*>                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
+*>
+*>            ISPEC=14: Nibble crossover point. (See IPARMQ for
+*>                      details.)  Default: 14% of deflation window
+*>                      size.
+*>
+*>            ISPEC=15: Number of simultaneous shifts in a multishift
+*>                      QR iteration.
+*>
+*>                      If IHI-ILO+1 is ...
+*>
+*>                      greater than      ...but less    ... the
+*>                      or equal to ...      than        default is
+*>
+*>                           1               30          NS =   2(+)
+*>                          30               60          NS =   4(+)
+*>                          60              150          NS =  10(+)
+*>                         150              590          NS =  **
+*>                         590             3000          NS =  64
+*>                        3000             6000          NS = 128
+*>                        6000             infinity      NS = 256
+*>
+*>                  (+)  By default some or all matrices of this order
+*>                       are passed to the implicit double shift routine
+*>                       DLAHQR and this parameter is ignored.  See
+*>                       ISPEC=12 above and comments in IPARMQ for
+*>                       details.
+*>
+*>                 (**)  The asterisks (**) indicate an ad-hoc
+*>                       function of N increasing from 10 to 64.
+*>
+*>            ISPEC=16: Select structured matrix multiply.
+*>                      If the number of simultaneous shifts (specified
+*>                      by ISPEC=15) is less than 14, then the default
+*>                      for ISPEC=16 is 0.  Otherwise the default for
+*>                      ISPEC=16 is 2.
+*> \endverbatim
+*
+*> \par References:
+*  ================
+*>
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
+*> \n
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
+*>       of Matrix Analysis, volume 23, pages 948--973, 2002.
+*
 *  =====================================================================
       SUBROUTINE DHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z,
      $                   LDZ, WORK, LWORK, INFO )
@@ -257,75 +329,9 @@
       DOUBLE PRECISION   H( LDH, * ), WI( * ), WORK( * ), WR( * ),
      $                   Z( LDZ, * )
 *     ..
-*  ================================================================
-*             Default values supplied by
-*             ILAENV(ISPEC,'DHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
-*             It is suggested that these defaults be adjusted in order
-*             to attain best performance in each particular
-*             computational environment.
-*
-*            ISPEC=12: The DLAHQR vs DLAQR0 crossover point.
-*                      Default: 75. (Must be at least 11.)
-*
-*            ISPEC=13: Recommended deflation window size.
-*                      This depends on ILO, IHI and NS.  NS is the
-*                      number of simultaneous shifts returned
-*                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
-*                      The default for (IHI-ILO+1).LE.500 is NS.
-*                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
-*
-*            ISPEC=14: Nibble crossover point. (See IPARMQ for
-*                      details.)  Default: 14% of deflation window
-*                      size.
-*
-*            ISPEC=15: Number of simultaneous shifts in a multishift
-*                      QR iteration.
-*
-*                      If IHI-ILO+1 is ...
-*
-*                      greater than      ...but less    ... the
-*                      or equal to ...      than        default is
-*
-*                           1               30          NS =   2(+)
-*                          30               60          NS =   4(+)
-*                          60              150          NS =  10(+)
-*                         150              590          NS =  **
-*                         590             3000          NS =  64
-*                        3000             6000          NS = 128
-*                        6000             infinity      NS = 256
-*
-*                  (+)  By default some or all matrices of this order
-*                       are passed to the implicit double shift routine
-*                       DLAHQR and this parameter is ignored.  See
-*                       ISPEC=12 above and comments in IPARMQ for
-*                       details.
-*
-*                 (**)  The asterisks (**) indicate an ad-hoc
-*                       function of N increasing from 10 to 64.
-*
-*            ISPEC=16: Select structured matrix multiply.
-*                      If the number of simultaneous shifts (specified
-*                      by ISPEC=15) is less than 14, then the default
-*                      for ISPEC=16 is 0.  Otherwise the default for
-*                      ISPEC=16 is 2.
-*
-*  ================================================================
-*     Based on contributions by
-*        Karen Braman and Ralph Byers, Department of Mathematics,
-*        University of Kansas, USA
-*
-*  ================================================================
-*     References:
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
-*       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
-*       929--947, 2002.
-*
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
-*       of Matrix Analysis, volume 23, pages 948--973, 2002.
-*
-*  ================================================================
+*
+*  =====================================================================
+*
 *     .. Parameters ..
 *
 *     ==== Matrices of order NTINY or smaller must be processed by
diff --git a/SRC/disnan.f b/SRC/disnan.f
index 6418645e..4e37159f 100644
--- a/SRC/disnan.f
+++ b/SRC/disnan.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       LOGICAL FUNCTION DISNAN( DIN )
 * 
@@ -24,30 +24,28 @@
 *       DOUBLE PRECISION   DIN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DISNAN returns .TRUE. if its argument is NaN, and .FALSE.
 *> otherwise.  To be replaced by the Fortran 2003 intrinsic in the
 *> future.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIN
 *> \verbatim
 *>          DIN is DOUBLE PRECISION
 *>          Input to test for NaN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_gbamv.f b/SRC/dla_gbamv.f
index d1da1278..355767a7 100644
--- a/SRC/dla_gbamv.f
+++ b/SRC/dla_gbamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X,
 *                             INCX, BETA, Y, INCY )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLA_GBAMV  performs one of the matrix-vector operations
 *>
@@ -51,11 +51,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -169,10 +168,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_gbrcond.f b/SRC/dla_gbrcond.f
index 657b3240..3f854760 100644
--- a/SRC/dla_gbrcond.f
+++ b/SRC/dla_gbrcond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_GBRCOND( TRANS, N, KL, KU, AB, LDAB,
 *                                              AFB, LDAFB, IPIV, CMODE, C,
@@ -32,11 +32,11 @@
 *      $                   C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLA_GBRCOND Estimates the Skeel condition number of  op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -47,11 +47,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -153,10 +152,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_gbrfsx_extended.f b/SRC/dla_gbrfsx_extended.f
index 5a32cf51..6c8582b8 100644
--- a/SRC/dla_gbrfsx_extended.f
+++ b/SRC/dla_gbrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU,
 *                                       NRHS, AB, LDAB, AFB, LDAFB, IPIV,
@@ -41,11 +41,12 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> DLA_GBRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +57,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -392,10 +392,9 @@
 *>       < 0:  if INFO = -i, the ith argument to DGBTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_gbrpvgrw.f b/SRC/dla_gbrpvgrw.f
index c8a45974..5a2c1277 100644
--- a/SRC/dla_gbrpvgrw.f
+++ b/SRC/dla_gbrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_GBRPVGRW( N, KL, KU, NCOLS, AB,
 *                                               LDAB, AFB, LDAFB )
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), AFB( LDAFB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLA_GBRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -40,11 +40,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          LDAFB is INTEGER
 *>     The leading dimension of the array AFB.  LDAFB >= 2*KL+KU+1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_geamv.f b/SRC/dla_geamv.f
index b13d4756..f9ca77ef 100644
--- a/SRC/dla_geamv.f
+++ b/SRC/dla_geamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA,
 *                              Y, INCY )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLA_GEAMV  performs one of the matrix-vector operations
 *>
@@ -51,11 +51,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -158,10 +157,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_gercond.f b/SRC/dla_gercond.f
index f44c1281..d6209c91 100644
--- a/SRC/dla_gercond.f
+++ b/SRC/dla_gercond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_GERCOND ( TRANS, N, A, LDA, AF,
 *                                               LDAF, IPIV, CMODE, C,
@@ -32,11 +32,11 @@
 *      $                   C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLA_GERCOND estimates the Skeel condition number of op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -47,11 +47,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -135,10 +134,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_gerfsx_extended.f b/SRC/dla_gerfsx_extended.f
index b8456673..6655cce4 100644
--- a/SRC/dla_gerfsx_extended.f
+++ b/SRC/dla_gerfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A,
 *                                       LDA, AF, LDAF, IPIV, COLEQU, C, B,
@@ -39,11 +39,12 @@
 *      $                   ERRS_N( NRHS, * ), ERRS_C( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> DLA_GERFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -54,11 +55,10 @@
 *> and ERRS_C for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERRS_N and ERRS_C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -378,10 +378,9 @@
 *>       < 0:  if INFO = -i, the ith argument to DGETRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_gerpvgrw.f b/SRC/dla_gerpvgrw.f
index b7796644..c2f4e193 100644
--- a/SRC/dla_gerpvgrw.f
+++ b/SRC/dla_gerpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_GERPVGRW( N, NCOLS, A, LDA, AF,
 *                LDAF )
@@ -28,11 +28,12 @@
 *       DOUBLE PRECISION   A( LDA, * ), AF( LDAF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> DLA_GERPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -40,11 +41,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -83,10 +83,9 @@
 *>          LDAF is INTEGER
 *>     The leading dimension of the array AF.  LDAF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_lin_berr.f b/SRC/dla_lin_berr.f
index ac811680..e3cfb17c 100644
--- a/SRC/dla_lin_berr.f
+++ b/SRC/dla_lin_berr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR )
 * 
@@ -28,22 +28,21 @@
 *       DOUBLE PRECISION   RES( N, NRHS )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLA_LIN_BERR computes component-wise relative backward error from
 *>    the formula
 *>        max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) )
 *>    where abs(Z) is the component-wise absolute value of the matrix
 *>    or vector Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -86,10 +85,9 @@
 *>          BERR is DOUBLE PRECISION array, dimension (NRHS)
 *>     The component-wise relative backward error from the formula above.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_porcond.f b/SRC/dla_porcond.f
index e9e4720c..4522c1e5 100644
--- a/SRC/dla_porcond.f
+++ b/SRC/dla_porcond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_PORCOND( UPLO, N, A, LDA, AF, LDAF,
 *                                              CMODE, C, INFO, WORK,
@@ -32,11 +32,11 @@
 *       INTEGER            IWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLA_PORCOND Estimates the Skeel condition number of  op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -47,11 +47,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_porfsx_extended.f b/SRC/dla_porfsx_extended.f
index c7b68a57..72428779 100644
--- a/SRC/dla_porfsx_extended.f
+++ b/SRC/dla_porfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, COLEQU, C, B, LDB, Y,
@@ -41,11 +41,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLA_PORFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -369,10 +368,9 @@
 *>       < 0:  if INFO = -i, the ith argument to DPOTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_porpvgrw.f b/SRC/dla_porpvgrw.f
index f0934d77..5aea294e 100644
--- a/SRC/dla_porpvgrw.f
+++ b/SRC/dla_porpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, 
 *                                               LDAF, WORK )
@@ -29,11 +29,12 @@
 *       DOUBLE PRECISION   A( LDA, * ), AF( LDAF, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> DLA_PORPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -41,11 +42,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +89,9 @@
 *> \verbatim
 *>          WORK is DOUBLE PRECISION array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_syamv.f b/SRC/dla_syamv.f
index 21e50be8..e6014737 100644
--- a/SRC/dla_syamv.f
+++ b/SRC/dla_syamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y,
 *                             INCY )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLA_SYAMV  performs the matrix-vector operation
 *>
@@ -50,11 +50,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -145,10 +144,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -159,10 +157,9 @@
 *
 *> \ingroup doubleSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Level 2 Blas routine.
@@ -174,7 +171,6 @@
 *>     Richard Hanson, Sandia National Labs.
 *>  -- Modified for the absolute-value product, April 2006
 *>     Jason Riedy, UC Berkeley
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dla_syrcond.f b/SRC/dla_syrcond.f
index a9355c60..8cb261c2 100644
--- a/SRC/dla_syrcond.f
+++ b/SRC/dla_syrcond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_SYRCOND( UPLO, N, A, LDA, AF, LDAF, 
 *                                              IPIV, CMODE, C, INFO, WORK,
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), AF( LDAF, * ), WORK( * ), C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLA_SYRCOND estimates the Skeel condition number of  op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -46,11 +46,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_syrfsx_extended.f b/SRC/dla_syrfsx_extended.f
index 131144db..7a3ca65d 100644
--- a/SRC/dla_syrfsx_extended.f
+++ b/SRC/dla_syrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, IPIV, COLEQU, C, B, LDB,
@@ -42,11 +42,12 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> DLA_SYRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -57,11 +58,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -377,10 +377,9 @@
 *>       < 0:  if INFO = -i, the ith argument to DSYTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_syrpvgrw.f b/SRC/dla_syrpvgrw.f
index a8c1310e..f388432c 100644
--- a/SRC/dla_syrpvgrw.f
+++ b/SRC/dla_syrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF,
 *                                               LDAF, IPIV, WORK )
@@ -30,11 +30,12 @@
 *       DOUBLE PRECISION   A( LDA, * ), AF( LDAF, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> DLA_SYRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -42,11 +43,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +105,9 @@
 *> \verbatim
 *>          WORK is DOUBLE PRECISION array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dla_wwaddw.f b/SRC/dla_wwaddw.f
index 95edcabc..36fec17d 100644
--- a/SRC/dla_wwaddw.f
+++ b/SRC/dla_wwaddw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLA_WWADDW( N, X, Y, W )
 * 
@@ -27,23 +27,20 @@
 *       DOUBLE PRECISION   X( * ), Y( * ), W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLA_WWADDW adds a vector W into a doubled-single vector (X, Y).
 *>
 *>    This works for all extant IBM's hex and binary floating point
 *>    arithmetics, but not for decimal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -68,10 +65,9 @@
 *>          W is DOUBLE PRECISION array, dimension (N)
 *>            The vector to be added.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlabad.f b/SRC/dlabad.f
index fa2c5a16..ad5f2020 100644
--- a/SRC/dlabad.f
+++ b/SRC/dlabad.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLABAD( SMALL, LARGE )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   LARGE, SMALL
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLABAD takes as input the values computed by DLAMCH for underflow and
 *> overflow, and returns the square root of each of these values if the
@@ -38,11 +38,10 @@
 *> the values computed by DLAMCH.  This subroutine is needed because
 *> DLAMCH does not compensate for poor arithmetic in the upper half of
 *> the exponent range, as is found on a Cray.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] SMALL
 *> \verbatim
@@ -59,10 +58,9 @@
 *>          On exit, if LOG10(LARGE) is sufficiently large, the square
 *>          root of LARGE, otherwise unchanged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlabrd.f b/SRC/dlabrd.f
index df97e835..17c69823 100644
--- a/SRC/dlabrd.f
+++ b/SRC/dlabrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y,
 *                          LDY )
@@ -29,11 +29,11 @@
 *      $                   TAUQ( * ), X( LDX, * ), Y( LDY, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLABRD reduces the first NB rows and columns of a real general
 *> m by n matrix A to upper or lower bidiagonal form by an orthogonal
@@ -44,11 +44,10 @@
 *> bidiagonal form.
 *>
 *> This is an auxiliary routine called by DGEBRD
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -148,10 +147,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -162,10 +160,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -207,7 +204,6 @@
 *>  where a denotes an element of the original matrix which is unchanged,
 *>  vi denotes an element of the vector defining H(i), and ui an element
 *>  of the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlacn2.f b/SRC/dlacn2.f
index a435fbbd..9180f53c 100644
--- a/SRC/dlacn2.f
+++ b/SRC/dlacn2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLACN2( N, V, X, ISGN, EST, KASE, ISAVE )
 * 
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   V( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLACN2 estimates the 1-norm of a square, real matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          ISAVE is INTEGER array, dimension (3)
 *>         ISAVE is used to save variables between calls to DLACN2
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,19 +105,13 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
-*>  Contributed by Nick Higham, University of Manchester.
 *>  Originally named SONEST, dated March 16, 1988.
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
-*>  a real or complex matrix, with applications to condition estimation",
-*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
-*>
 *>  This is a thread safe version of DLACON, which uses the array ISAVE
 *>  in place of a SAVE statement, as follows:
 *>
@@ -127,8 +119,19 @@
 *>      JUMP     ISAVE(1)
 *>      J        ISAVE(2)
 *>      ITER     ISAVE(3)
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Nick Higham, University of Manchester
+*
+*> \par References:
+*  ================
+*>
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  a real or complex matrix, with applications to condition estimation",
+*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
 *  =====================================================================
       SUBROUTINE DLACN2( N, V, X, ISGN, EST, KASE, ISAVE )
diff --git a/SRC/dlacon.f b/SRC/dlacon.f
index 2dc6f550..79d95216 100644
--- a/SRC/dlacon.f
+++ b/SRC/dlacon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLACON( N, V, X, ISGN, EST, KASE )
 * 
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   V( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLACON estimates the 1-norm of a square, real matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>         whether X should be overwritten by A * X  or A**T * X.
 *>         On the final return from DLACON, KASE will again be 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,21 +99,19 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Contributed by Nick Higham, University of Manchester.
+*>  Nick Higham, University of Manchester. \n
 *>  Originally named SONEST, dated March 16, 1988.
+*
+*> \par References:
+*  ================
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
 *>  a real or complex matrix, with applications to condition estimation",
 *>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLACON( N, V, X, ISGN, EST, KASE )
 *
diff --git a/SRC/dlacpy.f b/SRC/dlacpy.f
index 34b45629..441acd02 100644
--- a/SRC/dlacpy.f
+++ b/SRC/dlacpy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLACPY( UPLO, M, N, A, LDA, B, LDB )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLACPY copies all or part of a two-dimensional matrix A to another
 *> matrix B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dladiv.f b/SRC/dladiv.f
index 7ddf1013..f4e07da4 100644
--- a/SRC/dladiv.f
+++ b/SRC/dladiv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLADIV( A, B, C, D, P, Q )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   A, B, C, D, P, Q
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLADIV performs complex division in  real arithmetic
 *>
@@ -38,11 +38,10 @@
 *>
 *> The algorithm is due to Robert L. Smith and can be found
 *> in D. Knuth, The art of Computer Programming, Vol.2, p.195
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          Q is DOUBLE PRECISION
 *>          The scalars p and q in the above expression.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlae2.f b/SRC/dlae2.f
index a52ccce6..e85b386f 100644
--- a/SRC/dlae2.f
+++ b/SRC/dlae2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAE2( A, B, C, RT1, RT2 )
 * 
@@ -24,22 +24,21 @@
 *       DOUBLE PRECISION   A, B, C, RT1, RT2
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAE2  computes the eigenvalues of a 2-by-2 symmetric matrix
 *>    [  A   B  ]
 *>    [  B   C  ].
 *> On return, RT1 is the eigenvalue of larger absolute value, and RT2
 *> is the eigenvalue of smaller absolute value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -70,10 +69,9 @@
 *>          RT2 is DOUBLE PRECISION
 *>          The eigenvalue of smaller absolute value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -84,10 +82,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  RT1 is accurate to a few ulps barring over/underflow.
@@ -100,7 +97,6 @@
 *>  Overflow is possible only if RT1 is within a factor of 5 of overflow.
 *>  Underflow is harmless if the input data is 0 or exceeds
 *>     underflow_threshold / macheps.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlaebz.f b/SRC/dlaebz.f
index 3177f661..b7efc460 100644
--- a/SRC/dlaebz.f
+++ b/SRC/dlaebz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAEBZ( IJOB, NITMAX, N, MMAX, MINP, NBMIN, ABSTOL,
 *                          RELTOL, PIVMIN, D, E, E2, NVAL, AB, C, MOUT,
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAEBZ contains the iteration loops which compute and use the
 *> function N(w), which is the count of eigenvalues of a symmetric
@@ -75,11 +75,10 @@
 *>
 *> Note: the arguments are, in general, *not* checked for unreasonable
 *> values.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -265,10 +264,9 @@
 *>          = 1--MMAX: The last INFO intervals did not converge.
 *>          = MMAX+1:  More than MMAX intervals were generated.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -279,10 +277,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>      This routine is intended to be called only by other LAPACK
@@ -315,7 +312,6 @@
 *>      >= 0, then the interval will have  N(AB(j,1))=NAB(j,1)=f-k and
 *>      N(AB(j,2))=NAB(j,2)=f+r.  The cases w(l) < w(l+1) and
 *>      w(l-r)=...=w(l+k) are handled similarly.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlaed0.f b/SRC/dlaed0.f
index 004464be..2307b121 100644
--- a/SRC/dlaed0.f
+++ b/SRC/dlaed0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS,
 *                          WORK, IWORK, INFO )
@@ -30,19 +30,18 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED0 computes all eigenvalues and corresponding eigenvectors of a
 *> symmetric tridiagonal matrix using the divide and conquer method.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -150,10 +149,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -164,18 +162,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS,
      $                   WORK, IWORK, INFO )
diff --git a/SRC/dlaed1.f b/SRC/dlaed1.f
index e8a266e9..026f9a25 100644
--- a/SRC/dlaed1.f
+++ b/SRC/dlaed1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK,
 *                          INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   D( * ), Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED1 computes the updated eigensystem of a diagonal
 *> matrix after modification by a rank-one symmetric matrix.  This
@@ -68,11 +68,10 @@
 *>       directly using the updated eigenvalues.  The eigenvectors for
 *>       the current problem are multiplied with the eigenvectors from
 *>       the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -140,10 +139,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -154,18 +152,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE DLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK,
diff --git a/SRC/dlaed2.f b/SRC/dlaed2.f
index 7cd5eab8..9048e50e 100644
--- a/SRC/dlaed2.f
+++ b/SRC/dlaed2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W,
 *                          Q2, INDX, INDXC, INDXP, COLTYP, INFO )
@@ -32,11 +32,11 @@
 *      $                   W( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED2 merges the two sets of eigenvalues together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -44,11 +44,10 @@
 *> eigenvalues are close together or if there is a tiny entry in the
 *> Z vector.  For each such occurrence the order of the related secular
 *> equation problem is reduced by one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[out] K
 *> \verbatim
@@ -189,10 +188,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,18 +201,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE DLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W,
diff --git a/SRC/dlaed3.f b/SRC/dlaed3.f
index 3e5699bd..7e18d016 100644
--- a/SRC/dlaed3.f
+++ b/SRC/dlaed3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX,
 *                          CTOT, W, S, INFO )
@@ -31,11 +31,11 @@
 *      $                   S( * ), W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED3 finds the roots of the secular equation, as defined by the
 *> values in D, W, and RHO, between 1 and K.  It makes the
@@ -50,11 +50,10 @@
 *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] K
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -176,18 +174,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE DLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX,
diff --git a/SRC/dlaed4.f b/SRC/dlaed4.f
index d0c6bd13..8aad6e9e 100644
--- a/SRC/dlaed4.f
+++ b/SRC/dlaed4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * ), DELTA( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the I-th updated eigenvalue of a symmetric
 *> rank-one modification to a diagonal matrix whose elements are
@@ -49,11 +49,10 @@
 *>
 *> The method consists of approximating the rational functions in the
 *> secular equation by simpler interpolating rational functions.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -106,10 +105,12 @@
 *>          INFO is INTEGER
 *>         = 0:  successful exit
 *>         > 0:  if INFO = 1, the updating process failed.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  Logical variable ORGATI (origin-at-i?) is used for distinguishing
 *>  whether D(i) or D(i+1) is treated as the origin.
 *>
@@ -122,10 +123,9 @@
 *>   MAXIT is the maximum number of iterations allowed for each
 *>   eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,18 +136,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO )
 *
diff --git a/SRC/dlaed5.f b/SRC/dlaed5.f
index 7ccbf852..43d10bc9 100644
--- a/SRC/dlaed5.f
+++ b/SRC/dlaed5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED5( I, D, Z, DELTA, RHO, DLAM )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( 2 ), DELTA( 2 ), Z( 2 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the I-th eigenvalue of a symmetric rank-one
 *> modification of a 2-by-2 diagonal matrix
@@ -45,11 +45,10 @@
 *>
 *> We also assume RHO > 0 and that the Euclidean norm of the vector
 *> Z is one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          DLAM is DOUBLE PRECISION
 *>         The computed lambda_I, the I-th updated eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,18 +99,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLAED5( I, D, Z, DELTA, RHO, DLAM )
 *
diff --git a/SRC/dlaed6.f b/SRC/dlaed6.f
index f76805fb..cff3703b 100644
--- a/SRC/dlaed6.f
+++ b/SRC/dlaed6.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   D( 3 ), Z( 3 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED6 computes the positive or negative root (closest to the origin)
 *> of
@@ -49,11 +49,10 @@
 *> This routine will be called by DLAED4 when necessary. In most cases,
 *> the root sought is the smallest in magnitude, though it might not be
 *> in some extremely rare situations.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] KNITER
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               = 0: successful exit
 *>               > 0: if INFO = 1, failure to converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,23 +119,23 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  30/06/99: Based on contributions by
-*>     Ren-Cang Li, Computer Science Division, University of California
-*>     at Berkeley, USA
+*> \verbatim
 *>
 *>  10/02/03: This version has a few statements commented out for thread
 *>  safety (machine parameters are computed on each entry). SJH.
 *>
 *>  05/10/06: Modified from a new version of Ren-Cang Li, use
 *>     Gragg-Thornton-Warner cubic convergent scheme for better stability.
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Ren-Cang Li, Computer Science Division, University of California
+*>     at Berkeley, USA
 *>
 *  =====================================================================
       SUBROUTINE DLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO )
diff --git a/SRC/dlaed7.f b/SRC/dlaed7.f
index 5f5694fb..861c4d36 100644
--- a/SRC/dlaed7.f
+++ b/SRC/dlaed7.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q,
 *                          LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR,
@@ -35,11 +35,11 @@
 *      $                   QSTORE( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED7 computes the updated eigensystem of a diagonal
 *> matrix after modification by a rank-one symmetric matrix. This
@@ -73,11 +73,10 @@
 *>       directly using the updated eigenvalues.  The eigenvectors for
 *>       the current problem are multiplied with the eigenvectors from
 *>       the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -236,10 +235,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -250,18 +248,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q,
      $                   LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR,
diff --git a/SRC/dlaed8.f b/SRC/dlaed8.f
index 78699bbc..73e9d3c7 100644
--- a/SRC/dlaed8.f
+++ b/SRC/dlaed8.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO,
 *                          CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR,
@@ -34,11 +34,11 @@
 *      $                   Q( LDQ, * ), Q2( LDQ2, * ), W( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED8 merges the two sets of eigenvalues together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -46,11 +46,10 @@
 *> eigenvalues are close together or if there is a tiny element in the
 *> Z vector.  For each such occurrence the order of the related secular
 *> equation problem is reduced by one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -220,10 +219,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -234,18 +232,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO,
      $                   CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR,
diff --git a/SRC/dlaed9.f b/SRC/dlaed9.f
index deebc667..491791ac 100644
--- a/SRC/dlaed9.f
+++ b/SRC/dlaed9.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W,
 *                          S, LDS, INFO )
@@ -30,21 +30,20 @@
 *      $                   W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAED9 finds the roots of the secular equation, as defined by the
 *> values in D, Z, and RHO, between KSTART and KSTOP.  It makes the
 *> appropriate calls to DLAED4 and then stores the new matrix of
 *> eigenvectors for use in calculating the next level of Z vectors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] K
 *> \verbatim
@@ -134,10 +133,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -148,18 +146,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W,
      $                   S, LDS, INFO )
diff --git a/SRC/dlaeda.f b/SRC/dlaeda.f
index 25193c45..d64222ff 100644
--- a/SRC/dlaeda.f
+++ b/SRC/dlaeda.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR,
 *                          GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO )
@@ -30,20 +30,19 @@
 *       DOUBLE PRECISION   GIVNUM( 2, * ), Q( * ), Z( * ), ZTEMP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAEDA computes the Z vector corresponding to the merge step in the
 *> CURLVLth step of the merge process with TLVLS steps for the CURPBMth
 *> problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -144,10 +143,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -158,18 +156,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR,
      $                   GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO )
diff --git a/SRC/dlaein.f b/SRC/dlaein.f
index 50152f34..fc5edef1 100644
--- a/SRC/dlaein.f
+++ b/SRC/dlaein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAEIN( RIGHTV, NOINIT, N, H, LDH, WR, WI, VR, VI, B,
 *                          LDB, WORK, EPS3, SMLNUM, BIGNUM, INFO )
@@ -31,20 +31,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAEIN uses inverse iteration to find a right or left eigenvector
 *> corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg
 *> matrix H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RIGHTV
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          = 1:  inverse iteration did not converge; VR is set to the
 *>                last iterate, and so is VI if WI.ne.0.0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaev2.f b/SRC/dlaev2.f
index 99111db8..e692736a 100644
--- a/SRC/dlaev2.f
+++ b/SRC/dlaev2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAEV2( A, B, C, RT1, RT2, CS1, SN1 )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   A, B, C, CS1, RT1, RT2, SN1
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAEV2 computes the eigendecomposition of a 2-by-2 symmetric matrix
 *>    [  A   B  ]
@@ -39,11 +39,10 @@
 *>
 *>    [ CS1  SN1 ] [  A   B  ] [ CS1 -SN1 ]  =  [ RT1  0  ]
 *>    [-SN1  CS1 ] [  B   C  ] [ SN1  CS1 ]     [  0  RT2 ].
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -86,10 +85,9 @@
 *>          SN1 is DOUBLE PRECISION
 *>          The vector (CS1, SN1) is a unit right eigenvector for RT1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -100,10 +98,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  RT1 is accurate to a few ulps barring over/underflow.
@@ -118,7 +115,6 @@
 *>  Overflow is possible only if RT1 is within a factor of 5 of overflow.
 *>  Underflow is harmless if the input data is 0 or exceeds
 *>     underflow_threshold / macheps.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlaexc.f b/SRC/dlaexc.f
index 250845c7..58aaeb09 100644
--- a/SRC/dlaexc.f
+++ b/SRC/dlaexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAEXC( WANTQ, N, T, LDT, Q, LDQ, J1, N1, N2, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   Q( LDQ, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAEXC swaps adjacent diagonal blocks T11 and T22 of order 1 or 2 in
 *> an upper quasi-triangular matrix T by an orthogonal similarity
@@ -43,11 +43,10 @@
 *> with 1-by-1 and 2-by-2 diagonal blocks; each 2-by-2 diagonal block
 *> has its diagonal elemnts equal and its off-diagonal elements of
 *> opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -122,10 +121,9 @@
 *>               form; the blocks are not swapped and T and Q are
 *>               unchanged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlag2.f b/SRC/dlag2.f
index 3dd39c71..c711d79d 100644
--- a/SRC/dlag2.f
+++ b/SRC/dlag2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAG2( A, LDA, B, LDB, SAFMIN, SCALE1, SCALE2, WR1,
 *                         WR2, WI )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAG2 computes the eigenvalues of a 2 x 2 generalized eigenvalue
 *> problem  A - w B, with scaling as necessary to avoid over-/underflow.
@@ -44,11 +44,10 @@
 *>
 *> where  s  is a non-negative scaling factor chosen so that  w,  w B,
 *> and  s A  do not overflow and, if possible, do not underflow, either.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -140,10 +139,9 @@
 *>          eigenvalue is complex, then WI is SCALE1 times the imaginary
 *>          part of the eigenvalues.  WI will always be non-negative.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlag2s.f b/SRC/dlag2s.f
index 7e480add..d2740385 100644
--- a/SRC/dlag2s.f
+++ b/SRC/dlag2s.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAG2S( M, N, A, LDA, SA, LDSA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAG2S converts a DOUBLE PRECISION matrix, SA, to a SINGLE
 *> PRECISION matrix, A.
@@ -42,11 +42,10 @@
 *> RMAX. If not the convertion is aborted and a flag is raised.
 *>
 *> This is an auxiliary routine so there is no argument checking.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>                PRECISION overflow threshold, in this case, the content
 *>                of SA in exit is unspecified.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlags2.f b/SRC/dlags2.f
index 97463202..5b227383 100644
--- a/SRC/dlags2.f
+++ b/SRC/dlags2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV,
 *                          SNV, CSQ, SNQ )
@@ -27,11 +27,11 @@
 *      $                   SNU, SNV
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAGS2 computes 2-by-2 orthogonal matrices U, V and Q, such
 *> that if ( UPPER ) then
@@ -57,11 +57,10 @@
 *>
 *> Z**T denotes the transpose of Z.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPPER
 *> \verbatim
@@ -136,10 +135,9 @@
 *>          SNQ is DOUBLE PRECISION
 *>          The desired orthogonal matrix Q.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlagtf.f b/SRC/dlagtf.f
index eb4e25d8..346a8c18 100644
--- a/SRC/dlagtf.f
+++ b/SRC/dlagtf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAGTF( N, A, LAMBDA, B, C, TOL, D, IN, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( * ), B( * ), C( * ), D( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAGTF factorizes the matrix (T - lambda*I), where T is an n by n
 *> tridiagonal matrix and lambda is a scalar, as
@@ -51,11 +51,10 @@
 *> The parameter LAMBDA is included in the routine so that DLAGTF may
 *> be used, in conjunction with DLAGTS, to obtain eigenvectors of T by
 *> inverse iteration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -141,10 +140,9 @@
 *>          = 0   : successful exit
 *>          .lt. 0: if INFO = -k, the kth argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlagtm.f b/SRC/dlagtm.f
index 54054084..ead65da5 100644
--- a/SRC/dlagtm.f
+++ b/SRC/dlagtm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA,
 *                          B, LDB )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAGTM performs a matrix-vector product of the form
 *>
@@ -44,11 +44,10 @@
 *> where A is a tridiagonal matrix of order N, B and X are N by NRHS
 *> matrices, and alpha and beta are real scalars, each of which may be
 *> 0., 1., or -1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -129,10 +128,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(N,1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlagts.f b/SRC/dlagts.f
index 691d7a7a..4f375cbe 100644
--- a/SRC/dlagts.f
+++ b/SRC/dlagts.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAGTS( JOB, N, A, B, C, D, IN, Y, TOL, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( * ), B( * ), C( * ), D( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAGTS may be used to solve one of the systems of equations
 *>
@@ -48,11 +48,10 @@
 *> controlled by the argument JOB, and in each case there is an option
 *> to perturb zero or very small diagonal elements of U, this option
 *> being intended for use in applications such as inverse iteration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -146,10 +145,9 @@
 *>                  the elements of the right-hand side vector y are very
 *>                  large.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlagv2.f b/SRC/dlagv2.f
index c195c403..e3fbf5a9 100644
--- a/SRC/dlagv2.f
+++ b/SRC/dlagv2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL,
 *                          CSR, SNR )
@@ -30,11 +30,11 @@
 *      $                   B( LDB, * ), BETA( 2 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAGV2 computes the Generalized Schur factorization of a real 2-by-2
 *> matrix pencil (A,B) where B is upper triangular. This routine
@@ -61,11 +61,10 @@
 *>
 *>    where b11 >= b22 > 0.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] A
 *> \verbatim
@@ -136,10 +135,9 @@
 *>          SNR is DOUBLE PRECISION
 *>          The sine of the right rotation matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -150,17 +148,11 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL,
      $                   CSR, SNR )
diff --git a/SRC/dlahqr.f b/SRC/dlahqr.f
index 8ed28bbc..336d4003 100644
--- a/SRC/dlahqr.f
+++ b/SRC/dlahqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
 *                          ILOZ, IHIZ, Z, LDZ, INFO )
@@ -29,23 +29,20 @@
 *       DOUBLE PRECISION   H( LDH, * ), WI( * ), WR( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLAHQR is an auxiliary routine called by DHSEQR to update the
 *>    eigenvalues and Schur decomposition already computed by DHSEQR, by
 *>    dealing with the Hessenberg submatrix in rows and columns ILO to
 *>    IHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -177,10 +174,9 @@
 *>                  where U is the orthogonal matrix in (*)
 *>                  (regardless of the value of WANTT.)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -191,10 +187,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>     02-96 Based on modifications by
@@ -206,7 +201,6 @@
 *>     It is (1) more robust against overflow and underflow and
 *>     (2) adopts the more conservative Ahues & Tisseur stopping
 *>     criterion (LAWN 122, 1997).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlahr2.f b/SRC/dlahr2.f
index 1b231d2f..535749be 100644
--- a/SRC/dlahr2.f
+++ b/SRC/dlahr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAHR2 reduces the first NB columns of A real general n-BY-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -41,11 +41,10 @@
 *> Q as a block reflector I - V*T*V**T, and also the matrix Y = A * V * T.
 *>
 *> This is an auxiliary routine called by DGEHRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -129,10 +127,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -172,16 +169,15 @@
 *>  Gejin. Note that the entries of A(1:K,2:NB) differ from those
 *>  returned by the original LAPACK-3.0's DLAHRD routine. (This
 *>  subroutine is not backward compatible with LAPACK-3.0's DLAHRD.)
-*>
-*>  References
-*>  ==========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  Gregorio Quintana-Orti and Robert van de Geijn, "Improving the
 *>  performance of reduction to Hessenberg form," ACM Transactions on
 *>  Mathematical Software, 32(2):180-194, June 2006.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 *
diff --git a/SRC/dlahrd.f b/SRC/dlahrd.f
index 4c11613e..75c4ed75 100644
--- a/SRC/dlahrd.f
+++ b/SRC/dlahrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAHRD reduces the first NB columns of a real general n-by-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -43,11 +43,10 @@
 *> This is an OBSOLETE auxiliary routine. 
 *> This routine will be 'deprecated' in a  future release.
 *> Please use the new routine DLAHR2 instead.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -130,10 +128,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -167,7 +164,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlaic1.f b/SRC/dlaic1.f
index 1b942caf..18006844 100644
--- a/SRC/dlaic1.f
+++ b/SRC/dlaic1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   W( J ), X( J )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAIC1 applies one step of incremental condition estimation in
 *> its simplest version:
@@ -59,11 +59,10 @@
 *>                                           [ gamma ]
 *>
 *> where  alpha =  x**T*w.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -119,10 +118,9 @@
 *>          C is DOUBLE PRECISION
 *>          Cosine needed in forming xhat.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaisnan.f b/SRC/dlaisnan.f
index 3c2baee0..86a14960 100644
--- a/SRC/dlaisnan.f
+++ b/SRC/dlaisnan.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       LOGICAL FUNCTION DLAISNAN( DIN1, DIN2 )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   DIN1, DIN2
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is not for general use.  It exists solely to avoid
 *> over-optimization in DISNAN.
@@ -43,11 +43,10 @@
 *> Interprocedural or whole-program optimization may delete this
 *> test.  The ISNAN functions will be replaced by the correct
 *> Fortran 03 intrinsic once the intrinsic is widely available.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIN1
 *> \verbatim
@@ -59,10 +58,9 @@
 *>          DIN2 is DOUBLE PRECISION
 *>          Two numbers to compare for inequality.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaln2.f b/SRC/dlaln2.f
index 3ba89e8c..9e5177b5 100644
--- a/SRC/dlaln2.f
+++ b/SRC/dlaln2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLALN2( LTRANS, NA, NW, SMIN, CA, A, LDA, D1, D2, B,
 *                          LDB, WR, WI, X, LDX, SCALE, XNORM, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLALN2 solves a system of the form  (ca A - w D ) X = s B
 *> or (ca A**T - w D) X = s B   with possible scaling ("s") and
@@ -66,11 +66,10 @@
 *>
 *> Note: all input quantities are assumed to be smaller than overflow
 *> by a reasonable factor.  (See BIGNUM.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] LTRANS
 *> \verbatim
@@ -202,10 +201,9 @@
 *>          NOTE: In the interests of speed, this routine does not
 *>                check the inputs for errors.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlals0.f b/SRC/dlals0.f
index 728584f2..d0321454 100644
--- a/SRC/dlals0.f
+++ b/SRC/dlals0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
 *                          PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
@@ -34,11 +34,11 @@
 *      $                   POLES( LDGNUM, * ), WORK( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLALS0 applies back the multiplying factors of either the left or the
 *> right singular vector matrix of a diagonal matrix appended by a row
@@ -69,11 +69,10 @@
 *> (3R) The inverse transformation of (2L).
 *>
 *> (4R) The inverse transformation of (1L).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -244,10 +243,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -258,19 +256,13 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE DLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
      $                   PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
diff --git a/SRC/dlalsa.f b/SRC/dlalsa.f
index 266a75f7..da78450d 100644
--- a/SRC/dlalsa.f
+++ b/SRC/dlalsa.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
 *                          LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
@@ -37,11 +37,11 @@
 *      $                   Z( LDU, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLALSA is an itermediate step in solving the least squares problem
 *> by computing the SVD of the coefficient matrix in compact form (The
@@ -53,11 +53,10 @@
 *> ICOMPQ = 1, DLALSA applies the right singular vector matrix to the
 *> right hand side. The singular vector matrices were generated in
 *> compact form by DLALSA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -244,10 +243,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -258,19 +256,13 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE DLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
      $                   LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
diff --git a/SRC/dlalsd.f b/SRC/dlalsd.f
index 10fc877a..22645c39 100644
--- a/SRC/dlalsd.f
+++ b/SRC/dlalsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
 *                          RANK, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   B( LDB, * ), D( * ), E( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLALSD uses the singular value decomposition of A to solve the least
 *> squares problem of finding X to minimize the Euclidean norm of each
@@ -53,11 +53,10 @@
 *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -156,10 +155,9 @@
 *>               working on the submatrix lying in rows and columns
 *>               INFO/(N+1) through MOD(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -170,19 +168,13 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE DLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
      $                   RANK, WORK, IWORK, INFO )
diff --git a/SRC/dlamrg.f b/SRC/dlamrg.f
index 104981c2..0cda23ed 100644
--- a/SRC/dlamrg.f
+++ b/SRC/dlamrg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAMRG( N1, N2, A, DTRD1, DTRD2, INDEX )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAMRG will create a permutation list which will merge the elements
 *> of A (which is composed of two independently sorted sets) into a
 *> single set which is sorted in ascending order.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N1
 *> \verbatim
@@ -84,10 +83,9 @@
 *>         if B( I ) = A( INDEX( I ) ) for I=1,N1+N2, then B will be
 *>         sorted in ascending order.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaneg.f b/SRC/dlaneg.f
index 08286d82..90b1f3c3 100644
--- a/SRC/dlaneg.f
+++ b/SRC/dlaneg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION DLANEG( N, D, LLD, SIGMA, PIVMIN, R )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * ), LLD( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANEG computes the Sturm count, the number of negative pivots
 *> encountered while factoring tridiagonal T - sigma I = L D L^T.
@@ -52,11 +52,10 @@
 *>   Modern Symmetric Tridiagonal Eigensolvers," SIAM Journal on
 *>   Scientific Computing, v28, n5, 2006.  DOI 10.1137/050641624
 *>   (Tech report version in LAWN 172 with the same title.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -96,10 +95,9 @@
 *>          The twist index for the twisted factorization that is used
 *>          for the negcount.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -110,18 +108,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>     Jason Riedy, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*>     Osni Marques, LBNL/NERSC, USA \n
+*>     Christof Voemel, University of California, Berkeley, USA \n
+*>     Jason Riedy, University of California, Berkeley, USA \n
 *>
 *  =====================================================================
       INTEGER FUNCTION DLANEG( N, D, LLD, SIGMA, PIVMIN, R )
diff --git a/SRC/dlangb.f b/SRC/dlangb.f
index ee849037..b4e21c0b 100644
--- a/SRC/dlangb.f
+++ b/SRC/dlangb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANGB( NORM, N, KL, KU, AB, LDAB,
 *                        WORK )
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANGB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n band matrix  A,  with kl sub-diagonals and ku super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANGB returns the value
+*> \return DLANGB
+*> \verbatim
 *>
 *>    DLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -109,10 +107,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlange.f b/SRC/dlange.f
index 983c2545..d12ba8a0 100644
--- a/SRC/dlange.f
+++ b/SRC/dlange.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANGE( NORM, M, N, A, LDA, WORK )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANGE  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANGE returns the value
+*> \return DLANGE
+*> \verbatim
 *>
 *>    DLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -100,10 +98,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlangt.f b/SRC/dlangt.f
index a26c973a..2dadab5b 100644
--- a/SRC/dlangt.f
+++ b/SRC/dlangt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANGT( NORM, N, DL, D, DU )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANGT  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANGT returns the value
+*> \return DLANGT
+*> \verbatim
 *>
 *>    DLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -92,10 +90,9 @@
 *>          DU is DOUBLE PRECISION array, dimension (N-1)
 *>          The (n-1) super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlanhs.f b/SRC/dlanhs.f
index 4c065c22..030fc5fa 100644
--- a/SRC/dlanhs.f
+++ b/SRC/dlanhs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANHS( NORM, N, A, LDA, WORK )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANHS  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> Hessenberg matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANHS returns the value
+*> \return DLANHS
+*> \verbatim
 *>
 *>    DLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -94,10 +92,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlansb.f b/SRC/dlansb.f
index e084a451..37e31e26 100644
--- a/SRC/dlansb.f
+++ b/SRC/dlansb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANSB( NORM, UPLO, N, K, AB, LDAB,
 *                        WORK )
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANSB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n symmetric band matrix A,  with k super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANSB returns the value
+*> \return DLANSB
+*> \verbatim
 *>
 *>    DLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -114,10 +112,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlansf.f b/SRC/dlansf.f
index 151a34c9..15695850 100644
--- a/SRC/dlansf.f
+++ b/SRC/dlansf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( 0: * ), WORK( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANSF returns the value of the one norm, or the Frobenius norm, or
 *> the infinity norm, or the element of largest absolute value of a
 *> real symmetric matrix A in RFP format.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANSF returns the value
+*> \return DLANSF
+*> \verbatim
 *>
 *>    DLANSF = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a  matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +106,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -122,10 +119,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -208,12 +204,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK )
 *
diff --git a/SRC/dlansp.f b/SRC/dlansp.f
index d0f68441..71e71399 100644
--- a/SRC/dlansp.f
+++ b/SRC/dlansp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANSP( NORM, UPLO, N, AP, WORK )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANSP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real symmetric matrix A,  supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANSP returns the value
+*> \return DLANSP
+*> \verbatim
 *>
 *>    DLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -100,10 +98,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlanst.f b/SRC/dlanst.f
index 03a23bd0..3185318a 100644
--- a/SRC/dlanst.f
+++ b/SRC/dlanst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANST( NORM, N, D, E )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANST  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real symmetric tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANST returns the value
+*> \return DLANST
+*> \verbatim
 *>
 *>    DLANST = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -86,10 +84,9 @@
 *>          E is DOUBLE PRECISION array, dimension (N-1)
 *>          The (n-1) sub-diagonal or super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlansy.f b/SRC/dlansy.f
index b69cfea3..8d6679a0 100644
--- a/SRC/dlansy.f
+++ b/SRC/dlansy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANSY( NORM, UPLO, N, A, LDA, WORK )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANSY  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real symmetric matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANSY returns the value
+*> \return DLANSY
+*> \verbatim
 *>
 *>    DLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +106,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlantb.f b/SRC/dlantb.f
index 6ab32567..e2bb3704 100644
--- a/SRC/dlantb.f
+++ b/SRC/dlantb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANTB( NORM, UPLO, DIAG, N, K, AB,
 *                        LDAB, WORK )
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANTB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n triangular band matrix A,  with ( k + 1 ) diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANTB returns the value
+*> \return DLANTB
+*> \verbatim
 *>
 *>    DLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -125,10 +123,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlantp.f b/SRC/dlantp.f
index 6d62223a..696f8cc4 100644
--- a/SRC/dlantp.f
+++ b/SRC/dlantp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANTP( NORM, UPLO, DIAG, N, AP, WORK )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANTP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> triangular matrix A, supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANTP returns the value
+*> \return DLANTP
+*> \verbatim
 *>
 *>    DLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -110,10 +108,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlantr.f b/SRC/dlantr.f
index d9629e7e..17ff2a1a 100644
--- a/SRC/dlantr.f
+++ b/SRC/dlantr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLANTR( NORM, UPLO, DIAG, M, N, A, LDA,
 *                        WORK )
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANTR  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> trapezoidal or triangular matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> DLANTR returns the value
+*> \return DLANTR
+*> \verbatim
 *>
 *>    DLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -126,10 +124,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlanv2.f b/SRC/dlanv2.f
index d33ceeb6..561323e2 100644
--- a/SRC/dlanv2.f
+++ b/SRC/dlanv2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLANV2( A, B, C, D, RT1R, RT1I, RT2R, RT2I, CS, SN )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   A, B, C, CS, D, RT1I, RT1R, RT2I, RT2R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLANV2 computes the Schur factorization of a real 2-by-2 nonsymmetric
 *> matrix in standard form:
@@ -40,11 +40,10 @@
 *> 1) CC = 0 so that AA and DD are real eigenvalues of the matrix, or
 *> 2) AA = DD and BB*CC < 0, so that AA + or - sqrt(BB*CC) are complex
 *> conjugate eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] A
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          SN is DOUBLE PRECISION
 *>          Parameters of the rotation matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -115,17 +113,15 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by V. Sima, Research Institute for Informatics, Bucharest,
 *>  Romania, to reduce the risk of cancellation errors,
 *>  when computing real eigenvalues, and to ensure, if possible, that
 *>  abs(RT1R) >= abs(RT2R).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlapll.f b/SRC/dlapll.f
index dc31c2ff..a3817b45 100644
--- a/SRC/dlapll.f
+++ b/SRC/dlapll.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAPLL( N, X, INCX, Y, INCY, SSMIN )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given two column vectors X and Y, let
 *>
@@ -42,11 +42,10 @@
 *> and then computes the SVD of the 2-by-2 upper triangular matrix R.
 *> The smaller singular value of R is returned in SSMIN, which is used
 *> as the measurement of the linear dependency of the vectors X and Y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          SSMIN is DOUBLE PRECISION
 *>          The smallest singular value of the N-by-2 matrix A = ( X Y ).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlapmr.f b/SRC/dlapmr.f
index f67cffe5..a0714630 100644
--- a/SRC/dlapmr.f
+++ b/SRC/dlapmr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAPMR( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAPMR rearranges the rows of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(I,*) is moved to X(K(I),*) for I = 1,2,...,M.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlapmt.f b/SRC/dlapmt.f
index b67af834..89d6df0d 100644
--- a/SRC/dlapmt.f
+++ b/SRC/dlapmt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAPMT( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAPMT rearranges the columns of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlapy2.f b/SRC/dlapy2.f
index 029e0c08..25d060e8 100644
--- a/SRC/dlapy2.f
+++ b/SRC/dlapy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLAPY2( X, Y )
 * 
@@ -24,19 +24,18 @@
 *       DOUBLE PRECISION   X, Y
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAPY2 returns sqrt(x**2+y**2), taking care not to cause unnecessary
 *> overflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -48,10 +47,9 @@
 *>          Y is DOUBLE PRECISION
 *>          X and Y specify the values x and y.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlapy3.f b/SRC/dlapy3.f
index f2763ff6..11ab74cc 100644
--- a/SRC/dlapy3.f
+++ b/SRC/dlapy3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DLAPY3( X, Y, Z )
 * 
@@ -24,19 +24,18 @@
 *       DOUBLE PRECISION   X, Y, Z
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAPY3 returns sqrt(x**2+y**2+z**2), taking care not to cause
 *> unnecessary overflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -53,10 +52,9 @@
 *>          Z is DOUBLE PRECISION
 *>          X, Y and Z specify the values x, y and z.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaqgb.f b/SRC/dlaqgb.f
index d742512a..6e4652d6 100644
--- a/SRC/dlaqgb.f
+++ b/SRC/dlaqgb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, EQUED )
@@ -30,20 +30,19 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQGB equilibrates a general M by N band matrix A with KL
 *> subdiagonals and KU superdiagonals using the row and scaling factors
 *> in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -128,10 +127,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -141,10 +142,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaqge.f b/SRC/dlaqge.f
index 3fce578a..48970d5f 100644
--- a/SRC/dlaqge.f
+++ b/SRC/dlaqge.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          EQUED )
@@ -30,19 +30,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQGE equilibrates a general M by N matrix A using the row and
 *> column scaling factors in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -111,10 +110,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -124,10 +125,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaqp2.f b/SRC/dlaqp2.f
index f762c1a1..7a7a7313 100644
--- a/SRC/dlaqp2.f
+++ b/SRC/dlaqp2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
 *                          WORK )
@@ -30,20 +30,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQP2 computes a QR factorization with column pivoting of
 *> the block A(OFFSET+1:M,1:N).
 *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -114,10 +113,9 @@
 *> \verbatim
 *>          WORK is DOUBLE PRECISION array, dimension (N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -128,23 +126,25 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
-*>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE DLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
      $                   WORK )
diff --git a/SRC/dlaqps.f b/SRC/dlaqps.f
index 612c7365..f9608508 100644
--- a/SRC/dlaqps.f
+++ b/SRC/dlaqps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
 *                          VN2, AUXV, F, LDF )
@@ -30,11 +30,11 @@
 *      $                   VN1( * ), VN2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQPS computes a step of QR factorization with column pivoting
 *> of a real M-by-N matrix A by using Blas-3.  It tries to factorize
@@ -46,11 +46,10 @@
 *> columns is returned in KB.
 *>
 *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          LDF is INTEGER
 *>          The leading dimension of the array F. LDF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -156,23 +154,25 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
-*>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE DLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
      $                   VN2, AUXV, F, LDF )
diff --git a/SRC/dlaqr0.f b/SRC/dlaqr0.f
index 985dd9f0..125d8959 100644
--- a/SRC/dlaqr0.f
+++ b/SRC/dlaqr0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
 *                          ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLAQR0 computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -45,11 +45,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the orthogonal matrix Q:  A = Q*H*Q**T = (QZ)*T*(QZ)**T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -221,26 +220,28 @@
 *>
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
-*> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaqr1.f b/SRC/dlaqr1.f
index e31f61f3..eef96a22 100644
--- a/SRC/dlaqr1.f
+++ b/SRC/dlaqr1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   H( LDH, * ), V( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>      Given a 2-by-2 or 3-by-3 matrix H, DLAQR1 sets v to a
 *>      scalar multiple of the first column of the product
@@ -48,11 +48,10 @@
 *>
 *>      This is useful for starting double implicit shift bulges
 *>      in the QR algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -100,10 +99,9 @@
 *>              A scalar multiple of the first column of the
 *>              matrix K in (*).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,17 +112,11 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE DLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V )
diff --git a/SRC/dlaqr2.f b/SRC/dlaqr2.f
index 8af7c6a1..e3651dbe 100644
--- a/SRC/dlaqr2.f
+++ b/SRC/dlaqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLAQR2 is identical to DLAQR3 except that it avoids
 *>    recursion by calling DLAHQR instead of DLAQR4.
@@ -52,11 +52,10 @@
 *>    an orthogonal similarity transformation of H.  It is to be
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -255,10 +254,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -269,17 +267,11 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE DLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/dlaqr3.f b/SRC/dlaqr3.f
index 63c98c62..12d081e3 100644
--- a/SRC/dlaqr3.f
+++ b/SRC/dlaqr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    Aggressive early deflation:
 *>
@@ -49,11 +49,10 @@
 *>    an orthogonal similarity transformation of H.  It is to be
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -252,10 +251,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -266,17 +264,11 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE DLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/dlaqr4.f b/SRC/dlaqr4.f
index 2cfbc81b..6e20bb30 100644
--- a/SRC/dlaqr4.f
+++ b/SRC/dlaqr4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
 *                          ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLAQR4 implements one level of recursion for DLAQR0.
 *>    It is a complete implementation of the small bulge multi-shift
@@ -52,11 +52,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the orthogonal matrix Q:  A = Q*H*Q**T = (QZ)*T*(QZ)**T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -229,10 +228,9 @@
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -243,28 +241,24 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
      $                   ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )
diff --git a/SRC/dlaqr5.f b/SRC/dlaqr5.f
index 28c2367d..08d1cce6 100644
--- a/SRC/dlaqr5.f
+++ b/SRC/dlaqr5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS,
 *                          SR, SI, H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U,
@@ -33,19 +33,18 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DLAQR5, called by DLAQR0, performs a
 *>    single small-bulge multi-shift QR sweep.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -228,10 +227,9 @@
 *>             LDWV is the leading dimension of WV as declared in the
 *>             in the calling subroutine.  LDWV.GE.NV.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -242,24 +240,19 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*> \par Contributors:
+*  ==================
 *>
-*>     Reference:
-*>
-*>     K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*>     Algorithm Part I: Maintaining Well Focused Shifts, and
-*>     Level 3 Performance, SIAM Journal of Matrix Analysis,
-*>     volume 23, pages 929--947, 2002.
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*> \endverbatim
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
 *>
 *  =====================================================================
       SUBROUTINE DLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS,
diff --git a/SRC/dlaqsb.f b/SRC/dlaqsb.f
index 4c49597c..5695057e 100644
--- a/SRC/dlaqsb.f
+++ b/SRC/dlaqsb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED )
 * 
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQSB equilibrates a symmetric band matrix A using the scaling
 *> factors in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -123,10 +124,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaqsp.f b/SRC/dlaqsp.f
index 9dddd358..06a34cfb 100644
--- a/SRC/dlaqsp.f
+++ b/SRC/dlaqsp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED )
 * 
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   AP( * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQSP equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -96,10 +95,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -108,10 +109,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaqsy.f b/SRC/dlaqsy.f
index 0b141c2e..2060143f 100644
--- a/SRC/dlaqsy.f
+++ b/SRC/dlaqsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED )
 * 
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQSY equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -104,10 +103,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -116,10 +117,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaqtr.f b/SRC/dlaqtr.f
index eb7595f9..8270ff34 100644
--- a/SRC/dlaqtr.f
+++ b/SRC/dlaqtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAQTR( LTRAN, LREAL, N, T, LDT, B, W, SCALE, X, WORK,
 *                          INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   B( * ), T( LDT, * ), WORK( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAQTR solves the real quasi-triangular system
 *>
@@ -62,11 +62,10 @@
 *>
 *> This subroutine is designed for the condition number estimation
 *> in routine DTRSNA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] LTRAN
 *> \verbatim
@@ -149,10 +148,9 @@
 *>          NOTE: In the interests of speed, this routine does not
 *>                check the inputs for errors.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlar1v.f b/SRC/dlar1v.f
index ceeb7d06..d92e7288 100644
--- a/SRC/dlar1v.f
+++ b/SRC/dlar1v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
 *                  PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
@@ -35,11 +35,11 @@
 *       DOUBLE PRECISION Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAR1V computes the (scaled) r-th column of the inverse of
 *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix
@@ -56,11 +56,10 @@
 *> (d) Computation of the (scaled) r-th column of the inverse using the
 *>     twisted factorization obtained by combining the top part of the
 *>     the stationary and the bottom part of the progressive transform.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -204,10 +203,9 @@
 *> \verbatim
 *>          WORK is DOUBLE PRECISION array, dimension (4*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -218,21 +216,15 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
      $           PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
diff --git a/SRC/dlar2v.f b/SRC/dlar2v.f
index 6d406758..eb87fc92 100644
--- a/SRC/dlar2v.f
+++ b/SRC/dlar2v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAR2V( N, X, Y, Z, INCX, C, S, INCC )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   C( * ), S( * ), X( * ), Y( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAR2V applies a vector of real plane rotations from both sides to
 *> a sequence of 2-by-2 real symmetric matrices, defined by the elements
@@ -39,11 +39,10 @@
 *>
 *>    ( x(i)  z(i) ) := (  c(i)  s(i) ) ( x(i)  z(i) ) ( c(i) -s(i) )
 *>    ( z(i)  y(i) )    ( -s(i)  c(i) ) ( z(i)  y(i) ) ( s(i)  c(i) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlarf.f b/SRC/dlarf.f
index 4967ffc6..a5776d88 100644
--- a/SRC/dlarf.f
+++ b/SRC/dlarf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARF applies a real elementary reflector H to a real m by n matrix
 *> C, from either the left or the right. H is represented in the form
@@ -43,11 +43,10 @@
 *> where tau is a real scalar and v is a real vector.
 *>
 *> If tau = 0, then H is taken to be the unit matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlarfb.f b/SRC/dlarfb.f
index 542b6724..c3dda560 100644
--- a/SRC/dlarfb.f
+++ b/SRC/dlarfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV,
 *                          T, LDT, C, LDC, WORK, LDWORK )
@@ -30,19 +30,18 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARFB applies a real block reflector H or its transpose H**T to a
 *> real m by n matrix C, from either the left or the right.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,10 +163,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -192,7 +189,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlarfg.f b/SRC/dlarfg.f
index c24f40b5..cf95e3ab 100644
--- a/SRC/dlarfg.f
+++ b/SRC/dlarfg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARFG( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARFG generates a real elementary reflector H of order n, such
 *> that
@@ -53,11 +53,10 @@
 *> the unit matrix.
 *>
 *> Otherwise  1 <= tau <= 2.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          TAU is DOUBLE PRECISION
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlarfgp.f b/SRC/dlarfgp.f
index 65fbe3fd..eae04dc1 100644
--- a/SRC/dlarfgp.f
+++ b/SRC/dlarfgp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARFGP( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARFGP generates a real elementary reflector H of order n, such
 *> that
@@ -51,11 +51,10 @@
 *>
 *> If the elements of x are all zero, then tau = 0 and H is taken to be
 *> the unit matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          TAU is DOUBLE PRECISION
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlarft.f b/SRC/dlarft.f
index 7ded09ad..46c21a11 100644
--- a/SRC/dlarft.f
+++ b/SRC/dlarft.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARFT forms the triangular factor T of a real block reflector H
 *> of order n, which is defined as a product of k elementary reflectors.
@@ -50,11 +50,10 @@
 *> H(i) is stored in the i-th row of the array V, and
 *>
 *>    H  =  I - V**T * T * V
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,10 +134,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -163,7 +160,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlarfx.f b/SRC/dlarfx.f
index 77d9808c..cf28e2ca 100644
--- a/SRC/dlarfx.f
+++ b/SRC/dlarfx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARFX( SIDE, M, N, V, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARFX applies a real elementary reflector H to a real m by n
 *> matrix C, from either the left or the right. H is represented in the
@@ -46,11 +46,10 @@
 *> If tau = 0, then H is taken to be the unit matrix
 *>
 *> This version uses inline code if H has order < 11.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -105,10 +104,9 @@
 *>                      or (M) if SIDE = 'R'
 *>          WORK is not referenced if H has order < 11.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlargv.f b/SRC/dlargv.f
index f066dbd3..1c66f794 100644
--- a/SRC/dlargv.f
+++ b/SRC/dlargv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARGV( N, X, INCX, Y, INCY, C, INCC )
 * 
@@ -27,22 +27,21 @@
 *       DOUBLE PRECISION   C( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARGV generates a vector of real plane rotations, determined by
 *> elements of the real vectors x and y. For i = 1,2,...,n
 *>
 *>    (  c(i)  s(i) ) ( x(i) ) = ( a(i) )
 *>    ( -s(i)  c(i) ) ( y(i) ) = (   0  )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlarnv.f b/SRC/dlarnv.f
index da359c80..ce898c50 100644
--- a/SRC/dlarnv.f
+++ b/SRC/dlarnv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARNV( IDIST, ISEED, N, X )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARNV returns a vector of n random real numbers from a uniform or
 *> normal distribution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IDIST
 *> \verbatim
@@ -71,10 +70,9 @@
 *>          X is DOUBLE PRECISION array, dimension (N)
 *>          The generated random numbers.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -85,17 +83,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine calls the auxiliary routine DLARUV to generate random
 *>  real numbers from a uniform (0,1) distribution, in batches of up to
 *>  128 using vectorisable code. The Box-Muller method is used to
 *>  transform numbers from a uniform to a normal distribution.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlarra.f b/SRC/dlarra.f
index 39c7051f..b6f92f32 100644
--- a/SRC/dlarra.f
+++ b/SRC/dlarra.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRA( N, D, E, E2, SPLTOL, TNRM,
 *                           NSPLIT, ISPLIT, INFO )
@@ -30,19 +30,18 @@
 *       DOUBLE PRECISION   D( * ), E( * ), E2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Compute the splitting points with threshold SPLTOL.
 *> DLARRA sets any "small" off-diagonal elements to zero.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,21 +123,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLARRA( N, D, E, E2, SPLTOL, TNRM,
      $                    NSPLIT, ISPLIT, INFO )
diff --git a/SRC/dlarrb.f b/SRC/dlarrb.f
index 5a92f260..cae8f7ba 100644
--- a/SRC/dlarrb.f
+++ b/SRC/dlarrb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRB( N, D, LLD, IFIRST, ILAST, RTOL1,
 *                          RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK,
@@ -32,11 +32,11 @@
 *      $                   WERR( * ), WGAP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given the relatively robust representation(RRR) L D L^T, DLARRB
 *> does "limited" bisection to refine the eigenvalues of L D L^T,
@@ -46,11 +46,10 @@
 *> and WGAP, respectively. During bisection, intervals
 *> [left, right] are maintained by storing their mid-points and
 *> semi-widths in the arrays W and WERR respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -170,10 +169,9 @@
 *>          INFO is INTEGER
 *>          Error flag.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -184,21 +182,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLARRB( N, D, LLD, IFIRST, ILAST, RTOL1,
      $                   RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK,
diff --git a/SRC/dlarrc.f b/SRC/dlarrc.f
index 8e0a843c..5ec876a9 100644
--- a/SRC/dlarrc.f
+++ b/SRC/dlarrc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRC( JOBT, N, VL, VU, D, E, PIVMIN,
 *                                   EIGCNT, LCNT, RCNT, INFO )
@@ -30,20 +30,19 @@
 *       DOUBLE PRECISION   D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Find the number of eigenvalues of the symmetric tridiagonal matrix T
 *> that are in the interval (VL,VU] if JOBT = 'T', and of L D L^T
 *> if JOBT = 'L'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBT
 *> \verbatim
@@ -111,10 +110,9 @@
 *> \verbatim
 *>          INFO is INTEGER
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,21 +123,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLARRC( JOBT, N, VL, VU, D, E, PIVMIN,
      $                            EIGCNT, LCNT, RCNT, INFO )
diff --git a/SRC/dlarrd.f b/SRC/dlarrd.f
index 2cfdd268..7e6031ac 100644
--- a/SRC/dlarrd.f
+++ b/SRC/dlarrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRD( RANGE, ORDER, N, VL, VU, IL, IU, GERS,
 *                           RELTOL, D, E, E2, PIVMIN, NSPLIT, ISPLIT,
@@ -35,11 +35,11 @@
 *      $                   GERS( * ), W( * ), WERR( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARRD computes the eigenvalues of a symmetric tridiagonal
 *> matrix T to suitable accuracy. This is an auxiliary code to be
@@ -55,11 +55,10 @@
 *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal
 *> Matrix", Report CS41, Computer Science Dept., Stanford
 *> University, July 21, 1966.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RANGE
 *> \verbatim
@@ -279,10 +278,12 @@
 *>                                        floating-point arithmetic.
 *>                        Cure: Increase the PARAMETER "FUDGE",
 *>                              recompile, and try again.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  FUDGE   DOUBLE PRECISION, default = 2
 *>          A "fudge factor" to widen the Gershgorin intervals.  Ideally,
 *>          a value of 1 should work, but on machines with sloppy
@@ -290,19 +291,20 @@
 *>          publicly released versions should be large enough to handle
 *>          the worst machine around.  Note that this has no effect
 *>          on accuracy of the solution.
-*>
-*>  Based on contributions by
-*>     W. Kahan, University of California, Berkeley, USA
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
 *> \endverbatim
 *>
+*> \par Contributors:
+*  ==================
+*>
+*>     W. Kahan, University of California, Berkeley, USA \n
+*>     Beresford Parlett, University of California, Berkeley, USA \n
+*>     Jim Demmel, University of California, Berkeley, USA \n
+*>     Inderjit Dhillon, University of Texas, Austin, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*>     Christof Voemel, University of California, Berkeley, USA \n
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlarre.f b/SRC/dlarre.f
index 946e0c49..1b079856 100644
--- a/SRC/dlarre.f
+++ b/SRC/dlarre.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2,
 *                           RTOL1, RTOL2, SPLTOL, NSPLIT, ISPLIT, M,
@@ -35,11 +35,11 @@
 *      $                   W( * ),WERR( * ), WGAP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> To find the desired eigenvalues of a given real symmetric
 *> tridiagonal matrix T, DLARRE sets any "small" off-diagonal
@@ -54,11 +54,10 @@
 *> conpute all and then discard any unwanted one.
 *> As an added benefit, DLARRE also outputs the n
 *> Gerschgorin intervals for the matrices L_i D_i L_i^T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RANGE
 *> \verbatim
@@ -260,10 +259,9 @@
 *>          =-5:  Problem in DLASQ2.
 *>          =-6:  Problem in DLASQ2.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -274,24 +272,24 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The base representations are required to suffer very little
 *>  element growth and consequently define all their eigenvalues to
 *>  high relative accuracy.
-*>  ===============
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Beresford Parlett, University of California, Berkeley, USA \n
+*>     Jim Demmel, University of California, Berkeley, USA \n
+*>     Inderjit Dhillon, University of Texas, Austin, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*>     Christof Voemel, University of California, Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE DLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2,
diff --git a/SRC/dlarrf.f b/SRC/dlarrf.f
index 38bf888d..d1ffbb24 100644
--- a/SRC/dlarrf.f
+++ b/SRC/dlarrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRF( N, D, L, LD, CLSTRT, CLEND,
 *                          W, WGAP, WERR,
@@ -32,22 +32,21 @@
 *      $          LPLUS( * ), W( * ), WGAP( * ), WERR( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given the initial representation L D L^T and its cluster of close
 *> eigenvalues (in a relative measure), W( CLSTRT ), W( CLSTRT+1 ), ...
 *> W( CLEND ), DLARRF finds a new relatively robust representation
 *> L D L^T - SIGMA I = L(+) D(+) L(+)^T such that at least one of the
 *> eigenvalues of L(+) D(+) L(+)^T is relatively isolated.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -166,10 +165,9 @@
 *>          INFO is INTEGER
 *>          Signals processing OK (=0) or failure (=1)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -180,21 +178,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLARRF( N, D, L, LD, CLSTRT, CLEND,
      $                   W, WGAP, WERR,
diff --git a/SRC/dlarrj.f b/SRC/dlarrj.f
index 4e96e4cf..64c0c522 100644
--- a/SRC/dlarrj.f
+++ b/SRC/dlarrj.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRJ( N, D, E2, IFIRST, ILAST,
 *                          RTOL, OFFSET, W, WERR, WORK, IWORK,
@@ -32,11 +32,11 @@
 *      $                   WERR( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given the initial eigenvalue approximations of T, DLARRJ
 *> does  bisection to refine the eigenvalues of T,
@@ -45,11 +45,10 @@
 *> of the error in these guesses in WERR. During bisection, intervals
 *> [left, right] are maintained by storing their mid-points and
 *> semi-widths in the arrays W and WERR respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          INFO is INTEGER
 *>          Error flag.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -156,21 +154,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLARRJ( N, D, E2, IFIRST, ILAST,
      $                   RTOL, OFFSET, W, WERR, WORK, IWORK,
diff --git a/SRC/dlarrk.f b/SRC/dlarrk.f
index b04dfcad..666244f9 100644
--- a/SRC/dlarrk.f
+++ b/SRC/dlarrk.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRK( N, IW, GL, GU,
 *                           D, E2, PIVMIN, RELTOL, W, WERR, INFO)
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   D( * ), E2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARRK computes one eigenvalue of a symmetric tridiagonal
 *> matrix T to suitable accuracy. This is an auxiliary code to be
@@ -46,11 +46,10 @@
 *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal
 *> Matrix", Report CS41, Computer Science Dept., Stanford
 *> University, July 21, 1966.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -120,17 +119,18 @@
 *>          INFO is INTEGER
 *>          = 0:       Eigenvalue converged
 *>          = -1:      Eigenvalue did NOT converge
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  FUDGE   DOUBLE PRECISION, default = 2
 *>          A "fudge factor" to widen the Gershgorin intervals.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlarrr.f b/SRC/dlarrr.f
index e9bba067..d4b0c1aa 100644
--- a/SRC/dlarrr.f
+++ b/SRC/dlarrr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRR( N, D, E, INFO )
 * 
@@ -28,20 +28,19 @@
 *       ..
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Perform tests to decide whether the symmetric tridiagonal matrix T
 *> warrants expensive computations which guarantee high relative accuracy
 *> in the eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -70,10 +69,9 @@
 *>          INFO = 1          : the matrix warrants computations guaranteeing
 *>                              only absolute accuracy.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -84,21 +82,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLARRR( N, D, E, INFO )
 *
diff --git a/SRC/dlarrv.f b/SRC/dlarrv.f
index 5cbbc4f3..c7e85ccd 100644
--- a/SRC/dlarrv.f
+++ b/SRC/dlarrv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARRV( N, VL, VU, D, L, PIVMIN,
 *                          ISPLIT, M, DOL, DOU, MINRGP,
@@ -36,20 +36,19 @@
 *       DOUBLE PRECISION  Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARRV computes the eigenvectors of the tridiagonal matrix
 *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.
 *> The input eigenvalues should have been computed by DLARRE.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -255,10 +254,9 @@
 *>          = 5:  The Rayleigh Quotient Iteration failed to converge to
 *>                full accuracy in MAXITR steps.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -269,21 +267,15 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DLARRV( N, VL, VU, D, L, PIVMIN,
      $                   ISPLIT, M, DOL, DOU, MINRGP,
diff --git a/SRC/dlarscl2.f b/SRC/dlarscl2.f
index 01e9f131..9bbe1b51 100644
--- a/SRC/dlarscl2.f
+++ b/SRC/dlarscl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARSCL2 ( M, N, D, X, LDX )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   D( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARSCL2 performs a reciprocal diagonal scaling on an vector:
 *>   x <-- inv(D) * x
@@ -39,11 +39,10 @@
 *>
 *> Eventually to be replaced by BLAS_dge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlartg.f b/SRC/dlartg.f
index 82f301b6..11bda9d8 100644
--- a/SRC/dlartg.f
+++ b/SRC/dlartg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARTG( F, G, CS, SN, R )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   CS, F, G, R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARTG generate a plane rotation so that
 *>
@@ -44,11 +44,10 @@
 *>       there are zeros on the diagonal).
 *>
 *> If F exceeds G in magnitude, CS will be positive.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -82,10 +81,9 @@
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlartgp.f b/SRC/dlartgp.f
index 7935ded5..0ec9c89d 100644
--- a/SRC/dlartgp.f
+++ b/SRC/dlartgp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARTGP( F, G, CS, SN, R )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   CS, F, G, R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARTGP generates a plane rotation so that
 *>
@@ -42,11 +42,10 @@
 *>    If F=0 and (G .ne. 0), then CS=0 and SN=(+/-)1.
 *>
 *> The sign is chosen so that R >= 0.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -80,10 +79,9 @@
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlartgs.f b/SRC/dlartgs.f
index 5fa3b12c..801a4201 100644
--- a/SRC/dlartgs.f
+++ b/SRC/dlartgs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARTGS( X, Y, SIGMA, CS, SN )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION        CS, SIGMA, SN, X, Y
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARTGS generates a plane rotation designed to introduce a bulge in
 *> Golub-Reinsch-style implicit QR iteration for the bidiagonal SVD
@@ -40,11 +40,10 @@
 *>
 *> with R nonnegative.  If X^2 - SIGMA and X * Y are 0, then the
 *> rotation is by PI/2.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          SN is DOUBLE PRECISION
 *>          The sine of the rotation.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlartv.f b/SRC/dlartv.f
index 436b7c5e..8702d3a5 100644
--- a/SRC/dlartv.f
+++ b/SRC/dlartv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARTV( N, X, INCX, Y, INCY, C, S, INCC )
 * 
@@ -27,22 +27,21 @@
 *       DOUBLE PRECISION   C( * ), S( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARTV applies a vector of real plane rotations to elements of the
 *> real vectors x and y. For i = 1,2,...,n
 *>
 *>    ( x(i) ) := (  c(i)  s(i) ) ( x(i) )
 *>    ( y(i) )    ( -s(i)  c(i) ) ( y(i) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlaruv.f b/SRC/dlaruv.f
index fe845bf9..958405f5 100644
--- a/SRC/dlaruv.f
+++ b/SRC/dlaruv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARUV( ISEED, N, X )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   X( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARUV returns a vector of n random real numbers from a uniform (0,1)
 *> distribution (n <= 128).
 *>
 *> This is an auxiliary routine called by DLARNV and ZLARNV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] ISEED
 *> \verbatim
@@ -64,10 +63,9 @@
 *>          X is DOUBLE PRECISION array, dimension (N)
 *>          The generated random numbers.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -78,10 +76,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine uses a multiplicative congruential method with modulus
@@ -93,7 +90,6 @@
 *>  48-bit integers are stored in 4 integer array elements with 12 bits
 *>  per element. Hence the routine is portable across machines with
 *>  integers of 32 bits or more.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlarz.f b/SRC/dlarz.f
index 5c148d5e..7f34ccf9 100644
--- a/SRC/dlarz.f
+++ b/SRC/dlarz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARZ applies a real elementary reflector H to a real M-by-N
 *> matrix C, from either the left or the right. H is represented in the
@@ -47,11 +47,10 @@
 *>
 *>
 *> H is a product of k elementary reflectors as returned by DTZRZF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -119,10 +118,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -133,15 +131,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlarzb.f b/SRC/dlarzb.f
index 66a8a456..e3d4f7b1 100644
--- a/SRC/dlarzb.f
+++ b/SRC/dlarzb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V,
 *                          LDV, T, LDT, C, LDC, WORK, LDWORK )
@@ -30,21 +30,20 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARZB applies a real block reflector H or its transpose H**T to
 *> a real distributed M-by-N  C from the left or the right.
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -170,15 +168,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlarzt.f b/SRC/dlarzt.f
index 51ceb0e0..f3ea513f 100644
--- a/SRC/dlarzt.f
+++ b/SRC/dlarzt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLARZT forms the triangular factor T of a real block reflector
 *> H of order > n, which is defined as a product of k elementary
@@ -53,11 +53,10 @@
 *>    H  =  I - V**T * T * V
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,14 +137,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
 *>  the H(i) is best illustrated by the following example with n = 5 and
@@ -181,7 +180,6 @@
 *>     V = ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlas2.f b/SRC/dlas2.f
index a6a5f714..7c6fb8df 100644
--- a/SRC/dlas2.f
+++ b/SRC/dlas2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAS2( F, G, H, SSMIN, SSMAX )
 * 
@@ -24,22 +24,21 @@
 *       DOUBLE PRECISION   F, G, H, SSMAX, SSMIN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAS2  computes the singular values of the 2-by-2 matrix
 *>    [  F   G  ]
 *>    [  0   H  ].
 *> On return, SSMIN is the smaller singular value and SSMAX is the
 *> larger singular value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -70,10 +69,9 @@
 *>          SSMAX is DOUBLE PRECISION
 *>          The larger singular value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -84,10 +82,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Barring over/underflow, all output quantities are correct to within
@@ -105,7 +102,6 @@
 *>  Underflow is harmless if underflow is gradual. Otherwise, results
 *>  may correspond to a matrix modified by perturbations of size near
 *>  the underflow threshold.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlascl.f b/SRC/dlascl.f
index f7748b47..99776c78 100644
--- a/SRC/dlascl.f
+++ b/SRC/dlascl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO )
 * 
@@ -29,22 +29,21 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASCL multiplies the M by N real matrix A by the real scalar
 *> CTO/CFROM.  This is done without over/underflow as long as the final
 *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that
 *> A may be full, upper triangular, lower triangular, upper Hessenberg,
 *> or banded.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TYPE
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          0  - successful exit
 *>          <0 - if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlascl2.f b/SRC/dlascl2.f
index 7ab57121..1fc0af19 100644
--- a/SRC/dlascl2.f
+++ b/SRC/dlascl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASCL2 ( M, N, D, X, LDX )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   D( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASCL2 performs a diagonal scaling on a vector:
 *>   x <-- D * x
@@ -39,11 +39,10 @@
 *>
 *> Eventually to be replaced by BLAS_dge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasd0.f b/SRC/dlasd0.f
index acddc3af..e0531cd1 100644
--- a/SRC/dlasd0.f
+++ b/SRC/dlasd0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK,
 *                          WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Using a divide and conquer approach, DLASD0 computes the singular
 *> value decomposition (SVD) of a real upper bidiagonal N-by-M
@@ -44,11 +44,10 @@
 *>
 *> A related subroutine, DLASDA, computes only the singular values,
 *> and optionally, the singular vectors in compact form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -130,10 +129,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -144,18 +142,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK,
      $                   WORK, INFO )
diff --git a/SRC/dlasd1.f b/SRC/dlasd1.f
index d8626c2c..0c3d07e7 100644
--- a/SRC/dlasd1.f
+++ b/SRC/dlasd1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT,
 *                          IDXQ, IWORK, WORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   D( * ), U( LDU, * ), VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASD1 computes the SVD of an upper bidiagonal N-by-M matrix B,
 *> where N = NL + NR + 1 and M = N + SQRE. DLASD1 is called from DLASD0.
@@ -74,11 +74,10 @@
 *>    directly using the updated singular values.  The singular vectors
 *>    for the current problem are multiplied with the singular vectors
 *>    from the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NL
 *> \verbatim
@@ -182,10 +181,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -196,18 +194,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT,
      $                   IDXQ, IWORK, WORK, INFO )
diff --git a/SRC/dlasd2.f b/SRC/dlasd2.f
index 0565d363..e854fda2 100644
--- a/SRC/dlasd2.f
+++ b/SRC/dlasd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT,
 *                          LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX,
@@ -34,11 +34,11 @@
 *      $                   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASD2 merges the two sets of singular values together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -48,11 +48,10 @@
 *> equation problem is reduced by one.
 *>
 *> DLASD2 is called from DLASD1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NL
 *> \verbatim
@@ -246,10 +245,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -260,18 +258,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT,
      $                   LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX,
diff --git a/SRC/dlasd3.f b/SRC/dlasd3.f
index 19045915..9596b7a3 100644
--- a/SRC/dlasd3.f
+++ b/SRC/dlasd3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2,
 *                          LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z,
@@ -33,11 +33,11 @@
 *      $                   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASD3 finds all the square roots of the roots of the secular
 *> equation, as defined by the values in D and Z.  It makes the
@@ -52,11 +52,10 @@
 *> without guard digits, but we know of none.
 *>
 *> DLASD3 is called from DLASD1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NL
 *> \verbatim
@@ -202,10 +201,9 @@
 *>         < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>         > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -216,18 +214,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2,
      $                   LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z,
diff --git a/SRC/dlasd4.f b/SRC/dlasd4.f
index 79a0b0b1..5323e74e 100644
--- a/SRC/dlasd4.f
+++ b/SRC/dlasd4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * ), DELTA( * ), WORK( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the square root of the I-th updated
 *> eigenvalue of a positive symmetric rank-one modification to
@@ -50,11 +50,10 @@
 *>
 *> The method consists of approximating the rational functions in the
 *> secular equation by simpler interpolating rational functions.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -114,10 +113,12 @@
 *>          INFO is INTEGER
 *>         = 0:  successful exit
 *>         > 0:  if INFO = 1, the updating process failed.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  Logical variable ORGATI (origin-at-i?) is used for distinguishing
 *>  whether D(i) or D(i+1) is treated as the origin.
 *>
@@ -130,10 +131,9 @@
 *>  MAXIT is the maximum number of iterations allowed for each
 *>  eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -144,18 +144,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO )
 *
diff --git a/SRC/dlasd5.f b/SRC/dlasd5.f
index 4ea869f6..67a76c19 100644
--- a/SRC/dlasd5.f
+++ b/SRC/dlasd5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( 2 ), DELTA( 2 ), WORK( 2 ), Z( 2 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the square root of the I-th eigenvalue
 *> of a positive symmetric rank-one modification of a 2-by-2 diagonal
@@ -46,11 +46,10 @@
 *>
 *> We also assume RHO > 0 and that the Euclidean norm of the vector
 *> Z is one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          WORK is DOUBLE PRECISION array, dimension ( 2 )
 *>         WORK contains (D(j) + sigma_I) in its  j-th component.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -109,18 +107,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK )
 *
diff --git a/SRC/dlasd6.f b/SRC/dlasd6.f
index 5f34d79d..7a8c7999 100644
--- a/SRC/dlasd6.f
+++ b/SRC/dlasd6.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA,
 *                          IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM,
@@ -36,11 +36,11 @@
 *      $                   VF( * ), VL( * ), WORK( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASD6 computes the SVD of an updated upper bidiagonal matrix B
 *> obtained by merging two smaller ones by appending a row. This
@@ -86,11 +86,10 @@
 *>       values.
 *>
 *> DLASD6 is called from DLASDA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -290,10 +289,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -304,18 +302,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA,
      $                   IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM,
diff --git a/SRC/dlasd7.f b/SRC/dlasd7.f
index de432ffa..e471f826 100644
--- a/SRC/dlasd7.f
+++ b/SRC/dlasd7.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL,
 *                          VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ,
@@ -36,11 +36,11 @@
 *      $                   ZW( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASD7 merges the two sets of singular values together into a single
 *> sorted set. Then it tries to deflate the size of the problem. There
@@ -50,11 +50,10 @@
 *> secular equation problem is reduced by one.
 *>
 *> DLASD7 is called from DLASD6.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -256,10 +255,9 @@
 *>         = 0:  successful exit.
 *>         < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -270,18 +268,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL,
      $                   VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ,
diff --git a/SRC/dlasd8.f b/SRC/dlasd8.f
index 4873c5a2..9572782a 100644
--- a/SRC/dlasd8.f
+++ b/SRC/dlasd8.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR,
 *                          DSIGMA, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASD8 finds the square roots of the roots of the secular equation,
 *> as defined by the values in DSIGMA and Z. It makes the appropriate
@@ -44,11 +44,10 @@
 *> right singular vectors of the original bidiagonal matrix.
 *>
 *> DLASD8 is called from DLASD6.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -144,10 +143,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -158,18 +156,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR,
      $                   DSIGMA, WORK, INFO )
diff --git a/SRC/dlasda.f b/SRC/dlasda.f
index cd074b42..9f3c7e61 100644
--- a/SRC/dlasda.f
+++ b/SRC/dlasda.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K,
 *                          DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL,
@@ -34,11 +34,11 @@
 *      $                   Z( LDU, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Using a divide and conquer approach, DLASDA computes the singular
 *> value decomposition (SVD) of a real upper bidiagonal N-by-M matrix
@@ -49,11 +49,10 @@
 *>
 *> A related subroutine, DLASD0, computes the singular values and
 *> the singular vectors in explicit form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -251,10 +250,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -265,18 +263,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K,
      $                   DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL,
diff --git a/SRC/dlasdq.f b/SRC/dlasdq.f
index 36b8c4c2..ad501637 100644
--- a/SRC/dlasdq.f
+++ b/SRC/dlasdq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT,
 *                          U, LDU, C, LDC, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASDQ computes the singular value decomposition (SVD) of a real
 *> (upper or lower) bidiagonal matrix with diagonal D and offdiagonal
@@ -50,11 +50,10 @@
 *> See "Computing  Small Singular Values of Bidiagonal Matrices With
 *> Guaranteed High Relative Accuracy," by J. Demmel and W. Kahan,
 *> LAPACK Working Note #3, for a detailed description of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -189,10 +188,9 @@
 *>        If INFO > 0, the algorithm did not converge, and INFO
 *>        specifies how many superdiagonals did not converge.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,18 +201,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT,
      $                   U, LDU, C, LDC, WORK, INFO )
diff --git a/SRC/dlasdt.f b/SRC/dlasdt.f
index db85d801..962472ec 100644
--- a/SRC/dlasdt.f
+++ b/SRC/dlasdt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
 * 
@@ -27,19 +27,18 @@
 *       INTEGER            INODE( * ), NDIML( * ), NDIMR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASDT creates a tree of subproblems for bidiagonal divide and
 *> conquer.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -84,10 +83,9 @@
 *>          On entry, the maximum row dimension each subproblem at the
 *>          bottom of the tree can be of.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,18 +96,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
 *
diff --git a/SRC/dlaset.f b/SRC/dlaset.f
index 12468694..be917e8c 100644
--- a/SRC/dlaset.f
+++ b/SRC/dlaset.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASET( UPLO, M, N, ALPHA, BETA, A, LDA )
 * 
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASET initializes an m-by-n matrix A to BETA on the diagonal and
 *> ALPHA on the offdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasq1.f b/SRC/dlasq1.f
index 34dbf034..b8289f8b 100644
--- a/SRC/dlasq1.f
+++ b/SRC/dlasq1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASQ1( N, D, E, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASQ1 computes the singular values of a real N-by-N bidiagonal
 *> matrix with diagonal D and off-diagonal E. The singular values
@@ -45,11 +45,10 @@
 *>
 *> and the present implementation is described in "An implementation of
 *> the dqds Algorithm (Positive Case)", LAPACK Working Note.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>             = 3, termination criterion of outer while loop not met 
 *>                  (program created more than N unreduced blocks)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasq2.f b/SRC/dlasq2.f
index 391124fa..d16b4041 100644
--- a/SRC/dlasq2.f
+++ b/SRC/dlasq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASQ2( N, Z, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASQ2 computes all the eigenvalues of the symmetric positive 
 *> definite tridiagonal matrix associated with the qd array Z to high
@@ -48,11 +48,10 @@
 *> on machines which follow ieee-754 floating-point standard in their
 *> handling of infinities and NaNs, and false otherwise. This variable
 *> is passed to DLASQ3.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>              = 3, termination criterion of outer while loop not met 
 *>                   (program created more than N unreduced blocks)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,16 +99,14 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Local Variables: I0:N0 defines a current unreduced segment of Z.
 *>  The shifts are accumulated in SIGMA. Iteration count is in ITER.
 *>  Ping-pong is controlled by PP (alternates between 0 and 1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlasq3.f b/SRC/dlasq3.f
index 2711c157..13437c25 100644
--- a/SRC/dlasq3.f
+++ b/SRC/dlasq3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASQ3( I0, N0, Z, PP, DMIN, SIGMA, DESIG, QMAX, NFAIL,
 *                          ITER, NDIV, IEEE, TTYPE, DMIN1, DMIN2, DN, DN1,
@@ -32,20 +32,19 @@
 *       DOUBLE PRECISION   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASQ3 checks for deflation, computes a shift (TAU) and calls dqds.
 *> In case of failure it changes shifts, and tries again until output
 *> is positive.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -165,10 +164,9 @@
 *>         These are passed as arguments in order to save their values
 *>         between calls to DLASQ3.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasq4.f b/SRC/dlasq4.f
index 05feb8e1..8fc33ede 100644
--- a/SRC/dlasq4.f
+++ b/SRC/dlasq4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASQ4( I0, N0, Z, PP, N0IN, DMIN, DMIN1, DMIN2, DN,
 *                          DN1, DN2, TAU, TTYPE, G )
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASQ4 computes an approximation TAU to the smallest eigenvalue
 *> using values of d from the previous transform.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -127,10 +126,9 @@
 *>        G is passed as an argument in order to save its value between
 *>        calls to DLASQ4.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,14 +139,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  CNST1 = 9/16
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlasq5.f b/SRC/dlasq5.f
index 2791320e..b1abc9d1 100644
--- a/SRC/dlasq5.f
+++ b/SRC/dlasq5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASQ5( I0, N0, Z, PP, TAU, DMIN, DMIN1, DMIN2, DN,
 *                          DNM1, DNM2, IEEE )
@@ -30,19 +30,18 @@
 *       DOUBLE PRECISION   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASQ5 computes one dqds transform in ping-pong form, one
 *> version for IEEE machines another for non IEEE machines.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          IEEE is LOGICAL
 *>        Flag for IEEE or non IEEE arithmetic.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasq6.f b/SRC/dlasq6.f
index 342f617c..4ec5c13a 100644
--- a/SRC/dlasq6.f
+++ b/SRC/dlasq6.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASQ6( I0, N0, Z, PP, DMIN, DMIN1, DMIN2, DN,
 *                          DNM1, DNM2 )
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASQ6 computes one dqd (shift equal to zero) transform in
 *> ping-pong form, with protection against underflow and overflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          DNM2 is DOUBLE PRECISION
 *>        d(N0-2).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasr.f b/SRC/dlasr.f
index 4902e92f..6f71d212 100644
--- a/SRC/dlasr.f
+++ b/SRC/dlasr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASR applies a sequence of plane rotations to a real matrix A,
 *> from either the left or the right.
@@ -105,11 +105,10 @@
 *> 
 *> where R(k) appears in rows and columns k and z.  The rotations are
 *> performed without ever forming P(k) explicitly.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -184,10 +183,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasrt.f b/SRC/dlasrt.f
index 135a71d9..170192a0 100644
--- a/SRC/dlasrt.f
+++ b/SRC/dlasrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASRT( ID, N, D, INFO )
 * 
@@ -28,22 +28,21 @@
 *       DOUBLE PRECISION   D( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Sort the numbers in D in increasing order (if ID = 'I') or
 *> in decreasing order (if ID = 'D' ).
 *>
 *> Use Quick Sort, reverting to Insertion sort on arrays of
 *> size <= 20. Dimension of STACK limits N to about 2**32.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ID
 *> \verbatim
@@ -73,10 +72,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlassq.f b/SRC/dlassq.f
index 508b634a..5ad75390 100644
--- a/SRC/dlassq.f
+++ b/SRC/dlassq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASSQ( N, X, INCX, SCALE, SUMSQ )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASSQ  returns the values  scl  and  smsq  such that
 *>
@@ -47,11 +47,10 @@
 *> scl and smsq are overwritten on SCALE and SUMSQ respectively.
 *>
 *> The routine makes only one pass through the vector x.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          On exit, SUMSQ is overwritten with  smsq , the basic sum of
 *>          squares from which  scl  has been factored out.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasv2.f b/SRC/dlasv2.f
index fdc438ae..2077cdec 100644
--- a/SRC/dlasv2.f
+++ b/SRC/dlasv2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASV2( F, G, H, SSMIN, SSMAX, SNR, CSR, SNL, CSL )
 * 
@@ -24,11 +24,11 @@
 *       DOUBLE PRECISION   CSL, CSR, F, G, H, SNL, SNR, SSMAX, SSMIN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASV2 computes the singular value decomposition of a 2-by-2
 *> triangular matrix
@@ -40,11 +40,10 @@
 *>
 *>    [ CSL  SNL ] [  F   G  ] [ CSR -SNR ]  =  [ SSMAX   0   ]
 *>    [-SNL  CSL ] [  0   H  ] [ SNR  CSR ]     [  0    SSMIN ].
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          The vector (CSR, SNR) is a unit right singular vector for the
 *>          singular value abs(SSMAX).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,10 +111,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Any input parameter may be aliased with any output parameter.
@@ -136,7 +133,6 @@
 *>  Underflow is harmless if underflow is gradual. Otherwise, results
 *>  may correspond to a matrix modified by perturbations of size near
 *>  the underflow threshold.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlaswp.f b/SRC/dlaswp.f
index a1253a90..549ef81a 100644
--- a/SRC/dlaswp.f
+++ b/SRC/dlaswp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASWP( N, A, LDA, K1, K2, IPIV, INCX )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASWP performs a series of row interchanges on the matrix A.
 *> One row interchange is initiated for each of rows K1 through K2 of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          The increment between successive values of IPIV.  If IPIV
 *>          is negative, the pivots are applied in reverse order.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,15 +102,13 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by
 *>   R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlasy2.f b/SRC/dlasy2.f
index 9fb84fd8..f618ab52 100644
--- a/SRC/dlasy2.f
+++ b/SRC/dlasy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASY2( LTRANL, LTRANR, ISGN, N1, N2, TL, LDTL, TR,
 *                          LDTR, B, LDB, SCALE, X, LDX, XNORM, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASY2 solves for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in
 *>
@@ -43,11 +43,10 @@
 *>
 *> where TL is N1 by N1, TR is N2 by N2, B is N1 by N2, and ISGN = 1 or
 *> -1.  op(T) = T or T**T, where T**T denotes the transpose of T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] LTRANL
 *> \verbatim
@@ -158,10 +157,9 @@
 *>          NOTE: In the interests of speed, this routine does not
 *>                check the inputs for errors.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlasyf.f b/SRC/dlasyf.f
index ae4b252b..a5a147a4 100644
--- a/SRC/dlasyf.f
+++ b/SRC/dlasyf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLASYF computes a partial factorization of a real symmetric matrix A
 *> using the Bunch-Kaufman diagonal pivoting method. The partial
@@ -51,11 +51,10 @@
 *> DLASYF is an auxiliary routine called by DSYTRF. It uses blocked code
 *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or
 *> A22 (if UPLO = 'L').
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -141,10 +140,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlat2s.f b/SRC/dlat2s.f
index dbd6ec61..f4be4c9c 100644
--- a/SRC/dlat2s.f
+++ b/SRC/dlat2s.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAT2S( UPLO, N, A, LDA, SA, LDSA, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAT2S converts a DOUBLE PRECISION triangular matrix, SA, to a SINGLE
 *> PRECISION triangular matrix, A.
@@ -43,11 +43,10 @@
 *> RMAX. If not the convertion is aborted and a flag is raised.
 *>
 *> This is an auxiliary routine so there is no argument checking.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -96,10 +95,9 @@
 *>                PRECISION overflow threshold, in this case, the content
 *>                of the UPLO part of SA in exit is unspecified.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlatbs.f b/SRC/dlatbs.f
index c24841f6..cf55cc27 100644
--- a/SRC/dlatbs.f
+++ b/SRC/dlatbs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X,
 *                          SCALE, CNORM, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), CNORM( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLATBS solves one of the triangular systems
 *>
@@ -48,11 +48,10 @@
 *> overflow, the Level 2 BLAS routine DTBSV is called.  If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -168,10 +166,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, DTBSV
@@ -239,7 +236,6 @@
 *>
 *>  and we can safely call DTBSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlatdf.f b/SRC/dlatdf.f
index 6aabafea..20fda7cf 100644
--- a/SRC/dlatdf.f
+++ b/SRC/dlatdf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
 *                          JPIV )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   RHS( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLATDF uses the LU factorization of the n-by-n matrix Z computed by
 *> DGETC2 and computes a contribution to the reciprocal Dif-estimate
@@ -45,11 +45,10 @@
 *> The factorization of Z returned by DGETC2 has the form Z = P*L*U*Q,
 *> where P and Q are permutation matrices. L is lower triangular with
 *> unit diagonal elements and U is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          The pivot indices; for 1 <= j <= N, column j of the
 *>          matrix has been interchanged with column JPIV(j).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,18 +137,23 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
+*> \par Further Details:
+*  =====================
+*>
+*>  This routine is a further developed implementation of algorithm
+*>  BSOLVE in [1] using complete pivoting in the LU factorization.
 *
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
-*>  This routine is a further developed implementation of algorithm
-*>  BSOLVE in [1] using complete pivoting in the LU factorization.
 *>
 *>  [1] Bo Kagstrom and Lars Westin,
 *>      Generalized Schur Methods with Condition Estimators for
@@ -162,7 +165,6 @@
 *>      between two Regular Matrix Pairs with Applications in
 *>      Condition Estimation. Report IMINF-95.05, Departement of
 *>      Computing Science, Umea University, S-901 87 Umea, Sweden, 1995.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlatps.f b/SRC/dlatps.f
index 6b28c24e..f9569176 100644
--- a/SRC/dlatps.f
+++ b/SRC/dlatps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE,
 *                          CNORM, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   AP( * ), CNORM( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLATPS solves one of the triangular systems
 *>
@@ -48,11 +48,10 @@
 *> unscaled problem will not cause overflow, the Level 2 BLAS routine
 *> DTPSV is called. If the matrix A is singular (A(j,j) = 0 for some j),
 *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -141,10 +140,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -155,10 +153,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, DTPSV
@@ -226,7 +223,6 @@
 *>
 *>  and we can safely call DTPSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlatrd.f b/SRC/dlatrd.f
index d1b57019..aa083d20 100644
--- a/SRC/dlatrd.f
+++ b/SRC/dlatrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), E( * ), TAU( * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLATRD reduces NB rows and columns of a real symmetric matrix A to
 *> symmetric tridiagonal form by an orthogonal similarity
@@ -45,11 +45,10 @@
 *> matrix, of which the lower triangle is supplied.
 *>
 *> This is an auxiliary routine called by DSYTRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          LDW is INTEGER
 *>          The leading dimension of the array W. LDW >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -145,10 +143,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -196,7 +193,6 @@
 *>  where d denotes a diagonal element of the reduced matrix, a denotes
 *>  an element of the original matrix that is unchanged, and vi denotes
 *>  an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlatrs.f b/SRC/dlatrs.f
index b347f825..ea92a607 100644
--- a/SRC/dlatrs.f
+++ b/SRC/dlatrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE,
 *                          CNORM, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), CNORM( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLATRS solves one of the triangular systems
 *>
@@ -48,11 +48,10 @@
 *> overflow, the Level 2 BLAS routine DTRSV is called.  If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -150,10 +149,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -164,10 +162,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, DTRSV
@@ -235,7 +232,6 @@
 *>
 *>  and we can safely call DTRSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlatrz.f b/SRC/dlatrz.f
index b14539c4..03b19f38 100644
--- a/SRC/dlatrz.f
+++ b/SRC/dlatrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLATRZ( M, N, L, A, LDA, TAU, WORK )
 * 
@@ -27,21 +27,20 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLATRZ factors the M-by-(M+L) real upper trapezoidal matrix
 *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R  0 ) * Z, by means
 *> of orthogonal transformations.  Z is an (M+L)-by-(M+L) orthogonal
 *> matrix and, R and A1 are M-by-M upper triangular matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *> \verbatim
 *>          WORK is DOUBLE PRECISION array, dimension (M)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,14 +101,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -136,7 +135,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dlatzm.f b/SRC/dlatzm.f
index 7bcc3c36..cec63d32 100644
--- a/SRC/dlatzm.f
+++ b/SRC/dlatzm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine DORMRZ.
 *>
@@ -54,11 +54,10 @@
 *>        C = [ C1, C2 ] m
 *>               1  n-1
 *> Then C is overwritten by C*P.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -136,10 +135,9 @@
 *>                      (N) if SIDE = 'L'
 *>                      (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlauu2.f b/SRC/dlauu2.f
index 5803d294..b403e94d 100644
--- a/SRC/dlauu2.f
+++ b/SRC/dlauu2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAUU2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAUU2 computes the product U * U**T or L**T * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the unblocked form of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dlauum.f b/SRC/dlauum.f
index a0595134..29ea86ba 100644
--- a/SRC/dlauum.f
+++ b/SRC/dlauum.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DLAUUM( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DLAUUM computes the product U * U**T or L**T * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the blocked form of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dopgtr.f b/SRC/dopgtr.f
index 62b5d0b9..d0725fa9 100644
--- a/SRC/dopgtr.f
+++ b/SRC/dopgtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DOPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AP( * ), Q( LDQ, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DOPGTR generates a real orthogonal matrix Q which is defined as the
 *> product of n-1 elementary reflectors H(i) of order n, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dopmtr.f b/SRC/dopmtr.f
index 1c35a582..50e920b8 100644
--- a/SRC/dopmtr.f
+++ b/SRC/dopmtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DOPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AP( * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DOPMTR overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -134,10 +133,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorbdb.f b/SRC/dorbdb.f
index a6aae378..7cd9c1df 100644
--- a/SRC/dorbdb.f
+++ b/SRC/dorbdb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
 *                          X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
@@ -34,11 +34,11 @@
 *      $                   X21( LDX21, * ), X22( LDX22, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORBDB simultaneously bidiagonalizes the blocks of an M-by-M
 *> partitioned orthogonal matrix X:
@@ -60,11 +60,10 @@
 *>
 *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented
 *> implicitly by angles THETA, PHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -247,10 +246,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -261,10 +259,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The bidiagonal blocks B11, B12, B21, and B22 are represented
@@ -277,15 +274,14 @@
 *>  P1, P2, Q1, and Q2 are represented as products of elementary
 *>  reflectors. See DORCSD for details on generating P1, P2, Q1, and Q2
 *>  using DORGQR and DORGLQ.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
      $                   X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
diff --git a/SRC/dorcsd.f b/SRC/dorcsd.f
index 1345bbbb..1b140846 100644
--- a/SRC/dorcsd.f
+++ b/SRC/dorcsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE DORCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS,
 *                                    SIGNS, M, P, Q, X11, LDX11, X12,
@@ -38,11 +38,11 @@
 *      $                   * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORCSD computes the CS decomposition of an M-by-M partitioned
 *> orthogonal matrix X:
@@ -59,11 +59,10 @@
 *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are
 *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in
 *> which R = MIN(P,M-P,Q,M-Q).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -274,17 +273,16 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  DBBCSD did not converge. See the description of WORK
 *>                above for details.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
-*> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorg2l.f b/SRC/dorg2l.f
index 2a11d423..c672940a 100644
--- a/SRC/dorg2l.f
+++ b/SRC/dorg2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORG2L( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORG2L generates an m by n real matrix Q with orthonormal columns,
 *> which is defined as the last n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by DGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorg2r.f b/SRC/dorg2r.f
index df9a5e13..9f7fac0a 100644
--- a/SRC/dorg2r.f
+++ b/SRC/dorg2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORG2R( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORG2R generates an m by n real matrix Q with orthonormal columns,
 *> which is defined as the first n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by DGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorgbr.f b/SRC/dorgbr.f
index c65bc073..8cb93442 100644
--- a/SRC/dorgbr.f
+++ b/SRC/dorgbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGBR generates one of the real orthogonal matrices Q or P**T
 *> determined by DGEBRD when reducing a real matrix A to bidiagonal
@@ -52,11 +52,10 @@
 *> rows of P**T, where n >= m >= k;
 *> if k >= n, P**T = G(n-1) . . . G(2) G(1) and DORGBR returns P**T as
 *> an N-by-N matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorghr.f b/SRC/dorghr.f
index 738ec8f8..eb5a9229 100644
--- a/SRC/dorghr.f
+++ b/SRC/dorghr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,22 +27,21 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGHR generates a real orthogonal matrix Q which is defined as the
 *> product of IHI-ILO elementary reflectors of order N, as returned by
 *> DGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorgl2.f b/SRC/dorgl2.f
index 816fd3eb..8b16ce63 100644
--- a/SRC/dorgl2.f
+++ b/SRC/dorgl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGL2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGL2 generates an m by n real matrix Q with orthonormal rows,
 *> which is defined as the first m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by DGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorglq.f b/SRC/dorglq.f
index 19d83458..17814734 100644
--- a/SRC/dorglq.f
+++ b/SRC/dorglq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGLQ generates an M-by-N real matrix Q with orthonormal rows,
 *> which is defined as the first M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by DGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorgql.f b/SRC/dorgql.f
index 2baeb533..b73f33ab 100644
--- a/SRC/dorgql.f
+++ b/SRC/dorgql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGQL generates an M-by-N real matrix Q with orthonormal columns,
 *> which is defined as the last N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by DGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorgqr.f b/SRC/dorgqr.f
index 5c9b5bf1..da0469a0 100644
--- a/SRC/dorgqr.f
+++ b/SRC/dorgqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGQR generates an M-by-N real matrix Q with orthonormal columns,
 *> which is defined as the first N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by DGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorgr2.f b/SRC/dorgr2.f
index de41d940..c1ab7410 100644
--- a/SRC/dorgr2.f
+++ b/SRC/dorgr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGR2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGR2 generates an m by n real matrix Q with orthonormal rows,
 *> which is defined as the last m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by DGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorgrq.f b/SRC/dorgrq.f
index bfb319e1..5569086e 100644
--- a/SRC/dorgrq.f
+++ b/SRC/dorgrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGRQ generates an M-by-N real matrix Q with orthonormal rows,
 *> which is defined as the last M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by DGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorgtr.f b/SRC/dorgtr.f
index dff9bf44..03d416ad 100644
--- a/SRC/dorgtr.f
+++ b/SRC/dorgtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORGTR generates a real orthogonal matrix Q which is defined as the
 *> product of n-1 elementary reflectors of order N, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorm2l.f b/SRC/dorm2l.f
index d706afce..8e5d4362 100644
--- a/SRC/dorm2l.f
+++ b/SRC/dorm2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORM2L overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by DGEQLF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorm2r.f b/SRC/dorm2r.f
index a21f161a..600c6e5f 100644
--- a/SRC/dorm2r.f
+++ b/SRC/dorm2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORM2R overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by DGEQRF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormbr.f b/SRC/dormbr.f
index 523e0959..43d867fc 100644
--- a/SRC/dormbr.f
+++ b/SRC/dormbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> If VECT = 'Q', DORMBR overwrites the general real M-by-N matrix C
 *> with
@@ -62,11 +62,10 @@
 *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix:
 *> if k < nq, P = G(1) G(2) . . . G(k);
 *> if k >= nq, P = G(1) G(2) . . . G(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -179,10 +178,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormhr.f b/SRC/dormhr.f
index c2a66452..a1589b87 100644
--- a/SRC/dormhr.f
+++ b/SRC/dormhr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMHR overwrites the general real M-by-N matrix C with
 *>
@@ -46,11 +46,10 @@
 *> IHI-ILO elementary reflectors, as returned by DGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dorml2.f b/SRC/dorml2.f
index 422ff8ed..40382925 100644
--- a/SRC/dorml2.f
+++ b/SRC/dorml2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORML2 overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by DGELQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormlq.f b/SRC/dormlq.f
index 482b676c..96d7795b 100644
--- a/SRC/dormlq.f
+++ b/SRC/dormlq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMLQ overwrites the general real M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by DGELQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormql.f b/SRC/dormql.f
index 68940442..247de9eb 100644
--- a/SRC/dormql.f
+++ b/SRC/dormql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMQL overwrites the general real M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by DGEQLF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormqr.f b/SRC/dormqr.f
index 011c5665..e5b7e518 100644
--- a/SRC/dormqr.f
+++ b/SRC/dormqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMQR overwrites the general real M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by DGEQRF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormr2.f b/SRC/dormr2.f
index 377d3444..50a06005 100644
--- a/SRC/dormr2.f
+++ b/SRC/dormr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMR2 overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by DGERQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormr3.f b/SRC/dormr3.f
index c4dd5008..c40f250f 100644
--- a/SRC/dormr3.f
+++ b/SRC/dormr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMR3 overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by DTZRZF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,15 +163,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dormrq.f b/SRC/dormrq.f
index e4e1beb6..c266629b 100644
--- a/SRC/dormrq.f
+++ b/SRC/dormrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMRQ overwrites the general real M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by DGERQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dormrz.f b/SRC/dormrz.f
index 52d3e11b..4c5d9b15 100644
--- a/SRC/dormrz.f
+++ b/SRC/dormrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMRZ overwrites the general real M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by DTZRZF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -176,15 +174,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dormtr.f b/SRC/dormtr.f
index 32852b62..d7ac8d76 100644
--- a/SRC/dormtr.f
+++ b/SRC/dormtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DORMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DORMTR overwrites the general real M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpbcon.f b/SRC/dpbcon.f
index 08173553..019ba691 100644
--- a/SRC/dpbcon.f
+++ b/SRC/dpbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric positive definite band matrix using the
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpbequ.f b/SRC/dpbequ.f
index 3820da1a..611c3beb 100644
--- a/SRC/dpbequ.f
+++ b/SRC/dpbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite band matrix A and reduce its condition
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpbrfs.f b/SRC/dpbrfs.f
index 4440aaef..fd046184 100644
--- a/SRC/dpbrfs.f
+++ b/SRC/dpbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite
 *> and banded, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -165,16 +164,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpbstf.f b/SRC/dpbstf.f
index 4d7429ef..d7d6c57a 100644
--- a/SRC/dpbstf.f
+++ b/SRC/dpbstf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBSTF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBSTF computes a split Cholesky factorization of a real
 *> symmetric positive definite band matrix A.
@@ -47,11 +47,10 @@
 *>
 *> where U is upper triangular of order m = (n+kd)/2, and L is lower
 *> triangular of order n-m.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               because the updated element a(i,i) was negative; the
 *>               matrix A is not positive definite.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -150,7 +147,6 @@
 *>  a31  a42  a53  a64  a64   *    *   s13  s24  s53  s64  s75   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpbsv.f b/SRC/dpbsv.f
index b22b8f8f..b8695d88 100644
--- a/SRC/dpbsv.f
+++ b/SRC/dpbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -46,11 +46,10 @@
 *> triangular band matrix, with the same number of superdiagonals or
 *> subdiagonals as A.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup doubleOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -162,7 +159,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpbsvx.f b/SRC/dpbsvx.f
index bb1cf552..16cabdd9 100644
--- a/SRC/dpbsvx.f
+++ b/SRC/dpbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB,
 *                          EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -34,11 +34,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to
 *> compute the solution to a real system of linear equations
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -86,11 +89,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -291,10 +293,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 
@@ -305,10 +306,9 @@
 *
 *> \ingroup doubleOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -336,7 +336,6 @@
 *>     a31  a42  a53  a64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpbtf2.f b/SRC/dpbtf2.f
index 898be3f4..bfbbc573 100644
--- a/SRC/dpbtf2.f
+++ b/SRC/dpbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBTF2( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBTF2 computes the Cholesky factorization of a real symmetric
 *> positive definite band matrix A.
@@ -44,11 +44,10 @@
 *> L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -140,7 +137,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpbtrf.f b/SRC/dpbtrf.f
index 575e5de3..06de6c5c 100644
--- a/SRC/dpbtrf.f
+++ b/SRC/dpbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBTRF computes the Cholesky factorization of a real symmetric
 *> positive definite band matrix A.
@@ -41,11 +41,10 @@
 *>    A = U**T * U,  if UPLO = 'U', or
 *>    A = L  * L**T,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -135,12 +132,13 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
-*>  Contributed by
-*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
+*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
+*
 *  =====================================================================
       SUBROUTINE DPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 *
diff --git a/SRC/dpbtrs.f b/SRC/dpbtrs.f
index 30598a7d..5050dcdf 100644
--- a/SRC/dpbtrs.f
+++ b/SRC/dpbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPBTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite band matrix A using the Cholesky factorization
 *> A = U**T*U or A = L*L**T computed by DPBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpftrf.f b/SRC/dpftrf.f
index 477bbb06..58470b28 100644
--- a/SRC/dpftrf.f
+++ b/SRC/dpftrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPFTRF( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,11 +27,11 @@
 *       .. Array Arguments ..
 *       DOUBLE PRECISION   A( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPFTRF computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A.
@@ -42,11 +42,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -96,10 +95,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -110,10 +108,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -196,7 +193,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpftri.f b/SRC/dpftri.f
index f173f419..3342f0f3 100644
--- a/SRC/dpftri.f
+++ b/SRC/dpftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPFTRI( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,20 +27,19 @@
 *       DOUBLE PRECISION         A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPFTRI computes the inverse of a (real) symmetric positive definite
 *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T
 *> computed by DPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -189,7 +186,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpftrs.f b/SRC/dpftrs.f
index 5bdfa911..3eac679b 100644
--- a/SRC/dpftrs.f
+++ b/SRC/dpftrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( 0: * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPFTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite matrix A using the Cholesky factorization
 *> A = U**T*U or A = L*L**T computed by DPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -197,7 +194,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpocon.f b/SRC/dpocon.f
index d341ea47..7ad6c9c1 100644
--- a/SRC/dpocon.f
+++ b/SRC/dpocon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric positive definite matrix using the
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpoequ.f b/SRC/dpoequ.f
index e6b5db74..6ecf2a65 100644
--- a/SRC/dpoequ.f
+++ b/SRC/dpoequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOEQU( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A and reduce its condition number
@@ -42,11 +42,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpoequb.f b/SRC/dpoequb.f
index 84a6f48b..daecebd3 100644
--- a/SRC/dpoequb.f
+++ b/SRC/dpoequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A and reduce its condition number
@@ -42,11 +42,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dporfs.f b/SRC/dporfs.f
index 5a213ce7..c5e074b8 100644
--- a/SRC/dporfs.f
+++ b/SRC/dporfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPORFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite,
 *> and provides error bounds and backward error estimates for the
 *> solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,16 +158,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dporfsx.f b/SRC/dporfsx.f
index 3772991e..a3b3ed33 100644
--- a/SRC/dporfsx.f
+++ b/SRC/dporfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B,
 *                           LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DPORFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric positive
@@ -58,11 +56,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -378,10 +375,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dposv.f b/SRC/dposv.f
index 1e8963fd..784bd6a1 100644
--- a/SRC/dposv.f
+++ b/SRC/dposv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dposvx.f b/SRC/dposvx.f
index 55dff5b1..4e6f09de 100644
--- a/SRC/dposvx.f
+++ b/SRC/dposvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                          S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK,
@@ -34,11 +34,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to
 *> compute the solution to a real system of linear equations
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -86,11 +89,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -287,10 +289,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 
diff --git a/SRC/dposvxx.f b/SRC/dposvxx.f
index 8c3ff0fb..8af16bd1 100644
--- a/SRC/dposvxx.f
+++ b/SRC/dposvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                           S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T
 *>    to compute the solution to a double precision system of linear equations
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what DPOSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -105,11 +106,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -475,10 +475,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpotf2.f b/SRC/dpotf2.f
index 4604659e..acf564ad 100644
--- a/SRC/dpotf2.f
+++ b/SRC/dpotf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOTF2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOTF2 computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpotrf.f b/SRC/dpotrf.f
index 0e7010d1..7b9cfa4e 100644
--- a/SRC/dpotrf.f
+++ b/SRC/dpotrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOTRF( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOTRF computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -92,10 +91,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpotri.f b/SRC/dpotri.f
index ce3ac0a0..a704ecf4 100644
--- a/SRC/dpotri.f
+++ b/SRC/dpotri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOTRI( UPLO, N, A, LDA, INFO )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOTRI computes the inverse of a real symmetric positive definite
 *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T
 *> computed by DPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -80,10 +79,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpotrs.f b/SRC/dpotrs.f
index 5efb8dc8..d8032e84 100644
--- a/SRC/dpotrs.f
+++ b/SRC/dpotrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPOTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite matrix A using the Cholesky factorization
 *> A = U**T*U or A = L*L**T computed by DPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dppcon.f b/SRC/dppcon.f
index 9c380727..fe0d60dc 100644
--- a/SRC/dppcon.f
+++ b/SRC/dppcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPCON( UPLO, N, AP, ANORM, RCOND, WORK, IWORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric positive definite packed matrix using
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dppequ.f b/SRC/dppequ.f
index 148214d9..d46b34f8 100644
--- a/SRC/dppequ.f
+++ b/SRC/dppequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AP( * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A in packed storage and reduce
@@ -43,11 +43,10 @@
 *> This choice of S puts the condition number of B within a factor N of
 *> the smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpprfs.f b/SRC/dpprfs.f
index 1f0c58c0..93314afe 100644
--- a/SRC/dpprfs.f
+++ b/SRC/dpprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR,
 *                          BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -147,16 +146,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dppsv.f b/SRC/dppsv.f
index bea94b3e..21977017 100644
--- a/SRC/dppsv.f
+++ b/SRC/dppsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPSV( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -123,10 +121,9 @@
 *
 *> \ingroup doubleOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -142,7 +139,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dppsvx.f b/SRC/dppsvx.f
index a4031f9e..57bea1c5 100644
--- a/SRC/dppsvx.f
+++ b/SRC/dppsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB,
 *                          X, LDX, RCOND, FERR, BERR, WORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   FERR( * ), S( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to
 *> compute the solution to a real system of linear equations
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -84,11 +87,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -273,10 +275,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 
@@ -287,10 +288,9 @@
 *
 *> \ingroup doubleOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -306,7 +306,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpptrf.f b/SRC/dpptrf.f
index e6f05e6c..77a77c2f 100644
--- a/SRC/dpptrf.f
+++ b/SRC/dpptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPTRF( UPLO, N, AP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPTRF computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A stored in packed format.
@@ -41,11 +41,10 @@
 *>    A = U**T * U,  if UPLO = 'U', or
 *>    A = L  * L**T,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -84,10 +83,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -117,7 +114,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpptri.f b/SRC/dpptri.f
index 10f77ce0..e12f5316 100644
--- a/SRC/dpptri.f
+++ b/SRC/dpptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPTRI( UPLO, N, AP, INFO )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPTRI computes the inverse of a real symmetric positive definite
 *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T
 *> computed by DPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -78,10 +77,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpptrs.f b/SRC/dpptrs.f
index 2844e051..575334ee 100644
--- a/SRC/dpptrs.f
+++ b/SRC/dpptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPPTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite matrix A in packed storage using the Cholesky
 *> factorization A = U**T*U or A = L*L**T computed by DPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpstf2.f b/SRC/dpstf2.f
index feae5e92..9ef1b2bd 100644
--- a/SRC/dpstf2.f
+++ b/SRC/dpstf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       INTEGER            PIV( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPSTF2 computes the Cholesky factorization with complete
 *> pivoting of a real symmetric positive semidefinite matrix A.
@@ -47,11 +47,10 @@
 *>
 *> This algorithm does not attempt to check that A is positive
 *> semidefinite. This version of the algorithm calls level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -125,10 +124,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 
diff --git a/SRC/dpstrf.f b/SRC/dpstrf.f
index 0842d78b..9f44b430 100644
--- a/SRC/dpstrf.f
+++ b/SRC/dpstrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       INTEGER            PIV( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPSTRF computes the Cholesky factorization with complete
 *> pivoting of a real symmetric positive semidefinite matrix A.
@@ -47,11 +47,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
@@ -125,10 +124,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 
diff --git a/SRC/dptcon.f b/SRC/dptcon.f
index 948baa1d..27997375 100644
--- a/SRC/dptcon.f
+++ b/SRC/dptcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTCON( N, D, E, ANORM, RCOND, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPTCON computes the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric positive definite tridiagonal matrix
@@ -42,11 +42,10 @@
 *> Norm(inv(A)) is computed by a direct method, and the reciprocal of
 *> the condition number is computed as
 *>              RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,16 +105,14 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The method used is described in Nicholas J. Higham, "Efficient
 *>  Algorithms for Computing the Condition Number of a Tridiagonal
 *>  Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dpteqr.f b/SRC/dpteqr.f
index 373f538e..293c46ed 100644
--- a/SRC/dpteqr.f
+++ b/SRC/dpteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric positive definite tridiagonal matrix by first factoring the
@@ -51,11 +51,10 @@
 *> form, however, may preclude the possibility of obtaining high
 *> relative accuracy in the small eigenvalues of the original matrix, if
 *> these eigenvalues range over many orders of magnitude.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                      if INFO = N+i, i off-diagonal elements of the
 *>                      bidiagonal factor did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dptrfs.f b/SRC/dptrfs.f
index cbbcdd3a..3a9d1de7 100644
--- a/SRC/dptrfs.f
+++ b/SRC/dptrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTRFS( N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR,
 *                          BERR, WORK, INFO )
@@ -30,21 +30,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite
 *> and tridiagonal, and provides error bounds and backward error
 *> estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -139,16 +138,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dptsv.f b/SRC/dptsv.f
index 09cf1005..99b2b1d7 100644
--- a/SRC/dptsv.f
+++ b/SRC/dptsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTSV( N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   B( LDB, * ), D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPTSV computes the solution to a real system of linear equations
 *> A*X = B, where A is an N-by-N symmetric positive definite tridiagonal
@@ -39,11 +39,10 @@
 *>
 *> A is factored as A = L*D*L**T, and the factored form of A is then
 *> used to solve the system of equations.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -99,10 +98,9 @@
 *>                computed.  The factorization has not been completed
 *>                unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dptsvx.f b/SRC/dptsvx.f
index 5427ae36..b80da739 100644
--- a/SRC/dptsvx.f
+++ b/SRC/dptsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTSVX( 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
 *>
 *> DPTSVX 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 
diff --git a/SRC/dpttrf.f b/SRC/dpttrf.f
index fe58f12c..a18dac83 100644
--- a/SRC/dpttrf.f
+++ b/SRC/dpttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTTRF( N, D, E, INFO )
 * 
@@ -27,20 +27,19 @@
 *       DOUBLE PRECISION   D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPTTRF computes the L*D*L**T factorization of a real symmetric
 *> positive definite tridiagonal matrix A.  The factorization may also
 *> be regarded as having the form A = U**T*D*U.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -76,10 +75,9 @@
 *>               be completed, while if k = N, the factorization was
 *>               completed, but D(N) <= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dpttrs.f b/SRC/dpttrs.f
index 898f8972..9ef0d8a9 100644
--- a/SRC/dpttrs.f
+++ b/SRC/dpttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTTRS( N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   B( LDB, * ), D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPTTRS solves a tridiagonal system of the form
 *>    A * X = B
@@ -39,11 +39,10 @@
 *> diagonal matrix specified in the vector D, L is a unit bidiagonal
 *> matrix whose subdiagonal is specified in the vector E, and X and B
 *> are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dptts2.f b/SRC/dptts2.f
index 0ea8ab87..c3929d5e 100644
--- a/SRC/dptts2.f
+++ b/SRC/dptts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DPTTS2( N, NRHS, D, E, B, LDB )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   B( LDB, * ), D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DPTTS2 solves a tridiagonal system of the form
 *>    A * X = B
@@ -39,11 +39,10 @@
 *> diagonal matrix specified in the vector D, L is a unit bidiagonal
 *> matrix whose subdiagonal is specified in the vector E, and X and B
 *> are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/drscl.f b/SRC/drscl.f
index 4e5a80b7..2688f122 100644
--- a/SRC/drscl.f
+++ b/SRC/drscl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DRSCL( N, SA, SX, INCX )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   SX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DRSCL multiplies an n-element real vector x by the real scalar 1/a.
 *> This is done without overflow or underflow as long as
 *> the final result x/a does not overflow or underflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -69,10 +68,9 @@
 *>          The increment between successive values of the vector SX.
 *>          > 0:  SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i),     1< i<= n
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsbev.f b/SRC/dsbev.f
index dc490fcf..79de1c4d 100644
--- a/SRC/dsbev.f
+++ b/SRC/dsbev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                         INFO )
@@ -29,19 +29,18 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBEV computes all the eigenvalues and, optionally, eigenvectors of
 *> a real symmetric band matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsbevd.f b/SRC/dsbevd.f
index c4e6aa90..41351c08 100644
--- a/SRC/dsbevd.f
+++ b/SRC/dsbevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                          LWORK, IWORK, LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBEVD computes all the eigenvalues and, optionally, eigenvectors of
 *> a real symmetric band matrix A. If eigenvectors are desired, it uses
@@ -46,11 +46,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -177,10 +176,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsbevx.f b/SRC/dsbevx.f
index 1bd8403c..42b30ca0 100644
--- a/SRC/dsbevx.f
+++ b/SRC/dsbevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL,
 *                          VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK,
@@ -33,21 +33,20 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric band matrix A.  Eigenvalues and eigenvectors can
 *> be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -241,10 +240,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsbgst.f b/SRC/dsbgst.f
index d7974b6c..c134736a 100644
--- a/SRC/dsbgst.f
+++ b/SRC/dsbgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X,
 *                          LDX, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBGST reduces a real symmetric-definite banded generalized
 *> eigenproblem  A*x = lambda*B*x  to standard form  C*y = lambda*y,
@@ -44,11 +44,10 @@
 *> split Cholesky factorization. A is overwritten by C = X**T*A*X, where
 *> X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the
 *> bandwidth of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsbgv.f b/SRC/dsbgv.f
index 96be241d..0c547dcc 100644
--- a/SRC/dsbgv.f
+++ b/SRC/dsbgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z,
 *                         LDZ, WORK, INFO )
@@ -30,21 +30,20 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite banded eigenproblem, of
 *> the form A*x=(lambda)*B*x. Here A and B are assumed to be symmetric
 *> and banded, and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -161,10 +160,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsbgvd.f b/SRC/dsbgvd.f
index 901e7cda..edb077c5 100644
--- a/SRC/dsbgvd.f
+++ b/SRC/dsbgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
 *                          Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite banded eigenproblem, of the
@@ -49,11 +49,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -206,10 +205,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -220,17 +218,11 @@
 *
 *> \ingroup doubleOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
      $                   Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/dsbgvx.f b/SRC/dsbgvx.f
index 1b783710..cda94a63 100644
--- a/SRC/dsbgvx.f
+++ b/SRC/dsbgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
 *                          LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
@@ -34,11 +34,11 @@
 *      $                   W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a real generalized symmetric-definite banded eigenproblem, of
@@ -46,11 +46,10 @@
 *> and banded, and B is also positive definite.  Eigenvalues and
 *> eigenvectors can be selected by specifying either all eigenvalues,
 *> a range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -263,10 +262,9 @@
 *>                The factorization of B could not be completed and
 *>                no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -277,17 +275,11 @@
 *
 *> \ingroup doubleOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
      $                   LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
diff --git a/SRC/dsbtrd.f b/SRC/dsbtrd.f
index b97a9076..468ea879 100644
--- a/SRC/dsbtrd.f
+++ b/SRC/dsbtrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ,
 *                          WORK, INFO )
@@ -30,20 +30,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSBTRD reduces a real symmetric band matrix A to symmetric
 *> tridiagonal form T by an orthogonal similarity transformation:
 *> Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -139,10 +138,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -153,14 +151,12 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by Linda Kaufman, Bell Labs.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dsfrk.f b/SRC/dsfrk.f
index fcd7555a..fc1a5078 100644
--- a/SRC/dsfrk.f
+++ b/SRC/dsfrk.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA,
 *                         C )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for C in RFP Format.
 *>
@@ -49,11 +49,10 @@
 *> where alpha and beta are real scalars, C is an n--by--n symmetric
 *> matrix and A is an n--by--k matrix in the first case and a k--by--n
 *> matrix in the second case.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -150,10 +149,9 @@
 *>           NT = N*(N+1)/2. On entry, the symmetric matrix C in RFP
 *>           Format. RFP Format is described by TRANSR, UPLO and N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsgesv.f b/SRC/dsgesv.f
index 4ea5fcce..985e11a5 100644
--- a/SRC/dsgesv.f
+++ b/SRC/dsgesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK,
 *                          SWORK, ITER, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSGESV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -67,11 +67,10 @@
 *>     o EPS is the machine epsilon returned by DLAMCH('Epsilon')
 *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00
 *> respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -179,10 +178,9 @@
 *>                but the factor U is exactly singular, so the solution
 *>                could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspcon.f b/SRC/dspcon.f
index 74f1ae9d..e3bf5f32 100644
--- a/SRC/dspcon.f
+++ b/SRC/dspcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric packed matrix A using the factorization
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspev.f b/SRC/dspev.f
index 484f50cc..2ade5955 100644
--- a/SRC/dspev.f
+++ b/SRC/dspev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   AP( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPEV computes all the eigenvalues and, optionally, eigenvectors of a
 *> real symmetric matrix A in packed storage.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspevd.f b/SRC/dspevd.f
index 679a65db..24de2b08 100644
--- a/SRC/dspevd.f
+++ b/SRC/dspevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK,
 *                          IWORK, LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   AP( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPEVD computes all the eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A in packed storage. If eigenvectors are
@@ -46,11 +46,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -163,10 +162,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspevx.f b/SRC/dspevx.f
index 9d31549f..bd81df83 100644
--- a/SRC/dspevx.f
+++ b/SRC/dspevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, IWORK, IFAIL,
@@ -32,21 +32,20 @@
 *       DOUBLE PRECISION   AP( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A in packed storage.  Eigenvalues/vectors
 *> can be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -210,10 +209,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspgst.f b/SRC/dspgst.f
index d9e7f70a..b29387cc 100644
--- a/SRC/dspgst.f
+++ b/SRC/dspgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPGST( ITYPE, UPLO, N, AP, BP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AP( * ), BP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPGST reduces a real symmetric-definite generalized eigenproblem
 *> to standard form, using packed storage.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L.
 *>
 *> B must have been previously factorized as U**T*U or L*L**T by DPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspgv.f b/SRC/dspgv.f
index 74c7b5d2..8d927e5b 100644
--- a/SRC/dspgv.f
+++ b/SRC/dspgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                         INFO )
@@ -30,22 +30,21 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPGV computes all the eigenvalues and, optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be symmetric, stored in packed format,
 *> and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -145,10 +144,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspgvd.f b/SRC/dspgvd.f
index fb7d3e91..f07a8626 100644
--- a/SRC/dspgvd.f
+++ b/SRC/dspgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                          LWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -50,11 +50,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -189,10 +188,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,17 +201,11 @@
 *
 *> \ingroup doubleOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
      $                   LWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/dspgvx.f b/SRC/dspgvx.f
index 178e0d1c..6b968c56 100644
--- a/SRC/dspgvx.f
+++ b/SRC/dspgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
 *                          IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -46,11 +46,10 @@
 *> is also positive definite.  Eigenvalues and eigenvectors can be
 *> selected by specifying either a range of values or a range of indices
 *> for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -241,10 +240,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -255,17 +253,11 @@
 *
 *> \ingroup doubleOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
      $                   IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK,
diff --git a/SRC/dsposv.f b/SRC/dsposv.f
index 6b22f827..e7ffc83e 100644
--- a/SRC/dsposv.f
+++ b/SRC/dsposv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPOSV( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, WORK,
 *                          SWORK, ITER, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPOSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -68,11 +68,10 @@
 *>     o EPS is the machine epsilon returned by DLAMCH('Epsilon')
 *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00
 *> respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -183,10 +182,9 @@
 *>                factorization could not be completed, and the solution
 *>                has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsprfs.f b/SRC/dsprfs.f
index 1641fe26..d96764a1 100644
--- a/SRC/dsprfs.f
+++ b/SRC/dsprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,16 +154,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dspsv.f b/SRC/dspsv.f
index e55c4b50..f5603534 100644
--- a/SRC/dspsv.f
+++ b/SRC/dspsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -47,11 +47,10 @@
 *> triangular matrices, D is symmetric and block diagonal with 1-by-1
 *> and 2-by-2 diagonal blocks.  The factored form of A is then used to
 *> solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, so the solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup doubleOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -160,7 +157,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dspsvx.f b/SRC/dspsvx.f
index 865492eb..1beaf731 100644
--- a/SRC/dspsvx.f
+++ b/SRC/dspsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X,
 *                          LDX, RCOND, FERR, BERR, WORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPSVX uses the diagonal pivoting factorization A = U*D*U**T or
 *> A = L*D*L**T to compute the solution to a real system of linear
@@ -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:
 *>
@@ -71,11 +74,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
@@ -238,10 +240,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 
@@ -252,10 +253,9 @@
 *
 *> \ingroup doubleOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -271,7 +271,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dsptrd.f b/SRC/dsptrd.f
index 49bfd186..c9dc2dd1 100644
--- a/SRC/dsptrd.f
+++ b/SRC/dsptrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPTRD( UPLO, N, AP, D, E, TAU, INFO )
 * 
@@ -28,20 +28,19 @@
 *       DOUBLE PRECISION   AP( * ), D( * ), E( * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPTRD reduces a real symmetric matrix A stored in packed form to
 *> symmetric tridiagonal form T by an orthogonal similarity
 *> transformation: Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -148,7 +145,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP,
 *>  overwriting A(i+2:n,i), and tau is stored in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dsptrf.f b/SRC/dsptrf.f
index b5c420d9..73fe1f29 100644
--- a/SRC/dsptrf.f
+++ b/SRC/dsptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPTRF( UPLO, N, AP, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPTRF computes the factorization of a real symmetric matrix A stored
 *> in packed format using the Bunch-Kaufman diagonal pivoting method:
@@ -43,11 +43,10 @@
 *> where U (or L) is a product of permutation and unit upper (lower)
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,14 +111,10 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  5-96 - Based on modifications by J. Lewis, Boeing Computer Services
-*>         Company
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -155,8 +149,12 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>  J. Lewis, Boeing Computer Services Company
 *>
 *  =====================================================================
       SUBROUTINE DSPTRF( UPLO, N, AP, IPIV, INFO )
diff --git a/SRC/dsptri.f b/SRC/dsptri.f
index 03a8dffa..74d6acd2 100644
--- a/SRC/dsptri.f
+++ b/SRC/dsptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPTRI( UPLO, N, AP, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPTRI computes the inverse of a real symmetric indefinite matrix
 *> A in packed storage using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by DSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsptrs.f b/SRC/dsptrs.f
index b623a0bd..1a9b492d 100644
--- a/SRC/dsptrs.f
+++ b/SRC/dsptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSPTRS solves a system of linear equations A*X = B with a real
 *> symmetric matrix A stored in packed format using the factorization
 *> A = U*D*U**T or A = L*D*L**T computed by DSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dstebz.f b/SRC/dstebz.f
index a8933108..9aafd56a 100644
--- a/SRC/dstebz.f
+++ b/SRC/dstebz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEBZ( RANGE, ORDER, N, VL, VU, IL, IU, ABSTOL, D, E,
 *                          M, NSPLIT, W, IBLOCK, ISPLIT, WORK, IWORK,
@@ -32,11 +32,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEBZ computes the eigenvalues of a symmetric tridiagonal
 *> matrix T.  The user may ask for all eigenvalues, all eigenvalues
@@ -50,11 +50,10 @@
 *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal
 *> Matrix", Report CS41, Computer Science Dept., Stanford
 *> University, July 21, 1966.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RANGE
 *> \verbatim
@@ -226,10 +225,12 @@
 *>                                        floating-point arithmetic.
 *>                        Cure: Increase the PARAMETER "FUDGE",
 *>                              recompile, and try again.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  RELFAC  DOUBLE PRECISION, default = 2.0e0
 *>          The relative tolerance.  An interval (a,b] lies within
 *>          "relative tolerance" if  b-a < RELFAC*ulp*max(|a|,|b|),
@@ -244,10 +245,9 @@
 *>          the worst machine around.  Note that this has no effect
 *>          on accuracy of the solution.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dstedc.f b/SRC/dstedc.f
index 541b1229..465f5169 100644
--- a/SRC/dstedc.f
+++ b/SRC/dstedc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK,
 *                          LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEDC computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the divide and conquer method.
@@ -48,11 +48,10 @@
 *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.  See DLAED3 for details.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -166,10 +165,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -180,18 +178,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE DSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK,
diff --git a/SRC/dstegr.f b/SRC/dstegr.f
index e5f58353..fddbc063 100644
--- a/SRC/dstegr.f
+++ b/SRC/dstegr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                  ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
@@ -33,11 +33,11 @@
 *       DOUBLE PRECISION   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEGR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -59,11 +59,10 @@
 *> NaNs.  Normal execution may create these exceptiona values and hence
 *> may abort due to a floating point exception in environments which
 *> do not conform to the IEEE-754 standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -232,10 +231,9 @@
 *>                the nonzero error code returned by DLARRE or
 *>                DLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -246,19 +244,13 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, LBNL/NERSC, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Inderjit Dhillon, IBM Almaden, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE DSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $           ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
diff --git a/SRC/dstein.f b/SRC/dstein.f
index 34abb7f6..498eb52c 100644
--- a/SRC/dstein.f
+++ b/SRC/dstein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK,
 *                          IWORK, IFAIL, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEIN computes the eigenvectors of a real symmetric tridiagonal
 *> matrix T corresponding to specified eigenvalues, using inverse
@@ -42,11 +42,10 @@
 *>
 *> The maximum number of iterations allowed for each eigenvector is
 *> specified by an internal parameter MAXITS (currently set to 5).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -145,10 +144,12 @@
 *>          > 0: if INFO = i, then i eigenvectors failed to converge
 *>               in MAXITS iterations.  Their indices are stored in
 *>               array IFAIL.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  MAXITS  INTEGER, default = 5
 *>          The maximum number of iterations performed.
 *>
@@ -156,10 +157,9 @@
 *>          The number of iterations performed after norm growth
 *>          criterion is satisfied, should be at least 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dstemr.f b/SRC/dstemr.f
index ad044dbe..1d501a72 100644
--- a/SRC/dstemr.f
+++ b/SRC/dstemr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                          M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
@@ -34,11 +34,11 @@
 *       DOUBLE PRECISION   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEMR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -90,11 +90,10 @@
 *> floating-point standard in their handling of infinities and NaNs.
 *> This permits the use of efficient inner loops avoiding a check for
 *> zero divisors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -286,10 +285,9 @@
 *>                the nonzero error code returned by DLARRE or
 *>                DLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -300,21 +298,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE DSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $                   M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
diff --git a/SRC/dsteqr.f b/SRC/dsteqr.f
index 79d76911..92f6ef34 100644
--- a/SRC/dsteqr.f
+++ b/SRC/dsteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -28,22 +28,21 @@
 *       DOUBLE PRECISION   D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the implicit QL or QR method.
 *> The eigenvectors of a full or band symmetric matrix can also be found
 *> if DSYTRD or DSPTRD or DSBTRD has been used to reduce this matrix to
 *> tridiagonal form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -116,10 +115,9 @@
 *>                matrix which is orthogonally similar to the original
 *>                matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsterf.f b/SRC/dsterf.f
index 4a2d84dd..4a083910 100644
--- a/SRC/dsterf.f
+++ b/SRC/dsterf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTERF( N, D, E, INFO )
 * 
@@ -27,19 +27,18 @@
 *       DOUBLE PRECISION   D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTERF computes all eigenvalues of a symmetric tridiagonal matrix
 *> using the Pal-Walker-Kahan variant of the QL or QR algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -71,10 +70,9 @@
 *>                a total of 30*N iterations; if INFO = i, then i
 *>                elements of E have not converged to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dstev.f b/SRC/dstev.f
index e2e7683f..ad4a9ee4 100644
--- a/SRC/dstev.f
+++ b/SRC/dstev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEV( JOBZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEV computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric tridiagonal matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          > 0:  if INFO = i, the algorithm failed to converge; i
 *>                off-diagonal elements of E did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dstevd.f b/SRC/dstevd.f
index 31f98ac5..0d327f38 100644
--- a/SRC/dstevd.f
+++ b/SRC/dstevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEVD( JOBZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK,
 *                          LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEVD computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric tridiagonal matrix. If eigenvectors are desired, it
@@ -46,11 +46,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -147,10 +146,9 @@
 *>          > 0:  if INFO = i, the algorithm failed to converge; i
 *>                off-diagonal elements of E did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dstevr.f b/SRC/dstevr.f
index a266fbd2..0316a92c 100644
--- a/SRC/dstevr.f
+++ b/SRC/dstevr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL,
 *                          M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
@@ -32,11 +32,11 @@
 *       DOUBLE PRECISION   D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEVR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T.  Eigenvalues and
@@ -78,11 +78,10 @@
 *> hence may abort due to a floating point exception in environments
 *> which do not handle NaNs and infinities in the ieee standard default
 *> manner.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -272,10 +271,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  Internal error
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -286,19 +284,13 @@
 *
 *> \ingroup doubleOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
+*>     Inderjit Dhillon, IBM Almaden, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
 *>     Ken Stanley, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>
-*> \endverbatim
+*>       California at Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE DSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL,
diff --git a/SRC/dstevx.f b/SRC/dstevx.f
index af02662d..de228722 100644
--- a/SRC/dstevx.f
+++ b/SRC/dstevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSTEVX( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL,
 *                          M, W, Z, LDZ, WORK, IWORK, IFAIL, INFO )
@@ -31,21 +31,20 @@
 *       DOUBLE PRECISION   D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSTEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix A.  Eigenvalues and
 *> eigenvectors can be selected by specifying either a range of values
 *> or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -204,10 +203,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsycon.f b/SRC/dsycon.f
index afd4bf4f..a5d0072a 100644
--- a/SRC/dsycon.f
+++ b/SRC/dsycon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric matrix A using the factorization
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsyconv.f b/SRC/dsyconv.f
index 27380763..861bb6fe 100644
--- a/SRC/dsyconv.f
+++ b/SRC/dsyconv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYCONV convert A given by TRF into L and D and vice-versa.
 *> Get Non-diag elements of D (returned in workspace) and 
 *> apply or reverse permutation done in TRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsyequb.f b/SRC/dsyequb.f
index 4cdddbcb..2ed2aa9b 100644
--- a/SRC/dsyequb.f
+++ b/SRC/dsyequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), S( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYEQUB computes row and column scalings intended to equilibrate a
 *> symmetric matrix A and reduce its condition number
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -126,19 +124,14 @@
 *
 *> \ingroup doubleSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par References:
+*  ================
 *>
-*>  Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization",
-*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.
-*>  DOI 10.1023/B:NUMA.0000016606.32820.69
+*>  Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n
+*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n
+*>  DOI 10.1023/B:NUMA.0000016606.32820.69 \n
 *>  Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE DSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 *
diff --git a/SRC/dsyev.f b/SRC/dsyev.f
index d30d4d0f..047e006a 100644
--- a/SRC/dsyev.f
+++ b/SRC/dsyev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYEV computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -117,10 +116,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsyevd.f b/SRC/dsyevd.f
index 7a8b139e..0d0ff7b3 100644
--- a/SRC/dsyevd.f
+++ b/SRC/dsyevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK,
 *                          LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYEVD computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric matrix A. If eigenvectors are desired, it uses a
@@ -49,11 +49,10 @@
 *>
 *> Because of large use of BLAS of level 3, DSYEVD needs N**2 more
 *> workspace than DSYEVX.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -159,10 +158,9 @@
 *>                lying in rows and columns INFO/(N+1) through
 *>                mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -173,19 +171,15 @@
 *
 *> \ingroup doubleSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*>  Modified description of INFO. Sven, 16 Feb 05.
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee \n
+*>  Modified description of INFO. Sven, 16 Feb 05. \n
+
+
 *>
 *  =====================================================================
       SUBROUTINE DSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK,
diff --git a/SRC/dsyevr.f b/SRC/dsyevr.f
index 76833157..ad3a2efd 100644
--- a/SRC/dsyevr.f
+++ b/SRC/dsyevr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK,
@@ -32,11 +32,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYEVR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A.  Eigenvalues and eigenvectors can be
@@ -95,11 +95,10 @@
 *> hence may abort due to a floating point exception in environments
 *> which do not handle NaNs and infinities in the ieee standard default
 *> manner.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -298,10 +297,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  Internal error
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -312,21 +310,15 @@
 *
 *> \ingroup doubleSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
+*>     Inderjit Dhillon, IBM Almaden, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
 *>     Ken Stanley, Computer Science Division, University of
-*>       California at Berkeley, USA
+*>       California at Berkeley, USA \n
 *>     Jason Riedy, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>
-*> \endverbatim
+*>       California at Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE DSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
diff --git a/SRC/dsyevx.f b/SRC/dsyevx.f
index 90861c04..500a3e4d 100644
--- a/SRC/dsyevx.f
+++ b/SRC/dsyevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, LWORK, IWORK,
@@ -32,21 +32,20 @@
 *       DOUBLE PRECISION   A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A.  Eigenvalues and eigenvectors can be
 *> selected by specifying either a range of values or a range of indices
 *> for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -229,10 +228,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsygs2.f b/SRC/dsygs2.f
index 2b7bf1df..8dd4b0a0 100644
--- a/SRC/dsygs2.f
+++ b/SRC/dsygs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYGS2 reduces a real symmetric-definite generalized eigenproblem
 *> to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T *A*L.
 *>
 *> B must have been previously factorized as U**T *U or L*L**T by DPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsygst.f b/SRC/dsygst.f
index 792a8076..4717be87 100644
--- a/SRC/dsygst.f
+++ b/SRC/dsygst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYGST reduces a real symmetric-definite generalized eigenproblem
 *> to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L.
 *>
 *> B must have been previously factorized as U**T*U or L*L**T by DPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsygv.f b/SRC/dsygv.f
index dc5e0591..32bfb323 100644
--- a/SRC/dsygv.f
+++ b/SRC/dsygv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                         LWORK, INFO )
@@ -29,22 +29,21 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be symmetric and B is also
 *> positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -159,10 +158,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsygvd.f b/SRC/dsygvd.f
index 0fde04c4..fa95e316 100644
--- a/SRC/dsygvd.f
+++ b/SRC/dsygvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                          LWORK, IWORK, LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -48,11 +48,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -195,10 +194,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -209,20 +207,21 @@
 *
 *> \ingroup doubleSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  Based on contributions by
-*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
+*> \verbatim
 *>
 *>  Modified so that no backsubstitution is performed if DSYEVD fails to
 *>  converge (NEIG in old code could be greater than N causing out of
 *>  bounds reference to A - reported by Ralf Meyer).  Also corrected the
 *>  description of INFO and the test on ITYPE. Sven, 16 Feb 05.
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
 *>
 *  =====================================================================
       SUBROUTINE DSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
diff --git a/SRC/dsygvx.f b/SRC/dsygvx.f
index 6f022477..e0927753 100644
--- a/SRC/dsygvx.f
+++ b/SRC/dsygvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
 *                          VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -45,11 +45,10 @@
 *> and B are assumed to be symmetric and B is also positive definite.
 *> Eigenvalues and eigenvectors can be selected by specifying either a
 *> range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -268,10 +267,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -282,17 +280,11 @@
 *
 *> \ingroup doubleSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
      $                   VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
diff --git a/SRC/dsyrfs.f b/SRC/dsyrfs.f
index 9333713c..ceea92d7 100644
--- a/SRC/dsyrfs.f
+++ b/SRC/dsyrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,20 +31,19 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite, and
 *> provides error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -167,16 +166,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsyrfsx.f b/SRC/dsyrfsx.f
index 14e64b16..d597e8fe 100644
--- a/SRC/dsyrfsx.f
+++ b/SRC/dsyrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DSYRFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric indefinite, and
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -386,10 +383,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsysv.f b/SRC/dsysv.f
index f4d2acfc..8621e24c 100644
--- a/SRC/dsysv.f
+++ b/SRC/dsysv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK,
 *                         LWORK, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -48,11 +48,10 @@
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.  The factored form of A is then
 *> used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsysvx.f b/SRC/dsysvx.f
index 7b92f4e8..e8f3f5a7 100644
--- a/SRC/dsysvx.f
+++ b/SRC/dsysvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B,
 *                          LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK,
@@ -33,11 +33,11 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYSVX uses the diagonal pivoting factorization to compute the
 *> solution to a real system of linear equations A * X = B,
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -73,11 +76,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
@@ -264,10 +266,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 
diff --git a/SRC/dsysvxx.f b/SRC/dsysvxx.f
index 84953d35..2e7976dd 100644
--- a/SRC/dsysvxx.f
+++ b/SRC/dsysvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    DSYSVXX uses the diagonal pivoting factorization to compute the
 *>    solution to a double precision system of linear equations A * X = B, where A
@@ -64,9 +62,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what DSYSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -107,11 +108,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(R) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -486,10 +486,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsyswapr.f b/SRC/dsyswapr.f
index 8b0bd6af..10b850ac 100644
--- a/SRC/dsyswapr.f
+++ b/SRC/dsyswapr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYSWAPR( UPLO, N, A, LDA, I1, I2)
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       DOUBLE PRECISION A( LDA, N )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYSWAPR applies an elementary permutation on the rows and the columns of
 *> a symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          I2 is INTEGER
 *>          Index of the second row to swap
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsytd2.f b/SRC/dsytd2.f
index c85c412a..9215d474 100644
--- a/SRC/dsytd2.f
+++ b/SRC/dsytd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTD2( UPLO, N, A, LDA, D, E, TAU, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), D( * ), E( * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTD2 reduces a real symmetric matrix A to symmetric tridiagonal
 *> form T by an orthogonal similarity transformation: Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -126,10 +124,9 @@
 *
 *> \ingroup doubleSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -171,7 +168,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dsytf2.f b/SRC/dsytf2.f
index 3bdf48c8..be5bf049 100644
--- a/SRC/dsytf2.f
+++ b/SRC/dsytf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTF2 computes the factorization of a real symmetric matrix A using
 *> the Bunch-Kaufman diagonal pivoting method:
@@ -45,11 +45,10 @@
 *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -110,10 +109,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -124,25 +122,10 @@
 *
 *> \ingroup doubleSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  09-29-06 - patch from
-*>    Bobby Cheng, MathWorks
-*>
-*>    Replace l.204 and l.372
-*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
-*>    by
-*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN
-*>
-*>  01-01-96 - Based on modifications by
-*>    J. Lewis, Boeing Computer Services Company
-*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
-*>         Company
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -177,9 +160,28 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*> \verbatim
 *>
+*>  09-29-06 - patch from
+*>    Bobby Cheng, MathWorks
+*>
+*>    Replace l.204 and l.372
+*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
+*>    by
+*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN
+*>
+*>  01-01-96 - Based on modifications by
+*>    J. Lewis, Boeing Computer Services Company
+*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
+*>         Company
+*> \endverbatim
+*
 *  =====================================================================
       SUBROUTINE DSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 *
diff --git a/SRC/dsytrd.f b/SRC/dsytrd.f
index 51bb57a3..53fce30e 100644
--- a/SRC/dsytrd.f
+++ b/SRC/dsytrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTRD reduces a real symmetric matrix A to real symmetric
 *> tridiagonal form T by an orthogonal similarity transformation:
 *> Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -145,10 +143,9 @@
 *
 *> \ingroup doubleSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -190,7 +187,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dsytrf.f b/SRC/dsytrf.f
index 07341b1a..6c835f73 100644
--- a/SRC/dsytrf.f
+++ b/SRC/dsytrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTRF computes the factorization of a real symmetric matrix A using
 *> the Bunch-Kaufman diagonal pivoting method.  The form of the
@@ -46,11 +46,10 @@
 *> 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, and division by zero will occur if it
 *>                is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup doubleSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
@@ -180,7 +177,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dsytri.f b/SRC/dsytri.f
index da96cbe7..61540935 100644
--- a/SRC/dsytri.f
+++ b/SRC/dsytri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTRI computes the inverse of a real symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> DSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsytri2.f b/SRC/dsytri2.f
index c34c8f43..a54a67de 100644
--- a/SRC/dsytri2.f
+++ b/SRC/dsytri2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTRI2 computes the inverse of a DOUBLE PRECISION hermitian indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> DSYTRF. DSYTRI2 sets the LEADING DIMENSION of the workspace
 *> before calling DSYTRI2X that actually computes the inverse.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsytri2x.f b/SRC/dsytri2x.f
index 71a79851..b569c9ae 100644
--- a/SRC/dsytri2x.f
+++ b/SRC/dsytri2x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( N+NB+1,* )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTRI2X computes the inverse of a real symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> DSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsytrs.f b/SRC/dsytrs.f
index e564c4ea..42dc23a5 100644
--- a/SRC/dsytrs.f
+++ b/SRC/dsytrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTRS solves a system of linear equations A*X = B with a real
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by DSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dsytrs2.f b/SRC/dsytrs2.f
index 4ccbb833..3ca77775 100644
--- a/SRC/dsytrs2.f
+++ b/SRC/dsytrs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, 
 *                           WORK, INFO )
@@ -30,20 +30,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DSYTRS2 solves a system of linear equations A*X = B with a real
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by DSYTRF and converted by DSYCONV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtbcon.f b/SRC/dtbcon.f
index 8c929cea..20d2a82d 100644
--- a/SRC/dtbcon.f
+++ b/SRC/dtbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTBCON estimates the reciprocal of the condition number of a
 *> triangular band matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -127,10 +126,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtbrfs.f b/SRC/dtbrfs.f
index 7d0ddf76..68d2a397 100644
--- a/SRC/dtbrfs.f
+++ b/SRC/dtbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTBRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular band
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by DTBTRS or some other
 *> means before entering this routine.  DTBRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -172,10 +171,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtbtrs.f b/SRC/dtbtrs.f
index e3abf1bc..c4a26b31 100644
--- a/SRC/dtbtrs.f
+++ b/SRC/dtbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTBTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular band matrix of order N, and B is an
 *> N-by NRHS matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtfsm.f b/SRC/dtfsm.f
index 57e174f5..8d46616e 100644
--- a/SRC/dtfsm.f
+++ b/SRC/dtfsm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A,
 *                         B, LDB )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( 0: * ), B( 0: LDB-1, 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for A in RFP Format.
 *>
@@ -50,11 +50,10 @@
 *> A is in Rectangular Full Packed (RFP) Format.
 *>
 *> The matrix X is overwritten on B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -174,10 +173,9 @@
 *>           max( 1, m ).
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -188,10 +186,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -274,12 +271,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A,
      $                  B, LDB )
diff --git a/SRC/dtftri.f b/SRC/dtftri.f
index 03c8bca6..70dea4d7 100644
--- a/SRC/dtftri.f
+++ b/SRC/dtftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTFTRI( TRANSR, UPLO, DIAG, N, A, INFO )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTFTRI computes the inverse of a triangular matrix A stored in RFP
 *> format.
 *>
 *> This is a Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,10 +111,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -199,7 +196,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtfttp.f b/SRC/dtfttp.f
index d3218502..608fa589 100644
--- a/SRC/dtfttp.f
+++ b/SRC/dtfttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTFTTP( TRANSR, UPLO, N, ARF, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   AP( 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTFTTP copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -85,10 +84,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -99,10 +97,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -185,7 +182,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtfttr.f b/SRC/dtfttr.f
index f92b979a..2629bd22 100644
--- a/SRC/dtfttr.f
+++ b/SRC/dtfttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTFTTR copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -108,10 +106,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -194,12 +191,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO )
 *
diff --git a/SRC/dtgevc.f b/SRC/dtgevc.f
index 7b5553c3..aa6c3be8 100644
--- a/SRC/dtgevc.f
+++ b/SRC/dtgevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL,
 *                          LDVL, VR, LDVR, MM, M, WORK, INFO )
@@ -32,11 +32,11 @@
 *       ..
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGEVC computes some or all of the right and/or left eigenvectors of
 *> a pair of real matrices (S,P), where S is a quasi-triangular matrix
@@ -63,10 +63,10 @@
 *> factorization of a matrix pair (A,B), then Z*X and Q*Y
 *> are the matrices of right and left eigenvectors of (A,B).
 *> 
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -219,10 +219,9 @@
 *>          > 0:  the 2-by-2 block (INFO:INFO+1) does not have a complex
 *>                eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -233,10 +232,9 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Allocation of workspace:
@@ -291,7 +289,6 @@
 *>  transpose of the one in storage, so the rowwise method then
 *>  actually accesses columns of A and B at each step, and so is the
 *>  preferred method.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtgex2.f b/SRC/dtgex2.f
index 5ae21b1e..b033d770 100644
--- a/SRC/dtgex2.f
+++ b/SRC/dtgex2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, J1, N1, N2, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGEX2 swaps adjacent diagonal blocks (A11, B11) and (A22, B22)
 *> of size 1-by-1 or 2-by-2 in an upper (quasi) triangular matrix pair
@@ -50,11 +50,10 @@
 *>        Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T
 *>        Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -173,10 +172,9 @@
 *>            <0: If INFO = -16: LWORK is too small. Appropriate value
 *>                for LWORK is returned in WORK(1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -187,20 +185,24 @@
 *
 *> \ingroup doubleGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
-*>     Umea University, S-901 87 Umea, Sweden.
+*> \par Further Details:
+*  =====================
 *>
 *>  In the current code both weak and strong stability tests are
 *>  performed. The user can omit the strong stability test by changing
 *>  the internal logical parameter WANDS to .FALSE.. See ref. [2] for
 *>  details.
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+*>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -213,7 +215,6 @@
 *>      Report UMINF - 94.04, Department of Computing Science, Umea
 *>      University, S-901 87 Umea, Sweden, 1994. Also as LAPACK Working
 *>      Note 87. To appear in Numerical Algorithms, 1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtgexc.f b/SRC/dtgexc.f
index 6a4fa366..78042521 100644
--- a/SRC/dtgexc.f
+++ b/SRC/dtgexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, IFST, ILST, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGEXC reorders the generalized real Schur decomposition of a real
 *> matrix pair (A,B) using an orthogonal equivalence transformation
@@ -54,11 +54,10 @@
 *>        Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T
 *>        Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -187,10 +186,9 @@
 *>                and ILST points to the first row of the current
 *>                position of the block being moved.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -201,21 +199,21 @@
 *
 *> \ingroup doubleGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtgsen.f b/SRC/dtgsen.f
index e3e2110b..ccd4d6a4 100644
--- a/SRC/dtgsen.f
+++ b/SRC/dtgsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB,
 *                          ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, M, PL,
@@ -36,11 +36,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGSEN reorders the generalized real Schur decomposition of a real
 *> matrix pair (A, B) (in terms of an orthonormal equivalence trans-
@@ -66,11 +66,10 @@
 *> the selected cluster and the eigenvalues outside the cluster, resp.,
 *> and norms of "projections" onto left and right eigenspaces w.r.t.
 *> the selected cluster in the (1,1)-block.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -297,10 +296,9 @@
 *>                (A, B) may have been partially reordered.
 *>                If requested, 0 is returned in DIF(*), PL and PR.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -311,10 +309,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  DTGSEN first collects the selected eigenvalues by computing
@@ -416,13 +413,18 @@
 *>  based estimate DIF is not wanted (see DLATDF), then the parameter
 *>  IDIFJB (see below) should be changed from 3 to 4 (routine DLATDF
 *>  (IJOB = 2 will be used)). See DTGSYL for more details.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
-*>  References
-*>  ==========
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -443,7 +445,6 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
 *>      1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtgsja.f b/SRC/dtgsja.f
index fdf5d29b..786f8922 100644
--- a/SRC/dtgsja.f
+++ b/SRC/dtgsja.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B,
 *                          LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV,
@@ -34,11 +34,11 @@
 *      $                   V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGSJA computes the generalized singular value decomposition (GSVD)
 *> of two real upper triangular (or trapezoidal) matrices A and B.
@@ -123,11 +123,10 @@
 *> The computation of the orthogonal transformation matrices U, V or Q
 *> is optional.  These matrices may either be formed explicitly, or they
 *> may be postmultiplied into input matrices U1, V1, or Q1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -342,10 +341,9 @@
 *>          may take. If after MAXIT cycles, the routine fails to
 *>          converge, we return INFO = 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -356,10 +354,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  DTGSJA essentially uses a variant of Kogbetliantz algorithm to reduce
@@ -374,7 +371,6 @@
 *>                C1**2 + S1**2 = I,
 *>
 *>  and R1 is an L-by-L nonsingular upper triangular matrix.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtgsna.f b/SRC/dtgsna.f
index 3818668b..194e364f 100644
--- a/SRC/dtgsna.f
+++ b/SRC/dtgsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL,
 *                          LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK,
@@ -33,11 +33,11 @@
 *      $                   VL( LDVL, * ), VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or eigenvectors of a matrix pair (A, B) in
@@ -49,11 +49,10 @@
 *> i.e. A is block upper triangular with 1-by-1 and 2-by-2 diagonal
 *> blocks. B is upper triangular.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -222,10 +221,9 @@
 *>          =0: Successful exit
 *>          <0: If INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -236,10 +234,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of a generalized eigenvalue
@@ -345,13 +342,18 @@
 *>             EPS * norm(A, B) / DIF(i).
 *>
 *>  See ref. [2-3] for more details and further references.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
-*>  References
-*>  ==========
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -372,7 +374,6 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75.  To appear in ACM Trans. on Math. Software, Vol 22,
 *>      No 1, 1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtgsy2.f b/SRC/dtgsy2.f
index 86294dc0..4023aa67 100644
--- a/SRC/dtgsy2.f
+++ b/SRC/dtgsy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
@@ -34,11 +34,11 @@
 *      $                   D( LDD, * ), E( LDE, * ), F( LDF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGSY2 solves the generalized Sylvester equation:
 *>
@@ -77,11 +77,10 @@
 *> of an upper bound on the separation between to matrix pairs. Then
 *> the input (A, D), (B, E) are sub-pencils of the matrix pair in
 *> DTGSYL. See DTGSYL for details.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -251,10 +250,9 @@
 *>            >0: The matrix pairs (A, D) and (B, E) have common or very
 *>                close eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -265,18 +263,12 @@
 *
 *> \ingroup doubleSYauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
      $                   LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
diff --git a/SRC/dtgsyl.f b/SRC/dtgsyl.f
index b59acfec..1f29b8ce 100644
--- a/SRC/dtgsyl.f
+++ b/SRC/dtgsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK,
@@ -35,11 +35,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTGSYL solves the generalized Sylvester equation:
 *>
@@ -80,11 +80,10 @@
 *> information.
 *>
 *> This is a level 3 BLAS algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -253,10 +252,9 @@
 *>            <0: If INFO = -i, the i-th argument had an illegal value.
 *>            >0: (A, D) and (B, E) have common or close eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -267,15 +265,16 @@
 *
 *> \ingroup doubleSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
 *>  [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
@@ -293,7 +292,6 @@
 *>      Condition Estimators for Solving the Generalized Sylvester
 *>      Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7,
 *>      July 1989, pp 745-751.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtpcon.f b/SRC/dtpcon.f
index c6590d53..db5e85a6 100644
--- a/SRC/dtpcon.f
+++ b/SRC/dtpcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPCON estimates the reciprocal of the condition number of a packed
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtpmqrt.f b/SRC/dtpmqrt.f
index bc61bd23..9b23b151 100644
--- a/SRC/dtpmqrt.f
+++ b/SRC/dtpmqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT,
 *                           A, LDA, B, LDB, WORK, INFO )
@@ -30,20 +30,19 @@
 *      $                   T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPMQRT applies a real orthogonal matrix Q obtained from a 
 *> "triangular-pentagonal" real block reflector H to a general
 *> real matrix C, which consists of two blocks A and B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -167,10 +166,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -181,10 +179,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The columns of the pentagonal matrix V contain the elementary reflectors
@@ -213,7 +210,6 @@
 *>  If TRANS='N' and SIDE='R', C is on exit replaced with C * Q.
 *>
 *>  If TRANS='T' and SIDE='R', C is on exit replaced with C * Q**T.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtpqrt.f b/SRC/dtpqrt.f
index 7160834e..21aed00a 100644
--- a/SRC/dtpqrt.f
+++ b/SRC/dtpqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK,
 *                          INFO )
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPQRT computes a blocked QR factorization of a real 
 *> "triangular-pentagonal" matrix C, which is composed of a 
 *> triangular block A and pentagonal block B, using the compact 
 *> WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,11 +136,11 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The input matrix C is a (N+M)-by-N matrix  
 *>
 *>               C = [ A ]
@@ -185,7 +183,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = [T1 T2 ... TB].
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtpqrt2.f b/SRC/dtpqrt2.f
index d7dd3e7a..1556ca81 100644
--- a/SRC/dtpqrt2.f
+++ b/SRC/dtpqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO )
 * 
@@ -27,20 +27,19 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPQRT2 computes a QR factorization of a real "triangular-pentagonal"
 *> matrix C, which is composed of a triangular block A and pentagonal block B, 
 *> using the compact WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,10 +123,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The input matrix C is a (N+M)-by-N matrix  
@@ -171,7 +168,6 @@
 *>
 *>  where W^H is the conjugate transpose of W and T is the upper triangular
 *>  factor of the block reflector.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtprfb.f b/SRC/dtprfb.f
index 07bd5b2a..3b159648 100644
--- a/SRC/dtprfb.f
+++ b/SRC/dtprfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, 
 *                          V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK )
@@ -30,20 +30,20 @@
 *      $          V( LDV, * ), WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPRFB applies a real "triangular-pentagonal" block reflector H or its 
 *> transpose H**T to a real matrix C, which is composed of two 
 *> blocks A and B, either from the left or right.
 *> 
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -185,10 +185,9 @@
 *>          If SIDE = 'L', LDWORK >= K; 
 *>          if SIDE = 'R', LDWORK >= M.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -199,10 +198,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix C is a composite matrix formed from blocks A and B.
@@ -247,7 +245,6 @@
 *>  If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L.
 *>
 *>  If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtprfs.f b/SRC/dtprfs.f
index d9f29850..807fbcbb 100644
--- a/SRC/dtprfs.f
+++ b/SRC/dtprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular packed
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by DTPTRS or some other
 *> means before entering this routine.  DTPRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,10 +158,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtptri.f b/SRC/dtptri.f
index 0e47d2e3..a1434f12 100644
--- a/SRC/dtptri.f
+++ b/SRC/dtptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPTRI( UPLO, DIAG, N, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPTRI computes the inverse of a real upper or lower triangular
 *> matrix A stored in packed format.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -83,10 +82,9 @@
 *>          > 0:  if INFO = i, A(i,i) is exactly zero.  The triangular
 *>                matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -97,10 +95,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A triangular matrix A can be transferred to packed storage using one
@@ -115,7 +112,6 @@
 *>      1    CONTINUE                    1    CONTINUE
 *>           JC = JC + J                      JC = JC + N - J + 1
 *>      2 CONTINUE                       2 CONTINUE
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtptrs.f b/SRC/dtptrs.f
index 180241db..d9a97c44 100644
--- a/SRC/dtptrs.f
+++ b/SRC/dtptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *> where A is a triangular matrix of order N stored in packed format,
 *> and B is an N-by-NRHS matrix.  A check is made to verify that A is
 *> nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtpttf.f b/SRC/dtpttf.f
index 168c17a3..e76538f6 100644
--- a/SRC/dtpttf.f
+++ b/SRC/dtpttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPTTF( TRANSR, UPLO, N, AP, ARF, INFO )
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       DOUBLE PRECISION   AP( 0: * ), ARF( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPTTF copies a triangular matrix A from standard packed format (TP)
 *> to rectangular full packed format (TF).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -84,10 +83,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -184,7 +181,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtpttr.f b/SRC/dtpttr.f
index 4ee145b7..4cc4dd3f 100644
--- a/SRC/dtpttr.f
+++ b/SRC/dtpttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTPTTR( UPLO, N, AP, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTPTTR copies a triangular matrix A from standard packed format (TP)
 *> to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrcon.f b/SRC/dtrcon.f
index 3568a61f..5e0a8c80 100644
--- a/SRC/dtrcon.f
+++ b/SRC/dtrcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRCON estimates the reciprocal of the condition number of a
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -121,10 +120,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrevc.f b/SRC/dtrevc.f
index cd775b82..1c4b2105 100644
--- a/SRC/dtrevc.f
+++ b/SRC/dtrevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, MM, M, WORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTREVC computes some or all of the right and/or left eigenvectors of
 *> a real upper quasi-triangular matrix T.
@@ -56,11 +56,10 @@
 *> input matrix.  If Q is the orthogonal factor that reduces a matrix
 *> A to Schur form T, then Q*X and Q*Y are the matrices of right and
 *> left eigenvectors of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -192,10 +191,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -206,10 +204,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The algorithm used in this program is basically backward (forward)
@@ -219,7 +216,6 @@
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x| + |y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtrexc.f b/SRC/dtrexc.f
index 6623e1ab..50374d38 100644
--- a/SRC/dtrexc.f
+++ b/SRC/dtrexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   Q( LDQ, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTREXC reorders the real Schur factorization of a real matrix
 *> A = Q*T*Q**T, so that the diagonal block of T with row index IFST is
@@ -47,11 +47,10 @@
 *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
 *> 2-by-2 diagonal block has its diagonal elements equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                reordered, and ILST points to the first row of the
 *>                current position of the block being moved.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrrfs.f b/SRC/dtrrfs.f
index 153d9885..5ac12480 100644
--- a/SRC/dtrrfs.f
+++ b/SRC/dtrrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by DTRTRS or some other
 *> means before entering this routine.  DTRRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -166,10 +165,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrsen.f b/SRC/dtrsen.f
index 8e79e909..8b0ec238 100644
--- a/SRC/dtrsen.f
+++ b/SRC/dtrsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, WR, WI,
 *                          M, S, SEP, WORK, LWORK, IWORK, LIWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRSEN reorders the real Schur factorization of a real matrix
 *> A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in
@@ -52,11 +52,10 @@
 *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
 *> 2-by-2 diagonal block has its diagonal elemnts equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -222,10 +221,9 @@
 *>               contain the eigenvalues in the same order as in T; S and
 *>               SEP (if requested) are set to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -236,10 +234,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  DTRSEN first collects the selected eigenvalues by computing an
@@ -310,7 +307,6 @@
 *>  error in the computed right invariant subspace is
 *>
 *>                      EPS * norm(T) / SEP
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtrsna.f b/SRC/dtrsna.f
index 0356ee1a..44de99db 100644
--- a/SRC/dtrsna.f
+++ b/SRC/dtrsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, S, SEP, MM, M, WORK, LDWORK, IWORK,
@@ -33,11 +33,11 @@
 *      $                   VR( LDVR, * ), WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or right eigenvectors of a real upper
@@ -48,11 +48,10 @@
 *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
 *> 2-by-2 diagonal block has its diagonal elements equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -205,10 +204,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -219,10 +217,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of an eigenvalue lambda is
@@ -261,7 +258,6 @@
 *>  is given by
 *>
 *>                      EPS * norm(T) / SEP(i)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtrsyl.f b/SRC/dtrsyl.f
index 2deb437e..2b020009 100644
--- a/SRC/dtrsyl.f
+++ b/SRC/dtrsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C,
 *                          LDC, SCALE, INFO )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRSYL solves the real Sylvester matrix equation:
 *>
@@ -50,11 +50,10 @@
 *> is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks;
 *> each 2-by-2 diagonal block has its diagonal elements equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANA
 *> \verbatim
@@ -148,10 +147,9 @@
 *>               values were used to solve the equation (but the matrices
 *>               A and B are unchanged).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrti2.f b/SRC/dtrti2.f
index bba6491c..b874e378 100644
--- a/SRC/dtrti2.f
+++ b/SRC/dtrti2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRTI2( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRTI2 computes the inverse of a real upper or lower triangular
 *> matrix.
 *>
 *> This is the Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrtri.f b/SRC/dtrtri.f
index ff7c97a6..423b5a16 100644
--- a/SRC/dtrtri.f
+++ b/SRC/dtrtri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRTRI( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRTRI computes the inverse of a real upper or lower triangular
 *> matrix A.
 *>
 *> This is the Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrtrs.f b/SRC/dtrtrs.f
index bb598c97..cbc760ed 100644
--- a/SRC/dtrtrs.f
+++ b/SRC/dtrtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular matrix of order N, and B is an N-by-NRHS
 *> matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>               indicating that the matrix is singular and the solutions
 *>               X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtrttf.f b/SRC/dtrttf.f
index 5a6820bb..85e2c749 100644
--- a/SRC/dtrttf.f
+++ b/SRC/dtrttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRTTF copies a triangular matrix A from standard full format (TR)
 *> to rectangular full packed format (TF) .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -106,10 +104,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -192,12 +189,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE DTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO )
 *
diff --git a/SRC/dtrttp.f b/SRC/dtrttp.f
index 822db5b2..901b30b7 100644
--- a/SRC/dtrttp.f
+++ b/SRC/dtrttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTRTTP( UPLO, N, A, LDA, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       DOUBLE PRECISION   A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTRTTP copies a triangular matrix A from full format (TR) to standard
 *> packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/dtzrqf.f b/SRC/dtzrqf.f
index ebc41258..3c0a74e9 100644
--- a/SRC/dtzrqf.f
+++ b/SRC/dtzrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTZRQF( M, N, A, LDA, TAU, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine DTZRZF.
 *>
@@ -44,11 +44,10 @@
 *>
 *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -105,10 +103,9 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
@@ -136,7 +133,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dtzrzf.f b/SRC/dtzrzf.f
index 9661e370..29414730 100644
--- a/SRC/dtzrzf.f
+++ b/SRC/dtzrzf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE DTZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       DOUBLE PRECISION   A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DTZRZF reduces the M-by-N ( M<=N ) real upper trapezoidal matrix A
 *> to upper triangular form by means of orthogonal transformations.
@@ -42,11 +42,10 @@
 *>
 *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -122,14 +120,15 @@
 *
 *> \ingroup doubleOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -156,7 +155,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/dzsum1.f b/SRC/dzsum1.f
index c8e93643..9dc835a1 100644
--- a/SRC/dzsum1.f
+++ b/SRC/dzsum1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION DZSUM1( N, CX, INCX )
 * 
@@ -27,24 +27,21 @@
 *       COMPLEX*16         CX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> DZSUM1 takes the sum of the absolute values of a complex
 *> vector and returns a double precision result.
 *>
 *> Based on DZASUM from the Level 1 BLAS.
 *> The change is to use the 'genuine' absolute value.
-*>
-*> Contributed by Nick Higham for use with ZLACON.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -63,10 +60,9 @@
 *>          INCX is INTEGER
 *>          The spacing between successive values of CX.  INCX > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -77,6 +73,11 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
+*> \par Contributors:
+*  ==================
+*>
+*> Nick Higham for use with ZLACON.
+*
 *  =====================================================================
       DOUBLE PRECISION FUNCTION DZSUM1( N, CX, INCX )
 *
diff --git a/SRC/icmax1.f b/SRC/icmax1.f
index 0ef8dc87..187c3f55 100644
--- a/SRC/icmax1.f
+++ b/SRC/icmax1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER          FUNCTION ICMAX1( N, CX, INCX )
 * 
@@ -27,24 +27,21 @@
 *       COMPLEX            CX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ICMAX1 finds the index of the element whose real part has maximum
 *> absolute value.
 *>
 *> Based on ICAMAX from Level 1 BLAS.
 *> The change is to use the 'genuine' absolute value.
-*>
-*> Contributed by Nick Higham for use with CLACON.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -63,10 +60,9 @@
 *>          INCX is INTEGER
 *>          The spacing between successive values of CX.  INCX >= 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -77,6 +73,11 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
+*> \par Contributors:
+*  ==================
+*>
+*> Nick Higham for use with CLACON.
+*
 *  =====================================================================
       INTEGER          FUNCTION ICMAX1( N, CX, INCX )
 *
diff --git a/SRC/ieeeck.f b/SRC/ieeeck.f
index 06d0f515..c5faddd5 100644
--- a/SRC/ieeeck.f
+++ b/SRC/ieeeck.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER          FUNCTION IEEECK( ISPEC, ZERO, ONE )
 * 
@@ -25,19 +25,18 @@
 *       REAL               ONE, ZERO
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> IEEECK is called from the ILAENV to verify that Infinity and
 *> possibly NaN arithmetic is safe (i.e. will not trap).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ISPEC
 *> \verbatim
@@ -67,10 +66,9 @@
 *>          = 0:  Arithmetic failed to produce the correct answers
 *>          = 1:  Arithmetic produced the correct answers
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilaclc.f b/SRC/ilaclc.f
index 8441c5b7..cf8550cf 100644
--- a/SRC/ilaclc.f
+++ b/SRC/ilaclc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILACLC( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILACLC scans A for its last non-zero column.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILACLC scans A for its last non-zero column.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilaclr.f b/SRC/ilaclr.f
index 74a0b626..bf429ab2 100644
--- a/SRC/ilaclr.f
+++ b/SRC/ilaclr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILACLR( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       COMPLEX            A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILACLR scans A for its last non-zero row.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILACLR scans A for its last non-zero row.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/iladiag.f b/SRC/iladiag.f
index 5dc7656f..14d0b879 100644
--- a/SRC/iladiag.f
+++ b/SRC/iladiag.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILADIAG( DIAG )
 * 
@@ -24,11 +24,11 @@
 *       CHARACTER          DIAG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine translated from a character string specifying if a
 *> matrix has unit diagonal or not to the relevant BLAST-specified
@@ -37,15 +37,14 @@
 *> ILADIAG returns an INTEGER.  If ILADIAG < 0, then the input is not a
 *> character indicating a unit or non-unit diagonal.  Otherwise ILADIAG
 *> returns the constant value corresponding to DIAG.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/iladlc.f b/SRC/iladlc.f
index fcf4deec..c5d8a9a4 100644
--- a/SRC/iladlc.f
+++ b/SRC/iladlc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILADLC( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILADLC scans A for its last non-zero column.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILADLC scans A for its last non-zero column.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/iladlr.f b/SRC/iladlr.f
index 28c33504..3e4a731f 100644
--- a/SRC/iladlr.f
+++ b/SRC/iladlr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILADLR( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILADLR scans A for its last non-zero row.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILADLR scans A for its last non-zero row.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilaenv.f b/SRC/ilaenv.f
index 734c918c..d1976f90 100644
--- a/SRC/ilaenv.f
+++ b/SRC/ilaenv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILAENV( ISPEC, NAME, OPTS, N1, N2, N3, N4 )
 * 
@@ -25,11 +25,11 @@
 *       INTEGER            ISPEC, N1, N2, N3, N4
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ILAENV is called from the LAPACK routines to choose problem-dependent
 *> parameters for the local environment.  See ISPEC for a description of
@@ -47,11 +47,10 @@
 *>
 *> This routine will not function correctly if it is converted to all
 *> lower case.  Converting it to all upper case is allowed.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ISPEC
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          Problem dimensions for the subroutine NAME; these may not all
 *>          be required.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The following conventions have been used when calling ILAENV from the
@@ -160,7 +157,6 @@
 *>
 *>      NB = ILAENV( 1, 'STRTRI', UPLO // DIAG, N, -1, -1, -1 )
 *>      IF( NB.LE.1 ) NB = MAX( 1, N )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ilaprec.f b/SRC/ilaprec.f
index 3d07cf3f..2d65482a 100644
--- a/SRC/ilaprec.f
+++ b/SRC/ilaprec.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILAPREC( PREC )
 * 
@@ -24,11 +24,11 @@
 *       CHARACTER          PREC
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine translated from a character string specifying an
 *> intermediate precision to the relevant BLAST-specified integer
@@ -37,15 +37,14 @@
 *> ILAPREC returns an INTEGER.  If ILAPREC < 0, then the input is not a
 *> character indicating a supported intermediate precision.  Otherwise
 *> ILAPREC returns the constant value corresponding to PREC.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilaslc.f b/SRC/ilaslc.f
index 99fa5533..a74a0457 100644
--- a/SRC/ilaslc.f
+++ b/SRC/ilaslc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILASLC( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILASLC scans A for its last non-zero column.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILASLC scans A for its last non-zero column.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilaslr.f b/SRC/ilaslr.f
index 29ab3fb8..93f0ff81 100644
--- a/SRC/ilaslr.f
+++ b/SRC/ilaslr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILASLR( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILASLR scans A for its last non-zero row.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILASLR scans A for its last non-zero row.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilatrans.f b/SRC/ilatrans.f
index 6ce3689d..5259063c 100644
--- a/SRC/ilatrans.f
+++ b/SRC/ilatrans.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILATRANS( TRANS )
 * 
@@ -24,11 +24,11 @@
 *       CHARACTER          TRANS
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine translates from a character string specifying a
 *> transposition operation to the relevant BLAST-specified integer
@@ -37,15 +37,14 @@
 *> ILATRANS returns an INTEGER.  If ILATRANS < 0, then the input is not
 *> a character indicating a transposition operator.  Otherwise ILATRANS
 *> returns the constant value corresponding to TRANS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilauplo.f b/SRC/ilauplo.f
index 494ad74c..b21d6fce 100644
--- a/SRC/ilauplo.f
+++ b/SRC/ilauplo.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILAUPLO( UPLO )
 * 
@@ -24,11 +24,11 @@
 *       CHARACTER          UPLO
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine translated from a character string specifying a
 *> upper- or lower-triangular matrix to the relevant BLAST-specified
@@ -37,15 +37,14 @@
 *> ILAUPLO returns an INTEGER.  If ILAUPLO < 0, then the input is not
 *> a character indicating an upper- or lower-triangular matrix.
 *> Otherwise ILAUPLO returns the constant value corresponding to UPLO.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilaver.f b/SRC/ilaver.f
index 51ffb491..02133340 100644
--- a/SRC/ilaver.f
+++ b/SRC/ilaver.f
@@ -1,11 +1,9 @@
 *> \brief \b ILAVER returns the LAPACK version.
-*>\details
+*> \details
 *> \b Purpose:
-*>\verbatim
-*>
+*> \verbatim
 *>  This subroutine returns the LAPACK version.
-*>
-*>\endverbatim
+*> \endverbatim
 *>
 *> \author LAPACK is a software package provided by Univ. of Tennessee, Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..
 *> \date November 2011
diff --git a/SRC/ilazlc.f b/SRC/ilazlc.f
index b23ca89c..faa3edea 100644
--- a/SRC/ilazlc.f
+++ b/SRC/ilazlc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILAZLC( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILAZLC scans A for its last non-zero column.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILAZLC scans A for its last non-zero column.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ilazlr.f b/SRC/ilazlr.f
index 3be990df..543b1df9 100644
--- a/SRC/ilazlr.f
+++ b/SRC/ilazlr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION ILAZLR( M, N, A, LDA )
 * 
@@ -27,18 +27,17 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ILAZLR scans A for its last non-zero row.
+*> \verbatim
 *>
-*>\endverbatim
+*> ILAZLR scans A for its last non-zero row.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -63,10 +62,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A. LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/iparmq.f b/SRC/iparmq.f
index 9f6d0c86..6071add6 100644
--- a/SRC/iparmq.f
+++ b/SRC/iparmq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION IPARMQ( ISPEC, NAME, OPTS, N, ILO, IHI, LWORK )
 * 
@@ -24,20 +24,19 @@
 *       INTEGER            IHI, ILO, ISPEC, LWORK, N
 *       CHARACTER          NAME*( * ), OPTS*( * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>      This program sets problem and machine dependent parameters
 *>      useful for xHSEQR and its subroutines. It is called whenever 
 *>      ILAENV is called with 12 <= ISPEC <= 16
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ISPEC
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          LWORK is integer scalar
 *>               The amount of workspace available.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -145,10 +143,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>       Little is known about how best to choose these parameters.
@@ -212,7 +209,6 @@
 *>       IPARMQ(ISPEC=16) Select structured matrix multiply.
 *>                        (See ISPEC=16 above for details.)
 *>                        Default: 3.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/izmax1.f b/SRC/izmax1.f
index 267cd2b4..a7477df9 100644
--- a/SRC/izmax1.f
+++ b/SRC/izmax1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER          FUNCTION IZMAX1( N, CX, INCX )
 * 
@@ -27,24 +27,21 @@
 *       COMPLEX*16         CX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> IZMAX1 finds the index of the element whose real part has maximum
 *> absolute value.
 *>
 *> Based on IZAMAX from Level 1 BLAS.
 *> The change is to use the 'genuine' absolute value.
-*>
-*> Contributed by Nick Higham for use with ZLACON.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -63,10 +60,9 @@
 *>          INCX is INTEGER
 *>          The spacing between successive values of CX.  INCX >= 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -77,6 +73,11 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
+*> \par Contributors:
+*  ==================
+*>
+*> Nick Higham for use with ZLACON.
+*
 *  =====================================================================
       INTEGER          FUNCTION IZMAX1( N, CX, INCX )
 *
diff --git a/SRC/lsamen.f b/SRC/lsamen.f
index 35c5a4b3..3fa06ade 100644
--- a/SRC/lsamen.f
+++ b/SRC/lsamen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       LOGICAL          FUNCTION LSAMEN( N, CA, CB )
 * 
@@ -25,22 +25,21 @@
 *       INTEGER            N
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> LSAMEN  tests if the first N letters of CA are the same as the
 *> first N letters of CB, regardless of case.
 *> LSAMEN returns .TRUE. if CA and CB are equivalent except for case
 *> and .FALSE. otherwise.  LSAMEN also returns .FALSE. if LEN( CA )
 *> or LEN( CB ) is less than N.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -59,10 +58,9 @@
 *>          CA and CB specify two character strings of length at least N.
 *>          Only the first N characters of each string will be accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sbbcsd.f b/SRC/sbbcsd.f
index 9099d023..f214dbd8 100644
--- a/SRC/sbbcsd.f
+++ b/SRC/sbbcsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q,
 *                          THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T,
@@ -35,11 +35,11 @@
 *      $                   V2T( LDV2T, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SBBCSD computes the CS decomposition of an orthogonal matrix in
 *> bidiagonal-block form,
@@ -68,11 +68,10 @@
 *> The orthogonal matrices U1, U2, V1T, and V2T are input/output.
 *> The input matrices are pre- or post-multiplied by the appropriate
 *> singular vector matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -297,25 +296,26 @@
 *>          > 0:  if SBBCSD did not converge, INFO specifies the number
 *>                of nonzero entries in PHI, and B11D, B11E, etc.,
 *>                contain the partially reduced matrix.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Reference
-*>  =========
-*>
-*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
-*>      Algorithms, 50(1):33-65, 2009.
-*>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  REAL, default = MAX(10,MIN(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they
 *>          are within TOLMUL*EPS of either bound.
 *> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
+*>      Algorithms, 50(1):33-65, 2009.
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sbdsdc.f b/SRC/sbdsdc.f
index 19569ada..a2eba927 100644
--- a/SRC/sbdsdc.f
+++ b/SRC/sbdsdc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ,
 *                          WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SBDSDC computes the singular value decomposition (SVD) of a real
 *> N-by-N (upper or lower) bidiagonal matrix B:  B = U * S * VT,
@@ -55,11 +55,10 @@
 *> The code currently calls SLASDQ if singular values only are desired.
 *> However, it can be slightly modified to compute singular values
 *> using the divide and conquer method.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -183,10 +182,9 @@
 *>          > 0:  The algorithm failed to compute a singular value.
 *>                The update process of divide and conquer failed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -197,16 +195,11 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
-*> \endverbatim
 *>
 *  =====================================================================
       SUBROUTINE SBDSDC( UPLO, COMPQ, N, D, E, U, LDU, VT, LDVT, Q, IQ,
diff --git a/SRC/sbdsqr.f b/SRC/sbdsqr.f
index 5d7fbcf9..eed536f2 100644
--- a/SRC/sbdsqr.f
+++ b/SRC/sbdsqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,
 *                          LDU, C, LDC, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SBDSQR computes the singular values and, optionally, the right and/or
 *> left singular vectors from the singular value decomposition (SVD) of
@@ -65,11 +65,10 @@
 *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics
 *> Department, University of California at Berkeley, July 1992
 *> for a detailed description of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -187,10 +186,12 @@
 *>                   elements of a bidiagonal matrix which is orthogonally
 *>                   similar to the input matrix B;  if INFO = i, i
 *>                   elements of E have not converged to zero.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  REAL, default = max(10,min(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          If it is positive, TOLMUL*EPS is the desired relative
@@ -212,10 +213,9 @@
 *>          (and so fails to converge) if the number of passes
 *>          through the inner loop exceeds MAXITR*N**2.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/scsum1.f b/SRC/scsum1.f
index e6742e0d..beed7b4d 100644
--- a/SRC/scsum1.f
+++ b/SRC/scsum1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SCSUM1( N, CX, INCX )
 * 
@@ -27,24 +27,21 @@
 *       COMPLEX            CX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SCSUM1 takes the sum of the absolute values of a complex
 *> vector and returns a single precision result.
 *>
 *> Based on SCASUM from the Level 1 BLAS.
 *> The change is to use the 'genuine' absolute value.
-*>
-*> Contributed by Nick Higham for use with CLACON.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -63,10 +60,9 @@
 *>          INCX is INTEGER
 *>          The spacing between successive values of CX.  INCX > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -77,6 +73,11 @@
 *
 *> \ingroup complexOTHERauxiliary
 *
+*> \par Contributors:
+*  ==================
+*>
+*> Nick Higham for use with CLACON.
+*
 *  =====================================================================
       REAL             FUNCTION SCSUM1( N, CX, INCX )
 *
diff --git a/SRC/sdisna.f b/SRC/sdisna.f
index bc222520..f150c7aa 100644
--- a/SRC/sdisna.f
+++ b/SRC/sdisna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SDISNA( JOB, M, N, D, SEP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * ), SEP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SDISNA computes the reciprocal condition numbers for the eigenvectors
 *> of a real symmetric or complex Hermitian matrix or for the left or
@@ -51,11 +51,10 @@
 *>
 *> SDISNA may also be used to compute error bounds for eigenvectors of
 *> the generalized symmetric definite eigenproblem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbbrd.f b/SRC/sgbbrd.f
index a6f61eaf..c9de2a3d 100644
--- a/SRC/sgbbrd.f
+++ b/SRC/sgbbrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q,
 *                          LDQ, PT, LDPT, C, LDC, WORK, INFO )
@@ -30,22 +30,21 @@
 *      $                   PT( LDPT, * ), Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBBRD reduces a real general m-by-n band matrix A to upper
 *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B.
 *>
 *> The routine computes B, and optionally forms Q or P**T, or computes
 *> Q**T*C for a given matrix C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -171,10 +170,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbcon.f b/SRC/sgbcon.f
index abd27032..b1974eba 100644
--- a/SRC/sgbcon.f
+++ b/SRC/sgbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND,
 *                          WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       REAL               AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBCON estimates the reciprocal of the condition number of a real
 *> general band matrix A, in either the 1-norm or the infinity-norm,
@@ -44,11 +44,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -130,10 +129,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbequ.f b/SRC/sgbequ.f
index c0c88259..89803240 100644
--- a/SRC/sgbequ.f
+++ b/SRC/sgbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, INFO )
@@ -29,11 +29,11 @@
 *       REAL               AB( LDAB, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBEQU computes row and column scalings intended to equilibrate an
 *> M-by-N band matrix A and reduce its condition number.  R returns the
@@ -45,11 +45,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -137,10 +136,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbequb.f b/SRC/sgbequb.f
index 3cdef6f6..b9de2ec1 100644
--- a/SRC/sgbequb.f
+++ b/SRC/sgbequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                           AMAX, INFO )
@@ -29,11 +29,11 @@
 *       REAL               AB( LDAB, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -52,11 +52,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -144,10 +143,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbrfs.f b/SRC/sgbrfs.f
index 17c0993f..b4f480c3 100644
--- a/SRC/sgbrfs.f
+++ b/SRC/sgbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK,
@@ -32,20 +32,19 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is banded, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -180,16 +179,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbrfsx.f b/SRC/sgbrfsx.f
index 8a5e17f2..69d4bcd7 100644
--- a/SRC/sgbrfsx.f
+++ b/SRC/sgbrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SGBRFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -58,11 +56,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -423,10 +420,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbsv.f b/SRC/sgbsv.f
index 1c837ac1..76b9c2c9 100644
--- a/SRC/sgbsv.f
+++ b/SRC/sgbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBSV computes the solution to a real system of linear equations
 *> A * X = B, where A is a band matrix of order N with KL subdiagonals
@@ -43,11 +43,10 @@
 *> and unit lower triangular matrices with KL subdiagonals, and U is
 *> upper triangular with KL+KU superdiagonals.  The factored form of A
 *> is then used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -125,10 +124,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,10 +137,9 @@
 *
 *> \ingroup realGBsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -160,7 +157,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgbsvx.f b/SRC/sgbsvx.f
index 81fbaa4f..1336b7ab 100644
--- a/SRC/sgbsvx.f
+++ b/SRC/sgbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                          LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBSVX uses the LU factorization to compute the solution to a real
 *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed by this subroutine:
 *>
@@ -87,11 +90,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -348,10 +350,9 @@
 *>                       there are a number of situations where the
 *>                       computed solution can be more accurate than the
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbsvxx.f b/SRC/sgbsvxx.f
index ddf4e602..3a4ee9b6 100644
--- a/SRC/sgbsvxx.f
+++ b/SRC/sgbsvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SGBSVXX uses the LU factorization to compute the solution to a
 *>    real system of linear equations  A * X = B,  where A is an
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what SGBSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -109,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -543,10 +543,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgbtf2.f b/SRC/sgbtf2.f
index 871bca5d..2e83fc9b 100644
--- a/SRC/sgbtf2.f
+++ b/SRC/sgbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       REAL               AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBTF2 computes an LU factorization of a real m-by-n band matrix A
 *> using partial pivoting with row interchanges.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup realGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -143,7 +140,6 @@
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U, because of fill-in resulting from the row
 *>  interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgbtrf.f b/SRC/sgbtrf.f
index 9add5355..3b6d19ea 100644
--- a/SRC/sgbtrf.f
+++ b/SRC/sgbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       REAL               AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBTRF computes an LU factorization of a real m-by-n band matrix A
 *> using partial pivoting with row interchanges.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup realGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -142,7 +139,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgbtrs.f b/SRC/sgbtrs.f
index 478bb813..84deab33 100644
--- a/SRC/sgbtrs.f
+++ b/SRC/sgbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       REAL               AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGBTRS solves a system of linear equations
 *>    A * X = B  or  A**T * X = B
 *> with a general band matrix A using the LU factorization computed
 *> by SGBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgebak.f b/SRC/sgebak.f
index 2535e21b..0f182122 100644
--- a/SRC/sgebak.f
+++ b/SRC/sgebak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV,
 *                          INFO )
@@ -29,20 +29,19 @@
 *       REAL               V( LDV, * ), SCALE( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEBAK forms the right or left eigenvectors of a real general matrix
 *> by backward transformation on the computed eigenvectors of the
 *> balanced matrix output by SGEBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgebal.f b/SRC/sgebal.f
index af41d374..92b9befb 100644
--- a/SRC/sgebal.f
+++ b/SRC/sgebal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), SCALE( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEBAL balances a general real matrix A.  This involves, first,
 *> permuting A by a similarity transformation to isolate eigenvalues
@@ -43,11 +43,10 @@
 *>
 *> Balancing may reduce the 1-norm of the matrix, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,10 +125,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The permutations consist of row and column interchanges which put
@@ -158,7 +155,6 @@
 *>
 *>  Modified by Tzu-Yi Chen, Computer Science Division, University of
 *>    California at Berkeley, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgebd2.f b/SRC/sgebd2.f
index 06475337..5a04ba8d 100644
--- a/SRC/sgebd2.f
+++ b/SRC/sgebd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )
 * 
@@ -28,21 +28,20 @@
 *      $                   TAUQ( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEBD2 reduces a real general m by n matrix A to upper or lower
 *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0: successful exit.
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -187,7 +184,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgebrd.f b/SRC/sgebrd.f
index ad5a8f67..0b6d84fd 100644
--- a/SRC/sgebrd.f
+++ b/SRC/sgebrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK,
 *                          INFO )
@@ -29,21 +29,20 @@
 *      $                   TAUQ( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEBRD reduces a general real M-by-N matrix A to upper or lower
 *> bidiagonal form B by an orthogonal transformation: Q**T * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -139,10 +138,9 @@
 *>          = 0:  successful exit 
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -153,10 +151,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -202,7 +199,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgecon.f b/SRC/sgecon.f
index 9f814f04..954d3b44 100644
--- a/SRC/sgecon.f
+++ b/SRC/sgecon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGECON estimates the reciprocal of the condition number of a general
 *> real matrix A, in either the 1-norm or the infinity-norm, using
@@ -44,11 +44,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgeequ.f b/SRC/sgeequ.f
index 4b842b90..0bf2e9b3 100644
--- a/SRC/sgeequ.f
+++ b/SRC/sgeequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEEQU computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -45,11 +45,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -123,10 +122,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgeequb.f b/SRC/sgeequb.f
index 3060118b..13309e1c 100644
--- a/SRC/sgeequb.f
+++ b/SRC/sgeequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                           INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -52,11 +52,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgees.f b/SRC/sgees.f
index 8b564da5..df1db423 100644
--- a/SRC/sgees.f
+++ b/SRC/sgees.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, WR, WI,
 *                         VS, LDVS, WORK, LWORK, BWORK, INFO )
@@ -35,11 +35,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEES computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues, the real Schur form T, and, optionally, the matrix of
@@ -57,11 +57,10 @@
 *>         [  c  a  ]
 *>
 *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -200,10 +199,9 @@
 *>                   the Schur form no longer satisfy SELECT=.TRUE.  This
 *>                   could also be caused by underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgeesx.f b/SRC/sgeesx.f
index dba6cc93..18c6039a 100644
--- a/SRC/sgeesx.f
+++ b/SRC/sgeesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM,
 *                          WR, WI, VS, LDVS, RCONDE, RCONDV, WORK, LWORK,
@@ -38,11 +38,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEESX computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues, the real Schur form T, and, optionally, the matrix of
@@ -67,11 +67,10 @@
 *>           [  c  a  ]
 *>
 *> where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -264,10 +263,9 @@
 *>                   the Schur form no longer satisfy SELECT=.TRUE.  This
 *>                   could also be caused by underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgeev.f b/SRC/sgeev.f
index 68f666cb..4de6ae70 100644
--- a/SRC/sgeev.f
+++ b/SRC/sgeev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEEV( JOBVL, JOBVR, N, A, LDA, WR, WI, VL, LDVL, VR,
 *                         LDVR, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WI( * ), WORK( * ), WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEEV computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -48,11 +48,10 @@
 *>
 *> The computed eigenvectors are normalized to have Euclidean norm
 *> equal to 1 and largest component real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -173,10 +172,9 @@
 *>                elements i+1:N of WR and WI contain eigenvalues which
 *>                have converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgeevx.f b/SRC/sgeevx.f
index bd3c2238..db62c666 100644
--- a/SRC/sgeevx.f
+++ b/SRC/sgeevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, WR, WI,
 *                          VL, LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM,
@@ -34,11 +34,11 @@
 *      $                   WI( * ), WORK( * ), WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEEVX computes for an N-by-N real nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -69,11 +69,10 @@
 *> (in exact arithmetic) but diagonal scaling will.  For further
 *> explanation of balancing, see section 4.10.2 of the LAPACK
 *> Users' Guide.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -286,10 +285,9 @@
 *>                have been computed; elements 1:ILO-1 and i+1:N of WR
 *>                and WI contain eigenvalues which have converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgegs.f b/SRC/sgegs.f
index 21b46fec..ff2c21ee 100644
--- a/SRC/sgegs.f
+++ b/SRC/sgegs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHAR,
 *                         ALPHAI, BETA, VSL, LDVSL, VSR, LDVSR, WORK,
@@ -32,11 +32,11 @@
 *      $                   VSR( LDVSR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine SGGES.
 *>
@@ -57,11 +57,10 @@
 *> SGEGV should be used instead.  See SGEGV for a description of the
 *> eigenvalues of the generalized nonsymmetric eigenvalue problem
 *> (GNEP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -210,10 +209,9 @@
 *>                =N+8: error return from SGGBAK (computing VSR)
 *>                =N+9: error return from SLASCL (various places)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgegv.f b/SRC/sgegv.f
index 435316b7..b2aba6c9 100644
--- a/SRC/sgegv.f
+++ b/SRC/sgegv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI,
 *                         BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine SGGEV.
 *>
@@ -67,11 +67,10 @@
 *> are left eigenvectors of (A,B).
 *>
 *> Note: this routine performs "full balancing" on A and B
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -257,10 +256,9 @@
 *>                =N+9: error return from SGGBAK (computing VR)
 *>                =N+10: error return from SLASCL (various calls)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -271,10 +269,9 @@
 *
 *> \ingroup realGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing
@@ -303,7 +300,6 @@
 *>
 *>  [*] See SHGEQZ, SGEGS, or read the book "Matrix Computations",
 *>      by Golub & van Loan, pub. by Johns Hopkins U. Press.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgehd2.f b/SRC/sgehd2.f
index af00d4c5..8b1729a4 100644
--- a/SRC/sgehd2.f
+++ b/SRC/sgehd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEHD2 reduces a real general matrix A to upper Hessenberg form H by
 *> an orthogonal similarity transformation:  Q**T * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -112,10 +110,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -147,7 +144,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgehrd.f b/SRC/sgehrd.f
index f4268235..f90a6ac3 100644
--- a/SRC/sgehrd.f
+++ b/SRC/sgehrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL              A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEHRD reduces a real general matrix A to upper Hessenberg form H by
 *> an orthogonal similarity transformation:  Q**T * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,10 +125,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -166,7 +163,6 @@
 *>  This file is a slight modification of LAPACK-3.0's DGEHRD
 *>  subroutine incorporating improvements proposed by Quintana-Orti and
 *>  Van de Geijn (2006). (See DLAHR2.)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgejsv.f b/SRC/sgejsv.f
index a8b96855..b2bdd232 100644
--- a/SRC/sgejsv.f
+++ b/SRC/sgejsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP,
 *                          M, N, A, LDA, SVA, U, LDU, V, LDV,
@@ -33,11 +33,11 @@
 *       CHARACTER*1 JOBA, JOBP, JOBR, JOBT, JOBU, JOBV
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEJSV computes the singular value decomposition (SVD) of a real M-by-N
 *> matrix [A], where M >= N. The SVD of [A] is written as
@@ -51,11 +51,10 @@
 *> the right singular vectors of [A], respectively. The matrices [U] and [V]
 *> are computed and stored in the arrays U and V, respectively. The diagonal
 *> of [SIGMA] is computed and stored in the array SVA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBA
 *> \verbatim
@@ -381,10 +380,9 @@
 *>           > 0 :  SGEJSV  did not converge in the maximal allowed number
 *>                  of sweeps. The computed values may be inaccurate.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -395,10 +393,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  SGEJSV implements a preconditioned Jacobi SVD algorithm. It uses SGEQP3,
@@ -439,12 +436,17 @@
 *>  this extra QRF step easily. The implementer can also improve data movement
 *>  (matrix transpose, matrix copy, matrix transposed copy) - this
 *>  implementation of SGEJSV uses only the simplest, naive data movement.
-*>
-*>  Contributors
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
 *>  Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*
+*> \par References:
+*  ================
 *>
-*>  References
+*> \verbatim
 *>
 *> [1] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I.
 *>     SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342.
@@ -459,14 +461,14 @@
 *> [4] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV,
 *>     QSVD, (H,K)-SVD computations.
 *>     Department of Mathematics, University of Zagreb, 2008.
-*>
-*>  Bugs, examples and comments
+*> \endverbatim
+*
+*>  \par Bugs, examples and comments:
+*   =================================
 *>
 *>  Please report all bugs and send interesting examples and/or comments to
 *>  drmac@math.hr. Thank you.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP,
      $                   M, N, A, LDA, SVA, U, LDU, V, LDV,
diff --git a/SRC/sgelq2.f b/SRC/sgelq2.f
index 9d76746d..93313623 100644
--- a/SRC/sgelq2.f
+++ b/SRC/sgelq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGELQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGELQ2 computes an LQ factorization of a real m by n matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgelqf.f b/SRC/sgelqf.f
index adc948bd..4db7c3e1 100644
--- a/SRC/sgelqf.f
+++ b/SRC/sgelqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGELQF computes an LQ factorization of a real M-by-N matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -133,7 +130,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgels.f b/SRC/sgels.f
index a892941e..7ffb7af3 100644
--- a/SRC/sgels.f
+++ b/SRC/sgels.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK,
 *                         INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGELS solves overdetermined or underdetermined real linear systems
 *> involving an M-by-N matrix A, or its transpose, using a QR or LQ
@@ -59,11 +59,10 @@
 *> handled in a single call; they are stored as the columns of the
 *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution 
 *> matrix X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -167,10 +166,9 @@
 *>                full rank; the least squares solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgelsd.f b/SRC/sgelsd.f
index 8e7f5eab..dacd98d2 100644
--- a/SRC/sgelsd.f
+++ b/SRC/sgelsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND,
 *                          RANK, WORK, LWORK, IWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), S( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGELSD computes the minimum-norm solution to a real linear least
 *> squares problem:
@@ -65,11 +65,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -187,10 +186,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -201,19 +199,13 @@
 *
 *> \ingroup realGEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE SGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND,
      $                   RANK, WORK, LWORK, IWORK, INFO )
diff --git a/SRC/sgelss.f b/SRC/sgelss.f
index 8550b415..1c2c2416 100644
--- a/SRC/sgelss.f
+++ b/SRC/sgelss.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), S( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGELSS computes the minimum norm solution to a real linear least
 *> squares problem:
@@ -51,11 +51,10 @@
 *> The effective rank of A is determined by treating as zero those
 *> singular values which are less than RCOND times the largest singular
 *> value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -156,10 +155,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgelsx.f b/SRC/sgelsx.f
index d65d17b8..7d4e9ea0 100644
--- a/SRC/sgelsx.f
+++ b/SRC/sgelsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine SGELSY.
 *>
@@ -65,11 +65,10 @@
 *>    X = P * Z**T [ inv(T11)*Q1**T*B ]
 *>                 [        0         ]
 *> where Q1 consists of the first RANK columns of Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgelsy.f b/SRC/sgelsy.f
index 4f77b700..8fb4f640 100644
--- a/SRC/sgelsy.f
+++ b/SRC/sgelsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGELSY computes the minimum-norm solution to a real linear least
 *> squares problem:
@@ -72,11 +72,10 @@
 *>   o Matrix B (the right hand side) is updated with Blas-3.
 *>   o The permutation of matrix B (the right hand side) is faster and
 *>     more simple.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -181,10 +180,9 @@
 *>          = 0: successful exit
 *>          < 0: If INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -195,18 +193,12 @@
 *
 *> \ingroup realGEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>
-*> \endverbatim
+*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n 
+*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
+*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
 *>
 *  =====================================================================
       SUBROUTINE SGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
diff --git a/SRC/sgemqrt.f b/SRC/sgemqrt.f
index 6c5d8e86..53f28374 100644
--- a/SRC/sgemqrt.f
+++ b/SRC/sgemqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, 
 *                          C, LDC, WORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL   V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEMQRT overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> generated using the compact WY representation as returned by SGEQRT. 
 *>
 *> Q is of order M if SIDE = 'L' and of order N  if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgeql2.f b/SRC/sgeql2.f
index b89d47aa..e022a77b 100644
--- a/SRC/sgeql2.f
+++ b/SRC/sgeql2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQL2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQL2 computes a QL factorization of a real m by n matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqlf.f b/SRC/sgeqlf.f
index 7792461d..7ea961e5 100644
--- a/SRC/sgeqlf.f
+++ b/SRC/sgeqlf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQLF computes a QL factorization of a real M-by-N matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqp3.f b/SRC/sgeqp3.f
index 2a2497e3..4bedff7e 100644
--- a/SRC/sgeqp3.f
+++ b/SRC/sgeqp3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQP3 computes a QR factorization with column pivoting of a
 *> matrix A:  A*P = Q*R  using Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0: successful exit.
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -126,10 +124,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -143,13 +140,14 @@
 *>  where tau is a real/complex scalar, and v is a real/complex vector
 *>  with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in
 *>  A(i+1:m,i), and tau in TAU(i).
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO )
 *
diff --git a/SRC/sgeqpf.f b/SRC/sgeqpf.f
index 83557ad2..8a31c2c2 100644
--- a/SRC/sgeqpf.f
+++ b/SRC/sgeqpf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQPF( M, N, A, LDA, JPVT, TAU, WORK, INFO )
 * 
@@ -28,21 +28,20 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine SGEQP3.
 *>
 *> SGEQPF computes a QR factorization with column pivoting of a
 *> real M-by-N matrix A: A*P = Q*R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,10 +112,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -140,7 +137,6 @@
 *>    University of Zagreb, Croatia.
 *>  -- April 2011                                                      --
 *>  For more details see LAPACK Working Note 176.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqr2.f b/SRC/sgeqr2.f
index 1e99270c..50971907 100644
--- a/SRC/sgeqr2.f
+++ b/SRC/sgeqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQR2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQR2 computes a QR factorization of a real m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqr2p.f b/SRC/sgeqr2p.f
index d68d9ef3..9162bca6 100644
--- a/SRC/sgeqr2p.f
+++ b/SRC/sgeqr2p.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQR2P( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQR2P computes a QR factorization of a real m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqrf.f b/SRC/sgeqrf.f
index 2d2499da..b30b4a64 100644
--- a/SRC/sgeqrf.f
+++ b/SRC/sgeqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQRF computes a QR factorization of a real M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqrfp.f b/SRC/sgeqrfp.f
index 9fbf1d07..55921d23 100644
--- a/SRC/sgeqrfp.f
+++ b/SRC/sgeqrfp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQRFP computes a QR factorization of a real M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqrt.f b/SRC/sgeqrt.f
index 1d2b6480..bb26c8c0 100644
--- a/SRC/sgeqrt.f
+++ b/SRC/sgeqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL A( LDA, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQRT computes a blocked QR factorization of a real M-by-N matrix A
 *> using the compact WY representation of Q.  
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,11 +112,11 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
 *>  below the diagonal. For example, if M=5 and N=3, the matrix V is
 *>
@@ -138,7 +136,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = (T1 T2 ... TB).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqrt2.f b/SRC/sgeqrt2.f
index f6feaa0b..10b4afa2 100644
--- a/SRC/sgeqrt2.f
+++ b/SRC/sgeqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGEQRT2( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQRT2 computes a QR factorization of a real M-by-N matrix A, 
 *> using the compact WY representation of Q. 
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -125,7 +122,6 @@
 *>               H = I - V * T * V**T
 *>
 *>  where V**T is the transpose of V.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgeqrt3.f b/SRC/sgeqrt3.f
index 747b9980..26cfe066 100644
--- a/SRC/sgeqrt3.f
+++ b/SRC/sgeqrt3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE SGEQRT3( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,22 +27,21 @@
 *       REAL   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGEQRT3 recursively computes a QR factorization of a real M-by-N 
 *> matrix A, using the compact WY representation of Q. 
 *>
 *> Based on the algorithm of Elmroth and Gustavson, 
 *> IBM J. Res. Develop. Vol 44 No. 4 July 2000.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -106,10 +104,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -130,7 +127,6 @@
 *>  where V**T is the transpose of V.
 *>
 *>  For details of the algorithm, see Elmroth and Gustavson (cited above).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgerfs.f b/SRC/sgerfs.f
index cd0220da..b570d408 100644
--- a/SRC/sgerfs.f
+++ b/SRC/sgerfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,20 +31,19 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGERFS improves the computed solution to a system of linear
 *> equations and provides error bounds and backward error estimates for
 *> the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -161,16 +160,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgerfsx.f b/SRC/sgerfsx.f
index 12f0a1b5..89035565 100644
--- a/SRC/sgerfsx.f
+++ b/SRC/sgerfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SGERFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -398,10 +395,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgerq2.f b/SRC/sgerq2.f
index 42d01260..54ad0b92 100644
--- a/SRC/sgerq2.f
+++ b/SRC/sgerq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGERQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGERQ2 computes an RQ factorization of a real m by n matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in
 *>  A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgerqf.f b/SRC/sgerqf.f
index 19b162ea..64d22844 100644
--- a/SRC/sgerqf.f
+++ b/SRC/sgerqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGERQF computes an RQ factorization of a real M-by-N matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; v(1:n-k+i-1) is stored on exit in
 *>  A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgesc2.f b/SRC/sgesc2.f
index cbfa967c..735a9caa 100644
--- a/SRC/sgesc2.f
+++ b/SRC/sgesc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 * 
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), RHS( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGESC2 solves a system of linear equations
 *>
@@ -41,11 +41,10 @@
 *>
 *> with a general N-by-N matrix A using the LU factorization with
 *> complete pivoting computed by SGETC2.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>           On exit, SCALE contains the scale factor. SCALE is chosen
 *>           0 <= SCALE <= 1 to prevent owerflow in the solution.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,18 +105,12 @@
 *
 *> \ingroup realGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 *
diff --git a/SRC/sgesdd.f b/SRC/sgesdd.f
index 9e45e539..9972ab0d 100644
--- a/SRC/sgesdd.f
+++ b/SRC/sgesdd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK,
 *                          LWORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGESDD computes the singular value decomposition (SVD) of a real
 *> M-by-N matrix A, optionally computing the left and right singular
@@ -61,11 +61,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -195,10 +194,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  SBDSDC did not converge, updating process failed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -209,18 +207,12 @@
 *
 *> \ingroup realGEsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK,
      $                   LWORK, IWORK, INFO )
diff --git a/SRC/sgesv.f b/SRC/sgesv.f
index 98d12883..a6a0376a 100644
--- a/SRC/sgesv.f
+++ b/SRC/sgesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGESV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -44,11 +44,10 @@
 *> where P is a permutation matrix, L is unit lower triangular, and U is
 *> upper triangular.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -107,10 +106,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgesvd.f b/SRC/sgesvd.f
index 2362c4ac..5ef13c28 100644
--- a/SRC/sgesvd.f
+++ b/SRC/sgesvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGESVD computes the singular value decomposition (SVD) of a real
 *> M-by-N matrix A, optionally computing the left and/or right singular
@@ -50,11 +50,10 @@
 *> U and V are the left and right singular vectors of A.
 *>
 *> Note that the routine returns V**T, not V.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -195,10 +194,9 @@
 *>                did not converge to zero. See the description of WORK
 *>                above for details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgesvj.f b/SRC/sgesvj.f
index 902dff94..627949eb 100644
--- a/SRC/sgesvj.f
+++ b/SRC/sgesvj.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V,
 *                          LDV, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( LWORK )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGESVJ computes the singular value decomposition (SVD) of a real
 *> M-by-N matrix A, where M >= N. The SVD of A is written as
@@ -45,62 +45,10 @@
 *> matrix, and V is an N-by-N orthogonal matrix. The diagonal elements
 *> of SIGMA are the singular values of A. The columns of U and V are the
 *> left and the right singular vectors of A, respectively.
-*>
-*> Further Details
-*> ~~~~~~~~~~~~~~~
-*> The orthogonal N-by-N matrix V is obtained as a product of Jacobi plane
-*> rotations. The rotations are implemented as fast scaled rotations of
-*> Anda and Park [1]. In the case of underflow of the Jacobi angle, a
-*> modified Jacobi transformation of Drmac [4] is used. Pivot strategy uses
-*> column interchanges of de Rijk [2]. The relative accuracy of the computed
-*> singular values and the accuracy of the computed singular vectors (in
-*> angle metric) is as guaranteed by the theory of Demmel and Veselic [3].
-*> The condition number that determines the accuracy in the full rank case
-*> is essentially min_{D=diag} kappa(A*D), where kappa(.) is the
-*> spectral condition number. The best performance of this Jacobi SVD
-*> procedure is achieved if used in an  accelerated version of Drmac and
-*> Veselic [5,6], and it is the kernel routine in the SIGMA library [7].
-*> Some tunning parameters (marked with [TP]) are available for the
-*> implementer.
-*> The computational range for the nonzero singular values is the  machine
-*> number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even
-*> denormalized singular values can be computed with the corresponding
-*> gradual loss of accurate digits.
-*>
-*> Contributors
-*> ~~~~~~~~~~~~
-*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
-*>
-*> References
-*> ~~~~~~~~~~
-*> [1] A. A. Anda and H. Park: Fast plane rotations with dynamic scaling.
-*>    SIAM J. matrix Anal. Appl., Vol. 15 (1994), pp. 162-174.
-*> [2] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the
-*>    singular value decomposition on a vector computer.
-*>    SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371.
-*> [3] J. Demmel and K. Veselic: Jacobi method is more accurate than QR.
-*> [4] Z. Drmac: Implementation of Jacobi rotations for accurate singular
-*>    value computation in floating point arithmetic.
-*>    SIAM J. Sci. Comp., Vol. 18 (1997), pp. 1200-1222.
-*> [5] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I.
-*>    SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342.
-*>    LAPACK Working note 169.
-*> [6] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm II.
-*>    SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1343-1362.
-*>    LAPACK Working note 170.
-*> [7] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV,
-*>    QSVD, (H,K)-SVD computations.
-*>    Department of Mathematics, University of Zagreb, 2008.
-*>
-*> Bugs, Examples and Comments
-*> ~~~~~~~~~~~~~~~~~~~~~~~~~~~
-*> Please report all bugs and send interesting test examples and comments to
-*> drmac@math.hr. Thank you.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBA
 *> \verbatim
@@ -301,10 +249,9 @@
 *>                of sweeps. The output may still be useful. See the
 *>                description of WORK.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -315,6 +262,61 @@
 *
 *> \ingroup realGEcomputational
 *
+*> \par Further Details:
+*  =====================
+*>
+*> The orthogonal N-by-N matrix V is obtained as a product of Jacobi plane
+*> rotations. The rotations are implemented as fast scaled rotations of
+*> Anda and Park [1]. In the case of underflow of the Jacobi angle, a
+*> modified Jacobi transformation of Drmac [4] is used. Pivot strategy uses
+*> column interchanges of de Rijk [2]. The relative accuracy of the computed
+*> singular values and the accuracy of the computed singular vectors (in
+*> angle metric) is as guaranteed by the theory of Demmel and Veselic [3].
+*> The condition number that determines the accuracy in the full rank case
+*> is essentially min_{D=diag} kappa(A*D), where kappa(.) is the
+*> spectral condition number. The best performance of this Jacobi SVD
+*> procedure is achieved if used in an  accelerated version of Drmac and
+*> Veselic [5,6], and it is the kernel routine in the SIGMA library [7].
+*> Some tunning parameters (marked with [TP]) are available for the
+*> implementer. \n
+*> The computational range for the nonzero singular values is the  machine
+*> number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even
+*> denormalized singular values can be computed with the corresponding
+*> gradual loss of accurate digits.
+*>
+*> \par Contributors:
+*  ==================
+*>
+*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*>
+*> \par References:
+*  ================
+*>
+*> [1] A. A. Anda and H. Park: Fast plane rotations with dynamic scaling. \n
+*>    SIAM J. matrix Anal. Appl., Vol. 15 (1994), pp. 162-174. \n\n
+*> [2] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the
+*>    singular value decomposition on a vector computer. \n
+*>    SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371. \n\n
+*> [3] J. Demmel and K. Veselic: Jacobi method is more accurate than QR. \n
+*> [4] Z. Drmac: Implementation of Jacobi rotations for accurate singular
+*>    value computation in floating point arithmetic. \n
+*>    SIAM J. Sci. Comp., Vol. 18 (1997), pp. 1200-1222. \n\n
+*> [5] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I. \n
+*>    SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342. \n
+*>    LAPACK Working note 169. \n\n
+*> [6] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm II. \n
+*>    SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1343-1362. \n
+*>    LAPACK Working note 170. \n\n
+*> [7] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV,
+*>    QSVD, (H,K)-SVD computations.\n
+*>    Department of Mathematics, University of Zagreb, 2008.
+*>
+*> \par Bugs, Examples and Comments:
+*  =================================
+*>
+*> Please report all bugs and send interesting test examples and comments to
+*> drmac@math.hr. Thank you.
+*
 *  =====================================================================
       SUBROUTINE SGESVJ( JOBA, JOBU, JOBV, M, N, A, LDA, SVA, MV, V,
      $                   LDV, WORK, LWORK, INFO )
diff --git a/SRC/sgesvx.f b/SRC/sgesvx.f
index 88940fbe..c30d209f 100644
--- a/SRC/sgesvx.f
+++ b/SRC/sgesvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                          EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGESVX uses the LU factorization to compute the solution to a real
 *> system of linear equations
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -86,11 +89,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -329,10 +331,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 
diff --git a/SRC/sgesvxx.f b/SRC/sgesvxx.f
index a1636350..8feeeb8e 100644
--- a/SRC/sgesvxx.f
+++ b/SRC/sgesvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SGESVXX uses the LU factorization to compute the solution to a
 *>    real system of linear equations  A * X = B,  where A is an
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what SGESVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -109,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -523,10 +523,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgetc2.f b/SRC/sgetc2.f
index d76402b7..4e897ee2 100644
--- a/SRC/sgetc2.f
+++ b/SRC/sgetc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETC2( N, A, LDA, IPIV, JPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGETC2 computes an LU factorization with complete pivoting of the
 *> n-by-n matrix A. The factorization has the form A = P * L * U * Q,
@@ -40,11 +40,10 @@
 *> unit diagonal elements and U is upper triangular.
 *>
 *> This is the Level 2 BLAS algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>                we try to solve for x in Ax = b. So U is perturbed to
 *>                avoid the overflow.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,18 +102,12 @@
 *
 *> \ingroup realGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SGETC2( N, A, LDA, IPIV, JPIV, INFO )
 *
diff --git a/SRC/sgetf2.f b/SRC/sgetf2.f
index 2d6c1732..3833cc25 100644
--- a/SRC/sgetf2.f
+++ b/SRC/sgetf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETF2( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGETF2 computes an LU factorization of a general m-by-n matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgetrf.f b/SRC/sgetrf.f
index 8abbed30..ce812e53 100644
--- a/SRC/sgetrf.f
+++ b/SRC/sgetrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGETRF computes an LU factorization of a general M-by-N matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgetri.f b/SRC/sgetri.f
index 1c1e340a..94449537 100644
--- a/SRC/sgetri.f
+++ b/SRC/sgetri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -28,22 +28,21 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGETRI computes the inverse of a matrix using the LU factorization
 *> computed by SGETRF.
 *>
 *> This method inverts U and then computes inv(A) by solving the system
 *> inv(A)*L = inv(U) for inv(A).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0:  if INFO = i, U(i,i) is exactly zero; the matrix is
 *>                singular and its inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgetrs.f b/SRC/sgetrs.f
index 809e1330..f566a10a 100644
--- a/SRC/sgetrs.f
+++ b/SRC/sgetrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,21 +29,20 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGETRS solves a system of linear equations
 *>    A * X = B  or  A**T * X = B
 *> with a general N-by-N matrix A using the LU factorization computed
 *> by SGETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sggbak.f b/SRC/sggbak.f
index bb5b89b1..5a9167bc 100644
--- a/SRC/sggbak.f
+++ b/SRC/sggbak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V,
 *                          LDV, INFO )
@@ -29,21 +29,20 @@
 *       REAL               LSCALE( * ), RSCALE( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGBAK forms the right or left eigenvectors of a real generalized
 *> eigenvalue problem A*x = lambda*B*x, by backward transformation on
 *> the computed eigenvectors of the balanced pair of matrices output by
 *> SGGBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,15 +134,13 @@
 *
 *> \ingroup realGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. Ward, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sggbal.f b/SRC/sggbal.f
index 1be41ed3..8df66551 100644
--- a/SRC/sggbal.f
+++ b/SRC/sggbal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE,
 *                          RSCALE, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   RSCALE( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGBAL balances a pair of general real matrices (A,B).  This
 *> involves, first, permuting A and B by similarity transformations to
@@ -46,11 +46,10 @@
 *> Balancing may reduce the 1-norm of the matrices, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors in the
 *> generalized eigenvalue problem A*x = lambda*B*x.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -166,15 +164,13 @@
 *
 *> \ingroup realGBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. WARD, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgges.f b/SRC/sgges.f
index 7bba3308..c6dd5108 100644
--- a/SRC/sgges.f
+++ b/SRC/sgges.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB,
 *                         SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL, VSR,
@@ -37,11 +37,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGES computes for a pair of N-by-N real nonsymmetric matrices (A,B),
 *> the generalized eigenvalues, the generalized real Schur form (S,T),
@@ -76,11 +76,10 @@
 *> and the pair of corresponding 2-by-2 blocks in S and T will have a
 *> complex conjugate pair of generalized eigenvalues.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -267,10 +266,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering failed in STGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sggesx.f b/SRC/sggesx.f
index c0b8a54c..a24549e1 100644
--- a/SRC/sggesx.f
+++ b/SRC/sggesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA,
 *                          B, LDB, SDIM, ALPHAR, ALPHAI, BETA, VSL, LDVSL,
@@ -41,11 +41,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGESX computes for a pair of N-by-N real nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, the real Schur form (S,T), and,
@@ -81,11 +81,10 @@
 *> and the pair of corresponding 2-by-2 blocks in S and T will have a
 *> complex conjugate pair of generalized eigenvalues.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -329,10 +328,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering failed in STGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -343,10 +341,9 @@
 *
 *> \ingroup realGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  An approximate (asymptotic) bound on the average absolute error of
@@ -360,7 +357,6 @@
 *>       EPS * norm((A, B)) / RCONDV( 2 ).
 *>
 *>  See LAPACK User's Guide, section 4.11 for more information.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sggev.f b/SRC/sggev.f
index 07fbd3b3..bf545efb 100644
--- a/SRC/sggev.f
+++ b/SRC/sggev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHAR, ALPHAI,
 *                         BETA, VL, LDVL, VR, LDVR, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGEV computes for a pair of N-by-N real nonsymmetric matrices (A,B)
 *> the generalized eigenvalues, and optionally, the left and/or right
@@ -59,11 +59,10 @@
 *>
 *> where u(j)**H is the conjugate-transpose of u(j).
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -210,10 +209,9 @@
 *>          > N:  =N+1: other than QZ iteration failed in SHGEQZ.
 *>                =N+2: error return from STGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sggevx.f b/SRC/sggevx.f
index daa51c4d..8475ebe9 100644
--- a/SRC/sggevx.f
+++ b/SRC/sggevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB,
 *                          ALPHAR, ALPHAI, BETA, VL, LDVL, VR, LDVR, ILO,
@@ -37,11 +37,11 @@
 *      $                   VL( LDVL, * ), VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGEVX computes for a pair of N-by-N real nonsymmetric matrices (A,B)
 *> the generalized eigenvalues, and optionally, the left and/or right
@@ -71,11 +71,10 @@
 *>
 *> where u(j)**H is the conjugate-transpose of u(j).
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -344,10 +343,9 @@
 *>          > N:  =N+1: other than QZ iteration failed in SHGEQZ.
 *>                =N+2: error return from STGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -358,10 +356,9 @@
 *
 *> \ingroup realGEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing a matrix pair (A,B) includes, first, permuting rows and
@@ -386,7 +383,6 @@
 *>
 *>  For further explanation of the reciprocal condition numbers RCONDE
 *>  and RCONDV, see section 4.11 of LAPACK User's Guide.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sggglm.f b/SRC/sggglm.f
index d276de90..25c95757 100644
--- a/SRC/sggglm.f
+++ b/SRC/sggglm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGGLM solves a general Gauss-Markov linear model (GLM) problem:
 *>
@@ -61,11 +61,10 @@
 *>                  x
 *>
 *> where inv(B) denotes the inverse of B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -169,10 +168,9 @@
 *>                rank( A B ) < N; the least squares solution could not
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgghrd.f b/SRC/sgghrd.f
index fa54857d..33142064 100644
--- a/SRC/sgghrd.f
+++ b/SRC/sgghrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q,
 *                          LDQ, Z, LDZ, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGHRD reduces a pair of real matrices (A,B) to generalized upper
 *> Hessenberg form using orthogonal transformations, where A is a
@@ -64,11 +64,10 @@
 *> If Q1 is the orthogonal matrix from the QR factorization of B in the
 *> original equation A*x = lambda*B*x, then SGGHRD reduces the original
 *> problem to generalized Hessenberg form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -181,10 +180,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -195,16 +193,14 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine reduces A to Hessenberg and B to triangular form by
 *>  an unblocked reduction, as described in _Matrix_Computations_,
 *>  by Golub and Van Loan (Johns Hopkins Press.)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sgglse.f b/SRC/sgglse.f
index 6a1bf5e5..6eb478b3 100644
--- a/SRC/sgglse.f
+++ b/SRC/sgglse.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGLSE solves the linear equality-constrained least squares (LSE)
 *> problem:
@@ -52,11 +52,10 @@
 *> matrices (B, A) given by
 *>
 *>    B = (0 R)*Q,   A = Z*T*Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>                    ( (B) )
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sggqrf.f b/SRC/sggqrf.f
index 29c526df..0378a1ab 100644
--- a/SRC/sggqrf.f
+++ b/SRC/sggqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGQRF computes a generalized QR factorization of an N-by-M matrix A
 *> and an N-by-P matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the
 *> transpose of the matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -165,10 +164,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,10 +177,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -212,7 +209,6 @@
 *>  B(n-k+i,1:p-k+i-1), and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine SORGRQ.
 *>  To use Z to update another matrix, use LAPACK subroutine SORMRQ.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sggrqf.f b/SRC/sggrqf.f
index 7d6c9204..60513497 100644
--- a/SRC/sggrqf.f
+++ b/SRC/sggrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGRQF computes a generalized RQ factorization of an M-by-N matrix A
 *> and a P-by-N matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z**T denotes the
 *> transpose of the matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INF0= -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -178,10 +176,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -211,7 +208,6 @@
 *>  and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine SORGQR.
 *>  To use Z to update another matrix, use LAPACK subroutine SORMQR.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sggsvd.f b/SRC/sggsvd.f
index 08633242..cb9c3f17 100644
--- a/SRC/sggsvd.f
+++ b/SRC/sggsvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
 *                          LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
@@ -33,11 +33,11 @@
 *      $                   V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGSVD computes the generalized singular value decomposition (GSVD)
 *> of an M-by-N real matrix A and P-by-N real matrix B:
@@ -117,11 +117,10 @@
 *>
 *>                      X = Q*( I   0    )
 *>                            ( 0 inv(R) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -294,10 +293,12 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, the Jacobi-type procedure failed to
 *>                converge.  For further details, see subroutine STGSJA.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLA    REAL
 *>  TOLB    REAL
 *>          TOLA and TOLB are the thresholds to determine the effective
@@ -307,10 +308,9 @@
 *>          The size of TOLA and TOLB may affect the size of backward
 *>          errors of the decomposition.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -321,18 +321,12 @@
 *
 *> \ingroup realOTHERsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  2-96 Based on modifications by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
      $                   LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
diff --git a/SRC/sggsvp.f b/SRC/sggsvp.f
index ae481213..2e897e53 100644
--- a/SRC/sggsvp.f
+++ b/SRC/sggsvp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB,
 *                          TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ,
@@ -33,11 +33,11 @@
 *      $                   TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGGSVP computes orthogonal matrices U, V and Q such that
 *>
@@ -62,11 +62,10 @@
 *> This decomposition is the preprocessing step for computing the
 *> Generalized Singular Value Decomposition (GSVD), see subroutine
 *> SGGSVD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -230,10 +229,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -244,18 +242,13 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
 *>  The subroutine uses LAPACK subroutine SGEQPF for the QR factorization
 *>  with column pivoting to detect the effective numerical rank of the
 *>  a matrix. It may be replaced by a better rank determination strategy.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB,
      $                   TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ,
diff --git a/SRC/sgsvj0.f b/SRC/sgsvj0.f
index c49c20cf..0f5ad9ca 100644
--- a/SRC/sgsvj0.f
+++ b/SRC/sgsvj0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS,
 *                          SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
@@ -31,35 +31,20 @@
 *      $                   WORK( LWORK )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGSVJ0 is called from SGESVJ as a pre-processor and that is its main
 *> purpose. It applies Jacobi rotations in the same way as SGESVJ does, but
 *> it does not check convergence (stopping criterion). Few tuning
 *> parameters (marked by [TP]) are available for the implementer.
-*>
-*> Further Details
-*> ~~~~~~~~~~~~~~~
-*> SGSVJ0 is used just to enable SGESVJ to call a simplified version of
-*> itself to work on a submatrix of the original matrix.
-*>
-*> Contributors
-*> ~~~~~~~~~~~~
-*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
-*>
-*> Bugs, Examples and Comments
-*> ~~~~~~~~~~~~~~~~~~~~~~~~~~~
-*> Please report all bugs and send interesting test examples and comments to
-*> drmac@math.hr. Thank you.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBV
 *> \verbatim
@@ -199,10 +184,9 @@
 *>          = 0 : successful exit.
 *>          < 0 : if INFO = -i, then the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -213,6 +197,23 @@
 *
 *> \ingroup realOTHERcomputational
 *
+*> \par Further Details:
+*  =====================
+*>
+*> SGSVJ0 is used just to enable SGESVJ to call a simplified version of
+*> itself to work on a submatrix of the original matrix.
+*>
+*> \par Contributors:
+*  ==================
+*>
+*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*>
+*> \par Bugs, Examples and Comments:
+*  =================================
+*>
+*> Please report all bugs and send interesting test examples and comments to
+*> drmac@math.hr. Thank you.
+*
 *  =====================================================================
       SUBROUTINE SGSVJ0( JOBV, M, N, A, LDA, D, SVA, MV, V, LDV, EPS,
      $                   SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
diff --git a/SRC/sgsvj1.f b/SRC/sgsvj1.f
index 31a2d91a..59e04d3e 100644
--- a/SRC/sgsvj1.f
+++ b/SRC/sgsvj1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV,
 *                          EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( LWORK )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGSVJ1 is called from SGESVJ as a pre-processor and that is its main
 *> purpose. It applies Jacobi rotations in the same way as SGESVJ does, but
@@ -64,15 +64,10 @@
 *> tiled using quadratic tiles of side KBL. Here, KBL is a tunning parmeter.
 *> The number of sweeps is given in NSWEEP and the orthogonality threshold
 *> is given in TOL.
-*>
-*> Contributors
-*> ~~~~~~~~~~~~
-*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBV
 *> \verbatim
@@ -219,10 +214,9 @@
 *>          = 0 : successful exit.
 *>          < 0 : if INFO = -i, then the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -233,6 +227,11 @@
 *
 *> \ingroup realOTHERcomputational
 *
+*> \par Contributors:
+*  ==================
+*>
+*> Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
+*
 *  =====================================================================
       SUBROUTINE SGSVJ1( JOBV, M, N, N1, A, LDA, D, SVA, MV, V, LDV,
      $                   EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO )
diff --git a/SRC/sgtcon.f b/SRC/sgtcon.f
index 461c6ca1..8d43f737 100644
--- a/SRC/sgtcon.f
+++ b/SRC/sgtcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND,
 *                          WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       REAL               D( * ), DL( * ), DU( * ), DU2( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGTCON estimates the reciprocal of the condition number of a real
 *> tridiagonal matrix A using the LU factorization as computed by
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -130,10 +129,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgtrfs.f b/SRC/sgtrfs.f
index 98c22c77..05d2f910 100644
--- a/SRC/sgtrfs.f
+++ b/SRC/sgtrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK,
@@ -33,20 +33,19 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is tridiagonal, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -184,16 +183,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgtsv.f b/SRC/sgtsv.f
index 7c16fd42..219d47bd 100644
--- a/SRC/sgtsv.f
+++ b/SRC/sgtsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGTSV( N, NRHS, DL, D, DU, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               B( LDB, * ), D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGTSV  solves the equation
 *>
@@ -42,11 +42,10 @@
 *>
 *> Note that the equation  A**T*X = B  may be solved by interchanging the
 *> order of the arguments DU and DL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -112,10 +111,9 @@
 *>               has not been computed.  The factorization has not been
 *>               completed unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgtsvx.f b/SRC/sgtsvx.f
index 766e6834..91028d6f 100644
--- a/SRC/sgtsvx.f
+++ b/SRC/sgtsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF,
 *                          DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -34,11 +34,11 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGTSVX uses the LU factorization to compute the solution to a real
 *> system of linear equations A * X = B or A**T * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -71,11 +74,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
@@ -273,10 +275,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 
diff --git a/SRC/sgttrf.f b/SRC/sgttrf.f
index d85d51e7..c23265b8 100644
--- a/SRC/sgttrf.f
+++ b/SRC/sgttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGTTRF( N, DL, D, DU, DU2, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGTTRF computes an LU factorization of a real tridiagonal matrix A
 *> using elimination with partial pivoting and row interchanges.
@@ -42,11 +42,10 @@
 *> where L is a product of permutation and unit lower bidiagonal
 *> matrices and U is upper triangular with nonzeros in only the main
 *> diagonal and first two superdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgttrs.f b/SRC/sgttrs.f
index 90b5df18..91efca89 100644
--- a/SRC/sgttrs.f
+++ b/SRC/sgttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       REAL               B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGTTRS solves one of the systems of equations
 *>    A*X = B  or  A**T*X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by SGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sgtts2.f b/SRC/sgtts2.f
index 2c3dc3cf..8021ada3 100644
--- a/SRC/sgtts2.f
+++ b/SRC/sgtts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB )
 * 
@@ -28,21 +28,20 @@
 *       REAL               B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SGTTS2 solves one of the systems of equations
 *>    A*X = B  or  A**T*X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by SGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITRANS
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/shgeqz.f b/SRC/shgeqz.f
index e573fcc9..908b72c3 100644
--- a/SRC/shgeqz.f
+++ b/SRC/shgeqz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT,
 *                          ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, WORK,
@@ -32,11 +32,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SHGEQZ computes the eigenvalues of a real matrix pair (H,T),
 *> where H is an upper Hessenberg matrix and T is upper triangular,
@@ -92,11 +92,10 @@
 *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix
 *>      Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973),
 *>      pp. 241--256.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -274,10 +273,9 @@
 *>                     in Schur form, but ALPHAR(i), ALPHAI(i), and
 *>                     BETA(i), i=INFO-N+1,...,N should be correct.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -288,10 +286,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Iteration counters:
@@ -300,7 +297,6 @@
 *>  IITER  -- counts iterations run since ILAST was last
 *>            changed.  This is therefore reset only when a 1-by-1 or
 *>            2-by-2 block deflates off the bottom.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/shsein.f b/SRC/shsein.f
index 0ac9bf6b..0bfa168e 100644
--- a/SRC/shsein.f
+++ b/SRC/shsein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, WR, WI,
 *                          VL, LDVL, VR, LDVR, MM, M, WORK, IFAILL,
@@ -33,11 +33,11 @@
 *      $                   WI( * ), WORK( * ), WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SHSEIN uses inverse iteration to find specified right and/or left
 *> eigenvectors of a real upper Hessenberg matrix H.
@@ -48,11 +48,10 @@
 *>              H * x = w * x,     y**h * H = w * y**h
 *>
 *> where y**h denotes the conjugate transpose of the vector y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -235,10 +234,9 @@
 *>                failed to converge; see IFAILL and IFAILR for further
 *>                details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -249,16 +247,14 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x|+|y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/shseqr.f b/SRC/shseqr.f
index 0cf4a1e3..d44759ed 100644
--- a/SRC/shseqr.f
+++ b/SRC/shseqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z,
 *                          LDZ, WORK, LWORK, INFO )
@@ -29,13 +29,12 @@
 *       REAL               H( LDH, * ), WI( * ), WORK( * ), WR( * ),
 *      $                   Z( LDZ, * )
 *       ..
-*  Purpose
-*  =======
+*  
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SHSEQR computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -46,11 +45,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the orthogonal matrix Q:  A = Q*H*Q**T = (QZ)*T*(QZ)**T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -226,10 +224,9 @@
 *>                If INFO .GT. 0 and COMPZ = 'N', then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -240,6 +237,81 @@
 *
 *> \ingroup realOTHERcomputational
 *
+*> \par Contributors:
+*  ==================
+*>
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
+*>
+*>             Default values supplied by
+*>             ILAENV(ISPEC,'SHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
+*>             It is suggested that these defaults be adjusted in order
+*>             to attain best performance in each particular
+*>             computational environment.
+*>
+*>            ISPEC=12: The SLAHQR vs SLAQR0 crossover point.
+*>                      Default: 75. (Must be at least 11.)
+*>
+*>            ISPEC=13: Recommended deflation window size.
+*>                      This depends on ILO, IHI and NS.  NS is the
+*>                      number of simultaneous shifts returned
+*>                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
+*>                      The default for (IHI-ILO+1).LE.500 is NS.
+*>                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
+*>
+*>            ISPEC=14: Nibble crossover point. (See IPARMQ for
+*>                      details.)  Default: 14% of deflation window
+*>                      size.
+*>
+*>            ISPEC=15: Number of simultaneous shifts in a multishift
+*>                      QR iteration.
+*>
+*>                      If IHI-ILO+1 is ...
+*>
+*>                      greater than      ...but less    ... the
+*>                      or equal to ...      than        default is
+*>
+*>                           1               30          NS =   2(+)
+*>                          30               60          NS =   4(+)
+*>                          60              150          NS =  10(+)
+*>                         150              590          NS =  **
+*>                         590             3000          NS =  64
+*>                        3000             6000          NS = 128
+*>                        6000             infinity      NS = 256
+*>
+*>                  (+)  By default some or all matrices of this order
+*>                       are passed to the implicit double shift routine
+*>                       SLAHQR and this parameter is ignored.  See
+*>                       ISPEC=12 above and comments in IPARMQ for
+*>                       details.
+*>
+*>                 (**)  The asterisks (**) indicate an ad-hoc
+*>                       function of N increasing from 10 to 64.
+*>
+*>            ISPEC=16: Select structured matrix multiply.
+*>                      If the number of simultaneous shifts (specified
+*>                      by ISPEC=15) is less than 14, then the default
+*>                      for ISPEC=16 is 0.  Otherwise the default for
+*>                      ISPEC=16 is 2.
+*> \endverbatim
+*
+*> \par References:
+*  ================
+*>
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
+*> \n
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
+*>       of Matrix Analysis, volume 23, pages 948--973, 2002.
+*
 *  =====================================================================
       SUBROUTINE SHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z,
      $                   LDZ, WORK, LWORK, INFO )
@@ -257,75 +329,9 @@
       REAL               H( LDH, * ), WI( * ), WORK( * ), WR( * ),
      $                   Z( LDZ, * )
 *     ..
-*  ================================================================
-*             Default values supplied by
-*             ILAENV(ISPEC,'SHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
-*             It is suggested that these defaults be adjusted in order
-*             to attain best performance in each particular
-*             computational environment.
-*
-*            ISPEC=12: The SLAHQR vs SLAQR0 crossover point.
-*                      Default: 75. (Must be at least 11.)
-*
-*            ISPEC=13: Recommended deflation window size.
-*                      This depends on ILO, IHI and NS.  NS is the
-*                      number of simultaneous shifts returned
-*                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
-*                      The default for (IHI-ILO+1).LE.500 is NS.
-*                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
-*
-*            ISPEC=14: Nibble crossover point. (See IPARMQ for
-*                      details.)  Default: 14% of deflation window
-*                      size.
-*
-*            ISPEC=15: Number of simultaneous shifts in a multishift
-*                      QR iteration.
-*
-*                      If IHI-ILO+1 is ...
-*
-*                      greater than      ...but less    ... the
-*                      or equal to ...      than        default is
-*
-*                           1               30          NS =   2(+)
-*                          30               60          NS =   4(+)
-*                          60              150          NS =  10(+)
-*                         150              590          NS =  **
-*                         590             3000          NS =  64
-*                        3000             6000          NS = 128
-*                        6000             infinity      NS = 256
-*
-*                  (+)  By default some or all matrices of this order
-*                       are passed to the implicit double shift routine
-*                       SLAHQR and this parameter is ignored.  See
-*                       ISPEC=12 above and comments in IPARMQ for
-*                       details.
-*
-*                 (**)  The asterisks (**) indicate an ad-hoc
-*                       function of N increasing from 10 to 64.
-*
-*            ISPEC=16: Select structured matrix multiply.
-*                      If the number of simultaneous shifts (specified
-*                      by ISPEC=15) is less than 14, then the default
-*                      for ISPEC=16 is 0.  Otherwise the default for
-*                      ISPEC=16 is 2.
-*
-*  ================================================================
-*     Based on contributions by
-*        Karen Braman and Ralph Byers, Department of Mathematics,
-*        University of Kansas, USA
-*
-*  ================================================================
-*     References:
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
-*       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
-*       929--947, 2002.
-*
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
-*       of Matrix Analysis, volume 23, pages 948--973, 2002.
-*
-*  ================================================================
+*
+*  =====================================================================
+*
 *     .. Parameters ..
 *
 *     ==== Matrices of order NTINY or smaller must be processed by
diff --git a/SRC/sisnan.f b/SRC/sisnan.f
index 2fef67e7..0fe17609 100644
--- a/SRC/sisnan.f
+++ b/SRC/sisnan.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       LOGICAL FUNCTION SISNAN( SIN )
 * 
@@ -24,30 +24,28 @@
 *       REAL               SIN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SISNAN returns .TRUE. if its argument is NaN, and .FALSE.
 *> otherwise.  To be replaced by the Fortran 2003 intrinsic in the
 *> future.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIN
 *> \verbatim
 *>          SIN is REAL
 *>          Input to test for NaN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_gbamv.f b/SRC/sla_gbamv.f
index 42579b9b..09d5bf10 100644
--- a/SRC/sla_gbamv.f
+++ b/SRC/sla_gbamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X,
 *                             INCX, BETA, Y, INCY )
@@ -29,11 +29,11 @@
 *       REAL               AB( LDAB, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_GBAMV  performs one of the matrix-vector operations
 *>
@@ -51,11 +51,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -169,10 +168,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -201,7 +199,6 @@
 *     ..
 *
 *  =====================================================================
-
 *     .. Parameters ..
       REAL               ONE, ZERO
       PARAMETER          ( ONE = 1.0E+0, ZERO = 0.0E+0 )
diff --git a/SRC/sla_gbrcond.f b/SRC/sla_gbrcond.f
index 13faf6c6..f5e27b28 100644
--- a/SRC/sla_gbrcond.f
+++ b/SRC/sla_gbrcond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_GBRCOND( TRANS, N, KL, KU, AB, LDAB, AFB, LDAFB,
 *                                  IPIV, CMODE, C, INFO, WORK, IWORK )
@@ -31,11 +31,11 @@
 *      $                   C( * )
 *      ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLA_GBRCOND Estimates the Skeel condition number of  op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -46,11 +46,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_gbrfsx_extended.f b/SRC/sla_gbrfsx_extended.f
index 99434e04..20b7d2ca 100644
--- a/SRC/sla_gbrfsx_extended.f
+++ b/SRC/sla_gbrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU,
 *                                       NRHS, AB, LDAB, AFB, LDAFB, IPIV,
@@ -41,11 +41,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_GBRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -391,10 +390,9 @@
 *>       < 0:  if INFO = -i, the ith argument to SGBTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_gbrpvgrw.f b/SRC/sla_gbrpvgrw.f
index 86355aae..4fc7bff6 100644
--- a/SRC/sla_gbrpvgrw.f
+++ b/SRC/sla_gbrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_GBRPVGRW( N, KL, KU, NCOLS, AB, LDAB, AFB,
 *                                   LDAFB )
@@ -28,11 +28,11 @@
 *       REAL               AB( LDAB, * ), AFB( LDAFB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_GBRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -40,11 +40,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          LDAFB is INTEGER
 *>     The leading dimension of the array AFB.  LDAFB >= 2*KL+KU+1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_geamv.f b/SRC/sla_geamv.f
index b8376cad..f3ec2421 100644
--- a/SRC/sla_geamv.f
+++ b/SRC/sla_geamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA,
 *                              Y, INCY )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_GEAMV  performs one of the matrix-vector operations
 *>
@@ -51,11 +51,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -158,10 +157,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_gercond.f b/SRC/sla_gercond.f
index 9a909bb4..665fe590 100644
--- a/SRC/sla_gercond.f
+++ b/SRC/sla_gercond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_GERCOND ( TRANS, N, A, LDA, AF, LDAF, IPIV,
 *                                   CMODE, C, INFO, WORK, IWORK )
@@ -31,11 +31,11 @@
 *      $                   C( * )
 *      ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLA_GERCOND estimates the Skeel condition number of op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -46,11 +46,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -134,10 +133,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.2
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_gerfsx_extended.f b/SRC/sla_gerfsx_extended.f
index 6030a09f..0e9127e0 100644
--- a/SRC/sla_gerfsx_extended.f
+++ b/SRC/sla_gerfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A,
 *                                       LDA, AF, LDAF, IPIV, COLEQU, C, B,
@@ -41,11 +41,11 @@
 *      $                   ERRS_C( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_GERFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERRS_C for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERRS_N and ERRS_C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -377,10 +376,9 @@
 *>       < 0:  if INFO = -i, the ith argument to SGETRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_gerpvgrw.f b/SRC/sla_gerpvgrw.f
index 138cc371..775a4b51 100644
--- a/SRC/sla_gerpvgrw.f
+++ b/SRC/sla_gerpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_GERPVGRW( N, NCOLS, A, LDA, AF, LDAF )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), AF( LDAF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_GERPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -39,11 +39,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -82,10 +81,9 @@
 *>          LDAF is INTEGER
 *>     The leading dimension of the array AF.  LDAF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_lin_berr.f b/SRC/sla_lin_berr.f
index bae4bda8..01c731ce 100644
--- a/SRC/sla_lin_berr.f
+++ b/SRC/sla_lin_berr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR )
 * 
@@ -28,22 +28,21 @@
 *       REAL               RES( N, NRHS )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLA_LIN_BERR computes componentwise relative backward error from
 *>    the formula
 *>        max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) )
 *>    where abs(Z) is the componentwise absolute value of the matrix
 *>    or vector Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -86,10 +85,9 @@
 *>          BERR is REAL array, dimension (NRHS)
 *>     The componentwise relative backward error from the formula above.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_porcond.f b/SRC/sla_porcond.f
index 93124c2e..d3215976 100644
--- a/SRC/sla_porcond.f
+++ b/SRC/sla_porcond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_PORCOND( UPLO, N, A, LDA, AF, LDAF, CMODE, C,
 *                                  INFO, WORK, IWORK )
@@ -31,11 +31,11 @@
 *       INTEGER            IWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLA_PORCOND Estimates the Skeel condition number of  op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -46,11 +46,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_porfsx_extended.f b/SRC/sla_porfsx_extended.f
index a7d7d429..b3b26f07 100644
--- a/SRC/sla_porfsx_extended.f
+++ b/SRC/sla_porfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, COLEQU, C, B, LDB, Y,
@@ -41,11 +41,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_PORFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -366,10 +365,9 @@
 *>       < 0:  if INFO = -i, the ith argument to SPOTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_porpvgrw.f b/SRC/sla_porpvgrw.f
index 94864795..e4a1b3ff 100644
--- a/SRC/sla_porpvgrw.f
+++ b/SRC/sla_porpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, LDAF, WORK )
 * 
@@ -28,11 +28,12 @@
 *       REAL               A( LDA, * ), AF( LDAF, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> SLA_PORPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -40,11 +41,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -88,10 +88,9 @@
 *> \verbatim
 *>          WORK is REAL array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_syamv.f b/SRC/sla_syamv.f
index 02e91503..e9eb7e0e 100644
--- a/SRC/sla_syamv.f
+++ b/SRC/sla_syamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y,
 *                             INCY )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLA_SYAMV  performs the matrix-vector operation
 *>
@@ -50,11 +50,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -145,10 +144,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -159,10 +157,9 @@
 *
 *> \ingroup realSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Level 2 Blas routine.
@@ -174,7 +171,6 @@
 *>     Richard Hanson, Sandia National Labs.
 *>  -- Modified for the absolute-value product, April 2006
 *>     Jason Riedy, UC Berkeley
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sla_syrcond.f b/SRC/sla_syrcond.f
index e0ee682c..9c40a569 100644
--- a/SRC/sla_syrcond.f
+++ b/SRC/sla_syrcond.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_SYRCOND( UPLO, N, A, LDA, AF, LDAF, IPIV, CMODE,
 *                                  C, INFO, WORK, IWORK )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), AF( LDAF, * ), WORK( * ), C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLA_SYRCOND estimates the Skeel condition number of  op(A) * op2(C)
 *>    where op2 is determined by CMODE as follows
@@ -45,11 +45,10 @@
 *>    is computed by computing scaling factors R such that
 *>    diag(R)*A*op2(C) is row equilibrated and computing the standard
 *>    infinity-norm condition number.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -130,10 +129,9 @@
 *>          IWORK is INTEGER array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_syrfsx_extended.f b/SRC/sla_syrfsx_extended.f
index 3894d317..9530cc11 100644
--- a/SRC/sla_syrfsx_extended.f
+++ b/SRC/sla_syrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, IPIV, COLEQU, C, B, LDB,
@@ -42,11 +42,12 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> SLA_SYRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -57,11 +58,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -374,10 +374,9 @@
 *>       < 0:  if INFO = -i, the ith argument to SSYTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_syrpvgrw.f b/SRC/sla_syrpvgrw.f
index f9674703..b7667762 100644
--- a/SRC/sla_syrpvgrw.f
+++ b/SRC/sla_syrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF, LDAF, IPIV,
 *                                   WORK )
@@ -30,11 +30,12 @@
 *       REAL               A( LDA, * ), AF( LDAF, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> SLA_SYRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -42,11 +43,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +105,9 @@
 *> \verbatim
 *>          WORK is REAL array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sla_wwaddw.f b/SRC/sla_wwaddw.f
index 1b74b546..846213a9 100644
--- a/SRC/sla_wwaddw.f
+++ b/SRC/sla_wwaddw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLA_WWADDW( N, X, Y, W )
 * 
@@ -27,23 +27,20 @@
 *       REAL               X( * ), Y( * ), W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLA_WWADDW adds a vector W into a doubled-single vector (X, Y).
 *>
 *>    This works for all extant IBM's hex and binary floating point
 *>    arithmetics, but not for decimal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -68,10 +65,9 @@
 *>          W is REAL array, dimension (N)
 *>            The vector to be added.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slabad.f b/SRC/slabad.f
index c5395f64..24ee6041 100644
--- a/SRC/slabad.f
+++ b/SRC/slabad.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLABAD( SMALL, LARGE )
 * 
@@ -24,11 +24,11 @@
 *       REAL               LARGE, SMALL
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLABAD takes as input the values computed by SLAMCH for underflow and
 *> overflow, and returns the square root of each of these values if the
@@ -38,11 +38,10 @@
 *> the values computed by SLAMCH.  This subroutine is needed because
 *> SLAMCH does not compensate for poor arithmetic in the upper half of
 *> the exponent range, as is found on a Cray.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] SMALL
 *> \verbatim
@@ -59,10 +58,9 @@
 *>          On exit, if LOG10(LARGE) is sufficiently large, the square
 *>          root of LARGE, otherwise unchanged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slabrd.f b/SRC/slabrd.f
index 414212a5..af874632 100644
--- a/SRC/slabrd.f
+++ b/SRC/slabrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y,
 *                          LDY )
@@ -29,11 +29,11 @@
 *      $                   TAUQ( * ), X( LDX, * ), Y( LDY, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLABRD reduces the first NB rows and columns of a real general
 *> m by n matrix A to upper or lower bidiagonal form by an orthogonal
@@ -44,11 +44,10 @@
 *> bidiagonal form.
 *>
 *> This is an auxiliary routine called by SGEBRD
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -148,10 +147,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -162,10 +160,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -207,7 +204,6 @@
 *>  where a denotes an element of the original matrix which is unchanged,
 *>  vi denotes an element of the vector defining H(i), and ui an element
 *>  of the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slacn2.f b/SRC/slacn2.f
index d2e1b1bf..63b021d9 100644
--- a/SRC/slacn2.f
+++ b/SRC/slacn2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLACN2( N, V, X, ISGN, EST, KASE, ISAVE )
 * 
@@ -29,19 +29,18 @@
 *       REAL               V( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLACN2 estimates the 1-norm of a square, real matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          ISAVE is INTEGER array, dimension (3)
 *>         ISAVE is used to save variables between calls to SLACN2
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,19 +105,13 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
-*>  Contributed by Nick Higham, University of Manchester.
 *>  Originally named SONEST, dated March 16, 1988.
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
-*>  a real or complex matrix, with applications to condition estimation",
-*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
-*>
 *>  This is a thread safe version of SLACON, which uses the array ISAVE
 *>  in place of a SAVE statement, as follows:
 *>
@@ -127,8 +119,19 @@
 *>      JUMP     ISAVE(1)
 *>      J        ISAVE(2)
 *>      ITER     ISAVE(3)
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Nick Higham, University of Manchester
+*
+*> \par References:
+*  ================
+*>
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  a real or complex matrix, with applications to condition estimation",
+*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
 *  =====================================================================
       SUBROUTINE SLACN2( N, V, X, ISGN, EST, KASE, ISAVE )
diff --git a/SRC/slacon.f b/SRC/slacon.f
index 2a922c9a..f21de871 100644
--- a/SRC/slacon.f
+++ b/SRC/slacon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLACON( N, V, X, ISGN, EST, KASE )
 * 
@@ -29,19 +29,18 @@
 *       REAL               V( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLACON estimates the 1-norm of a square, real matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>         whether X should be overwritten by A * X  or A**T * X.
 *>         On the final return from SLACON, KASE will again be 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,21 +99,19 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Contributed by Nick Higham, University of Manchester.
+*>  Nick Higham, University of Manchester. \n
 *>  Originally named SONEST, dated March 16, 1988.
+*
+*> \par References:
+*  ================
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
 *>  a real or complex matrix, with applications to condition estimation",
 *>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLACON( N, V, X, ISGN, EST, KASE )
 *
diff --git a/SRC/slacpy.f b/SRC/slacpy.f
index 1ad584a1..13128629 100644
--- a/SRC/slacpy.f
+++ b/SRC/slacpy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLACPY( UPLO, M, N, A, LDA, B, LDB )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLACPY copies all or part of a two-dimensional matrix A to another
 *> matrix B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sladiv.f b/SRC/sladiv.f
index 4a4e7c8b..cca5ca0d 100644
--- a/SRC/sladiv.f
+++ b/SRC/sladiv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLADIV( A, B, C, D, P, Q )
 * 
@@ -24,11 +24,11 @@
 *       REAL               A, B, C, D, P, Q
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLADIV performs complex division in  real arithmetic
 *>
@@ -38,11 +38,10 @@
 *>
 *> The algorithm is due to Robert L. Smith and can be found
 *> in D. Knuth, The art of Computer Programming, Vol.2, p.195
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          Q is REAL
 *>          The scalars p and q in the above expression.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slae2.f b/SRC/slae2.f
index 25b6fed7..53cb42af 100644
--- a/SRC/slae2.f
+++ b/SRC/slae2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAE2( A, B, C, RT1, RT2 )
 * 
@@ -24,22 +24,21 @@
 *       REAL               A, B, C, RT1, RT2
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAE2  computes the eigenvalues of a 2-by-2 symmetric matrix
 *>    [  A   B  ]
 *>    [  B   C  ].
 *> On return, RT1 is the eigenvalue of larger absolute value, and RT2
 *> is the eigenvalue of smaller absolute value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -70,10 +69,9 @@
 *>          RT2 is REAL
 *>          The eigenvalue of smaller absolute value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -84,10 +82,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  RT1 is accurate to a few ulps barring over/underflow.
@@ -100,7 +97,6 @@
 *>  Overflow is possible only if RT1 is within a factor of 5 of overflow.
 *>  Underflow is harmless if the input data is 0 or exceeds
 *>     underflow_threshold / macheps.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slaebz.f b/SRC/slaebz.f
index ce0075c0..5b915306 100644
--- a/SRC/slaebz.f
+++ b/SRC/slaebz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAEBZ( IJOB, NITMAX, N, MMAX, MINP, NBMIN, ABSTOL,
 *                          RELTOL, PIVMIN, D, E, E2, NVAL, AB, C, MOUT,
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAEBZ contains the iteration loops which compute and use the
 *> function N(w), which is the count of eigenvalues of a symmetric
@@ -75,11 +75,10 @@
 *>
 *> Note: the arguments are, in general, *not* checked for unreasonable
 *> values.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -265,10 +264,9 @@
 *>          = 1--MMAX: The last INFO intervals did not converge.
 *>          = MMAX+1:  More than MMAX intervals were generated.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -279,10 +277,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>      This routine is intended to be called only by other LAPACK
@@ -315,7 +312,6 @@
 *>      >= 0, then the interval will have  N(AB(j,1))=NAB(j,1)=f-k and
 *>      N(AB(j,2))=NAB(j,2)=f+r.  The cases w(l) < w(l+1) and
 *>      w(l-r)=...=w(l+k) are handled similarly.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slaed0.f b/SRC/slaed0.f
index 119f4ebe..7b41711c 100644
--- a/SRC/slaed0.f
+++ b/SRC/slaed0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS,
 *                          WORK, IWORK, INFO )
@@ -30,19 +30,18 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED0 computes all eigenvalues and corresponding eigenvectors of a
 *> symmetric tridiagonal matrix using the divide and conquer method.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -150,10 +149,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -164,18 +162,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLAED0( ICOMPQ, QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS,
      $                   WORK, IWORK, INFO )
diff --git a/SRC/slaed1.f b/SRC/slaed1.f
index e5517861..f17fa9f1 100644
--- a/SRC/slaed1.f
+++ b/SRC/slaed1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK,
 *                          INFO )
@@ -30,11 +30,11 @@
 *       REAL               D( * ), Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED1 computes the updated eigensystem of a diagonal
 *> matrix after modification by a rank-one symmetric matrix.  This
@@ -68,11 +68,10 @@
 *>       directly using the updated eigenvalues.  The eigenvectors for
 *>       the current problem are multiplied with the eigenvectors from
 *>       the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -140,10 +139,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -154,18 +152,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE SLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK,
diff --git a/SRC/slaed2.f b/SRC/slaed2.f
index 41f4102a..fe232ac6 100644
--- a/SRC/slaed2.f
+++ b/SRC/slaed2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W,
 *                          Q2, INDX, INDXC, INDXP, COLTYP, INFO )
@@ -32,11 +32,11 @@
 *      $                   W( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED2 merges the two sets of eigenvalues together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -44,11 +44,10 @@
 *> eigenvalues are close together or if there is a tiny entry in the
 *> Z vector.  For each such occurrence the order of the related secular
 *> equation problem is reduced by one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[out] K
 *> \verbatim
@@ -189,10 +188,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,18 +201,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE SLAED2( K, N, N1, D, Q, LDQ, INDXQ, RHO, Z, DLAMDA, W,
diff --git a/SRC/slaed3.f b/SRC/slaed3.f
index 8d0250c2..d71bd17e 100644
--- a/SRC/slaed3.f
+++ b/SRC/slaed3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX,
 *                          CTOT, W, S, INFO )
@@ -31,11 +31,11 @@
 *      $                   S( * ), W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED3 finds the roots of the secular equation, as defined by the
 *> values in D, W, and RHO, between 1 and K.  It makes the
@@ -50,11 +50,10 @@
 *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] K
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -176,18 +174,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE SLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX,
diff --git a/SRC/slaed4.f b/SRC/slaed4.f
index f365c555..e28c3e25 100644
--- a/SRC/slaed4.f
+++ b/SRC/slaed4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * ), DELTA( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the I-th updated eigenvalue of a symmetric
 *> rank-one modification to a diagonal matrix whose elements are
@@ -49,11 +49,10 @@
 *>
 *> The method consists of approximating the rational functions in the
 *> secular equation by simpler interpolating rational functions.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -106,10 +105,12 @@
 *>          INFO is INTEGER
 *>         = 0:  successful exit
 *>         > 0:  if INFO = 1, the updating process failed.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  Logical variable ORGATI (origin-at-i?) is used for distinguishing
 *>  whether D(i) or D(i+1) is treated as the origin.
 *>
@@ -122,10 +123,9 @@
 *>   MAXIT is the maximum number of iterations allowed for each
 *>   eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,18 +136,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLAED4( N, I, D, Z, DELTA, RHO, DLAM, INFO )
 *
diff --git a/SRC/slaed5.f b/SRC/slaed5.f
index 973bb0e7..db16ddcb 100644
--- a/SRC/slaed5.f
+++ b/SRC/slaed5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED5( I, D, Z, DELTA, RHO, DLAM )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( 2 ), DELTA( 2 ), Z( 2 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the I-th eigenvalue of a symmetric rank-one
 *> modification of a 2-by-2 diagonal matrix
@@ -45,11 +45,10 @@
 *>
 *> We also assume RHO > 0 and that the Euclidean norm of the vector
 *> Z is one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          DLAM is REAL
 *>         The computed lambda_I, the I-th updated eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,18 +99,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLAED5( I, D, Z, DELTA, RHO, DLAM )
 *
diff --git a/SRC/slaed6.f b/SRC/slaed6.f
index 753f78c9..bd514731 100644
--- a/SRC/slaed6.f
+++ b/SRC/slaed6.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               D( 3 ), Z( 3 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED6 computes the positive or negative root (closest to the origin)
 *> of
@@ -49,11 +49,10 @@
 *> This routine will be called by SLAED4 when necessary. In most cases,
 *> the root sought is the smallest in magnitude, though it might not be
 *> in some extremely rare situations.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] KNITER
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               = 0: successful exit
 *>               > 0: if INFO = 1, failure to converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,23 +119,23 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  30/06/99: Based on contributions by
-*>     Ren-Cang Li, Computer Science Division, University of California
-*>     at Berkeley, USA
+*> \verbatim
 *>
-*>  10/02/03: This version has a few statements commented out for thread safety
-*>     (machine parameters are computed on each entry). SJH.
+*>  10/02/03: This version has a few statements commented out for thread
+*>  safety (machine parameters are computed on each entry). SJH.
 *>
 *>  05/10/06: Modified from a new version of Ren-Cang Li, use
 *>     Gragg-Thornton-Warner cubic convergent scheme for better stability.
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Ren-Cang Li, Computer Science Division, University of California
+*>     at Berkeley, USA
 *>
 *  =====================================================================
       SUBROUTINE SLAED6( KNITER, ORGATI, RHO, D, Z, FINIT, TAU, INFO )
diff --git a/SRC/slaed7.f b/SRC/slaed7.f
index b3293ffb..2ba207df 100644
--- a/SRC/slaed7.f
+++ b/SRC/slaed7.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q,
 *                          LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR,
@@ -35,11 +35,11 @@
 *      $                   QSTORE( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED7 computes the updated eigensystem of a diagonal
 *> matrix after modification by a rank-one symmetric matrix. This
@@ -73,11 +73,10 @@
 *>       directly using the updated eigenvalues.  The eigenvectors for
 *>       the current problem are multiplied with the eigenvectors from
 *>       the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -236,10 +235,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -250,18 +248,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLAED7( ICOMPQ, N, QSIZ, TLVLS, CURLVL, CURPBM, D, Q,
      $                   LDQ, INDXQ, RHO, CUTPNT, QSTORE, QPTR, PRMPTR,
diff --git a/SRC/slaed8.f b/SRC/slaed8.f
index 3ca47e95..9b89f48c 100644
--- a/SRC/slaed8.f
+++ b/SRC/slaed8.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO,
 *                          CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR,
@@ -34,11 +34,11 @@
 *      $                   Q( LDQ, * ), Q2( LDQ2, * ), W( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED8 merges the two sets of eigenvalues together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -46,11 +46,10 @@
 *> eigenvalues are close together or if there is a tiny element in the
 *> Z vector.  For each such occurrence the order of the related secular
 *> equation problem is reduced by one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -220,10 +219,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -234,18 +232,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLAED8( ICOMPQ, K, N, QSIZ, D, Q, LDQ, INDXQ, RHO,
      $                   CUTPNT, Z, DLAMDA, Q2, LDQ2, W, PERM, GIVPTR,
diff --git a/SRC/slaed9.f b/SRC/slaed9.f
index 7b09e45a..afad67d1 100644
--- a/SRC/slaed9.f
+++ b/SRC/slaed9.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W,
 *                          S, LDS, INFO )
@@ -30,21 +30,20 @@
 *      $                   W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAED9 finds the roots of the secular equation, as defined by the
 *> values in D, Z, and RHO, between KSTART and KSTOP.  It makes the
 *> appropriate calls to SLAED4 and then stores the new matrix of
 *> eigenvectors for use in calculating the next level of Z vectors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] K
 *> \verbatim
@@ -134,10 +133,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -148,18 +146,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLAED9( K, KSTART, KSTOP, N, D, Q, LDQ, RHO, DLAMDA, W,
      $                   S, LDS, INFO )
diff --git a/SRC/slaeda.f b/SRC/slaeda.f
index b94985b9..10e31006 100644
--- a/SRC/slaeda.f
+++ b/SRC/slaeda.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR,
 *                          GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO )
@@ -30,20 +30,19 @@
 *       REAL               GIVNUM( 2, * ), Q( * ), Z( * ), ZTEMP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAEDA computes the Z vector corresponding to the merge step in the
 *> CURLVLth step of the merge process with TLVLS steps for the CURPBMth
 *> problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -144,10 +143,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -158,18 +156,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLAEDA( N, TLVLS, CURLVL, CURPBM, PRMPTR, PERM, GIVPTR,
      $                   GIVCOL, GIVNUM, Q, QPTR, Z, ZTEMP, INFO )
diff --git a/SRC/slaein.f b/SRC/slaein.f
index d067b2eb..e8c8856f 100644
--- a/SRC/slaein.f
+++ b/SRC/slaein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAEIN( RIGHTV, NOINIT, N, H, LDH, WR, WI, VR, VI, B,
 *                          LDB, WORK, EPS3, SMLNUM, BIGNUM, INFO )
@@ -31,20 +31,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAEIN uses inverse iteration to find a right or left eigenvector
 *> corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg
 *> matrix H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RIGHTV
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          = 1:  inverse iteration did not converge; VR is set to the
 *>                last iterate, and so is VI if WI.ne.0.0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaev2.f b/SRC/slaev2.f
index 437553ba..7a364fde 100644
--- a/SRC/slaev2.f
+++ b/SRC/slaev2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAEV2( A, B, C, RT1, RT2, CS1, SN1 )
 * 
@@ -24,11 +24,11 @@
 *       REAL               A, B, C, CS1, RT1, RT2, SN1
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAEV2 computes the eigendecomposition of a 2-by-2 symmetric matrix
 *>    [  A   B  ]
@@ -39,11 +39,10 @@
 *>
 *>    [ CS1  SN1 ] [  A   B  ] [ CS1 -SN1 ]  =  [ RT1  0  ]
 *>    [-SN1  CS1 ] [  B   C  ] [ SN1  CS1 ]     [  0  RT2 ].
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -86,10 +85,9 @@
 *>          SN1 is REAL
 *>          The vector (CS1, SN1) is a unit right eigenvector for RT1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -100,10 +98,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  RT1 is accurate to a few ulps barring over/underflow.
@@ -118,7 +115,6 @@
 *>  Overflow is possible only if RT1 is within a factor of 5 of overflow.
 *>  Underflow is harmless if the input data is 0 or exceeds
 *>     underflow_threshold / macheps.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slaexc.f b/SRC/slaexc.f
index d5087dd0..ca434796 100644
--- a/SRC/slaexc.f
+++ b/SRC/slaexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAEXC( WANTQ, N, T, LDT, Q, LDQ, J1, N1, N2, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       REAL               Q( LDQ, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAEXC swaps adjacent diagonal blocks T11 and T22 of order 1 or 2 in
 *> an upper quasi-triangular matrix T by an orthogonal similarity
@@ -43,11 +43,10 @@
 *> with 1-by-1 and 2-by-2 diagonal blocks; each 2-by-2 diagonal block
 *> has its diagonal elemnts equal and its off-diagonal elements of
 *> opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -122,10 +121,9 @@
 *>               form; the blocks are not swapped and T and Q are
 *>               unchanged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slag2.f b/SRC/slag2.f
index 8b892965..6ea0dc3d 100644
--- a/SRC/slag2.f
+++ b/SRC/slag2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAG2( A, LDA, B, LDB, SAFMIN, SCALE1, SCALE2, WR1,
 *                         WR2, WI )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAG2 computes the eigenvalues of a 2 x 2 generalized eigenvalue
 *> problem  A - w B, with scaling as necessary to avoid over-/underflow.
@@ -44,11 +44,10 @@
 *>
 *> where  s  is a non-negative scaling factor chosen so that  w,  w B,
 *> and  s A  do not overflow and, if possible, do not underflow, either.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -140,10 +139,9 @@
 *>          eigenvalue is complex, then WI is SCALE1 times the imaginary
 *>          part of the eigenvalues.  WI will always be non-negative.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slag2d.f b/SRC/slag2d.f
index 0a578d68..f4917825 100644
--- a/SRC/slag2d.f
+++ b/SRC/slag2d.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAG2D( M, N, SA, LDSA, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAG2D converts a SINGLE PRECISION matrix, SA, to a DOUBLE
 *> PRECISION matrix, A.
@@ -42,11 +42,10 @@
 *> converting from single to double.
 *>
 *> This is an auxiliary routine so there is no argument checking.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slags2.f b/SRC/slags2.f
index c6ca3a96..f9f95c08 100644
--- a/SRC/slags2.f
+++ b/SRC/slags2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV,
 *                          SNV, CSQ, SNQ )
@@ -27,11 +27,11 @@
 *      $                   SNU, SNV
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAGS2 computes 2-by-2 orthogonal matrices U, V and Q, such
 *> that if ( UPPER ) then
@@ -57,11 +57,10 @@
 *>
 *> Z**T denotes the transpose of Z.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPPER
 *> \verbatim
@@ -136,10 +135,9 @@
 *>          SNQ is REAL
 *>          The desired orthogonal matrix Q.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slagtf.f b/SRC/slagtf.f
index e8c7c685..e5ca39c1 100644
--- a/SRC/slagtf.f
+++ b/SRC/slagtf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAGTF( N, A, LAMBDA, B, C, TOL, D, IN, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               A( * ), B( * ), C( * ), D( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAGTF factorizes the matrix (T - lambda*I), where T is an n by n
 *> tridiagonal matrix and lambda is a scalar, as
@@ -51,11 +51,10 @@
 *> The parameter LAMBDA is included in the routine so that SLAGTF may
 *> be used, in conjunction with SLAGTS, to obtain eigenvectors of T by
 *> inverse iteration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -141,10 +140,9 @@
 *>          = 0   : successful exit
 *>          .lt. 0: if INFO = -k, the kth argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slagtm.f b/SRC/slagtm.f
index 863ca550..31f95243 100644
--- a/SRC/slagtm.f
+++ b/SRC/slagtm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA,
 *                          B, LDB )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAGTM performs a matrix-vector product of the form
 *>
@@ -44,11 +44,10 @@
 *> where A is a tridiagonal matrix of order N, B and X are N by NRHS
 *> matrices, and alpha and beta are real scalars, each of which may be
 *> 0., 1., or -1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -129,10 +128,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(N,1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slagts.f b/SRC/slagts.f
index 3afaae72..81d10af6 100644
--- a/SRC/slagts.f
+++ b/SRC/slagts.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAGTS( JOB, N, A, B, C, D, IN, Y, TOL, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               A( * ), B( * ), C( * ), D( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAGTS may be used to solve one of the systems of equations
 *>
@@ -48,11 +48,10 @@
 *> controlled by the argument JOB, and in each case there is an option
 *> to perturb zero or very small diagonal elements of U, this option
 *> being intended for use in applications such as inverse iteration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -146,10 +145,9 @@
 *>                  the elements of the right-hand side vector y are very
 *>                  large.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slagv2.f b/SRC/slagv2.f
index 8d7e5b24..7895917f 100644
--- a/SRC/slagv2.f
+++ b/SRC/slagv2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL,
 *                          CSR, SNR )
@@ -30,11 +30,11 @@
 *      $                   B( LDB, * ), BETA( 2 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAGV2 computes the Generalized Schur factorization of a real 2-by-2
 *> matrix pencil (A,B) where B is upper triangular. This routine
@@ -61,11 +61,10 @@
 *>
 *>    where b11 >= b22 > 0.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] A
 *> \verbatim
@@ -136,10 +135,9 @@
 *>          SNR is REAL
 *>          The sine of the right rotation matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -150,17 +148,11 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SLAGV2( A, LDA, B, LDB, ALPHAR, ALPHAI, BETA, CSL, SNL,
      $                   CSR, SNR )
diff --git a/SRC/slahqr.f b/SRC/slahqr.f
index 6cb3a6aa..5a4e9e7f 100644
--- a/SRC/slahqr.f
+++ b/SRC/slahqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
 *                          ILOZ, IHIZ, Z, LDZ, INFO )
@@ -29,23 +29,20 @@
 *       REAL               H( LDH, * ), WI( * ), WR( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLAHQR is an auxiliary routine called by SHSEQR to update the
 *>    eigenvalues and Schur decomposition already computed by SHSEQR, by
 *>    dealing with the Hessenberg submatrix in rows and columns ILO to
 *>    IHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -177,10 +174,9 @@
 *>                  where U is the orthogonal matrix in (*)
 *>                  (regardless of the value of WANTT.)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -191,10 +187,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>     02-96 Based on modifications by
@@ -206,7 +201,6 @@
 *>     It is (1) more robust against overflow and underflow and
 *>     (2) adopts the more conservative Ahues & Tisseur stopping
 *>     criterion (LAWN 122, 1997).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slahr2.f b/SRC/slahr2.f
index 1619f0fe..816afa10 100644
--- a/SRC/slahr2.f
+++ b/SRC/slahr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAHR2 reduces the first NB columns of A real general n-BY-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -41,11 +41,10 @@
 *> Q as a block reflector I - V*T*V**T, and also the matrix Y = A * V * T.
 *>
 *> This is an auxiliary routine called by SGEHRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -129,10 +127,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -172,16 +169,15 @@
 *>  Gejin. Note that the entries of A(1:K,2:NB) differ from those
 *>  returned by the original LAPACK-3.0's DLAHRD routine. (This
 *>  subroutine is not backward compatible with LAPACK-3.0's DLAHRD.)
-*>
-*>  References
-*>  ==========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  Gregorio Quintana-Orti and Robert van de Geijn, "Improving the
 *>  performance of reduction to Hessenberg form," ACM Transactions on
 *>  Mathematical Software, 32(2):180-194, June 2006.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 *
diff --git a/SRC/slahrd.f b/SRC/slahrd.f
index 70feef8a..249dc0d3 100644
--- a/SRC/slahrd.f
+++ b/SRC/slahrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAHRD reduces the first NB columns of a real general n-by-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -43,11 +43,10 @@
 *> This is an OBSOLETE auxiliary routine. 
 *> This routine will be 'deprecated' in a  future release.
 *> Please use the new routine SLAHR2 instead.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -130,10 +128,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -167,7 +164,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slaic1.f b/SRC/slaic1.f
index 42324685..88807c8c 100644
--- a/SRC/slaic1.f
+++ b/SRC/slaic1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C )
 * 
@@ -28,11 +28,11 @@
 *       REAL               W( J ), X( J )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAIC1 applies one step of incremental condition estimation in
 *> its simplest version:
@@ -59,11 +59,10 @@
 *>                                           [ gamma ]
 *>
 *> where  alpha =  x**T*w.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -119,10 +118,9 @@
 *>          C is REAL
 *>          Cosine needed in forming xhat.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaisnan.f b/SRC/slaisnan.f
index 1c286ff0..9b99037e 100644
--- a/SRC/slaisnan.f
+++ b/SRC/slaisnan.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       LOGICAL FUNCTION SLAISNAN( SIN1, SIN2 )
 * 
@@ -24,11 +24,11 @@
 *       REAL               SIN1, SIN2
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is not for general use.  It exists solely to avoid
 *> over-optimization in SISNAN.
@@ -43,11 +43,10 @@
 *> Interprocedural or whole-program optimization may delete this
 *> test.  The ISNAN functions will be replaced by the correct
 *> Fortran 03 intrinsic once the intrinsic is widely available.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIN1
 *> \verbatim
@@ -59,10 +58,9 @@
 *>          SIN2 is REAL
 *>          Two numbers to compare for inequality.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaln2.f b/SRC/slaln2.f
index f9beca14..dde291d1 100644
--- a/SRC/slaln2.f
+++ b/SRC/slaln2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLALN2( LTRANS, NA, NW, SMIN, CA, A, LDA, D1, D2, B,
 *                          LDB, WR, WI, X, LDX, SCALE, XNORM, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLALN2 solves a system of the form  (ca A - w D ) X = s B
 *> or (ca A**T - w D) X = s B   with possible scaling ("s") and
@@ -66,11 +66,10 @@
 *>
 *> Note: all input quantities are assumed to be smaller than overflow
 *> by a reasonable factor.  (See BIGNUM.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] LTRANS
 *> \verbatim
@@ -202,10 +201,9 @@
 *>          NOTE: In the interests of speed, this routine does not
 *>                check the inputs for errors.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slals0.f b/SRC/slals0.f
index b0911444..f2f59a5b 100644
--- a/SRC/slals0.f
+++ b/SRC/slals0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
 *                          PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
@@ -34,11 +34,11 @@
 *      $                   POLES( LDGNUM, * ), WORK( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLALS0 applies back the multiplying factors of either the left or the
 *> right singular vector matrix of a diagonal matrix appended by a row
@@ -69,11 +69,10 @@
 *> (3R) The inverse transformation of (2L).
 *>
 *> (4R) The inverse transformation of (1L).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -244,10 +243,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -258,19 +256,13 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE SLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
      $                   PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
diff --git a/SRC/slalsa.f b/SRC/slalsa.f
index 8f6d2adc..9cea9eac 100644
--- a/SRC/slalsa.f
+++ b/SRC/slalsa.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
 *                          LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
@@ -37,11 +37,11 @@
 *      $                   Z( LDU, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLALSA is an itermediate step in solving the least squares problem
 *> by computing the SVD of the coefficient matrix in compact form (The
@@ -53,11 +53,10 @@
 *> ICOMPQ = 1, SLALSA applies the right singular vector matrix to the
 *> right hand side. The singular vector matrices were generated in
 *> compact form by SLALSA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -244,10 +243,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -258,19 +256,13 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE SLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
      $                   LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
diff --git a/SRC/slalsd.f b/SRC/slalsd.f
index bb542ba7..daf838ea 100644
--- a/SRC/slalsd.f
+++ b/SRC/slalsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
 *                          RANK, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       REAL               B( LDB, * ), D( * ), E( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLALSD uses the singular value decomposition of A to solve the least
 *> squares problem of finding X to minimize the Euclidean norm of each
@@ -53,11 +53,10 @@
 *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -156,10 +155,9 @@
 *>               working on the submatrix lying in rows and columns
 *>               INFO/(N+1) through MOD(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -170,19 +168,13 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE SLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
      $                   RANK, WORK, IWORK, INFO )
diff --git a/SRC/slamrg.f b/SRC/slamrg.f
index 03a70af0..373e3eba 100644
--- a/SRC/slamrg.f
+++ b/SRC/slamrg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAMRG( N1, N2, A, STRD1, STRD2, INDEX )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAMRG will create a permutation list which will merge the elements
 *> of A (which is composed of two independently sorted sets) into a
 *> single set which is sorted in ascending order.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N1
 *> \verbatim
@@ -84,10 +83,9 @@
 *>         if B( I ) = A( INDEX( I ) ) for I=1,N1+N2, then B will be
 *>         sorted in ascending order.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaneg.f b/SRC/slaneg.f
index 8cc6ffe1..e0fb3aac 100644
--- a/SRC/slaneg.f
+++ b/SRC/slaneg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       INTEGER FUNCTION SLANEG( N, D, LLD, SIGMA, PIVMIN, R )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * ), LLD( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANEG computes the Sturm count, the number of negative pivots
 *> encountered while factoring tridiagonal T - sigma I = L D L^T.
@@ -52,11 +52,10 @@
 *>   Modern Symmetric Tridiagonal Eigensolvers," SIAM Journal on
 *>   Scientific Computing, v28, n5, 2006.  DOI 10.1137/050641624
 *>   (Tech report version in LAWN 172 with the same title.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -96,10 +95,9 @@
 *>          The twist index for the twisted factorization that is used
 *>          for the negcount.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -110,18 +108,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>     Jason Riedy, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*>     Osni Marques, LBNL/NERSC, USA \n
+*>     Christof Voemel, University of California, Berkeley, USA \n
+*>     Jason Riedy, University of California, Berkeley, USA \n
 *>
 *  =====================================================================
       INTEGER FUNCTION SLANEG( N, D, LLD, SIGMA, PIVMIN, R )
diff --git a/SRC/slangb.f b/SRC/slangb.f
index ca4403a3..b3075fcb 100644
--- a/SRC/slangb.f
+++ b/SRC/slangb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANGB( NORM, N, KL, KU, AB, LDAB,
 *                        WORK )
@@ -29,20 +29,19 @@
 *       REAL               AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANGB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n band matrix  A,  with kl sub-diagonals and ku super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANGB returns the value
+*> \return SLANGB
+*> \verbatim
 *>
 *>    SLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -109,10 +107,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slange.f b/SRC/slange.f
index bbc71bc3..699921b3 100644
--- a/SRC/slange.f
+++ b/SRC/slange.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANGE( NORM, M, N, A, LDA, WORK )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANGE  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANGE returns the value
+*> \return SLANGE
+*> \verbatim
 *>
 *>    SLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -100,10 +98,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slangt.f b/SRC/slangt.f
index a26cc92e..efc18c68 100644
--- a/SRC/slangt.f
+++ b/SRC/slangt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANGT( NORM, N, DL, D, DU )
 * 
@@ -28,20 +28,19 @@
 *       REAL               D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANGT  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANGT returns the value
+*> \return SLANGT
+*> \verbatim
 *>
 *>    SLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -92,10 +90,9 @@
 *>          DU is REAL array, dimension (N-1)
 *>          The (n-1) super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slanhs.f b/SRC/slanhs.f
index b7ca3d41..32edc576 100644
--- a/SRC/slanhs.f
+++ b/SRC/slanhs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANHS( NORM, N, A, LDA, WORK )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANHS  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> Hessenberg matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANHS returns the value
+*> \return SLANHS
+*> \verbatim
 *>
 *>    SLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -94,10 +92,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slansb.f b/SRC/slansb.f
index 2cd604c5..bcbad98a 100644
--- a/SRC/slansb.f
+++ b/SRC/slansb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANSB( NORM, UPLO, N, K, AB, LDAB,
 *                        WORK )
@@ -29,20 +29,19 @@
 *       REAL               AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANSB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n symmetric band matrix A,  with k super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANSB returns the value
+*> \return SLANSB
+*> \verbatim
 *>
 *>    SLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -114,10 +112,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slansf.f b/SRC/slansf.f
index 061b7f55..bc803a0d 100644
--- a/SRC/slansf.f
+++ b/SRC/slansf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL FUNCTION SLANSF( NORM, TRANSR, UPLO, N, A, WORK )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( 0: * ), WORK( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANSF returns the value of the one norm, or the Frobenius norm, or
 *> the infinity norm, or the element of largest absolute value of a
 *> real symmetric matrix A in RFP format.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANSF returns the value
+*> \return SLANSF
+*> \verbatim
 *>
 *>    SLANSF = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a  matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +106,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -122,10 +119,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -208,12 +204,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       REAL FUNCTION SLANSF( NORM, TRANSR, UPLO, N, A, WORK )
 *
diff --git a/SRC/slansp.f b/SRC/slansp.f
index 6d6c685e..e85dcfef 100644
--- a/SRC/slansp.f
+++ b/SRC/slansp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANSP( NORM, UPLO, N, AP, WORK )
 * 
@@ -28,20 +28,19 @@
 *       REAL               AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANSP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real symmetric matrix A,  supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANSP returns the value
+*> \return SLANSP
+*> \verbatim
 *>
 *>    SLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -100,10 +98,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slanst.f b/SRC/slanst.f
index 40d54119..464f7383 100644
--- a/SRC/slanst.f
+++ b/SRC/slanst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANST( NORM, N, D, E )
 * 
@@ -28,20 +28,19 @@
 *       REAL               D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANST  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real symmetric tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANST returns the value
+*> \return SLANST
+*> \verbatim
 *>
 *>    SLANST = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -86,10 +84,9 @@
 *>          E is REAL array, dimension (N-1)
 *>          The (n-1) sub-diagonal or super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slansy.f b/SRC/slansy.f
index 243acf97..fa8dd0c1 100644
--- a/SRC/slansy.f
+++ b/SRC/slansy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANSY( NORM, UPLO, N, A, LDA, WORK )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANSY  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> real symmetric matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANSY returns the value
+*> \return SLANSY
+*> \verbatim
 *>
 *>    SLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +106,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slantb.f b/SRC/slantb.f
index ae998ae2..bfc8a656 100644
--- a/SRC/slantb.f
+++ b/SRC/slantb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANTB( NORM, UPLO, DIAG, N, K, AB,
 *                        LDAB, WORK )
@@ -29,20 +29,19 @@
 *       REAL               AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANTB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n triangular band matrix A,  with ( k + 1 ) diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANTB returns the value
+*> \return SLANTB
+*> \verbatim
 *>
 *>    SLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -125,10 +123,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slantp.f b/SRC/slantp.f
index d8f48a01..cb724005 100644
--- a/SRC/slantp.f
+++ b/SRC/slantp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANTP( NORM, UPLO, DIAG, N, AP, WORK )
 * 
@@ -28,20 +28,19 @@
 *       REAL               AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANTP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> triangular matrix A, supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANTP returns the value
+*> \return SLANTP
+*> \verbatim
 *>
 *>    SLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -110,10 +108,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slantr.f b/SRC/slantr.f
index 1c32058e..949f22a1 100644
--- a/SRC/slantr.f
+++ b/SRC/slantr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLANTR( NORM, UPLO, DIAG, M, N, A, LDA,
 *                        WORK )
@@ -29,20 +29,19 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANTR  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> trapezoidal or triangular matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> SLANTR returns the value
+*> \return SLANTR
+*> \verbatim
 *>
 *>    SLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -126,10 +124,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slanv2.f b/SRC/slanv2.f
index 064b4e1b..5835b1df 100644
--- a/SRC/slanv2.f
+++ b/SRC/slanv2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLANV2( A, B, C, D, RT1R, RT1I, RT2R, RT2I, CS, SN )
 * 
@@ -24,11 +24,11 @@
 *       REAL               A, B, C, CS, D, RT1I, RT1R, RT2I, RT2R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLANV2 computes the Schur factorization of a real 2-by-2 nonsymmetric
 *> matrix in standard form:
@@ -40,11 +40,10 @@
 *> 1) CC = 0 so that AA and DD are real eigenvalues of the matrix, or
 *> 2) AA = DD and BB*CC < 0, so that AA + or - sqrt(BB*CC) are complex
 *> conjugate eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] A
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          SN is REAL
 *>          Parameters of the rotation matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -115,17 +113,15 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by V. Sima, Research Institute for Informatics, Bucharest,
 *>  Romania, to reduce the risk of cancellation errors,
 *>  when computing real eigenvalues, and to ensure, if possible, that
 *>  abs(RT1R) >= abs(RT2R).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slapll.f b/SRC/slapll.f
index cee936fa..554c2ea2 100644
--- a/SRC/slapll.f
+++ b/SRC/slapll.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAPLL( N, X, INCX, Y, INCY, SSMIN )
 * 
@@ -28,11 +28,11 @@
 *       REAL               X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given two column vectors X and Y, let
 *>
@@ -42,11 +42,10 @@
 *> and then computes the SVD of the 2-by-2 upper triangular matrix R.
 *> The smaller singular value of R is returned in SSMIN, which is used
 *> as the measurement of the linear dependency of the vectors X and Y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          SSMIN is REAL
 *>          The smallest singular value of the N-by-2 matrix A = ( X Y ).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slapmr.f b/SRC/slapmr.f
index bb0a1d12..640d8a09 100644
--- a/SRC/slapmr.f
+++ b/SRC/slapmr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAPMR( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       REAL               X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAPMR rearranges the rows of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(I,*) is moved to X(K(I),*) for I = 1,2,...,M.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slapmt.f b/SRC/slapmt.f
index 482da44b..186aeaa3 100644
--- a/SRC/slapmt.f
+++ b/SRC/slapmt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAPMT( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       REAL               X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAPMT rearranges the columns of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slapy2.f b/SRC/slapy2.f
index b41dd22a..6d31ba94 100644
--- a/SRC/slapy2.f
+++ b/SRC/slapy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLAPY2( X, Y )
 * 
@@ -24,19 +24,18 @@
 *       REAL               X, Y
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAPY2 returns sqrt(x**2+y**2), taking care not to cause unnecessary
 *> overflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -48,10 +47,9 @@
 *>          Y is REAL
 *>          X and Y specify the values x and y.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slapy3.f b/SRC/slapy3.f
index 7ebc773f..9cf9006f 100644
--- a/SRC/slapy3.f
+++ b/SRC/slapy3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       REAL             FUNCTION SLAPY3( X, Y, Z )
 * 
@@ -24,19 +24,18 @@
 *       REAL               X, Y, Z
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAPY3 returns sqrt(x**2+y**2+z**2), taking care not to cause
 *> unnecessary overflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -53,10 +52,9 @@
 *>          Z is REAL
 *>          X, Y and Z specify the values x, y and z.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaqgb.f b/SRC/slaqgb.f
index 886ab225..f544a998 100644
--- a/SRC/slaqgb.f
+++ b/SRC/slaqgb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, EQUED )
@@ -30,20 +30,19 @@
 *       REAL               AB( LDAB, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQGB equilibrates a general M by N band matrix A with KL
 *> subdiagonals and KU superdiagonals using the row and scaling factors
 *> in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -128,10 +127,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -141,10 +142,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaqge.f b/SRC/slaqge.f
index b11e1ded..99f31500 100644
--- a/SRC/slaqge.f
+++ b/SRC/slaqge.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          EQUED )
@@ -30,19 +30,18 @@
 *       REAL               A( LDA, * ), C( * ), R( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQGE equilibrates a general M by N matrix A using the row and
 *> column scaling factors in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -111,10 +110,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -124,10 +125,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaqp2.f b/SRC/slaqp2.f
index 3960ce19..7a830273 100644
--- a/SRC/slaqp2.f
+++ b/SRC/slaqp2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
 *                          WORK )
@@ -30,20 +30,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQP2 computes a QR factorization with column pivoting of
 *> the block A(OFFSET+1:M,1:N).
 *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -114,10 +113,9 @@
 *> \verbatim
 *>          WORK is REAL array, dimension (N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -128,23 +126,25 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
-*>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE SLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
      $                   WORK )
diff --git a/SRC/slaqps.f b/SRC/slaqps.f
index 1e5e53ae..7c115780 100644
--- a/SRC/slaqps.f
+++ b/SRC/slaqps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
 *                          VN2, AUXV, F, LDF )
@@ -30,11 +30,11 @@
 *      $                   VN1( * ), VN2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQPS computes a step of QR factorization with column pivoting
 *> of a real M-by-N matrix A by using Blas-3.  It tries to factorize
@@ -46,11 +46,10 @@
 *> columns is returned in KB.
 *>
 *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          LDF is INTEGER
 *>          The leading dimension of the array F. LDF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -156,23 +154,26 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
 *>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE SLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
      $                   VN2, AUXV, F, LDF )
diff --git a/SRC/slaqr0.f b/SRC/slaqr0.f
index 94c1d3d3..4bf5d3f5 100644
--- a/SRC/slaqr0.f
+++ b/SRC/slaqr0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
 *                          ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLAQR0 computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -45,11 +45,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the orthogonal matrix Q:  A = Q*H*Q**T = (QZ)*T*(QZ)**T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -222,10 +221,9 @@
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -236,28 +234,24 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
      $                   ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )
diff --git a/SRC/slaqr1.f b/SRC/slaqr1.f
index 94403cca..d6375613 100644
--- a/SRC/slaqr1.f
+++ b/SRC/slaqr1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V )
 * 
@@ -28,11 +28,11 @@
 *       REAL               H( LDH, * ), V( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>      Given a 2-by-2 or 3-by-3 matrix H, SLAQR1 sets v to a
 *>      scalar multiple of the first column of the product
@@ -48,11 +48,10 @@
 *>
 *>      This is useful for starting double implicit shift bulges
 *>      in the QR algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -100,10 +99,9 @@
 *>              A scalar multiple of the first column of the
 *>              matrix K in (*).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,17 +112,11 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE SLAQR1( N, H, LDH, SR1, SI1, SR2, SI2, V )
diff --git a/SRC/slaqr2.f b/SRC/slaqr2.f
index 3c96a201..b8877458 100644
--- a/SRC/slaqr2.f
+++ b/SRC/slaqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLAQR2 is identical to SLAQR3 except that it avoids
 *>    recursion by calling SLAHQR instead of SLAQR4.
@@ -52,11 +52,10 @@
 *>    an orthogonal similarity transformation of H.  It is to be
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -255,10 +254,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -269,17 +267,11 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE SLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/slaqr3.f b/SRC/slaqr3.f
index 4841606f..2a38ad2a 100644
--- a/SRC/slaqr3.f
+++ b/SRC/slaqr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SR, SI, V, LDV, NH, T,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    Aggressive early deflation:
 *>
@@ -49,11 +49,10 @@
 *>    an orthogonal similarity transformation of H.  It is to be
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -252,10 +251,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -266,17 +264,11 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE SLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/slaqr4.f b/SRC/slaqr4.f
index cd261201..00cf9b67 100644
--- a/SRC/slaqr4.f
+++ b/SRC/slaqr4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
 *                          ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLAQR4 implements one level of recursion for SLAQR0.
 *>    It is a complete implementation of the small bulge multi-shift
@@ -52,11 +52,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the orthogonal matrix Q:  A = Q*H*Q**T = (QZ)*T*(QZ)**T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -231,10 +230,9 @@
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -245,28 +243,24 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI,
      $                   ILOZ, IHIZ, Z, LDZ, WORK, LWORK, INFO )
diff --git a/SRC/slaqr5.f b/SRC/slaqr5.f
index 7935b58c..408cf10e 100644
--- a/SRC/slaqr5.f
+++ b/SRC/slaqr5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS,
 *                          SR, SI, H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U,
@@ -33,19 +33,18 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SLAQR5, called by SLAQR0, performs a
 *>    single small-bulge multi-shift QR sweep.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -228,10 +227,9 @@
 *>             LDWV is the leading dimension of WV as declared in the
 *>             in the calling subroutine.  LDWV.GE.NV.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -242,24 +240,19 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*> \par Contributors:
+*  ==================
 *>
-*>     Reference:
-*>
-*>     K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*>     Algorithm Part I: Maintaining Well Focused Shifts, and
-*>     Level 3 Performance, SIAM Journal of Matrix Analysis,
-*>     volume 23, pages 929--947, 2002.
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*> \endverbatim
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
 *>
 *  =====================================================================
       SUBROUTINE SLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS,
diff --git a/SRC/slaqsb.f b/SRC/slaqsb.f
index 2a5ffb46..45857a07 100644
--- a/SRC/slaqsb.f
+++ b/SRC/slaqsb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED )
 * 
@@ -29,19 +29,18 @@
 *       REAL               AB( LDAB, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQSB equilibrates a symmetric band matrix A using the scaling
 *> factors in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -123,10 +124,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaqsp.f b/SRC/slaqsp.f
index 7facd59d..92568059 100644
--- a/SRC/slaqsp.f
+++ b/SRC/slaqsp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED )
 * 
@@ -29,19 +29,18 @@
 *       REAL               AP( * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQSP equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -96,10 +95,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -108,10 +109,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaqsy.f b/SRC/slaqsy.f
index 19390482..953e1766 100644
--- a/SRC/slaqsy.f
+++ b/SRC/slaqsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED )
 * 
@@ -29,19 +29,18 @@
 *       REAL               A( LDA, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQSY equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -104,10 +103,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -116,10 +117,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaqtr.f b/SRC/slaqtr.f
index 9f7e3673..b3d21d63 100644
--- a/SRC/slaqtr.f
+++ b/SRC/slaqtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAQTR( LTRAN, LREAL, N, T, LDT, B, W, SCALE, X, WORK,
 *                          INFO )
@@ -30,11 +30,11 @@
 *       REAL               B( * ), T( LDT, * ), WORK( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAQTR solves the real quasi-triangular system
 *>
@@ -62,11 +62,10 @@
 *>
 *> This subroutine is designed for the condition number estimation
 *> in routine STRSNA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] LTRAN
 *> \verbatim
@@ -149,10 +148,9 @@
 *>          NOTE: In the interests of speed, this routine does not
 *>                check the inputs for errors.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slar1v.f b/SRC/slar1v.f
index 7242d0e0..721aba76 100644
--- a/SRC/slar1v.f
+++ b/SRC/slar1v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
 *                  PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
@@ -35,11 +35,11 @@
 *       REAL             Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAR1V computes the (scaled) r-th column of the inverse of
 *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix
@@ -56,11 +56,10 @@
 *> (d) Computation of the (scaled) r-th column of the inverse using the
 *>     twisted factorization obtained by combining the top part of the
 *>     the stationary and the bottom part of the progressive transform.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -204,10 +203,9 @@
 *> \verbatim
 *>          WORK is REAL array, dimension (4*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -218,21 +216,15 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
      $           PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
diff --git a/SRC/slar2v.f b/SRC/slar2v.f
index 05197c86..bd2b5431 100644
--- a/SRC/slar2v.f
+++ b/SRC/slar2v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAR2V( N, X, Y, Z, INCX, C, S, INCC )
 * 
@@ -27,11 +27,11 @@
 *       REAL               C( * ), S( * ), X( * ), Y( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAR2V applies a vector of real plane rotations from both sides to
 *> a sequence of 2-by-2 real symmetric matrices, defined by the elements
@@ -39,11 +39,10 @@
 *>
 *>    ( x(i)  z(i) ) := (  c(i)  s(i) ) ( x(i)  z(i) ) ( c(i) -s(i) )
 *>    ( z(i)  y(i) )    ( -s(i)  c(i) ) ( z(i)  y(i) ) ( s(i)  c(i) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slarf.f b/SRC/slarf.f
index 723f0e1f..85383869 100644
--- a/SRC/slarf.f
+++ b/SRC/slarf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       REAL               C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARF applies a real elementary reflector H to a real m by n matrix
 *> C, from either the left or the right. H is represented in the form
@@ -43,11 +43,10 @@
 *> where tau is a real scalar and v is a real vector.
 *>
 *> If tau = 0, then H is taken to be the unit matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slarfb.f b/SRC/slarfb.f
index 783960f9..985e91f1 100644
--- a/SRC/slarfb.f
+++ b/SRC/slarfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV,
 *                          T, LDT, C, LDC, WORK, LDWORK )
@@ -30,19 +30,18 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARFB applies a real block reflector H or its transpose H**T to a
 *> real m by n matrix C, from either the left or the right.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,10 +163,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -192,7 +189,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slarfg.f b/SRC/slarfg.f
index a4adbc41..738b20a3 100644
--- a/SRC/slarfg.f
+++ b/SRC/slarfg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARFG( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       REAL               X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARFG generates a real elementary reflector H of order n, such
 *> that
@@ -53,11 +53,10 @@
 *> the unit matrix.
 *>
 *> Otherwise  1 <= tau <= 2.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          TAU is REAL
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slarfgp.f b/SRC/slarfgp.f
index 61c0ec95..2de7777f 100644
--- a/SRC/slarfgp.f
+++ b/SRC/slarfgp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARFGP( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       REAL               X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARFGP generates a real elementary reflector H of order n, such
 *> that
@@ -51,11 +51,10 @@
 *>
 *> If the elements of x are all zero, then tau = 0 and H is taken to be
 *> the unit matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          TAU is REAL
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slarft.f b/SRC/slarft.f
index ba5c2db5..ded233aa 100644
--- a/SRC/slarft.f
+++ b/SRC/slarft.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       REAL               T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARFT forms the triangular factor T of a real block reflector H
 *> of order n, which is defined as a product of k elementary reflectors.
@@ -50,11 +50,10 @@
 *> H(i) is stored in the i-th row of the array V, and
 *>
 *>    H  =  I - V**T * T * V
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,10 +134,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -163,7 +160,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slarfx.f b/SRC/slarfx.f
index d39d7470..53671a38 100644
--- a/SRC/slarfx.f
+++ b/SRC/slarfx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARFX( SIDE, M, N, V, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       REAL               C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARFX applies a real elementary reflector H to a real m by n
 *> matrix C, from either the left or the right. H is represented in the
@@ -46,11 +46,10 @@
 *> If tau = 0, then H is taken to be the unit matrix
 *>
 *> This version uses inline code if H has order < 11.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -105,10 +104,9 @@
 *>                      or (M) if SIDE = 'R'
 *>          WORK is not referenced if H has order < 11.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slargv.f b/SRC/slargv.f
index 1d8bffb5..acbd8bc7 100644
--- a/SRC/slargv.f
+++ b/SRC/slargv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARGV( N, X, INCX, Y, INCY, C, INCC )
 * 
@@ -27,22 +27,21 @@
 *       REAL               C( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARGV generates a vector of real plane rotations, determined by
 *> elements of the real vectors x and y. For i = 1,2,...,n
 *>
 *>    (  c(i)  s(i) ) ( x(i) ) = ( a(i) )
 *>    ( -s(i)  c(i) ) ( y(i) ) = (   0  )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slarnv.f b/SRC/slarnv.f
index 504c0459..7b7b274b 100644
--- a/SRC/slarnv.f
+++ b/SRC/slarnv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARNV( IDIST, ISEED, N, X )
 * 
@@ -28,19 +28,18 @@
 *       REAL               X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARNV returns a vector of n random real numbers from a uniform or
 *> normal distribution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IDIST
 *> \verbatim
@@ -71,10 +70,9 @@
 *>          X is REAL array, dimension (N)
 *>          The generated random numbers.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -85,17 +83,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine calls the auxiliary routine SLARUV to generate random
 *>  real numbers from a uniform (0,1) distribution, in batches of up to
 *>  128 using vectorisable code. The Box-Muller method is used to
 *>  transform numbers from a uniform to a normal distribution.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slarra.f b/SRC/slarra.f
index 3d391d8a..60b30b74 100644
--- a/SRC/slarra.f
+++ b/SRC/slarra.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRA( N, D, E, E2, SPLTOL, TNRM,
 *                           NSPLIT, ISPLIT, INFO )
@@ -30,19 +30,18 @@
 *       REAL               D( * ), E( * ), E2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Compute the splitting points with threshold SPLTOL.
 *> SLARRA sets any "small" off-diagonal elements to zero.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,21 +123,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLARRA( N, D, E, E2, SPLTOL, TNRM,
      $                    NSPLIT, ISPLIT, INFO )
diff --git a/SRC/slarrb.f b/SRC/slarrb.f
index f12b861c..1ee97552 100644
--- a/SRC/slarrb.f
+++ b/SRC/slarrb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRB( N, D, LLD, IFIRST, ILAST, RTOL1,
 *                          RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK,
@@ -32,11 +32,11 @@
 *      $                   WERR( * ), WGAP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given the relatively robust representation(RRR) L D L^T, SLARRB
 *> does "limited" bisection to refine the eigenvalues of L D L^T,
@@ -46,11 +46,10 @@
 *> and WGAP, respectively. During bisection, intervals
 *> [left, right] are maintained by storing their mid-points and
 *> semi-widths in the arrays W and WERR respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -170,10 +169,9 @@
 *>          INFO is INTEGER
 *>          Error flag.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -184,21 +182,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLARRB( N, D, LLD, IFIRST, ILAST, RTOL1,
      $                   RTOL2, OFFSET, W, WGAP, WERR, WORK, IWORK,
diff --git a/SRC/slarrc.f b/SRC/slarrc.f
index aaf3dbf5..0318bbe4 100644
--- a/SRC/slarrc.f
+++ b/SRC/slarrc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRC( JOBT, N, VL, VU, D, E, PIVMIN,
 *                                   EIGCNT, LCNT, RCNT, INFO )
@@ -30,20 +30,19 @@
 *       REAL               D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Find the number of eigenvalues of the symmetric tridiagonal matrix T
 *> that are in the interval (VL,VU] if JOBT = 'T', and of L D L^T
 *> if JOBT = 'L'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBT
 *> \verbatim
@@ -111,10 +110,9 @@
 *> \verbatim
 *>          INFO is INTEGER
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,21 +123,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLARRC( JOBT, N, VL, VU, D, E, PIVMIN,
      $                            EIGCNT, LCNT, RCNT, INFO )
diff --git a/SRC/slarrd.f b/SRC/slarrd.f
index 43b261e8..e0507051 100644
--- a/SRC/slarrd.f
+++ b/SRC/slarrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRD( RANGE, ORDER, N, VL, VU, IL, IU, GERS,
 *                           RELTOL, D, E, E2, PIVMIN, NSPLIT, ISPLIT,
@@ -35,11 +35,11 @@
 *      $                   GERS( * ), W( * ), WERR( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARRD computes the eigenvalues of a symmetric tridiagonal
 *> matrix T to suitable accuracy. This is an auxiliary code to be
@@ -55,11 +55,10 @@
 *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal
 *> Matrix", Report CS41, Computer Science Dept., Stanford
 *> University, July 21, 1966.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RANGE
 *> \verbatim
@@ -279,30 +278,33 @@
 *>                                        floating-point arithmetic.
 *>                        Cure: Increase the PARAMETER "FUDGE",
 *>                              recompile, and try again.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
-*>  FUDGE   REAL            , default = 2
+*> \verbatim
+*>  FUDGE   REAL, default = 2
 *>          A "fudge factor" to widen the Gershgorin intervals.  Ideally,
 *>          a value of 1 should work, but on machines with sloppy
 *>          arithmetic, this needs to be larger.  The default for
 *>          publicly released versions should be large enough to handle
 *>          the worst machine around.  Note that this has no effect
 *>          on accuracy of the solution.
-*>
-*>  Based on contributions by
-*>     W. Kahan, University of California, Berkeley, USA
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
 *> \endverbatim
 *>
+*> \par Contributors:
+*  ==================
+*>
+*>     W. Kahan, University of California, Berkeley, USA \n
+*>     Beresford Parlett, University of California, Berkeley, USA \n
+*>     Jim Demmel, University of California, Berkeley, USA \n
+*>     Inderjit Dhillon, University of Texas, Austin, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*>     Christof Voemel, University of California, Berkeley, USA \n
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slarre.f b/SRC/slarre.f
index 1c468d5c..bc006d63 100644
--- a/SRC/slarre.f
+++ b/SRC/slarre.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2,
 *                           RTOL1, RTOL2, SPLTOL, NSPLIT, ISPLIT, M,
@@ -35,11 +35,11 @@
 *      $                   W( * ),WERR( * ), WGAP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> To find the desired eigenvalues of a given real symmetric
 *> tridiagonal matrix T, SLARRE sets any "small" off-diagonal
@@ -54,11 +54,10 @@
 *> conpute all and then discard any unwanted one.
 *> As an added benefit, SLARRE also outputs the n
 *> Gerschgorin intervals for the matrices L_i D_i L_i^T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RANGE
 *> \verbatim
@@ -260,10 +259,9 @@
 *>          =-5:  Problem in SLASQ2.
 *>          =-6:  Problem in SLASQ2.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -274,24 +272,24 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The base representations are required to suffer very little
 *>  element growth and consequently define all their eigenvalues to
 *>  high relative accuracy.
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Beresford Parlett, University of California, Berkeley, USA \n
+*>     Jim Demmel, University of California, Berkeley, USA \n
+*>     Inderjit Dhillon, University of Texas, Austin, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*>     Christof Voemel, University of California, Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE SLARRE( RANGE, N, VL, VU, IL, IU, D, E, E2,
diff --git a/SRC/slarrf.f b/SRC/slarrf.f
index 33bd3157..2eb495bd 100644
--- a/SRC/slarrf.f
+++ b/SRC/slarrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRF( N, D, L, LD, CLSTRT, CLEND,
 *                          W, WGAP, WERR,
@@ -32,22 +32,21 @@
 *      $          LPLUS( * ), W( * ), WGAP( * ), WERR( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given the initial representation L D L^T and its cluster of close
 *> eigenvalues (in a relative measure), W( CLSTRT ), W( CLSTRT+1 ), ...
 *> W( CLEND ), SLARRF finds a new relatively robust representation
 *> L D L^T - SIGMA I = L(+) D(+) L(+)^T such that at least one of the
 *> eigenvalues of L(+) D(+) L(+)^T is relatively isolated.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -167,8 +166,8 @@
 *>          Signals processing OK (=0) or failure (=1)
 *> \endverbatim
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,21 +178,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLARRF( N, D, L, LD, CLSTRT, CLEND,
      $                   W, WGAP, WERR,
diff --git a/SRC/slarrj.f b/SRC/slarrj.f
index 9911eef5..3bb17ed0 100644
--- a/SRC/slarrj.f
+++ b/SRC/slarrj.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRJ( N, D, E2, IFIRST, ILAST,
 *                          RTOL, OFFSET, W, WERR, WORK, IWORK,
@@ -32,11 +32,11 @@
 *      $                   WERR( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given the initial eigenvalue approximations of T, SLARRJ
 *> does  bisection to refine the eigenvalues of T,
@@ -45,11 +45,10 @@
 *> of the error in these guesses in WERR. During bisection, intervals
 *> [left, right] are maintained by storing their mid-points and
 *> semi-widths in the arrays W and WERR respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          INFO is INTEGER
 *>          Error flag.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -156,21 +154,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLARRJ( N, D, E2, IFIRST, ILAST,
      $                   RTOL, OFFSET, W, WERR, WORK, IWORK,
diff --git a/SRC/slarrk.f b/SRC/slarrk.f
index aaf5d63c..41571dae 100644
--- a/SRC/slarrk.f
+++ b/SRC/slarrk.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRK( N, IW, GL, GU,
 *                           D, E2, PIVMIN, RELTOL, W, WERR, INFO)
@@ -29,11 +29,11 @@
 *       REAL               D( * ), E2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARRK computes one eigenvalue of a symmetric tridiagonal
 *> matrix T to suitable accuracy. This is an auxiliary code to be
@@ -46,11 +46,10 @@
 *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal
 *> Matrix", Report CS41, Computer Science Dept., Stanford
 *> University, July 21, 1966.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -120,17 +119,18 @@
 *>          INFO is INTEGER
 *>          = 0:       Eigenvalue converged
 *>          = -1:      Eigenvalue did NOT converge
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  FUDGE   REAL            , default = 2
 *>          A "fudge factor" to widen the Gershgorin intervals.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slarrr.f b/SRC/slarrr.f
index 027d3f04..b757db36 100644
--- a/SRC/slarrr.f
+++ b/SRC/slarrr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRR( N, D, E, INFO )
 * 
@@ -28,20 +28,19 @@
 *       ..
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Perform tests to decide whether the symmetric tridiagonal matrix T
 *> warrants expensive computations which guarantee high relative accuracy
 *> in the eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -70,10 +69,9 @@
 *>          INFO = 1          : the matrix warrants computations guaranteeing
 *>                              only absolute accuracy.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -84,21 +82,15 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLARRR( N, D, E, INFO )
 *
diff --git a/SRC/slarrv.f b/SRC/slarrv.f
index b153dd8a..0fe6978d 100644
--- a/SRC/slarrv.f
+++ b/SRC/slarrv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARRV( N, VL, VU, D, L, PIVMIN,
 *                          ISPLIT, M, DOL, DOU, MINRGP,
@@ -36,20 +36,19 @@
 *       REAL              Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARRV computes the eigenvectors of the tridiagonal matrix
 *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.
 *> The input eigenvalues should have been computed by SLARRE.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -255,10 +254,9 @@
 *>          = 5:  The Rayleigh Quotient Iteration failed to converge to
 *>                full accuracy in MAXITR steps.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -269,21 +267,15 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SLARRV( N, VL, VU, D, L, PIVMIN,
      $                   ISPLIT, M, DOL, DOU, MINRGP,
diff --git a/SRC/slarscl2.f b/SRC/slarscl2.f
index 351d1d5b..1d816a12 100644
--- a/SRC/slarscl2.f
+++ b/SRC/slarscl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARSCL2 ( M, N, D, X, LDX )
 * 
@@ -27,11 +27,11 @@
 *       REAL               D( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARSCL2 performs a reciprocal diagonal scaling on an vector:
 *>   x <-- inv(D) * x
@@ -39,11 +39,10 @@
 *>
 *> Eventually to be replaced by BLAS_sge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slartg.f b/SRC/slartg.f
index f024f919..ebe08504 100644
--- a/SRC/slartg.f
+++ b/SRC/slartg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARTG( F, G, CS, SN, R )
 * 
@@ -24,11 +24,11 @@
 *       REAL               CS, F, G, R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARTG generate a plane rotation so that
 *>
@@ -44,11 +44,10 @@
 *>       there are zeros on the diagonal).
 *>
 *> If F exceeds G in magnitude, CS will be positive.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -82,10 +81,9 @@
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slartgp.f b/SRC/slartgp.f
index 03b84b68..e862b38d 100644
--- a/SRC/slartgp.f
+++ b/SRC/slartgp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARTGP( F, G, CS, SN, R )
 * 
@@ -24,11 +24,11 @@
 *       REAL               CS, F, G, R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARTGP generates a plane rotation so that
 *>
@@ -42,11 +42,10 @@
 *>    If F=0 and (G .ne. 0), then CS=0 and SN=(+/-)1.
 *>
 *> The sign is chosen so that R >= 0.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -80,10 +79,9 @@
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slartgs.f b/SRC/slartgs.f
index 5d4bac13..754bd532 100644
--- a/SRC/slartgs.f
+++ b/SRC/slartgs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARTGS( X, Y, SIGMA, CS, SN )
 * 
@@ -24,11 +24,11 @@
 *       REAL                    CS, SIGMA, SN, X, Y
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARTGS generates a plane rotation designed to introduce a bulge in
 *> Golub-Reinsch-style implicit QR iteration for the bidiagonal SVD
@@ -40,11 +40,10 @@
 *>
 *> with R nonnegative.  If X^2 - SIGMA and X * Y are 0, then the
 *> rotation is by PI/2.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          SN is REAL
 *>          The sine of the rotation.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slartv.f b/SRC/slartv.f
index 8df487ac..fb0794ed 100644
--- a/SRC/slartv.f
+++ b/SRC/slartv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARTV( N, X, INCX, Y, INCY, C, S, INCC )
 * 
@@ -27,22 +27,21 @@
 *       REAL               C( * ), S( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARTV applies a vector of real plane rotations to elements of the
 *> real vectors x and y. For i = 1,2,...,n
 *>
 *>    ( x(i) ) := (  c(i)  s(i) ) ( x(i) )
 *>    ( y(i) )    ( -s(i)  c(i) ) ( y(i) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slaruv.f b/SRC/slaruv.f
index bf0910d8..e941dd98 100644
--- a/SRC/slaruv.f
+++ b/SRC/slaruv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARUV( ISEED, N, X )
 * 
@@ -28,21 +28,20 @@
 *       REAL               X( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARUV returns a vector of n random real numbers from a uniform (0,1)
 *> distribution (n <= 128).
 *>
 *> This is an auxiliary routine called by SLARNV and CLARNV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in,out] ISEED
 *> \verbatim
@@ -64,10 +63,9 @@
 *>          X is REAL array, dimension (N)
 *>          The generated random numbers.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -78,10 +76,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine uses a multiplicative congruential method with modulus
@@ -93,7 +90,6 @@
 *>  48-bit integers are stored in 4 integer array elements with 12 bits
 *>  per element. Hence the routine is portable across machines with
 *>  integers of 32 bits or more.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slarz.f b/SRC/slarz.f
index 256fa23c..29b51e7d 100644
--- a/SRC/slarz.f
+++ b/SRC/slarz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       REAL               C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARZ applies a real elementary reflector H to a real M-by-N
 *> matrix C, from either the left or the right. H is represented in the
@@ -47,11 +47,10 @@
 *>
 *>
 *> H is a product of k elementary reflectors as returned by STZRZF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -119,10 +118,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -133,15 +131,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slarzb.f b/SRC/slarzb.f
index e9e37b97..8b28786f 100644
--- a/SRC/slarzb.f
+++ b/SRC/slarzb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V,
 *                          LDV, T, LDT, C, LDC, WORK, LDWORK )
@@ -30,21 +30,20 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARZB applies a real block reflector H or its transpose H**T to
 *> a real distributed M-by-N  C from the left or the right.
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -170,15 +168,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slarzt.f b/SRC/slarzt.f
index 4c9dd2a5..7ec22767 100644
--- a/SRC/slarzt.f
+++ b/SRC/slarzt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       REAL               T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLARZT forms the triangular factor T of a real block reflector
 *> H of order > n, which is defined as a product of k elementary
@@ -53,11 +53,10 @@
 *>    H  =  I - V**T * T * V
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,14 +137,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
 *>  the H(i) is best illustrated by the following example with n = 5 and
@@ -181,7 +180,6 @@
 *>     V = ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slas2.f b/SRC/slas2.f
index 683620c0..a6009b94 100644
--- a/SRC/slas2.f
+++ b/SRC/slas2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAS2( F, G, H, SSMIN, SSMAX )
 * 
@@ -24,22 +24,21 @@
 *       REAL               F, G, H, SSMAX, SSMIN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAS2  computes the singular values of the 2-by-2 matrix
 *>    [  F   G  ]
 *>    [  0   H  ].
 *> On return, SSMIN is the smaller singular value and SSMAX is the
 *> larger singular value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -70,10 +69,9 @@
 *>          SSMAX is REAL
 *>          The larger singular value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -84,10 +82,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Barring over/underflow, all output quantities are correct to within
@@ -105,7 +102,6 @@
 *>  Underflow is harmless if underflow is gradual. Otherwise, results
 *>  may correspond to a matrix modified by perturbations of size near
 *>  the underflow threshold.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slascl.f b/SRC/slascl.f
index 7ad115b5..83194e3d 100644
--- a/SRC/slascl.f
+++ b/SRC/slascl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO )
 * 
@@ -29,22 +29,21 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASCL multiplies the M by N real matrix A by the real scalar
 *> CTO/CFROM.  This is done without over/underflow as long as the final
 *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that
 *> A may be full, upper triangular, lower triangular, upper Hessenberg,
 *> or banded.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TYPE
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          0  - successful exit
 *>          <0 - if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slascl2.f b/SRC/slascl2.f
index 41f87246..412c73db 100644
--- a/SRC/slascl2.f
+++ b/SRC/slascl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASCL2 ( M, N, D, X, LDX )
 * 
@@ -27,11 +27,11 @@
 *       REAL               D( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASCL2 performs a diagonal scaling on a vector:
 *>   x <-- D * x
@@ -39,11 +39,10 @@
 *>
 *> Eventually to be replaced by BLAS_sge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasd0.f b/SRC/slasd0.f
index 54a216ff..227947ae 100644
--- a/SRC/slasd0.f
+++ b/SRC/slasd0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK,
 *                          WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Using a divide and conquer approach, SLASD0 computes the singular
 *> value decomposition (SVD) of a real upper bidiagonal N-by-M
@@ -44,11 +44,10 @@
 *>
 *> A related subroutine, SLASDA, computes only the singular values,
 *> and optionally, the singular vectors in compact form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -128,10 +127,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -142,18 +140,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD0( N, SQRE, D, E, U, LDU, VT, LDVT, SMLSIZ, IWORK,
      $                   WORK, INFO )
diff --git a/SRC/slasd1.f b/SRC/slasd1.f
index 98711d10..e1bb200b 100644
--- a/SRC/slasd1.f
+++ b/SRC/slasd1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT,
 *                          IDXQ, IWORK, WORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               D( * ), U( LDU, * ), VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASD1 computes the SVD of an upper bidiagonal N-by-M matrix B,
 *> where N = NL + NR + 1 and M = N + SQRE. SLASD1 is called from SLASD0.
@@ -74,11 +74,10 @@
 *>    directly using the updated singular values.  The singular vectors
 *>    for the current problem are multiplied with the singular vectors
 *>    from the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NL
 *> \verbatim
@@ -182,10 +181,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -196,18 +194,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD1( NL, NR, SQRE, D, ALPHA, BETA, U, LDU, VT, LDVT,
      $                   IDXQ, IWORK, WORK, INFO )
diff --git a/SRC/slasd2.f b/SRC/slasd2.f
index 0baaaa16..3107f4dc 100644
--- a/SRC/slasd2.f
+++ b/SRC/slasd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT,
 *                          LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX,
@@ -34,11 +34,11 @@
 *      $                   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASD2 merges the two sets of singular values together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -48,11 +48,10 @@
 *> equation problem is reduced by one.
 *>
 *> SLASD2 is called from SLASD1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NL
 *> \verbatim
@@ -246,10 +245,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -260,18 +258,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD2( NL, NR, SQRE, K, D, Z, ALPHA, BETA, U, LDU, VT,
      $                   LDVT, DSIGMA, U2, LDU2, VT2, LDVT2, IDXP, IDX,
diff --git a/SRC/slasd3.f b/SRC/slasd3.f
index ba89d980..2d29e9fa 100644
--- a/SRC/slasd3.f
+++ b/SRC/slasd3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2,
 *                          LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z,
@@ -33,11 +33,11 @@
 *      $                   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASD3 finds all the square roots of the roots of the secular
 *> equation, as defined by the values in D and Z.  It makes the
@@ -52,11 +52,10 @@
 *> without guard digits, but we know of none.
 *>
 *> SLASD3 is called from SLASD1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NL
 *> \verbatim
@@ -202,10 +201,9 @@
 *>         < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>         > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -216,18 +214,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD3( NL, NR, SQRE, K, D, Q, LDQ, DSIGMA, U, LDU, U2,
      $                   LDU2, VT, LDVT, VT2, LDVT2, IDXC, CTOT, Z,
diff --git a/SRC/slasd4.f b/SRC/slasd4.f
index ee96ca14..608a28d3 100644
--- a/SRC/slasd4.f
+++ b/SRC/slasd4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * ), DELTA( * ), WORK( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the square root of the I-th updated
 *> eigenvalue of a positive symmetric rank-one modification to
@@ -50,11 +50,10 @@
 *>
 *> The method consists of approximating the rational functions in the
 *> secular equation by simpler interpolating rational functions.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -114,10 +113,12 @@
 *>          INFO is INTEGER
 *>         = 0:  successful exit
 *>         > 0:  if INFO = 1, the updating process failed.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  Logical variable ORGATI (origin-at-i?) is used for distinguishing
 *>  whether D(i) or D(i+1) is treated as the origin.
 *>
@@ -130,10 +131,9 @@
 *>  MAXIT is the maximum number of iterations allowed for each
 *>  eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -144,18 +144,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD4( N, I, D, Z, DELTA, RHO, SIGMA, WORK, INFO )
 *
diff --git a/SRC/slasd5.f b/SRC/slasd5.f
index b5ebbfb5..bb58536b 100644
--- a/SRC/slasd5.f
+++ b/SRC/slasd5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( 2 ), DELTA( 2 ), WORK( 2 ), Z( 2 )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This subroutine computes the square root of the I-th eigenvalue
 *> of a positive symmetric rank-one modification of a 2-by-2 diagonal
@@ -46,11 +46,10 @@
 *>
 *> We also assume RHO > 0 and that the Euclidean norm of the vector
 *> Z is one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          WORK is REAL array, dimension (2)
 *>         WORK contains (D(j) + sigma_I) in its  j-th component.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -109,18 +107,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ren-Cang Li, Computer Science Division, University of California
 *>     at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD5( I, D, Z, DELTA, RHO, DSIGMA, WORK )
 *
diff --git a/SRC/slasd6.f b/SRC/slasd6.f
index 26561f33..9ddde57b 100644
--- a/SRC/slasd6.f
+++ b/SRC/slasd6.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA,
 *                          IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM,
@@ -36,11 +36,11 @@
 *      $                   VF( * ), VL( * ), WORK( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASD6 computes the SVD of an updated upper bidiagonal matrix B
 *> obtained by merging two smaller ones by appending a row. This
@@ -86,11 +86,10 @@
 *>       values.
 *>
 *> SLASD6 is called from SLASDA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -290,10 +289,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -304,18 +302,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD6( ICOMPQ, NL, NR, SQRE, D, VF, VL, ALPHA, BETA,
      $                   IDXQ, PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM,
diff --git a/SRC/slasd7.f b/SRC/slasd7.f
index 4f5e4615..51534388 100644
--- a/SRC/slasd7.f
+++ b/SRC/slasd7.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL,
 *                          VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ,
@@ -36,11 +36,11 @@
 *      $                   ZW( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASD7 merges the two sets of singular values together into a single
 *> sorted set. Then it tries to deflate the size of the problem. There
@@ -50,11 +50,10 @@
 *> secular equation problem is reduced by one.
 *>
 *> SLASD7 is called from SLASD6.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -256,10 +255,9 @@
 *>         = 0:  successful exit.
 *>         < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -270,18 +268,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD7( ICOMPQ, NL, NR, SQRE, K, D, Z, ZW, VF, VFW, VL,
      $                   VLW, ALPHA, BETA, DSIGMA, IDX, IDXP, IDXQ,
diff --git a/SRC/slasd8.f b/SRC/slasd8.f
index 21dc6e04..56aeac32 100644
--- a/SRC/slasd8.f
+++ b/SRC/slasd8.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR,
 *                          DSIGMA, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASD8 finds the square roots of the roots of the secular equation,
 *> as defined by the values in DSIGMA and Z. It makes the appropriate
@@ -44,11 +44,10 @@
 *> right singular vectors of the original bidiagonal matrix.
 *>
 *> SLASD8 is called from SLASD6.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -144,10 +143,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -158,18 +156,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASD8( ICOMPQ, K, D, Z, VF, VL, DIFL, DIFR, LDDIFR,
      $                   DSIGMA, WORK, INFO )
diff --git a/SRC/slasda.f b/SRC/slasda.f
index c0dc0a52..3b368201 100644
--- a/SRC/slasda.f
+++ b/SRC/slasda.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K,
 *                          DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL,
@@ -34,11 +34,11 @@
 *      $                   Z( LDU, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Using a divide and conquer approach, SLASDA computes the singular
 *> value decomposition (SVD) of a real upper bidiagonal N-by-M matrix
@@ -49,11 +49,10 @@
 *>
 *> A related subroutine, SLASD0, computes the singular values and
 *> the singular vectors in explicit form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -250,10 +249,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, a singular value did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -264,18 +262,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASDA( ICOMPQ, SMLSIZ, N, SQRE, D, E, U, LDU, VT, K,
      $                   DIFL, DIFR, Z, POLES, GIVPTR, GIVCOL, LDGCOL,
diff --git a/SRC/slasdq.f b/SRC/slasdq.f
index 1157a482..79cdac93 100644
--- a/SRC/slasdq.f
+++ b/SRC/slasdq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT,
 *                          U, LDU, C, LDC, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   VT( LDVT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASDQ computes the singular value decomposition (SVD) of a real
 *> (upper or lower) bidiagonal matrix with diagonal D and offdiagonal
@@ -50,11 +50,10 @@
 *> See "Computing  Small Singular Values of Bidiagonal Matrices With
 *> Guaranteed High Relative Accuracy," by J. Demmel and W. Kahan,
 *> LAPACK Working Note #3, for a detailed description of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -189,10 +188,9 @@
 *>        If INFO > 0, the algorithm did not converge, and INFO
 *>        specifies how many superdiagonals did not converge.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,18 +201,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASDQ( UPLO, SQRE, N, NCVT, NRU, NCC, D, E, VT, LDVT,
      $                   U, LDU, C, LDC, WORK, INFO )
diff --git a/SRC/slasdt.f b/SRC/slasdt.f
index cef21ccd..de479050 100644
--- a/SRC/slasdt.f
+++ b/SRC/slasdt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
 * 
@@ -27,19 +27,18 @@
 *       INTEGER            INODE( * ), NDIML( * ), NDIMR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASDT creates a tree of subproblems for bidiagonal divide and
 *> conquer.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -84,10 +83,9 @@
 *>          On entry, the maximum row dimension each subproblem at the
 *>          bottom of the tree can be of.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,18 +96,12 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
 *
diff --git a/SRC/slaset.f b/SRC/slaset.f
index ff5820e9..bdd13203 100644
--- a/SRC/slaset.f
+++ b/SRC/slaset.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASET( UPLO, M, N, ALPHA, BETA, A, LDA )
 * 
@@ -29,19 +29,18 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASET initializes an m-by-n matrix A to BETA on the diagonal and
 *> ALPHA on the offdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasq1.f b/SRC/slasq1.f
index 4a4dd185..104c68a9 100644
--- a/SRC/slasq1.f
+++ b/SRC/slasq1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASQ1( N, D, E, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               D( * ), E( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASQ1 computes the singular values of a real N-by-N bidiagonal
 *> matrix with diagonal D and off-diagonal E. The singular values
@@ -45,11 +45,10 @@
 *>
 *> and the present implementation is described in "An implementation of
 *> the dqds Algorithm (Positive Case)", LAPACK Working Note.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>             = 3, termination criterion of outer while loop not met 
 *>                  (program created more than N unreduced blocks)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasq2.f b/SRC/slasq2.f
index 95264b81..b057ab83 100644
--- a/SRC/slasq2.f
+++ b/SRC/slasq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASQ2( N, Z, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASQ2 computes all the eigenvalues of the symmetric positive 
 *> definite tridiagonal matrix associated with the qd array Z to high
@@ -48,11 +48,10 @@
 *> on machines which follow ieee-754 floating-point standard in their
 *> handling of infinities and NaNs, and false otherwise. This variable
 *> is passed to SLASQ3.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>              = 3, termination criterion of outer while loop not met 
 *>                   (program created more than N unreduced blocks)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,15 +99,14 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  Local Variables: I0:N0 defines a current unreduced segment of Z.
 *>  The shifts are accumulated in SIGMA. Iteration count is in ITER.
 *>  Ping-pong is controlled by PP (alternates between 0 and 1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slasq3.f b/SRC/slasq3.f
index 6f285836..bf8ead32 100644
--- a/SRC/slasq3.f
+++ b/SRC/slasq3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASQ3( I0, N0, Z, PP, DMIN, SIGMA, DESIG, QMAX, NFAIL,
 *                          ITER, NDIV, IEEE, TTYPE, DMIN1, DMIN2, DN, DN1,
@@ -32,20 +32,19 @@
 *       REAL               Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASQ3 checks for deflation, computes a shift (TAU) and calls dqds.
 *> In case of failure it changes shifts, and tries again until output
 *> is positive.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -165,10 +164,9 @@
 *>         These are passed as arguments in order to save their values
 *>         between calls to SLASQ3.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasq4.f b/SRC/slasq4.f
index 3b2d4dd5..d22ea85b 100644
--- a/SRC/slasq4.f
+++ b/SRC/slasq4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASQ4( I0, N0, Z, PP, N0IN, DMIN, DMIN1, DMIN2, DN,
 *                          DN1, DN2, TAU, TTYPE, G )
@@ -29,19 +29,18 @@
 *       REAL               Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASQ4 computes an approximation TAU to the smallest eigenvalue
 *> using values of d from the previous transform.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -127,10 +126,9 @@
 *>        G is passed as an argument in order to save its value between
 *>        calls to SLASQ4.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,13 +139,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
-*>  CNST1 = 9/16
 *>
+*>  CNST1 = 9/16
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slasq5.f b/SRC/slasq5.f
index c7ce25ba..28ad5614 100644
--- a/SRC/slasq5.f
+++ b/SRC/slasq5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASQ5( I0, N0, Z, PP, TAU, DMIN, DMIN1, DMIN2, DN,
 *                          DNM1, DNM2, IEEE )
@@ -30,19 +30,18 @@
 *       REAL               Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASQ5 computes one dqds transform in ping-pong form, one
 *> version for IEEE machines another for non IEEE machines.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          IEEE is LOGICAL
 *>        Flag for IEEE or non IEEE arithmetic.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasq6.f b/SRC/slasq6.f
index 085fe11e..c60e0a5a 100644
--- a/SRC/slasq6.f
+++ b/SRC/slasq6.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASQ6( I0, N0, Z, PP, DMIN, DMIN1, DMIN2, DN,
 *                          DNM1, DNM2 )
@@ -29,19 +29,18 @@
 *       REAL               Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASQ6 computes one dqd (shift equal to zero) transform in
 *> ping-pong form, with protection against underflow and overflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] I0
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          DNM2 is REAL
 *>        d(N0-2).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasr.f b/SRC/slasr.f
index fe06f8ae..d1e47104 100644
--- a/SRC/slasr.f
+++ b/SRC/slasr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), C( * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASR applies a sequence of plane rotations to a real matrix A,
 *> from either the left or the right.
@@ -105,11 +105,10 @@
 *> 
 *> where R(k) appears in rows and columns k and z.  The rotations are
 *> performed without ever forming P(k) explicitly.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -184,10 +183,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasrt.f b/SRC/slasrt.f
index e528b6d0..6ba5d576 100644
--- a/SRC/slasrt.f
+++ b/SRC/slasrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASRT( ID, N, D, INFO )
 * 
@@ -28,22 +28,21 @@
 *       REAL               D( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Sort the numbers in D in increasing order (if ID = 'I') or
 *> in decreasing order (if ID = 'D' ).
 *>
 *> Use Quick Sort, reverting to Insertion sort on arrays of
 *> size <= 20. Dimension of STACK limits N to about 2**32.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ID
 *> \verbatim
@@ -73,10 +72,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slassq.f b/SRC/slassq.f
index db4dbd23..b3f2505f 100644
--- a/SRC/slassq.f
+++ b/SRC/slassq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASSQ( N, X, INCX, SCALE, SUMSQ )
 * 
@@ -28,11 +28,11 @@
 *       REAL               X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASSQ  returns the values  scl  and  smsq  such that
 *>
@@ -47,11 +47,10 @@
 *> scl and smsq are overwritten on SCALE and SUMSQ respectively.
 *>
 *> The routine makes only one pass through the vector x.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          On exit, SUMSQ is overwritten with  smsq , the basic sum of
 *>          squares from which  scl  has been factored out.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasv2.f b/SRC/slasv2.f
index 39cec50e..61bf60af 100644
--- a/SRC/slasv2.f
+++ b/SRC/slasv2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASV2( F, G, H, SSMIN, SSMAX, SNR, CSR, SNL, CSL )
 * 
@@ -24,11 +24,11 @@
 *       REAL               CSL, CSR, F, G, H, SNL, SNR, SSMAX, SSMIN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASV2 computes the singular value decomposition of a 2-by-2
 *> triangular matrix
@@ -40,11 +40,10 @@
 *>
 *>    [ CSL  SNL ] [  F   G  ] [ CSR -SNR ]  =  [ SSMAX   0   ]
 *>    [-SNL  CSL ] [  0   H  ] [ SNR  CSR ]     [  0    SSMIN ].
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          The vector (CSR, SNR) is a unit right singular vector for the
 *>          singular value abs(SSMAX).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,10 +111,9 @@
 *
 *> \ingroup auxOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Any input parameter may be aliased with any output parameter.
@@ -136,7 +133,6 @@
 *>  Underflow is harmless if underflow is gradual. Otherwise, results
 *>  may correspond to a matrix modified by perturbations of size near
 *>  the underflow threshold.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slaswp.f b/SRC/slaswp.f
index 3f1e3c92..03db09c4 100644
--- a/SRC/slaswp.f
+++ b/SRC/slaswp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASWP( N, A, LDA, K1, K2, IPIV, INCX )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASWP performs a series of row interchanges on the matrix A.
 *> One row interchange is initiated for each of rows K1 through K2 of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          The increment between successive values of IPIV.  If IPIV
 *>          is negative, the pivots are applied in reverse order.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,15 +102,13 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by
 *>   R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slasy2.f b/SRC/slasy2.f
index b08446f9..349390cf 100644
--- a/SRC/slasy2.f
+++ b/SRC/slasy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASY2( LTRANL, LTRANR, ISGN, N1, N2, TL, LDTL, TR,
 *                          LDTR, B, LDB, SCALE, X, LDX, XNORM, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASY2 solves for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in
 *>
@@ -43,11 +43,10 @@
 *>
 *> where TL is N1 by N1, TR is N2 by N2, B is N1 by N2, and ISGN = 1 or
 *> -1.  op(T) = T or T**T, where T**T denotes the transpose of T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] LTRANL
 *> \verbatim
@@ -158,10 +157,9 @@
 *>          NOTE: In the interests of speed, this routine does not
 *>                check the inputs for errors.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slasyf.f b/SRC/slasyf.f
index 832f6a24..7d09ff95 100644
--- a/SRC/slasyf.f
+++ b/SRC/slasyf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLASYF computes a partial factorization of a real symmetric matrix A
 *> using the Bunch-Kaufman diagonal pivoting method. The partial
@@ -51,11 +51,10 @@
 *> SLASYF is an auxiliary routine called by SSYTRF. It uses blocked code
 *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or
 *> A22 (if UPLO = 'L').
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -141,10 +140,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slatbs.f b/SRC/slatbs.f
index 09745c2e..c3f2804a 100644
--- a/SRC/slatbs.f
+++ b/SRC/slatbs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X,
 *                          SCALE, CNORM, INFO )
@@ -30,11 +30,11 @@
 *       REAL               AB( LDAB, * ), CNORM( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLATBS solves one of the triangular systems
 *>
@@ -48,11 +48,10 @@
 *> overflow, the Level 2 BLAS routine STBSV is called.  If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -168,10 +166,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, STBSV
@@ -239,7 +236,6 @@
 *>
 *>  and we can safely call STBSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slatdf.f b/SRC/slatdf.f
index a6d6deb3..43277a2e 100644
--- a/SRC/slatdf.f
+++ b/SRC/slatdf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
 *                          JPIV )
@@ -30,11 +30,11 @@
 *       REAL               RHS( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLATDF uses the LU factorization of the n-by-n matrix Z computed by
 *> SGETC2 and computes a contribution to the reciprocal Dif-estimate
@@ -45,11 +45,10 @@
 *> The factorization of Z returned by SGETC2 has the form Z = P*L*U*Q,
 *> where P and Q are permutation matrices. L is lower triangular with
 *> unit diagonal elements and U is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          The pivot indices; for 1 <= j <= N, column j of the
 *>          matrix has been interchanged with column JPIV(j).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,18 +137,23 @@
 *
 *> \ingroup realOTHERauxiliary
 *
+*> \par Further Details:
+*  =====================
+*>
+*>  This routine is a further developed implementation of algorithm
+*>  BSOLVE in [1] using complete pivoting in the LU factorization.
 *
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
-*>  This routine is a further developed implementation of algorithm
-*>  BSOLVE in [1] using complete pivoting in the LU factorization.
 *>
 *>  [1] Bo Kagstrom and Lars Westin,
 *>      Generalized Schur Methods with Condition Estimators for
@@ -162,7 +165,6 @@
 *>      between two Regular Matrix Pairs with Applications in
 *>      Condition Estimation. Report IMINF-95.05, Departement of
 *>      Computing Science, Umea University, S-901 87 Umea, Sweden, 1995.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slatps.f b/SRC/slatps.f
index 9e84b1db..3b0f0ead 100644
--- a/SRC/slatps.f
+++ b/SRC/slatps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE,
 *                          CNORM, INFO )
@@ -30,11 +30,11 @@
 *       REAL               AP( * ), CNORM( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLATPS solves one of the triangular systems
 *>
@@ -48,11 +48,10 @@
 *> unscaled problem will not cause overflow, the Level 2 BLAS routine
 *> STPSV is called. If the matrix A is singular (A(j,j) = 0 for some j),
 *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -141,10 +140,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -155,10 +153,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, STPSV
@@ -226,7 +223,6 @@
 *>
 *>  and we can safely call STPSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slatrd.f b/SRC/slatrd.f
index 561f2c15..fc196e3e 100644
--- a/SRC/slatrd.f
+++ b/SRC/slatrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), E( * ), TAU( * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLATRD reduces NB rows and columns of a real symmetric matrix A to
 *> symmetric tridiagonal form by an orthogonal similarity
@@ -45,11 +45,10 @@
 *> matrix, of which the lower triangle is supplied.
 *>
 *> This is an auxiliary routine called by SSYTRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          LDW is INTEGER
 *>          The leading dimension of the array W. LDW >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -145,10 +143,9 @@
 *
 *> \ingroup doubleOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -196,7 +193,6 @@
 *>  where d denotes a diagonal element of the reduced matrix, a denotes
 *>  an element of the original matrix that is unchanged, and vi denotes
 *>  an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slatrs.f b/SRC/slatrs.f
index 59bf0eca..5b532635 100644
--- a/SRC/slatrs.f
+++ b/SRC/slatrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE,
 *                          CNORM, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), CNORM( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLATRS solves one of the triangular systems
 *>
@@ -48,11 +48,10 @@
 *> overflow, the Level 2 BLAS routine STRSV is called.  If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -150,10 +149,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -164,10 +162,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, STRSV
@@ -235,7 +232,6 @@
 *>
 *>  and we can safely call STRSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slatrz.f b/SRC/slatrz.f
index 4119cb4d..51b73576 100644
--- a/SRC/slatrz.f
+++ b/SRC/slatrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLATRZ( M, N, L, A, LDA, TAU, WORK )
 * 
@@ -27,21 +27,20 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLATRZ factors the M-by-(M+L) real upper trapezoidal matrix
 *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R  0 ) * Z, by means
 *> of orthogonal transformations.  Z is an (M+L)-by-(M+L) orthogonal
 *> matrix and, R and A1 are M-by-M upper triangular matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *> \verbatim
 *>          WORK is REAL array, dimension (M)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,14 +101,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -136,7 +135,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/slatzm.f b/SRC/slatzm.f
index 40d48643..18161756 100644
--- a/SRC/slatzm.f
+++ b/SRC/slatzm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       REAL               C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine SORMRZ.
 *>
@@ -54,11 +54,10 @@
 *>        C = [ C1, C2 ] m
 *>               1  n-1
 *> Then C is overwritten by C*P.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -136,10 +135,9 @@
 *>                      (N) if SIDE = 'L'
 *>                      (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slauu2.f b/SRC/slauu2.f
index 9d2e9192..6dc7e5a5 100644
--- a/SRC/slauu2.f
+++ b/SRC/slauu2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAUU2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAUU2 computes the product U * U**T or L**T * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the unblocked form of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/slauum.f b/SRC/slauum.f
index 126aad08..c8c73531 100644
--- a/SRC/slauum.f
+++ b/SRC/slauum.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SLAUUM( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SLAUUM computes the product U * U**T or L**T * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the blocked form of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sopgtr.f b/SRC/sopgtr.f
index 10a7283a..948e574a 100644
--- a/SRC/sopgtr.f
+++ b/SRC/sopgtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SOPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AP( * ), Q( LDQ, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SOPGTR generates a real orthogonal matrix Q which is defined as the
 *> product of n-1 elementary reflectors H(i) of order n, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sopmtr.f b/SRC/sopmtr.f
index d431a4bf..06164601 100644
--- a/SRC/sopmtr.f
+++ b/SRC/sopmtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SOPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       REAL               AP( * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SOPMTR overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -134,10 +133,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorbdb.f b/SRC/sorbdb.f
index a298ec85..08a4018c 100644
--- a/SRC/sorbdb.f
+++ b/SRC/sorbdb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
 *                          X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
@@ -34,11 +34,11 @@
 *      $                   X21( LDX21, * ), X22( LDX22, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORBDB simultaneously bidiagonalizes the blocks of an M-by-M
 *> partitioned orthogonal matrix X:
@@ -60,11 +60,10 @@
 *>
 *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented
 *> implicitly by angles THETA, PHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -247,10 +246,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -261,10 +259,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The bidiagonal blocks B11, B12, B21, and B22 are represented
@@ -277,15 +274,14 @@
 *>  P1, P2, Q1, and Q2 are represented as products of elementary
 *>  reflectors. See SORCSD for details on generating P1, P2, Q1, and Q2
 *>  using SORGQR and SORGLQ.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SORBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
      $                   X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
diff --git a/SRC/sorcsd.f b/SRC/sorcsd.f
index 154342ca..75dafdd7 100644
--- a/SRC/sorcsd.f
+++ b/SRC/sorcsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE SORCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS,
 *                                    SIGNS, M, P, Q, X11, LDX11, X12,
@@ -38,11 +38,11 @@
 *      $                   * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORCSD computes the CS decomposition of an M-by-M partitioned
 *> orthogonal matrix X:
@@ -59,11 +59,10 @@
 *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are
 *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in
 *> which R = MIN(P,M-P,Q,M-Q).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -274,17 +273,16 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  SBBCSD did not converge. See the description of WORK
 *>                above for details.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
-*> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorg2l.f b/SRC/sorg2l.f
index feef1ad9..e552ca8d 100644
--- a/SRC/sorg2l.f
+++ b/SRC/sorg2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORG2L( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORG2L generates an m by n real matrix Q with orthonormal columns,
 *> which is defined as the last n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by SGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorg2r.f b/SRC/sorg2r.f
index 90b75e32..264472fe 100644
--- a/SRC/sorg2r.f
+++ b/SRC/sorg2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORG2R( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORG2R generates an m by n real matrix Q with orthonormal columns,
 *> which is defined as the first n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by SGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorgbr.f b/SRC/sorgbr.f
index 2dbb47f2..8c66ffc2 100644
--- a/SRC/sorgbr.f
+++ b/SRC/sorgbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGBR generates one of the real orthogonal matrices Q or P**T
 *> determined by SGEBRD when reducing a real matrix A to bidiagonal
@@ -52,11 +52,10 @@
 *> rows of P**T, where n >= m >= k;
 *> if k >= n, P**T = G(n-1) . . . G(2) G(1) and SORGBR returns P**T as
 *> an N-by-N matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorghr.f b/SRC/sorghr.f
index 3bfa6847..a9c65f7c 100644
--- a/SRC/sorghr.f
+++ b/SRC/sorghr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,22 +27,21 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGHR generates a real orthogonal matrix Q which is defined as the
 *> product of IHI-ILO elementary reflectors of order N, as returned by
 *> SGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorgl2.f b/SRC/sorgl2.f
index c7362b13..c8b2de7c 100644
--- a/SRC/sorgl2.f
+++ b/SRC/sorgl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGL2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGL2 generates an m by n real matrix Q with orthonormal rows,
 *> which is defined as the first m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by SGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorglq.f b/SRC/sorglq.f
index 1fa482dc..3b8ef09d 100644
--- a/SRC/sorglq.f
+++ b/SRC/sorglq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGLQ generates an M-by-N real matrix Q with orthonormal rows,
 *> which is defined as the first M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by SGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorgql.f b/SRC/sorgql.f
index fa0130e9..d1448a22 100644
--- a/SRC/sorgql.f
+++ b/SRC/sorgql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGQL generates an M-by-N real matrix Q with orthonormal columns,
 *> which is defined as the last N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by SGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorgqr.f b/SRC/sorgqr.f
index 524fe8a9..79e4ec62 100644
--- a/SRC/sorgqr.f
+++ b/SRC/sorgqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGQR generates an M-by-N real matrix Q with orthonormal columns,
 *> which is defined as the first N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by SGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorgr2.f b/SRC/sorgr2.f
index b7158af6..b770e2a3 100644
--- a/SRC/sorgr2.f
+++ b/SRC/sorgr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGR2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGR2 generates an m by n real matrix Q with orthonormal rows,
 *> which is defined as the last m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by SGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorgrq.f b/SRC/sorgrq.f
index 2784dcfc..86ddcebc 100644
--- a/SRC/sorgrq.f
+++ b/SRC/sorgrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGRQ generates an M-by-N real matrix Q with orthonormal rows,
 *> which is defined as the last M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by SGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorgtr.f b/SRC/sorgtr.f
index f7842156..d7fcd4fd 100644
--- a/SRC/sorgtr.f
+++ b/SRC/sorgtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORGTR generates a real orthogonal matrix Q which is defined as the
 *> product of n-1 elementary reflectors of order N, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorm2l.f b/SRC/sorm2l.f
index acfa581c..d2b16515 100644
--- a/SRC/sorm2l.f
+++ b/SRC/sorm2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORM2L overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by SGEQLF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorm2r.f b/SRC/sorm2r.f
index ea42db17..74114468 100644
--- a/SRC/sorm2r.f
+++ b/SRC/sorm2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORM2R overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by SGEQRF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormbr.f b/SRC/sormbr.f
index 36a80d58..5fc9502c 100644
--- a/SRC/sormbr.f
+++ b/SRC/sormbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> If VECT = 'Q', SORMBR overwrites the general real M-by-N matrix C
 *> with
@@ -63,11 +63,10 @@
 *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix:
 *> if k < nq, P = G(1) G(2) . . . G(k);
 *> if k >= nq, P = G(1) G(2) . . . G(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -180,10 +179,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormhr.f b/SRC/sormhr.f
index ca87aa29..e373a9be 100644
--- a/SRC/sormhr.f
+++ b/SRC/sormhr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMHR overwrites the general real M-by-N matrix C with
 *>
@@ -47,11 +47,10 @@
 *> IHI-ILO elementary reflectors, as returned by SGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -163,10 +162,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sorml2.f b/SRC/sorml2.f
index d8229ce9..a539d508 100644
--- a/SRC/sorml2.f
+++ b/SRC/sorml2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORML2 overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by SGELQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormlq.f b/SRC/sormlq.f
index 10797f47..4b667b67 100644
--- a/SRC/sormlq.f
+++ b/SRC/sormlq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMLQ overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by SGELQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormql.f b/SRC/sormql.f
index 825fbdd0..49ca2eb1 100644
--- a/SRC/sormql.f
+++ b/SRC/sormql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMQL overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by SGEQLF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormqr.f b/SRC/sormqr.f
index 127ed656..4c01a5fe 100644
--- a/SRC/sormqr.f
+++ b/SRC/sormqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMQR overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by SGEQRF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormr2.f b/SRC/sormr2.f
index ff1d8fa3..5d6dcde1 100644
--- a/SRC/sormr2.f
+++ b/SRC/sormr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMR2 overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by SGERQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormr3.f b/SRC/sormr3.f
index 198ccef3..65250df2 100644
--- a/SRC/sormr3.f
+++ b/SRC/sormr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMR3 overwrites the general real m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by STZRZF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,15 +163,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sormrq.f b/SRC/sormrq.f
index 0b1e7ad8..e3ef5903 100644
--- a/SRC/sormrq.f
+++ b/SRC/sormrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMRQ overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *>
 *> as returned by SGERQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sormrz.f b/SRC/sormrz.f
index 2b3d48f7..a67f902e 100644
--- a/SRC/sormrz.f
+++ b/SRC/sormrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMRZ overwrites the general real M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by STZRZF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -176,15 +174,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sormtr.f b/SRC/sormtr.f
index a309f0c9..013121b7 100644
--- a/SRC/sormtr.f
+++ b/SRC/sormtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SORMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SORMTR overwrites the general real M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spbcon.f b/SRC/spbcon.f
index 54d15518..6eff8c27 100644
--- a/SRC/spbcon.f
+++ b/SRC/spbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       REAL               AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric positive definite band matrix using the
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spbequ.f b/SRC/spbequ.f
index ab7533fc..c1e4afa2 100644
--- a/SRC/spbequ.f
+++ b/SRC/spbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               AB( LDAB, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite band matrix A and reduce its condition
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spbrfs.f b/SRC/spbrfs.f
index 5ce6964e..a7bf249a 100644
--- a/SRC/spbrfs.f
+++ b/SRC/spbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite
 *> and banded, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -165,16 +164,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spbstf.f b/SRC/spbstf.f
index 5f7e864d..784f1938 100644
--- a/SRC/spbstf.f
+++ b/SRC/spbstf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBSTF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBSTF computes a split Cholesky factorization of a real
 *> symmetric positive definite band matrix A.
@@ -47,11 +47,10 @@
 *>
 *> where U is upper triangular of order m = (n+kd)/2, and L is lower
 *> triangular of order n-m.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               because the updated element a(i,i) was negative; the
 *>               matrix A is not positive definite.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -150,7 +147,6 @@
 *>  a31  a42  a53  a64  a64   *    *   s13  s24  s53  s64  s75   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spbsv.f b/SRC/spbsv.f
index 37c076ca..23a6155f 100644
--- a/SRC/spbsv.f
+++ b/SRC/spbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -46,11 +46,10 @@
 *> triangular band matrix, with the same number of superdiagonals or
 *> subdiagonals as A.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup realOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -162,7 +159,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spbsvx.f b/SRC/spbsvx.f
index 9c5c9e76..02b2853c 100644
--- a/SRC/spbsvx.f
+++ b/SRC/spbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB,
 *                          EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -34,11 +34,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to
 *> compute the solution to a real system of linear equations
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -86,11 +89,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -291,10 +293,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 
@@ -305,10 +306,9 @@
 *
 *> \ingroup realOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -336,7 +336,6 @@
 *>     a31  a42  a53  a64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spbtf2.f b/SRC/spbtf2.f
index 79c63c73..e03fe292 100644
--- a/SRC/spbtf2.f
+++ b/SRC/spbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBTF2( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBTF2 computes the Cholesky factorization of a real symmetric
 *> positive definite band matrix A.
@@ -44,11 +44,10 @@
 *> L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -140,7 +137,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spbtrf.f b/SRC/spbtrf.f
index 5fbe3add..39a9b155 100644
--- a/SRC/spbtrf.f
+++ b/SRC/spbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBTRF computes the Cholesky factorization of a real symmetric
 *> positive definite band matrix A.
@@ -41,11 +41,10 @@
 *>    A = U**T * U,  if UPLO = 'U', or
 *>    A = L  * L**T,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -135,12 +132,13 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
-*>  Contributed by
-*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
+*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
+*
 *  =====================================================================
       SUBROUTINE SPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 *
diff --git a/SRC/spbtrs.f b/SRC/spbtrs.f
index 8640825b..9c45a20d 100644
--- a/SRC/spbtrs.f
+++ b/SRC/spbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       REAL               AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPBTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite band matrix A using the Cholesky factorization
 *> A = U**T*U or A = L*L**T computed by SPBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spftrf.f b/SRC/spftrf.f
index 9902166a..225f108b 100644
--- a/SRC/spftrf.f
+++ b/SRC/spftrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPFTRF( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,11 +27,11 @@
 *       .. Array Arguments ..
 *       REAL               A( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPFTRF computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A.
@@ -42,11 +42,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -96,10 +95,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -110,10 +108,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -196,7 +193,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spftri.f b/SRC/spftri.f
index 14dff1ac..2744e154 100644
--- a/SRC/spftri.f
+++ b/SRC/spftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPFTRI( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,20 +27,19 @@
 *       REAL               A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPFTRI computes the inverse of a real (symmetric) positive definite
 *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T
 *> computed by SPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -189,7 +186,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spftrs.f b/SRC/spftrs.f
index 5c6b00e8..19c96aaa 100644
--- a/SRC/spftrs.f
+++ b/SRC/spftrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( 0: * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPFTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite matrix A using the Cholesky factorization
 *> A = U**T*U or A = L*L**T computed by SPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -197,7 +194,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spocon.f b/SRC/spocon.f
index de30449f..b5b6fec1 100644
--- a/SRC/spocon.f
+++ b/SRC/spocon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOCON estimates the reciprocal of the condition number (in the 
 *> 1-norm) of a real symmetric positive definite matrix using the
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spoequ.f b/SRC/spoequ.f
index a418f714..02294251 100644
--- a/SRC/spoequ.f
+++ b/SRC/spoequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOEQU( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A and reduce its condition number
@@ -42,11 +42,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spoequb.f b/SRC/spoequb.f
index 8475e7dc..bb57eee8 100644
--- a/SRC/spoequb.f
+++ b/SRC/spoequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A and reduce its condition number
@@ -42,11 +42,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sporfs.f b/SRC/sporfs.f
index 8d837ed1..7bde1186 100644
--- a/SRC/sporfs.f
+++ b/SRC/sporfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPORFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite,
 *> and provides error bounds and backward error estimates for the
 *> solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,16 +158,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sporfsx.f b/SRC/sporfsx.f
index 8cca00e6..df3dac1b 100644
--- a/SRC/sporfsx.f
+++ b/SRC/sporfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B,
 *                           LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SPORFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric positive
@@ -58,11 +56,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -378,10 +375,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sposv.f b/SRC/sposv.f
index 8b6394a0..3fbd56e9 100644
--- a/SRC/sposv.f
+++ b/SRC/sposv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sposvx.f b/SRC/sposvx.f
index f8ec2392..f17d404c 100644
--- a/SRC/sposvx.f
+++ b/SRC/sposvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                          S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK,
@@ -34,11 +34,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to
 *> compute the solution to a real system of linear equations
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -86,11 +89,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -287,10 +289,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 
diff --git a/SRC/sposvxx.f b/SRC/sposvxx.f
index f04e61eb..dfc8eb14 100644
--- a/SRC/sposvxx.f
+++ b/SRC/sposvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                           S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T
 *>    to compute the solution to a real system of linear equations
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what SPOSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -105,11 +106,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -478,10 +478,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spotf2.f b/SRC/spotf2.f
index 9cf510e7..8dae1ff2 100644
--- a/SRC/spotf2.f
+++ b/SRC/spotf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOTF2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOTF2 computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spotrf.f b/SRC/spotrf.f
index 865fcca0..8d5d9d3a 100644
--- a/SRC/spotrf.f
+++ b/SRC/spotrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOTRF( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOTRF computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -92,10 +91,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spotri.f b/SRC/spotri.f
index e5770616..f21e3f55 100644
--- a/SRC/spotri.f
+++ b/SRC/spotri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOTRI( UPLO, N, A, LDA, INFO )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOTRI computes the inverse of a real symmetric positive definite
 *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T
 *> computed by SPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -80,10 +79,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spotrs.f b/SRC/spotrs.f
index d8ab7893..0f7f3abe 100644
--- a/SRC/spotrs.f
+++ b/SRC/spotrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPOTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite matrix A using the Cholesky factorization
 *> A = U**T*U or A = L*L**T computed by SPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sppcon.f b/SRC/sppcon.f
index 657baf1d..e16119c4 100644
--- a/SRC/sppcon.f
+++ b/SRC/sppcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPCON( UPLO, N, AP, ANORM, RCOND, WORK, IWORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       REAL               AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric positive definite packed matrix using
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sppequ.f b/SRC/sppequ.f
index 211c4f3e..162c3395 100644
--- a/SRC/sppequ.f
+++ b/SRC/sppequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               AP( * ), S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPEQU computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A in packed storage and reduce
@@ -43,11 +43,10 @@
 *> This choice of S puts the condition number of B within a factor N of
 *> the smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spprfs.f b/SRC/spprfs.f
index 53fa3b8a..16b0204e 100644
--- a/SRC/spprfs.f
+++ b/SRC/spprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR,
 *                          BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -147,16 +146,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sppsv.f b/SRC/sppsv.f
index 192ff675..6e03b291 100644
--- a/SRC/sppsv.f
+++ b/SRC/sppsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPSV( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -123,10 +121,9 @@
 *
 *> \ingroup realOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -142,7 +139,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sppsvx.f b/SRC/sppsvx.f
index 9841eaae..67b5d6dc 100644
--- a/SRC/sppsvx.f
+++ b/SRC/sppsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB,
 *                          X, LDX, RCOND, FERR, BERR, WORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   FERR( * ), S( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPSVX uses the Cholesky factorization A = U**T*U or A = L*L**T to
 *> compute the solution to a real system of linear equations
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -84,11 +87,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -273,10 +275,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 
@@ -287,10 +288,9 @@
 *
 *> \ingroup realOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -306,7 +306,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spptrf.f b/SRC/spptrf.f
index 70ffdc5d..f59590d5 100644
--- a/SRC/spptrf.f
+++ b/SRC/spptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPTRF( UPLO, N, AP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPTRF computes the Cholesky factorization of a real symmetric
 *> positive definite matrix A stored in packed format.
@@ -41,11 +41,10 @@
 *>    A = U**T * U,  if UPLO = 'U', or
 *>    A = L  * L**T,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -84,10 +83,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -117,7 +114,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spptri.f b/SRC/spptri.f
index 444ca85d..ad9514e6 100644
--- a/SRC/spptri.f
+++ b/SRC/spptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPTRI( UPLO, N, AP, INFO )
 * 
@@ -28,20 +28,19 @@
 *       REAL               AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPTRI computes the inverse of a real symmetric positive definite
 *> matrix A using the Cholesky factorization A = U**T*U or A = L*L**T
 *> computed by SPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -78,10 +77,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spptrs.f b/SRC/spptrs.f
index 3e329ac1..b9f63ebb 100644
--- a/SRC/spptrs.f
+++ b/SRC/spptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       REAL               AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPPTRS solves a system of linear equations A*X = B with a symmetric
 *> positive definite matrix A in packed storage using the Cholesky
 *> factorization A = U**T*U or A = L*L**T computed by SPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spstf2.f b/SRC/spstf2.f
index 3d43eb70..fb853d30 100644
--- a/SRC/spstf2.f
+++ b/SRC/spstf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       INTEGER            PIV( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPSTF2 computes the Cholesky factorization with complete
 *> pivoting of a real symmetric positive semidefinite matrix A.
@@ -47,11 +47,10 @@
 *>
 *> This algorithm does not attempt to check that A is positive
 *> semidefinite. This version of the algorithm calls level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -125,10 +124,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 
diff --git a/SRC/spstrf.f b/SRC/spstrf.f
index 72377370..536bf954 100644
--- a/SRC/spstrf.f
+++ b/SRC/spstrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPSTRF( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       INTEGER            PIV( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPSTRF computes the Cholesky factorization with complete
 *> pivoting of a real symmetric positive semidefinite matrix A.
@@ -47,11 +47,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
@@ -125,10 +124,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 
diff --git a/SRC/sptcon.f b/SRC/sptcon.f
index be3a635f..d7bbea8d 100644
--- a/SRC/sptcon.f
+++ b/SRC/sptcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTCON( N, D, E, ANORM, RCOND, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * ), E( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTCON computes the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric positive definite tridiagonal matrix
@@ -42,11 +42,10 @@
 *> Norm(inv(A)) is computed by a direct method, and the reciprocal of
 *> the condition number is computed as
 *>              RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,16 +105,14 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The method used is described in Nicholas J. Higham, "Efficient
 *>  Algorithms for Computing the Condition Number of a Tridiagonal
 *>  Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/spteqr.f b/SRC/spteqr.f
index c7fb814c..431e7c28 100644
--- a/SRC/spteqr.f
+++ b/SRC/spteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric positive definite tridiagonal matrix by first factoring the
@@ -51,11 +51,10 @@
 *> form, however, may preclude the possibility of obtaining high
 *> relative accuracy in the small eigenvalues of the original matrix, if
 *> these eigenvalues range over many orders of magnitude.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                      if INFO = N+i, i off-diagonal elements of the
 *>                      bidiagonal factor did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sptrfs.f b/SRC/sptrfs.f
index 402c80ed..eeb04306 100644
--- a/SRC/sptrfs.f
+++ b/SRC/sptrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTRFS( N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR,
 *                          BERR, WORK, INFO )
@@ -30,21 +30,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric positive definite
 *> and tridiagonal, and provides error bounds and backward error
 *> estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -139,16 +138,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sptsv.f b/SRC/sptsv.f
index 28d2573b..aa1c5989 100644
--- a/SRC/sptsv.f
+++ b/SRC/sptsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTSV( N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               B( LDB, * ), D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTSV computes the solution to a real system of linear equations
 *> A*X = B, where A is an N-by-N symmetric positive definite tridiagonal
@@ -39,11 +39,10 @@
 *>
 *> A is factored as A = L*D*L**T, and the factored form of A is then
 *> used to solve the system of equations.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -99,10 +98,9 @@
 *>                computed.  The factorization has not been completed
 *>                unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
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 
diff --git a/SRC/spttrf.f b/SRC/spttrf.f
index 2db1746d..359e832b 100644
--- a/SRC/spttrf.f
+++ b/SRC/spttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTTRF( N, D, E, INFO )
 * 
@@ -27,20 +27,19 @@
 *       REAL               D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTTRF computes the L*D*L**T factorization of a real symmetric
 *> positive definite tridiagonal matrix A.  The factorization may also
 *> be regarded as having the form A = U**T*D*U.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -76,10 +75,9 @@
 *>               be completed, while if k = N, the factorization was
 *>               completed, but D(N) <= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/spttrs.f b/SRC/spttrs.f
index 69ab70f4..f756c651 100644
--- a/SRC/spttrs.f
+++ b/SRC/spttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTTRS( N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               B( LDB, * ), D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTTRS solves a tridiagonal system of the form
 *>    A * X = B
@@ -39,11 +39,10 @@
 *> diagonal matrix specified in the vector D, L is a unit bidiagonal
 *> matrix whose subdiagonal is specified in the vector E, and X and B
 *> are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sptts2.f b/SRC/sptts2.f
index 94923449..d1c11c77 100644
--- a/SRC/sptts2.f
+++ b/SRC/sptts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SPTTS2( N, NRHS, D, E, B, LDB )
 * 
@@ -27,11 +27,11 @@
 *       REAL               B( LDB, * ), D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SPTTS2 solves a tridiagonal system of the form
 *>    A * X = B
@@ -39,11 +39,10 @@
 *> diagonal matrix specified in the vector D, L is a unit bidiagonal
 *> matrix whose subdiagonal is specified in the vector E, and X and B
 *> are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/srscl.f b/SRC/srscl.f
index b2f49663..d8ccade6 100644
--- a/SRC/srscl.f
+++ b/SRC/srscl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SRSCL( N, SA, SX, INCX )
 * 
@@ -28,20 +28,19 @@
 *       REAL               SX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SRSCL multiplies an n-element real vector x by the real scalar 1/a.
 *> This is done without overflow or underflow as long as
 *> the final result x/a does not overflow or underflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -69,10 +68,9 @@
 *>          The increment between successive values of the vector SX.
 *>          > 0:  SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i),     1< i<= n
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssbev.f b/SRC/ssbev.f
index 82e0da37..8a093f45 100644
--- a/SRC/ssbev.f
+++ b/SRC/ssbev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                         INFO )
@@ -29,19 +29,18 @@
 *       REAL               AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBEV computes all the eigenvalues and, optionally, eigenvectors of
 *> a real symmetric band matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssbevd.f b/SRC/ssbevd.f
index 64645f72..6c74ee82 100644
--- a/SRC/ssbevd.f
+++ b/SRC/ssbevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                          LWORK, IWORK, LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               AB( LDAB, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBEVD computes all the eigenvalues and, optionally, eigenvectors of
 *> a real symmetric band matrix A. If eigenvectors are desired, it uses
@@ -46,11 +46,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -177,10 +176,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssbevx.f b/SRC/ssbevx.f
index 28cf7a3a..70346b59 100644
--- a/SRC/ssbevx.f
+++ b/SRC/ssbevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL,
 *                          VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK,
@@ -33,21 +33,20 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric band matrix A.  Eigenvalues and eigenvectors can
 *> be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -241,10 +240,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssbgst.f b/SRC/ssbgst.f
index 2bd5dd0d..bd53af76 100644
--- a/SRC/ssbgst.f
+++ b/SRC/ssbgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X,
 *                          LDX, WORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBGST reduces a real symmetric-definite banded generalized
 *> eigenproblem  A*x = lambda*B*x  to standard form  C*y = lambda*y,
@@ -44,11 +44,10 @@
 *> split Cholesky factorization. A is overwritten by C = X**T*A*X, where
 *> X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the
 *> bandwidth of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssbgv.f b/SRC/ssbgv.f
index 2f79900c..e10fc653 100644
--- a/SRC/ssbgv.f
+++ b/SRC/ssbgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z,
 *                         LDZ, WORK, INFO )
@@ -30,21 +30,20 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite banded eigenproblem, of
 *> the form A*x=(lambda)*B*x. Here A and B are assumed to be symmetric
 *> and banded, and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -161,10 +160,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssbgvd.f b/SRC/ssbgvd.f
index 28b96642..8a4c2cfc 100644
--- a/SRC/ssbgvd.f
+++ b/SRC/ssbgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
 *                          Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite banded eigenproblem, of the
@@ -49,11 +49,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -206,10 +205,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -220,17 +218,11 @@
 *
 *> \ingroup realOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SSBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
      $                   Z, LDZ, WORK, LWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/ssbgvx.f b/SRC/ssbgvx.f
index 747b9a6f..c6a71793 100644
--- a/SRC/ssbgvx.f
+++ b/SRC/ssbgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
 *                          LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
@@ -34,11 +34,11 @@
 *      $                   W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a real generalized symmetric-definite banded eigenproblem, of
@@ -46,11 +46,10 @@
 *> and banded, and B is also positive definite.  Eigenvalues and
 *> eigenvectors can be selected by specifying either all eigenvalues,
 *> a range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -263,10 +262,9 @@
 *>                The factorization of B could not be completed and
 *>                no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -277,17 +275,11 @@
 *
 *> \ingroup realOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SSBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
      $                   LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
diff --git a/SRC/ssbtrd.f b/SRC/ssbtrd.f
index 51e0d200..f663401f 100644
--- a/SRC/ssbtrd.f
+++ b/SRC/ssbtrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ,
 *                          WORK, INFO )
@@ -30,20 +30,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSBTRD reduces a real symmetric band matrix A to symmetric
 *> tridiagonal form T by an orthogonal similarity transformation:
 *> Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -139,10 +138,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -153,14 +151,12 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by Linda Kaufman, Bell Labs.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ssfrk.f b/SRC/ssfrk.f
index f2754021..e22c079c 100644
--- a/SRC/ssfrk.f
+++ b/SRC/ssfrk.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA,
 *                         C )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for C in RFP Format.
 *>
@@ -49,11 +49,10 @@
 *> where alpha and beta are real scalars, C is an n--by--n symmetric
 *> matrix and A is an n--by--k matrix in the first case and a k--by--n
 *> matrix in the second case.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -150,10 +149,9 @@
 *>           NT = N*(N+1)/2. On entry, the symmetric matrix C in RFP
 *>           Format. RFP Format is described by TRANSR, UPLO and N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspcon.f b/SRC/sspcon.f
index 38bbd730..031c8095 100644
--- a/SRC/sspcon.f
+++ b/SRC/sspcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       REAL               AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric packed matrix A using the factorization
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspev.f b/SRC/sspev.f
index e87bee32..8a8b86ab 100644
--- a/SRC/sspev.f
+++ b/SRC/sspev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               AP( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPEV computes all the eigenvalues and, optionally, eigenvectors of a
 *> real symmetric matrix A in packed storage.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspevd.f b/SRC/sspevd.f
index 3abbc72a..7b80d9ee 100644
--- a/SRC/sspevd.f
+++ b/SRC/sspevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK,
 *                          IWORK, LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               AP( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPEVD computes all the eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A in packed storage. If eigenvectors are
@@ -46,11 +46,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -162,10 +161,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspevx.f b/SRC/sspevx.f
index bb059b7f..a4d1a5eb 100644
--- a/SRC/sspevx.f
+++ b/SRC/sspevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, IWORK, IFAIL,
@@ -32,21 +32,20 @@
 *       REAL               AP( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A in packed storage.  Eigenvalues/vectors
 *> can be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -210,10 +209,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspgst.f b/SRC/sspgst.f
index d011afc7..4ff7a5ce 100644
--- a/SRC/sspgst.f
+++ b/SRC/sspgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPGST( ITYPE, UPLO, N, AP, BP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AP( * ), BP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPGST reduces a real symmetric-definite generalized eigenproblem
 *> to standard form, using packed storage.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L.
 *>
 *> B must have been previously factorized as U**T*U or L*L**T by SPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspgv.f b/SRC/sspgv.f
index 27be82a4..148f0d30 100644
--- a/SRC/sspgv.f
+++ b/SRC/sspgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                         INFO )
@@ -30,22 +30,21 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPGV computes all the eigenvalues and, optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be symmetric, stored in packed format,
 *> and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -145,10 +144,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspgvd.f b/SRC/sspgvd.f
index a03b3582..8b016830 100644
--- a/SRC/sspgvd.f
+++ b/SRC/sspgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                          LWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -50,11 +50,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -189,10 +188,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,17 +201,11 @@
 *
 *> \ingroup realOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SSPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
      $                   LWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/sspgvx.f b/SRC/sspgvx.f
index 2da83251..4d3640e1 100644
--- a/SRC/sspgvx.f
+++ b/SRC/sspgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
 *                          IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -46,11 +46,10 @@
 *> is also positive definite.  Eigenvalues and eigenvectors can be
 *> selected by specifying either a range of values or a range of indices
 *> for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -241,10 +240,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -255,17 +253,11 @@
 *
 *> \ingroup realOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SSPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
      $                   IL, IU, ABSTOL, M, W, Z, LDZ, WORK, IWORK,
diff --git a/SRC/ssprfs.f b/SRC/ssprfs.f
index 8d27b39b..be0319b9 100644
--- a/SRC/ssprfs.f
+++ b/SRC/ssprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, IWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,16 +154,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sspsv.f b/SRC/sspsv.f
index 72fb0620..187d5b56 100644
--- a/SRC/sspsv.f
+++ b/SRC/sspsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -47,11 +47,10 @@
 *> triangular matrices, D is symmetric and block diagonal with 1-by-1
 *> and 2-by-2 diagonal blocks.  The factored form of A is then used to
 *> solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, so the solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup realOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -160,7 +157,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/sspsvx.f b/SRC/sspsvx.f
index aa821581..79904d8c 100644
--- a/SRC/sspsvx.f
+++ b/SRC/sspsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X,
 *                          LDX, RCOND, FERR, BERR, WORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPSVX uses the diagonal pivoting factorization A = U*D*U**T or
 *> A = L*D*L**T to compute the solution to a real system of linear
@@ -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:
 *>
@@ -71,11 +74,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
@@ -238,10 +240,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 
@@ -252,10 +253,9 @@
 *
 *> \ingroup realOTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -271,7 +271,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ssptrd.f b/SRC/ssptrd.f
index 9cf21c69..5ed85576 100644
--- a/SRC/ssptrd.f
+++ b/SRC/ssptrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPTRD( UPLO, N, AP, D, E, TAU, INFO )
 * 
@@ -28,20 +28,19 @@
 *       REAL               AP( * ), D( * ), E( * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPTRD reduces a real symmetric matrix A stored in packed form to
 *> symmetric tridiagonal form T by an orthogonal similarity
 *> transformation: Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -148,7 +145,6 @@
 *>  where tau is a real scalar, and v is a real vector with
 *>  v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP,
 *>  overwriting A(i+2:n,i), and tau is stored in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ssptrf.f b/SRC/ssptrf.f
index 9f127306..48238ebd 100644
--- a/SRC/ssptrf.f
+++ b/SRC/ssptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPTRF( UPLO, N, AP, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPTRF computes the factorization of a real symmetric matrix A stored
 *> in packed format using the Bunch-Kaufman diagonal pivoting method:
@@ -43,11 +43,10 @@
 *> where U (or L) is a product of permutation and unit upper (lower)
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,10 +111,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  5-96 - Based on modifications by J. Lewis, Boeing Computer Services
@@ -155,7 +152,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ssptri.f b/SRC/ssptri.f
index b17a0730..435df47b 100644
--- a/SRC/ssptri.f
+++ b/SRC/ssptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPTRI( UPLO, N, AP, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       REAL               AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPTRI computes the inverse of a real symmetric indefinite matrix
 *> A in packed storage using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by SSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssptrs.f b/SRC/ssptrs.f
index 803d645c..1286f1e9 100644
--- a/SRC/ssptrs.f
+++ b/SRC/ssptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       REAL               AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSPTRS solves a system of linear equations A*X = B with a real
 *> symmetric matrix A stored in packed format using the factorization
 *> A = U*D*U**T or A = L*D*L**T computed by SSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sstebz.f b/SRC/sstebz.f
index 41c1045f..9aa6a6b1 100644
--- a/SRC/sstebz.f
+++ b/SRC/sstebz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEBZ( RANGE, ORDER, N, VL, VU, IL, IU, ABSTOL, D, E,
 *                          M, NSPLIT, W, IBLOCK, ISPLIT, WORK, IWORK,
@@ -32,11 +32,11 @@
 *       REAL               D( * ), E( * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEBZ computes the eigenvalues of a symmetric tridiagonal
 *> matrix T.  The user may ask for all eigenvalues, all eigenvalues
@@ -50,11 +50,10 @@
 *> See W. Kahan "Accurate Eigenvalues of a Symmetric Tridiagonal
 *> Matrix", Report CS41, Computer Science Dept., Stanford
 *> University, July 21, 1966.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RANGE
 *> \verbatim
@@ -226,10 +225,12 @@
 *>                                        floating-point arithmetic.
 *>                        Cure: Increase the PARAMETER "FUDGE",
 *>                              recompile, and try again.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  RELFAC  REAL, default = 2.0e0
 *>          The relative tolerance.  An interval (a,b] lies within
 *>          "relative tolerance" if  b-a < RELFAC*ulp*max(|a|,|b|),
@@ -244,10 +245,9 @@
 *>          the worst machine around.  Note that this has no effect
 *>          on accuracy of the solution.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sstedc.f b/SRC/sstedc.f
index 5f689f06..8a82613e 100644
--- a/SRC/sstedc.f
+++ b/SRC/sstedc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK,
 *                          LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEDC computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the divide and conquer method.
@@ -48,11 +48,10 @@
 *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.  See SLAED3 for details.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -165,10 +164,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,18 +177,12 @@
 *
 *> \ingroup auxOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee
 *>
 *  =====================================================================
       SUBROUTINE SSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK,
diff --git a/SRC/sstegr.f b/SRC/sstegr.f
index a00ed992..aa8ebabc 100644
--- a/SRC/sstegr.f
+++ b/SRC/sstegr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                  ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
@@ -33,11 +33,11 @@
 *       REAL               Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEGR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -59,11 +59,10 @@
 *> NaNs.  Normal execution may create these exceptiona values and hence
 *> may abort due to a floating point exception in environments which
 *> do not conform to the IEEE-754 standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -232,10 +231,9 @@
 *>                the nonzero error code returned by SLARRE or
 *>                SLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -246,19 +244,13 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, LBNL/NERSC, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Inderjit Dhillon, IBM Almaden, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE SSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $           ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
diff --git a/SRC/sstein.f b/SRC/sstein.f
index d2228479..3b9b92ca 100644
--- a/SRC/sstein.f
+++ b/SRC/sstein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK,
 *                          IWORK, IFAIL, INFO )
@@ -30,11 +30,11 @@
 *       REAL               D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEIN computes the eigenvectors of a real symmetric tridiagonal
 *> matrix T corresponding to specified eigenvalues, using inverse
@@ -42,11 +42,10 @@
 *>
 *> The maximum number of iterations allowed for each eigenvector is
 *> specified by an internal parameter MAXITS (currently set to 5).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -145,10 +144,12 @@
 *>          > 0: if INFO = i, then i eigenvectors failed to converge
 *>               in MAXITS iterations.  Their indices are stored in
 *>               array IFAIL.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  MAXITS  INTEGER, default = 5
 *>          The maximum number of iterations performed.
 *>
@@ -156,10 +157,9 @@
 *>          The number of iterations performed after norm growth
 *>          criterion is satisfied, should be at least 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sstemr.f b/SRC/sstemr.f
index e09c068a..163d2879 100644
--- a/SRC/sstemr.f
+++ b/SRC/sstemr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                          M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
@@ -34,11 +34,11 @@
 *       REAL               Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEMR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -90,11 +90,10 @@
 *> floating-point standard in their handling of infinities and NaNs.
 *> This permits the use of efficient inner loops avoiding a check for
 *> zero divisors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -286,10 +285,9 @@
 *>                the nonzero error code returned by SLARRE or
 *>                SLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -300,21 +298,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE SSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $                   M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
diff --git a/SRC/ssteqr.f b/SRC/ssteqr.f
index 7a6e09d0..1980e072 100644
--- a/SRC/ssteqr.f
+++ b/SRC/ssteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -28,22 +28,21 @@
 *       REAL               D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the implicit QL or QR method.
 *> The eigenvectors of a full or band symmetric matrix can also be found
 *> if SSYTRD or SSPTRD or SSBTRD has been used to reduce this matrix to
 *> tridiagonal form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -116,10 +115,9 @@
 *>                matrix which is orthogonally similar to the original
 *>                matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssterf.f b/SRC/ssterf.f
index 6bc8a851..639db350 100644
--- a/SRC/ssterf.f
+++ b/SRC/ssterf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTERF( N, D, E, INFO )
 * 
@@ -27,19 +27,18 @@
 *       REAL               D( * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTERF computes all eigenvalues of a symmetric tridiagonal matrix
 *> using the Pal-Walker-Kahan variant of the QL or QR algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -71,10 +70,9 @@
 *>                a total of 30*N iterations; if INFO = i, then i
 *>                elements of E have not converged to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sstev.f b/SRC/sstev.f
index 6303125a..968e4335 100644
--- a/SRC/sstev.f
+++ b/SRC/sstev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEV( JOBZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEV computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric tridiagonal matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          > 0:  if INFO = i, the algorithm failed to converge; i
 *>                off-diagonal elements of E did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sstevd.f b/SRC/sstevd.f
index d2b423e7..40bae575 100644
--- a/SRC/sstevd.f
+++ b/SRC/sstevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEVD( JOBZ, N, D, E, Z, LDZ, WORK, LWORK, IWORK,
 *                          LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               D( * ), E( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEVD computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric tridiagonal matrix. If eigenvectors are desired, it
@@ -46,11 +46,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -147,10 +146,9 @@
 *>          > 0:  if INFO = i, the algorithm failed to converge; i
 *>                off-diagonal elements of E did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/sstevr.f b/SRC/sstevr.f
index c55a9f2d..6dcb269e 100644
--- a/SRC/sstevr.f
+++ b/SRC/sstevr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL,
 *                          M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
@@ -32,11 +32,11 @@
 *       REAL               D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEVR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T.  Eigenvalues and
@@ -78,11 +78,10 @@
 *> hence may abort due to a floating point exception in environments
 *> which do not handle NaNs and infinities in the ieee standard default
 *> manner.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -272,10 +271,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  Internal error
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -286,21 +284,15 @@
 *
 *> \ingroup realOTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
+*>     Inderjit Dhillon, IBM Almaden, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
 *>     Ken Stanley, Computer Science Division, University of
-*>       California at Berkeley, USA
+*>       California at Berkeley, USA \n
 *>     Jason Riedy, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>
-*> \endverbatim
+*>       California at Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE SSTEVR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL,
diff --git a/SRC/sstevx.f b/SRC/sstevx.f
index 42dd8d94..c5e2a644 100644
--- a/SRC/sstevx.f
+++ b/SRC/sstevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSTEVX( JOBZ, RANGE, N, D, E, VL, VU, IL, IU, ABSTOL,
 *                          M, W, Z, LDZ, WORK, IWORK, IFAIL, INFO )
@@ -31,21 +31,20 @@
 *       REAL               D( * ), E( * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSTEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix A.  Eigenvalues and
 *> eigenvectors can be selected by specifying either a range of values
 *> or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -204,10 +203,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssycon.f b/SRC/ssycon.f
index a12b4c76..01c95a25 100644
--- a/SRC/ssycon.f
+++ b/SRC/ssycon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a real symmetric matrix A using the factorization
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssyconv.f b/SRC/ssyconv.f
index 0f67d952..758a92ed 100644
--- a/SRC/ssyconv.f
+++ b/SRC/ssyconv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYCONV convert A given by TRF into L and D and vice-versa.
 *> Get Non-diag elements of D (returned in workspace) and 
 *> apply or reverse permutation done in TRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssyequb.f b/SRC/ssyequb.f
index 3930e185..53ceb7ee 100644
--- a/SRC/ssyequb.f
+++ b/SRC/ssyequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), S( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYEQUB computes row and column scalings intended to equilibrate a
 *> symmetric matrix A and reduce its condition number
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -126,19 +124,14 @@
 *
 *> \ingroup realSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par References:
+*  ================
 *>
-*>  Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization",
-*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.
-*>  DOI 10.1023/B:NUMA.0000016606.32820.69
+*>  Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n
+*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n
+*>  DOI 10.1023/B:NUMA.0000016606.32820.69 \n
 *>  Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE SSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 *
diff --git a/SRC/ssyev.f b/SRC/ssyev.f
index 82ee4614..2e4f1ea8 100644
--- a/SRC/ssyev.f
+++ b/SRC/ssyev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( LDA, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYEV computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -117,10 +116,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssyevd.f b/SRC/ssyevd.f
index 2c188a23..631d3ddc 100644
--- a/SRC/ssyevd.f
+++ b/SRC/ssyevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK,
 *                          LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYEVD computes all eigenvalues and, optionally, eigenvectors of a
 *> real symmetric matrix A. If eigenvectors are desired, it uses a
@@ -49,11 +49,10 @@
 *>
 *> Because of large use of BLAS of level 3, SSYEVD needs N**2 more
 *> workspace than SSYEVX.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -159,10 +158,9 @@
 *>                lying in rows and columns INFO/(N+1) through
 *>                mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -173,19 +171,13 @@
 *
 *> \ingroup realSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>  Modified by Francoise Tisseur, University of Tennessee.
-*>
-*>  Modified description of INFO. Sven, 16 Feb 05.
-*> \endverbatim
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA \n
+*>  Modified by Francoise Tisseur, University of Tennessee \n
+*>  Modified description of INFO. Sven, 16 Feb 05. \n
 *>
 *  =====================================================================
       SUBROUTINE SSYEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, IWORK,
diff --git a/SRC/ssyevr.f b/SRC/ssyevr.f
index 1ee75462..9963f840 100644
--- a/SRC/ssyevr.f
+++ b/SRC/ssyevr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK,
@@ -32,11 +32,11 @@
 *       REAL               A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYEVR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A.  Eigenvalues and eigenvectors can be
@@ -95,11 +95,10 @@
 *> hence may abort due to a floating point exception in environments
 *> which do not handle NaNs and infinities in the ieee standard default
 *> manner.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -300,10 +299,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  Internal error
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -314,21 +312,15 @@
 *
 *> \ingroup realSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
+*>     Inderjit Dhillon, IBM Almaden, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
 *>     Ken Stanley, Computer Science Division, University of
-*>       California at Berkeley, USA
+*>       California at Berkeley, USA \n
 *>     Jason Riedy, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>
-*> \endverbatim
+*>       California at Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE SSYEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
diff --git a/SRC/ssyevx.f b/SRC/ssyevx.f
index 389f6f37..994ca5a9 100644
--- a/SRC/ssyevx.f
+++ b/SRC/ssyevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, LWORK, IWORK,
@@ -32,21 +32,20 @@
 *       REAL               A( LDA, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric matrix A.  Eigenvalues and eigenvectors can be
 *> selected by specifying either a range of values or a range of indices
 *> for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -229,10 +228,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssygs2.f b/SRC/ssygs2.f
index 53e4d929..920e6521 100644
--- a/SRC/ssygs2.f
+++ b/SRC/ssygs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYGS2 reduces a real symmetric-definite generalized eigenproblem
 *> to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T *A*L.
 *>
 *> B must have been previously factorized as U**T *U or L*L**T by SPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssygst.f b/SRC/ssygst.f
index 29afe23f..a2a8f198 100644
--- a/SRC/ssygst.f
+++ b/SRC/ssygst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYGST reduces a real symmetric-definite generalized eigenproblem
 *> to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**T or L**T*A*L.
 *>
 *> B must have been previously factorized as U**T*U or L*L**T by SPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssygv.f b/SRC/ssygv.f
index 79dd4bba..70b67bcd 100644
--- a/SRC/ssygv.f
+++ b/SRC/ssygv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                         LWORK, INFO )
@@ -29,22 +29,21 @@
 *       REAL               A( LDA, * ), B( LDB, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be symmetric and B is also
 *> positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -159,10 +158,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssygvd.f b/SRC/ssygvd.f
index 28b90816..f799ce13 100644
--- a/SRC/ssygvd.f
+++ b/SRC/ssygvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                          LWORK, IWORK, LIWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -48,11 +48,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -195,10 +194,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -209,20 +207,21 @@
 *
 *> \ingroup realSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  Based on contributions by
-*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
+*> \verbatim
 *>
 *>  Modified so that no backsubstitution is performed if SSYEVD fails to
 *>  converge (NEIG in old code could be greater than N causing out of
 *>  bounds reference to A - reported by Ralf Meyer).  Also corrected the
 *>  description of INFO and the test on ITYPE. Sven, 16 Feb 05.
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
 *>
 *  =====================================================================
       SUBROUTINE SSYGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
diff --git a/SRC/ssygvx.f b/SRC/ssygvx.f
index ffe4bf53..e64b9de5 100644
--- a/SRC/ssygvx.f
+++ b/SRC/ssygvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
 *                          VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a real generalized symmetric-definite eigenproblem, of the form
@@ -45,11 +45,10 @@
 *> and B are assumed to be symmetric and B is also positive definite.
 *> Eigenvalues and eigenvectors can be selected by specifying either a
 *> range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -268,10 +267,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -282,17 +280,11 @@
 *
 *> \ingroup realSYeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE SSYGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
      $                   VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
diff --git a/SRC/ssyrfs.f b/SRC/ssyrfs.f
index f5a06401..9ade859a 100644
--- a/SRC/ssyrfs.f
+++ b/SRC/ssyrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,20 +31,19 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite, and
 *> provides error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -167,16 +166,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssyrfsx.f b/SRC/ssyrfsx.f
index 67830e4e..f27c18da 100644
--- a/SRC/ssyrfsx.f
+++ b/SRC/ssyrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SSYRFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric indefinite, and
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -386,10 +383,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssysv.f b/SRC/ssysv.f
index baf78b94..1c506c17 100644
--- a/SRC/ssysv.f
+++ b/SRC/ssysv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK,
 *                         LWORK, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYSV computes the solution to a real system of linear equations
 *>    A * X = B,
@@ -48,11 +48,10 @@
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.  The factored form of A is then
 *> used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssysvx.f b/SRC/ssysvx.f
index 9494b18d..364ba2ec 100644
--- a/SRC/ssysvx.f
+++ b/SRC/ssysvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B,
 *                          LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK,
@@ -33,11 +33,11 @@
 *      $                   BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYSVX uses the diagonal pivoting factorization to compute the
 *> solution to a real system of linear equations A * X = B,
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -73,11 +76,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
@@ -264,10 +266,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 
diff --git a/SRC/ssysvxx.f b/SRC/ssysvxx.f
index aa45f3fa..32f3ef30 100644
--- a/SRC/ssysvxx.f
+++ b/SRC/ssysvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    SSYSVXX uses the diagonal pivoting factorization to compute the
 *>    solution to a real system of linear equations A * X = B, where A
@@ -64,9 +62,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what SSYSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -107,11 +108,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(R) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -489,10 +489,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssyswapr.f b/SRC/ssyswapr.f
index 2f4f85c1..83d74cd9 100644
--- a/SRC/ssyswapr.f
+++ b/SRC/ssyswapr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYSWAPR( UPLO, N, A, LDA, I1, I2)
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       REAL             A( LDA, N )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYSWAPR applies an elementary permutation on the rows and the columns of
 *> a symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          I2 is INTEGER
 *>          Index of the second row to swap
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssytd2.f b/SRC/ssytd2.f
index 66a1ee24..289c6ab8 100644
--- a/SRC/ssytd2.f
+++ b/SRC/ssytd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTD2( UPLO, N, A, LDA, D, E, TAU, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( LDA, * ), D( * ), E( * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTD2 reduces a real symmetric matrix A to symmetric tridiagonal
 *> form T by an orthogonal similarity transformation: Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -126,10 +124,9 @@
 *
 *> \ingroup realSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -171,7 +168,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ssytf2.f b/SRC/ssytf2.f
index 2ac172a3..0641343b 100644
--- a/SRC/ssytf2.f
+++ b/SRC/ssytf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTF2 computes the factorization of a real symmetric matrix A using
 *> the Bunch-Kaufman diagonal pivoting method:
@@ -45,11 +45,10 @@
 *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -110,10 +109,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -124,25 +122,10 @@
 *
 *> \ingroup realSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  09-29-06 - patch from
-*>    Bobby Cheng, MathWorks
-*>
-*>    Replace l.204 and l.372
-*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
-*>    by
-*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN
+*> \par Further Details:
+*  =====================
 *>
-*>  01-01-96 - Based on modifications by
-*>    J. Lewis, Boeing Computer Services Company
-*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
-*>         Company
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -177,9 +160,29 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
+*> \verbatim
+*>
+*>  09-29-06 - patch from
+*>    Bobby Cheng, MathWorks
+*>
+*>    Replace l.204 and l.372
+*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
+*>    by
+*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. SISNAN(ABSAKK) ) THEN
+*>
+*>  01-01-96 - Based on modifications by
+*>    J. Lewis, Boeing Computer Services Company
+*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
+*>         Company
+*>
+*> \endverbatim
+*
 *  =====================================================================
       SUBROUTINE SSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 *
diff --git a/SRC/ssytrd.f b/SRC/ssytrd.f
index 8a14a577..de37eff9 100644
--- a/SRC/ssytrd.f
+++ b/SRC/ssytrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTRD reduces a real symmetric matrix A to real symmetric
 *> tridiagonal form T by an orthogonal similarity transformation:
 *> Q**T * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -145,10 +143,9 @@
 *
 *> \ingroup realSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -190,7 +187,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ssytrf.f b/SRC/ssytrf.f
index 7d33f857..cfca5dfc 100644
--- a/SRC/ssytrf.f
+++ b/SRC/ssytrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTRF computes the factorization of a real symmetric matrix A using
 *> the Bunch-Kaufman diagonal pivoting method.  The form of the
@@ -46,11 +46,10 @@
 *> 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, and division by zero will occur if it
 *>                is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup realSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
@@ -180,7 +177,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ssytri.f b/SRC/ssytri.f
index ed93bdd0..772330c0 100644
--- a/SRC/ssytri.f
+++ b/SRC/ssytri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTRI computes the inverse of a real symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> SSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssytri2.f b/SRC/ssytri2.f
index 021fd63a..801f9c57 100644
--- a/SRC/ssytri2.f
+++ b/SRC/ssytri2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTRI2 computes the inverse of a REAL hermitian indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> SSYTRF. SSYTRI2 sets the LEADING DIMENSION of the workspace
 *> before calling SSYTRI2X that actually computes the inverse.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssytri2x.f b/SRC/ssytri2x.f
index 860366bb..03bbc332 100644
--- a/SRC/ssytri2x.f
+++ b/SRC/ssytri2x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       REAL               A( LDA, * ), WORK( N+NB+1,* )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTRI2X computes the inverse of a real symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> SSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssytrs.f b/SRC/ssytrs.f
index b196553c..44ce20f1 100644
--- a/SRC/ssytrs.f
+++ b/SRC/ssytrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTRS solves a system of linear equations A*X = B with a real
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by SSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ssytrs2.f b/SRC/ssytrs2.f
index 59e107a8..a18528a1 100644
--- a/SRC/ssytrs2.f
+++ b/SRC/ssytrs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE SSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, 
 *                           WORK, INFO )
@@ -30,20 +30,19 @@
 *       REAL               A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> SSYTRS2 solves a system of linear equations A*X = B with a real
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by SSYTRF and converted by SSYCONV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stbcon.f b/SRC/stbcon.f
index e35e9aab..d9a31831 100644
--- a/SRC/stbcon.f
+++ b/SRC/stbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       REAL               AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STBCON estimates the reciprocal of the condition number of a
 *> triangular band matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -127,10 +126,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stbrfs.f b/SRC/stbrfs.f
index d632edbe..6343e9b4 100644
--- a/SRC/stbrfs.f
+++ b/SRC/stbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   FERR( * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STBRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular band
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by STBTRS or some other
 *> means before entering this routine.  STBRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -172,10 +171,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stbtrs.f b/SRC/stbtrs.f
index d7c41dfd..ed44d798 100644
--- a/SRC/stbtrs.f
+++ b/SRC/stbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, INFO )
@@ -29,11 +29,11 @@
 *       REAL               AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STBTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular band matrix of order N, and B is an
 *> N-by NRHS matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stfsm.f b/SRC/stfsm.f
index e2639546..14c8ed6d 100644
--- a/SRC/stfsm.f
+++ b/SRC/stfsm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A,
 *                         B, LDB )
@@ -30,11 +30,11 @@
 *       REAL               A( 0: * ), B( 0: LDB-1, 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for A in RFP Format.
 *>
@@ -50,11 +50,10 @@
 *> A is in Rectangular Full Packed (RFP) Format.
 *>
 *> The matrix X is overwritten on B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -174,10 +173,9 @@
 *>           max( 1, m ).
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -188,10 +186,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -274,12 +271,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE STFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A,
      $                  B, LDB )
diff --git a/SRC/stftri.f b/SRC/stftri.f
index 15dfee70..9e14d38b 100644
--- a/SRC/stftri.f
+++ b/SRC/stftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STFTRI( TRANSR, UPLO, DIAG, N, A, INFO )
 * 
@@ -28,21 +28,20 @@
 *       REAL               A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STFTRI computes the inverse of a triangular matrix A stored in RFP
 *> format.
 *>
 *> This is a Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,10 +111,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -199,7 +196,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stfttp.f b/SRC/stfttp.f
index e562ed34..99ae1930 100644
--- a/SRC/stfttp.f
+++ b/SRC/stfttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STFTTP( TRANSR, UPLO, N, ARF, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               AP( 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STFTTP copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -85,10 +84,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -99,10 +97,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -185,7 +182,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stfttr.f b/SRC/stfttr.f
index 25c04398..cb367534 100644
--- a/SRC/stfttr.f
+++ b/SRC/stfttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STFTTR copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -108,10 +106,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -194,12 +191,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE STFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO )
 *
diff --git a/SRC/stgevc.f b/SRC/stgevc.f
index d382322a..3221127c 100644
--- a/SRC/stgevc.f
+++ b/SRC/stgevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL,
 *                          LDVL, VR, LDVR, MM, M, WORK, INFO )
@@ -32,11 +32,11 @@
 *       ..
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGEVC computes some or all of the right and/or left eigenvectors of
 *> a pair of real matrices (S,P), where S is a quasi-triangular matrix
@@ -63,10 +63,10 @@
 *> factorization of a matrix pair (A,B), then Z*X and Q*Y
 *> are the matrices of right and left eigenvectors of (A,B).
 *> 
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -219,10 +219,9 @@
 *>          > 0:  the 2-by-2 block (INFO:INFO+1) does not have a complex
 *>                eigenvalue.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -233,10 +232,9 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Allocation of workspace:
@@ -291,7 +289,6 @@
 *>  transpose of the one in storage, so the rowwise method then
 *>  actually accesses columns of A and B at each step, and so is the
 *>  preferred method.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stgex2.f b/SRC/stgex2.f
index ff62cf02..f5d779d0 100644
--- a/SRC/stgex2.f
+++ b/SRC/stgex2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, J1, N1, N2, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGEX2 swaps adjacent diagonal blocks (A11, B11) and (A22, B22)
 *> of size 1-by-1 or 2-by-2 in an upper (quasi) triangular matrix pair
@@ -50,11 +50,10 @@
 *>        Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T
 *>        Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -173,10 +172,9 @@
 *>            <0: If INFO = -16: LWORK is too small. Appropriate value
 *>                for LWORK is returned in WORK(1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -187,20 +185,24 @@
 *
 *> \ingroup realGEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
-*>     Umea University, S-901 87 Umea, Sweden.
+*> \par Further Details:
+*  =====================
 *>
 *>  In the current code both weak and strong stability tests are
 *>  performed. The user can omit the strong stability test by changing
 *>  the internal logical parameter WANDS to .FALSE.. See ref. [2] for
 *>  details.
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+*>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -213,7 +215,6 @@
 *>      Report UMINF - 94.04, Department of Computing Science, Umea
 *>      University, S-901 87 Umea, Sweden, 1994. Also as LAPACK Working
 *>      Note 87. To appear in Numerical Algorithms, 1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stgexc.f b/SRC/stgexc.f
index 154aa2cb..08e00bb0 100644
--- a/SRC/stgexc.f
+++ b/SRC/stgexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, IFST, ILST, WORK, LWORK, INFO )
@@ -30,11 +30,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGEXC reorders the generalized real Schur decomposition of a real
 *> matrix pair (A,B) using an orthogonal equivalence transformation
@@ -54,11 +54,10 @@
 *>        Q(in) * A(in) * Z(in)**T = Q(out) * A(out) * Z(out)**T
 *>        Q(in) * B(in) * Z(in)**T = Q(out) * B(out) * Z(out)**T
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -187,10 +186,9 @@
 *>                and ILST points to the first row of the current
 *>                position of the block being moved.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -201,21 +199,21 @@
 *
 *> \ingroup realGEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stgsen.f b/SRC/stgsen.f
index 43e413b2..5f712dd9 100644
--- a/SRC/stgsen.f
+++ b/SRC/stgsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB,
 *                          ALPHAR, ALPHAI, BETA, Q, LDQ, Z, LDZ, M, PL,
@@ -36,11 +36,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGSEN reorders the generalized real Schur decomposition of a real
 *> matrix pair (A, B) (in terms of an orthonormal equivalence trans-
@@ -66,11 +66,10 @@
 *> the selected cluster and the eigenvalues outside the cluster, resp.,
 *> and norms of "projections" onto left and right eigenspaces w.r.t.
 *> the selected cluster in the (1,1)-block.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -296,10 +295,9 @@
 *>                (A, B) may have been partially reordered.
 *>                If requested, 0 is returned in DIF(*), PL and PR.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -310,10 +308,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  STGSEN first collects the selected eigenvalues by computing
@@ -415,13 +412,18 @@
 *>  based estimate DIF is not wanted (see SLATDF), then the parameter
 *>  IDIFJB (see below) should be changed from 3 to 4 (routine SLATDF
 *>  (IJOB = 2 will be used)). See STGSYL for more details.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
-*>  References
-*>  ==========
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -442,7 +444,6 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
 *>      1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stgsja.f b/SRC/stgsja.f
index a53e4a82..2a154e91 100644
--- a/SRC/stgsja.f
+++ b/SRC/stgsja.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B,
 *                          LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV,
@@ -34,11 +34,11 @@
 *      $                   V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGSJA computes the generalized singular value decomposition (GSVD)
 *> of two real upper triangular (or trapezoidal) matrices A and B.
@@ -123,11 +123,10 @@
 *> The computation of the orthogonal transformation matrices U, V or Q
 *> is optional.  These matrices may either be formed explicitly, or they
 *> may be postmultiplied into input matrices U1, V1, or Q1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -342,10 +341,9 @@
 *>          may take. If after MAXIT cycles, the routine fails to
 *>          converge, we return INFO = 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -356,10 +354,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  STGSJA essentially uses a variant of Kogbetliantz algorithm to reduce
@@ -374,7 +371,6 @@
 *>                C1**2 + S1**2 = I,
 *>
 *>  and R1 is an L-by-L nonsingular upper triangular matrix.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stgsna.f b/SRC/stgsna.f
index 03f6a9b0..ee04d1ee 100644
--- a/SRC/stgsna.f
+++ b/SRC/stgsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL,
 *                          LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK,
@@ -33,11 +33,11 @@
 *      $                   VL( LDVL, * ), VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or eigenvectors of a matrix pair (A, B) in
@@ -49,11 +49,10 @@
 *> i.e. A is block upper triangular with 1-by-1 and 2-by-2 diagonal
 *> blocks. B is upper triangular.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -222,10 +221,9 @@
 *>          =0: Successful exit
 *>          <0: If INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -236,10 +234,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of a generalized eigenvalue
@@ -345,13 +342,18 @@
 *>             EPS * norm(A, B) / DIF(i).
 *>
 *>  See ref. [2-3] for more details and further references.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
-*>  References
-*>  ==========
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -372,7 +374,6 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75.  To appear in ACM Trans. on Math. Software, Vol 22,
 *>      No 1, 1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stgsy2.f b/SRC/stgsy2.f
index f58205fb..24bc7064 100644
--- a/SRC/stgsy2.f
+++ b/SRC/stgsy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
@@ -34,11 +34,11 @@
 *      $                   D( LDD, * ), E( LDE, * ), F( LDF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGSY2 solves the generalized Sylvester equation:
 *>
@@ -77,11 +77,10 @@
 *> of an upper bound on the separation between to matrix pairs. Then
 *> the input (A, D), (B, E) are sub-pencils of the matrix pair in
 *> STGSYL. See STGSYL for details.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -251,10 +250,9 @@
 *>            >0: The matrix pairs (A, D) and (B, E) have common or very
 *>                close eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -265,18 +263,12 @@
 *
 *> \ingroup realSYauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE STGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
      $                   LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
diff --git a/SRC/stgsyl.f b/SRC/stgsyl.f
index ac8edab4..7b5b9749 100644
--- a/SRC/stgsyl.f
+++ b/SRC/stgsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK,
@@ -35,11 +35,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STGSYL solves the generalized Sylvester equation:
 *>
@@ -80,11 +80,10 @@
 *> information.
 *>
 *> This is a level 3 BLAS algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -253,10 +252,9 @@
 *>            <0: If INFO = -i, the i-th argument had an illegal value.
 *>            >0: (A, D) and (B, E) have common or close eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -267,15 +265,16 @@
 *
 *> \ingroup realSYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
+*>
+*> \verbatim
 *>
 *>  [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
@@ -293,7 +292,6 @@
 *>      Condition Estimators for Solving the Generalized Sylvester
 *>      Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7,
 *>      July 1989, pp 745-751.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stpcon.f b/SRC/stpcon.f
index a8299a73..4a770d82 100644
--- a/SRC/stpcon.f
+++ b/SRC/stpcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, IWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       REAL               AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPCON estimates the reciprocal of the condition number of a packed
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stpmqrt.f b/SRC/stpmqrt.f
index f2863231..ab1a7628 100644
--- a/SRC/stpmqrt.f
+++ b/SRC/stpmqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT,
 *                           A, LDA, B, LDB, WORK, INFO )
@@ -30,20 +30,19 @@
 *      $          WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPMQRT applies a real orthogonal matrix Q obtained from a 
 *> "triangular-pentagonal" real block reflector H to a general
 *> real matrix C, which consists of two blocks A and B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -167,10 +166,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -181,10 +179,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The columns of the pentagonal matrix V contain the elementary reflectors
@@ -213,7 +210,6 @@
 *>  If TRANS='N' and SIDE='R', C is on exit replaced with C * Q.
 *>
 *>  If TRANS='C' and SIDE='R', C is on exit replaced with C * Q^H.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stpqrt.f b/SRC/stpqrt.f
index adea51aa..06259d81 100644
--- a/SRC/stpqrt.f
+++ b/SRC/stpqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK,
 *                          INFO )
@@ -28,21 +28,20 @@
 *       REAL A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPQRT computes a blocked QR factorization of a real 
 *> "triangular-pentagonal" matrix C, which is composed of a 
 *> triangular block A and pentagonal block B, using the compact 
 *> WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,11 +136,11 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The input matrix C is a (N+M)-by-N matrix  
 *>
 *>               C = [ A ]
@@ -185,7 +183,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = [T1 T2 ... TB].
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stpqrt2.f b/SRC/stpqrt2.f
index 3b48db27..97681748 100644
--- a/SRC/stpqrt2.f
+++ b/SRC/stpqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO )
 * 
@@ -27,20 +27,19 @@
 *       REAL   A( LDA, * ), B( LDB, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPQRT2 computes a QR factorization of a real "triangular-pentagonal"
 *> matrix C, which is composed of a triangular block A and pentagonal block B, 
 *> using the compact WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,10 +123,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The input matrix C is a (N+M)-by-N matrix  
@@ -171,7 +168,6 @@
 *>
 *>  where W^H is the conjugate transpose of W and T is the upper triangular
 *>  factor of the block reflector.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stprfb.f b/SRC/stprfb.f
index 61233fae..4d536d93 100644
--- a/SRC/stprfb.f
+++ b/SRC/stprfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, 
 *                          V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK )
@@ -30,20 +30,20 @@
 *      $          V( LDV, * ), WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPRFB applies a real "triangular-pentagonal" block reflector H or its 
 *> conjugate transpose H^H to a real matrix C, which is composed of two 
 *> blocks A and B, either from the left or right.
 *> 
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -185,10 +185,9 @@
 *>          If SIDE = 'L', LDWORK >= K; 
 *>          if SIDE = 'R', LDWORK >= M.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -199,10 +198,9 @@
 *
 *> \ingroup realOTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix C is a composite matrix formed from blocks A and B.
@@ -247,7 +245,6 @@
 *>  If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L.
 *>
 *>  If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stprfs.f b/SRC/stprfs.f
index 14d66b05..4ad3fe2c 100644
--- a/SRC/stprfs.f
+++ b/SRC/stprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular packed
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by STPTRS or some other
 *> means before entering this routine.  STPRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,10 +158,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stptri.f b/SRC/stptri.f
index 24cac6f5..ccfdcc3b 100644
--- a/SRC/stptri.f
+++ b/SRC/stptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPTRI( UPLO, DIAG, N, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPTRI computes the inverse of a real upper or lower triangular
 *> matrix A stored in packed format.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -83,10 +82,9 @@
 *>          > 0:  if INFO = i, A(i,i) is exactly zero.  The triangular
 *>                matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -97,10 +95,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A triangular matrix A can be transferred to packed storage using one
@@ -115,7 +112,6 @@
 *>      1    CONTINUE                    1    CONTINUE
 *>           JC = JC + J                      JC = JC + N - J + 1
 *>      2 CONTINUE                       2 CONTINUE
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stptrs.f b/SRC/stptrs.f
index f2a7c846..43d1201c 100644
--- a/SRC/stptrs.f
+++ b/SRC/stptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       REAL               AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *> where A is a triangular matrix of order N stored in packed format,
 *> and B is an N-by-NRHS matrix.  A check is made to verify that A is
 *> nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stpttf.f b/SRC/stpttf.f
index 38e49557..7105a8b0 100644
--- a/SRC/stpttf.f
+++ b/SRC/stpttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPTTF( TRANSR, UPLO, N, AP, ARF, INFO )
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       REAL               AP( 0: * ), ARF( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPTTF copies a triangular matrix A from standard packed format (TP)
 *> to rectangular full packed format (TF).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -84,10 +83,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -184,7 +181,6 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stpttr.f b/SRC/stpttr.f
index b9f74f9b..4dd13ba3 100644
--- a/SRC/stpttr.f
+++ b/SRC/stpttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STPTTR( UPLO, N, AP, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STPTTR copies a triangular matrix A from standard packed format (TP)
 *> to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strcon.f b/SRC/strcon.f
index 2fa09064..531166c8 100644
--- a/SRC/strcon.f
+++ b/SRC/strcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK,
 *                          IWORK, INFO )
@@ -31,11 +31,11 @@
 *       REAL               A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRCON estimates the reciprocal of the condition number of a
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -121,10 +120,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strevc.f b/SRC/strevc.f
index b90aa65c..fb37bec4 100644
--- a/SRC/strevc.f
+++ b/SRC/strevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, MM, M, WORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STREVC computes some or all of the right and/or left eigenvectors of
 *> a real upper quasi-triangular matrix T.
@@ -56,11 +56,10 @@
 *> input matrix.  If Q is the orthogonal factor that reduces a matrix
 *> A to Schur form T, then Q*X and Q*Y are the matrices of right and
 *> left eigenvectors of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -192,10 +191,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -206,10 +204,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The algorithm used in this program is basically backward (forward)
@@ -219,7 +216,6 @@
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x| + |y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/strexc.f b/SRC/strexc.f
index 8609b9c4..d02f3a85 100644
--- a/SRC/strexc.f
+++ b/SRC/strexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       REAL               Q( LDQ, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STREXC reorders the real Schur factorization of a real matrix
 *> A = Q*T*Q**T, so that the diagonal block of T with row index IFST is
@@ -47,11 +47,10 @@
 *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
 *> 2-by-2 diagonal block has its diagonal elements equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                reordered, and ILST points to the first row of the
 *>                current position of the block being moved.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strrfs.f b/SRC/strrfs.f
index e23ae83f..dc05cb39 100644
--- a/SRC/strrfs.f
+++ b/SRC/strrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by STRTRS or some other
 *> means before entering this routine.  STRRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -166,10 +165,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strsen.f b/SRC/strsen.f
index 877de3ce..5cf4e175 100644
--- a/SRC/strsen.f
+++ b/SRC/strsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, WR, WI,
 *                          M, S, SEP, WORK, LWORK, IWORK, LIWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   WR( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRSEN reorders the real Schur factorization of a real matrix
 *> A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in
@@ -52,11 +52,10 @@
 *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
 *> 2-by-2 diagonal block has its diagonal elemnts equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -223,10 +222,9 @@
 *>               contain the eigenvalues in the same order as in T; S and
 *>               SEP (if requested) are set to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -237,10 +235,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  STRSEN first collects the selected eigenvalues by computing an
@@ -311,7 +308,6 @@
 *>  error in the computed right invariant subspace is
 *>
 *>                      EPS * norm(T) / SEP
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/strsna.f b/SRC/strsna.f
index bac77194..47f18afd 100644
--- a/SRC/strsna.f
+++ b/SRC/strsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, S, SEP, MM, M, WORK, LDWORK, IWORK,
@@ -33,11 +33,11 @@
 *      $                   VR( LDVR, * ), WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or right eigenvectors of a real upper
@@ -48,11 +48,10 @@
 *> block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each
 *> 2-by-2 diagonal block has its diagonal elements equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -205,10 +204,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -219,10 +217,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of an eigenvalue lambda is
@@ -261,7 +258,6 @@
 *>  is given by
 *>
 *>                      EPS * norm(T) / SEP(i)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/strsyl.f b/SRC/strsyl.f
index 70f92e4e..c8efc106 100644
--- a/SRC/strsyl.f
+++ b/SRC/strsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C,
 *                          LDC, SCALE, INFO )
@@ -30,11 +30,11 @@
 *       REAL               A( LDA, * ), B( LDB, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRSYL solves the real Sylvester matrix equation:
 *>
@@ -50,11 +50,10 @@
 *> is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks;
 *> each 2-by-2 diagonal block has its diagonal elements equal and its
 *> off-diagonal elements of opposite sign.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANA
 *> \verbatim
@@ -148,10 +147,9 @@
 *>               values were used to solve the equation (but the matrices
 *>               A and B are unchanged).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strti2.f b/SRC/strti2.f
index 911a6ed5..17b98374 100644
--- a/SRC/strti2.f
+++ b/SRC/strti2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRTI2( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRTI2 computes the inverse of a real upper or lower triangular
 *> matrix.
 *>
 *> This is the Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strtri.f b/SRC/strtri.f
index ea7e0a35..102f6425 100644
--- a/SRC/strtri.f
+++ b/SRC/strtri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRTRI( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       REAL               A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRTRI computes the inverse of a real upper or lower triangular
 *> matrix A.
 *>
 *> This is the Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strtrs.f b/SRC/strtrs.f
index 480f868d..95b53449 100644
--- a/SRC/strtrs.f
+++ b/SRC/strtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       REAL               A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular matrix of order N, and B is an N-by-NRHS
 *> matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>               indicating that the matrix is singular and the solutions
 *>               X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/strttf.f b/SRC/strttf.f
index aed88560..43aa4aca 100644
--- a/SRC/strttf.f
+++ b/SRC/strttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRTTF copies a triangular matrix A from standard full format (TR)
 *> to rectangular full packed format (TF) .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -106,10 +104,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Rectangular Full Packed (RFP) Format when N is
@@ -192,12 +189,8 @@
 *>     02 12 22 00 01             00 10 20 30 40 50
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
-*>  Reference
-*>  =========
-*>
 *> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE STRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO )
 *
diff --git a/SRC/strttp.f b/SRC/strttp.f
index ff5a4ce3..9b3c1411 100644
--- a/SRC/strttp.f
+++ b/SRC/strttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STRTTP( UPLO, N, A, LDA, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       REAL               A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STRTTP copies a triangular matrix A from full format (TR) to standard
 *> packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/stzrqf.f b/SRC/stzrqf.f
index 6d439def..d4bc696d 100644
--- a/SRC/stzrqf.f
+++ b/SRC/stzrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STZRQF( M, N, A, LDA, TAU, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine STZRZF.
 *>
@@ -44,11 +44,10 @@
 *>
 *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -105,10 +103,9 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
@@ -136,7 +133,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/stzrzf.f b/SRC/stzrzf.f
index 2b9999bf..890fe688 100644
--- a/SRC/stzrzf.f
+++ b/SRC/stzrzf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE STZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       REAL               A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> STZRZF reduces the M-by-N ( M<=N ) real upper trapezoidal matrix A
 *> to upper triangular form by means of orthogonal transformations.
@@ -42,11 +42,10 @@
 *>
 *> where Z is an N-by-N orthogonal matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -122,14 +120,15 @@
 *
 *> \ingroup realOTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -156,7 +155,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/xerbla.f b/SRC/xerbla.f
index 10e0699c..35e82304 100644
--- a/SRC/xerbla.f
+++ b/SRC/xerbla.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE XERBLA( SRNAME, INFO )
 * 
@@ -25,11 +25,11 @@
 *       INTEGER            INFO
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> XERBLA  is an error handler for the LAPACK routines.
 *> It is called by an LAPACK routine if an input parameter has an
@@ -37,11 +37,10 @@
 *>
 *> Installers may consider modifying the STOP statement in order to
 *> call system-specific exception-handling facilities.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SRNAME
 *> \verbatim
@@ -55,10 +54,9 @@
 *>          The position of the invalid parameter in the parameter list
 *>          of the calling routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/xerbla_array.f b/SRC/xerbla_array.f
index 825988b7..4746f25b 100644
--- a/SRC/xerbla_array.f
+++ b/SRC/xerbla_array.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE XERBLA_ARRAY( SRNAME_ARRAY, SRNAME_LEN, INFO)
 * 
@@ -27,11 +27,11 @@
 *       CHARACTER(1) SRNAME_ARRAY(SRNAME_LEN)
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> XERBLA_ARRAY assists other languages in calling XERBLA, the LAPACK
 *> and BLAS error handler.  Rather than taking a Fortran string argument
@@ -51,11 +51,10 @@
 *>
 *> Providing XERBLA_ARRAY is not necessary for intercepting LAPACK
 *> errors.  XERBLA_ARRAY calls XERBLA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SRNAME_ARRAY
 *> \verbatim
@@ -75,10 +74,9 @@
 *>          The position of the invalid parameter in the parameter list
 *>          of the calling routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zbbcsd.f b/SRC/zbbcsd.f
index 7911a4a9..9e39b1f8 100644
--- a/SRC/zbbcsd.f
+++ b/SRC/zbbcsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZBBCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, M, P, Q,
 *                          THETA, PHI, U1, LDU1, U2, LDU2, V1T, LDV1T,
@@ -35,11 +35,11 @@
 *      $                   V2T( LDV2T, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZBBCSD computes the CS decomposition of a unitary matrix in
 *> bidiagonal-block form,
@@ -68,11 +68,10 @@
 *> The unitary matrices U1, U2, V1T, and V2T are input/output.
 *> The input matrices are pre- or post-multiplied by the appropriate
 *> singular vector matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -297,25 +296,26 @@
 *>          > 0:  if ZBBCSD did not converge, INFO specifies the number
 *>                of nonzero entries in PHI, and B11D, B11E, etc.,
 *>                contain the partially reduced matrix.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Reference
-*>  =========
-*>
-*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
-*>      Algorithms, 50(1):33-65, 2009.
-*>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  DOUBLE PRECISION, default = MAX(10,MIN(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          Angles THETA(i), PHI(i) are rounded to 0 or PI/2 when they
 *>          are within TOLMUL*EPS of either bound.
 *> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
+*>      Algorithms, 50(1):33-65, 2009.
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zbdsqr.f b/SRC/zbdsqr.f
index 0e2bda02..5b1b301b 100644
--- a/SRC/zbdsqr.f
+++ b/SRC/zbdsqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U,
 *                          LDU, C, LDC, RWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         C( LDC, * ), U( LDU, * ), VT( LDVT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZBDSQR computes the singular values and, optionally, the right and/or
 *> left singular vectors from the singular value decomposition (SVD) of
@@ -65,11 +65,10 @@
 *> B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics
 *> Department, University of California at Berkeley, July 1992
 *> for a detailed description of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -180,10 +179,12 @@
 *>                elements of a bidiagonal matrix which is orthogonally
 *>                similar to the input matrix B;  if INFO = i, i
 *>                elements of E have not converged to zero.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLMUL  DOUBLE PRECISION, default = max(10,min(100,EPS**(-1/8)))
 *>          TOLMUL controls the convergence criterion of the QR loop.
 *>          If it is positive, TOLMUL*EPS is the desired relative
@@ -205,10 +206,9 @@
 *>          (and so fails to converge) if the number of passes
 *>          through the inner loop exceeds MAXITR*N**2.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zcgesv.f b/SRC/zcgesv.f
index 9b2bb312..68985fac 100644
--- a/SRC/zcgesv.f
+++ b/SRC/zcgesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZCGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK,
 *                          SWORK, RWORK, ITER, INFO )
@@ -32,11 +32,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZCGESV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -68,11 +68,10 @@
 *>     o EPS is the machine epsilon returned by DLAMCH('Epsilon')
 *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00
 *> respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -185,10 +184,9 @@
 *>                factor U is exactly singular, so the solution
 *>                could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zcposv.f b/SRC/zcposv.f
index ee010e43..ca7a5d03 100644
--- a/SRC/zcposv.f
+++ b/SRC/zcposv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZCPOSV( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, WORK,
 *                          SWORK, RWORK, ITER, INFO )
@@ -32,11 +32,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZCPOSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -69,11 +69,10 @@
 *>     o EPS is the machine epsilon returned by DLAMCH('Epsilon')
 *> The value ITERMAX and BWDMAX are fixed to 30 and 1.0D+00
 *> respectively.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -193,10 +192,9 @@
 *>                factorization could not be completed, and the solution
 *>                has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zdrscl.f b/SRC/zdrscl.f
index 6d0b1f0c..ad425779 100644
--- a/SRC/zdrscl.f
+++ b/SRC/zdrscl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZDRSCL( N, SA, SX, INCX )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         SX( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZDRSCL multiplies an n-element complex vector x by the real scalar
 *> 1/a.  This is done without overflow or underflow as long as
 *> the final result x/a does not overflow or underflow.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -69,10 +68,9 @@
 *>          The increment between successive values of the vector SX.
 *>          > 0:  SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i),     1< i<= n
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbbrd.f b/SRC/zgbbrd.f
index 82ee3b27..88e2e909 100644
--- a/SRC/zgbbrd.f
+++ b/SRC/zgbbrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBBRD( VECT, M, N, NCC, KL, KU, AB, LDAB, D, E, Q,
 *                          LDQ, PT, LDPT, C, LDC, WORK, RWORK, INFO )
@@ -31,22 +31,21 @@
 *      $                   Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBBRD reduces a complex general m-by-n band matrix A to real upper
 *> bidiagonal form B by a unitary transformation: Q**H * A * P = B.
 *>
 *> The routine computes B, and optionally forms Q or P**H, or computes
 *> Q**H*C for a given matrix C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -177,10 +176,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbcon.f b/SRC/zgbcon.f
index 1c78ace4..d2041a5c 100644
--- a/SRC/zgbcon.f
+++ b/SRC/zgbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBCON( NORM, N, KL, KU, AB, LDAB, IPIV, ANORM, RCOND,
 *                          WORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *       COMPLEX*16         AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBCON estimates the reciprocal of the condition number of a complex
 *> general band matrix A, in either the 1-norm or the infinity-norm,
@@ -45,11 +45,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbequ.f b/SRC/zgbequ.f
index 59e11080..741d98bf 100644
--- a/SRC/zgbequ.f
+++ b/SRC/zgbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBEQU( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBEQU computes row and column scalings intended to equilibrate an
 *> M-by-N band matrix A and reduce its condition number.  R returns the
@@ -46,11 +46,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -138,10 +137,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbequb.f b/SRC/zgbequb.f
index 02b55389..48ea812f 100644
--- a/SRC/zgbequb.f
+++ b/SRC/zgbequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBEQUB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                           AMAX, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -53,11 +53,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -145,10 +144,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbrfs.f b/SRC/zgbrfs.f
index 25a04c9a..9f55282c 100644
--- a/SRC/zgbrfs.f
+++ b/SRC/zgbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBRFS( TRANS, N, KL, KU, NRHS, AB, LDAB, AFB, LDAFB,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK,
@@ -33,20 +33,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is banded, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -181,16 +180,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbrfsx.f b/SRC/zgbrfsx.f
index ef608537..243294d0 100644
--- a/SRC/zgbrfsx.f
+++ b/SRC/zgbrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBRFSX( TRANS, EQUED, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, R, C, B, LDB, X, LDX, RCOND,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZGBRFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -58,11 +56,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -423,10 +420,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbsv.f b/SRC/zgbsv.f
index 436a5c88..1e91fa03 100644
--- a/SRC/zgbsv.f
+++ b/SRC/zgbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBSV computes the solution to a complex system of linear equations
 *> A * X = B, where A is a band matrix of order N with KL subdiagonals
@@ -43,11 +43,10 @@
 *> and unit lower triangular matrices with KL subdiagonals, and U is
 *> upper triangular with KL+KU superdiagonals.  The factored form of A
 *> is then used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -125,10 +124,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,10 +137,9 @@
 *
 *> \ingroup complex16GBsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -160,7 +157,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgbsvx.f b/SRC/zgbsvx.f
index cbe43b20..43ed5f00 100644
--- a/SRC/zgbsvx.f
+++ b/SRC/zgbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBSVX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                          LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBSVX uses the LU factorization to compute the solution to a complex
 *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed by this subroutine:
 *>
@@ -88,11 +91,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -350,10 +352,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 
diff --git a/SRC/zgbsvxx.f b/SRC/zgbsvxx.f
index 955df209..33ebf138 100644
--- a/SRC/zgbsvxx.f
+++ b/SRC/zgbsvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBSVXX( FACT, TRANS, N, KL, KU, NRHS, AB, LDAB, AFB,
 *                           LDAFB, IPIV, EQUED, R, C, B, LDB, X, LDX,
@@ -39,11 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZGBSVXX uses the LU factorization to compute the solution to a
 *>    complex*16 system of linear equations  A * X = B,  where A is an
@@ -63,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what ZGBSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -107,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -538,10 +540,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgbtf2.f b/SRC/zgbtf2.f
index c5f12329..e6ce0d6c 100644
--- a/SRC/zgbtf2.f
+++ b/SRC/zgbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBTF2( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBTF2 computes an LU factorization of a complex m-by-n band matrix
 *> A using partial pivoting with row interchanges.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup complex16GBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -143,7 +140,6 @@
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U, because of fill-in resulting from the row
 *>  interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgbtrf.f b/SRC/zgbtrf.f
index ee891551..39358ff6 100644
--- a/SRC/zgbtrf.f
+++ b/SRC/zgbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBTRF( M, N, KL, KU, AB, LDAB, IPIV, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBTRF computes an LU factorization of a complex m-by-n band matrix A
 *> using partial pivoting with row interchanges.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -107,10 +106,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -121,10 +119,9 @@
 *
 *> \ingroup complex16GBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -142,7 +139,6 @@
 *>  Array elements marked * are not used by the routine; elements marked
 *>  + need not be set on entry, but are required by the routine to store
 *>  elements of U because of fill-in resulting from the row interchanges.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgbtrs.f b/SRC/zgbtrs.f
index 2ca3591f..ea1d9864 100644
--- a/SRC/zgbtrs.f
+++ b/SRC/zgbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGBTRS( TRANS, N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX*16         AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGBTRS solves a system of linear equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B
 *> with a general band matrix A using the LU factorization computed
 *> by ZGBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgebak.f b/SRC/zgebak.f
index a1f33421..b6d19728 100644
--- a/SRC/zgebak.f
+++ b/SRC/zgebak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV,
 *                          INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEBAK forms the right or left eigenvectors of a complex general
 *> matrix by backward transformation on the computed eigenvectors of the
 *> balanced matrix output by ZGEBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgebal.f b/SRC/zgebal.f
index 49c71f61..2106ee76 100644
--- a/SRC/zgebal.f
+++ b/SRC/zgebal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEBAL balances a general complex matrix A.  This involves, first,
 *> permuting A by a similarity transformation to isolate eigenvalues
@@ -44,11 +44,10 @@
 *>
 *> Balancing may reduce the 1-norm of the matrix, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -114,8 +113,8 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -126,10 +125,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The permutations consist of row and column interchanges which put
@@ -157,7 +155,6 @@
 *>
 *>  Modified by Tzu-Yi Chen, Computer Science Division, University of
 *>    California at Berkeley, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgebd2.f b/SRC/zgebd2.f
index 6fdf7d54..179cbe0a 100644
--- a/SRC/zgebd2.f
+++ b/SRC/zgebd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEBD2 reduces a complex general m by n matrix A to upper or lower
 *> real bidiagonal form B by a unitary transformation: Q**H * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -187,7 +184,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgebrd.f b/SRC/zgebrd.f
index 6a2881e0..bb4a178b 100644
--- a/SRC/zgebrd.f
+++ b/SRC/zgebrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK,
 *                          INFO )
@@ -29,21 +29,20 @@
 *       COMPLEX*16         A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEBRD reduces a general complex M-by-N matrix A to upper or lower
 *> bidiagonal form B by a unitary transformation: Q**H * A * P = B.
 *>
 *> If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -139,10 +138,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -153,10 +151,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -202,7 +199,6 @@
 *>  where d and e denote diagonal and off-diagonal elements of B, vi
 *>  denotes an element of the vector defining H(i), and ui an element of
 *>  the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgecon.f b/SRC/zgecon.f
index 7c865cce..cf16d131 100644
--- a/SRC/zgecon.f
+++ b/SRC/zgecon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, RWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGECON estimates the reciprocal of the condition number of a general
 *> complex matrix A, in either the 1-norm or the infinity-norm, using
@@ -44,11 +44,10 @@
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgeequ.f b/SRC/zgeequ.f
index 688a0b43..9f236348 100644
--- a/SRC/zgeequ.f
+++ b/SRC/zgeequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEEQU computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -46,11 +46,10 @@
 *> number and BIGNUM = largest safe number.  Use of these scaling
 *> factors is not guaranteed to reduce the condition number of A but
 *> works well in practice.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgeequb.f b/SRC/zgeequb.f
index 8ee9aa80..e9fff4ff 100644
--- a/SRC/zgeequb.f
+++ b/SRC/zgeequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEEQUB( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                           INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEEQUB computes row and column scalings intended to equilibrate an
 *> M-by-N matrix A and reduce its condition number.  R returns the row
@@ -53,11 +53,10 @@
 *> these factors introduces no additional rounding errors.  However, the
 *> scaled entries' magnitured are no longer approximately 1 but lie
 *> between sqrt(radix) and 1/sqrt(radix).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -131,10 +130,9 @@
 *>                <= M:  the i-th row of A is exactly zero
 *>                >  M:  the (i-M)-th column of A is exactly zero
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgees.f b/SRC/zgees.f
index 27083007..9477416e 100644
--- a/SRC/zgees.f
+++ b/SRC/zgees.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, W, VS,
 *                         LDVS, WORK, LWORK, RWORK, BWORK, INFO )
@@ -35,11 +35,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEES computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur
@@ -51,11 +51,10 @@
 *> invariant subspace corresponding to the selected eigenvalues.
 *>
 *> A complex matrix is in Schur form if it is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -181,10 +180,9 @@
 *>                      SELECT = .TRUE..  This could also be caused by
 *>                      underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgeesx.f b/SRC/zgeesx.f
index 2181038b..5d5f41c2 100644
--- a/SRC/zgeesx.f
+++ b/SRC/zgeesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, W,
 *                          VS, LDVS, RCONDE, RCONDV, WORK, LWORK, RWORK,
@@ -37,11 +37,11 @@
 *       EXTERNAL           SELECT
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEESX computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues, the Schur form T, and, optionally, the matrix of Schur
@@ -60,11 +60,10 @@
 *> these quantities are called s and sep respectively).
 *>
 *> A complex matrix is in Schur form if it is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVS
 *> \verbatim
@@ -222,10 +221,9 @@
 *>                   the Schur form no longer satisfy SELECT=.TRUE.  This
 *>                   could also be caused by underflow due to scaling.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgeev.f b/SRC/zgeev.f
index 73f1b27a..a7fc2ac7 100644
--- a/SRC/zgeev.f
+++ b/SRC/zgeev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEEV( JOBVL, JOBVR, N, A, LDA, W, VL, LDVL, VR, LDVR,
 *                         WORK, LWORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEEV computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -49,11 +49,10 @@
 *>
 *> The computed eigenvectors are normalized to have Euclidean norm
 *> equal to 1 and largest component real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -161,10 +160,9 @@
 *>                elements and i+1:N of W contain eigenvalues which have
 *>                converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgeevx.f b/SRC/zgeevx.f
index 3e14a9ba..0e560484 100644
--- a/SRC/zgeevx.f
+++ b/SRC/zgeevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, W, VL,
 *                          LDVL, VR, LDVR, ILO, IHI, SCALE, ABNRM, RCONDE,
@@ -34,11 +34,11 @@
 *      $                   W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEEVX computes for an N-by-N complex nonsymmetric matrix A, the
 *> eigenvalues and, optionally, the left and/or right eigenvectors.
@@ -69,11 +69,10 @@
 *> (in exact arithmetic) but diagonal scaling will.  For further
 *> explanation of balancing, see section 4.10.2 of the LAPACK
 *> Users' Guide.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -268,10 +267,9 @@
 *>                have been computed; elements 1:ILO-1 and i+1:N of W
 *>                contain eigenvalues which have converged.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgegs.f b/SRC/zgegs.f
index 3859be54..3a8bb877 100644
--- a/SRC/zgegs.f
+++ b/SRC/zgegs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEGS( JOBVSL, JOBVSR, N, A, LDA, B, LDB, ALPHA, BETA,
 *                         VSL, LDVSL, VSR, LDVSR, WORK, LWORK, RWORK,
@@ -33,11 +33,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine ZGGES.
 *>
@@ -56,11 +56,10 @@
 *> ZGEGV should be used instead.  See ZGEGV for a description of the
 *> eigenvalues of the generalized nonsymmetric eigenvalue problem
 *> (GNEP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -208,10 +207,9 @@
 *>                =N+8: error return from ZGGBAK (computing VSR)
 *>                =N+9: error return from ZLASCL (various places)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgegv.f b/SRC/zgegv.f
index f12cbdcb..bee5d04d 100644
--- a/SRC/zgegv.f
+++ b/SRC/zgegv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEGV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA,
 *                         VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine ZGGEV.
 *>
@@ -64,11 +64,10 @@
 *> are left eigenvectors of (A,B).
 *>
 *> Note: this routine performs "full balancing" on A and B
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -234,10 +233,9 @@
 *>                =N+9: error return from ZGGBAK (computing VR)
 *>                =N+10: error return from ZLASCL (various calls)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -248,10 +246,9 @@
 *
 *> \ingroup complex16GEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing
@@ -279,7 +276,6 @@
 *>  are computed, then only the diagonal blocks will be correct.
 *>
 *>  [*] In other words, upper triangular form.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgehd2.f b/SRC/zgehd2.f
index 6a8ae738..e5eaedf7 100644
--- a/SRC/zgehd2.f
+++ b/SRC/zgehd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEHD2 reduces a complex general matrix A to upper Hessenberg form H
 *> by a unitary similarity transformation:  Q**H * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -112,10 +110,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -147,7 +144,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgehrd.f b/SRC/zgehrd.f
index c546808e..9b7e9c19 100644
--- a/SRC/zgehrd.f
+++ b/SRC/zgehrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16        A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEHRD reduces a complex general matrix A to upper Hessenberg form H by
 *> an unitary similarity transformation:  Q**H * A * Q = H .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,10 +125,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of (ihi-ilo) elementary
@@ -166,7 +163,6 @@
 *>  This file is a slight modification of LAPACK-3.0's DGEHRD
 *>  subroutine incorporating improvements proposed by Quintana-Orti and
 *>  Van de Geijn (2006). (See DLAHR2.)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgelq2.f b/SRC/zgelq2.f
index e03f4b82..3ac16107 100644
--- a/SRC/zgelq2.f
+++ b/SRC/zgelq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGELQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGELQ2 computes an LQ factorization of a complex m by n matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in
 *>  A(i,i+1:n), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgelqf.f b/SRC/zgelqf.f
index 6e1164c7..7c326262 100644
--- a/SRC/zgelqf.f
+++ b/SRC/zgelqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGELQF computes an LQ factorization of a complex M-by-N matrix A:
 *> A = L * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -133,7 +130,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in
 *>  A(i,i+1:n), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgels.f b/SRC/zgels.f
index 05cdfe6f..ddbd7fc5 100644
--- a/SRC/zgels.f
+++ b/SRC/zgels.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGELS( TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK,
 *                         INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGELS solves overdetermined or underdetermined complex linear systems
 *> involving an M-by-N matrix A, or its conjugate-transpose, using a QR
@@ -59,11 +59,10 @@
 *> handled in a single call; they are stored as the columns of the
 *> M-by-NRHS right hand side matrix B and the N-by-NRHS solution
 *> matrix X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -166,10 +165,9 @@
 *>                full rank; the least squares solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgelsd.f b/SRC/zgelsd.f
index ef7064a9..2b171241 100644
--- a/SRC/zgelsd.f
+++ b/SRC/zgelsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
 *                          WORK, LWORK, RWORK, IWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGELSD computes the minimum-norm solution to a real linear least
 *> squares problem:
@@ -66,11 +66,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -202,10 +201,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -216,19 +214,13 @@
 *
 *> \ingroup complex16GEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
      $                   WORK, LWORK, RWORK, IWORK, INFO )
diff --git a/SRC/zgelss.f b/SRC/zgelss.f
index 6e628463..ca96cace 100644
--- a/SRC/zgelss.f
+++ b/SRC/zgelss.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
 *                          WORK, LWORK, RWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGELSS computes the minimum norm solution to a complex linear
 *> least squares problem:
@@ -52,11 +52,10 @@
 *> The effective rank of A is determined by treating as zero those
 *> singular values which are less than RCOND times the largest singular
 *> value.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -162,10 +161,9 @@
 *>                if INFO = i, i off-diagonal elements of an intermediate
 *>                bidiagonal form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgelsx.f b/SRC/zgelsx.f
index c4ab1659..830b3d8d 100644
--- a/SRC/zgelsx.f
+++ b/SRC/zgelsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGELSX( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine ZGELSY.
 *>
@@ -66,11 +66,10 @@
 *>    X = P * Z**H [ inv(T11)*Q1**H*B ]
 *>                 [        0         ]
 *> where Q1 consists of the first RANK columns of Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -168,10 +167,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgelsy.f b/SRC/zgelsy.f
index c0126773..bca35d4b 100644
--- a/SRC/zgelsy.f
+++ b/SRC/zgelsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
 *                          WORK, LWORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGELSY computes the minimum-norm solution to a complex linear least
 *> squares problem:
@@ -73,11 +73,10 @@
 *>     the call to the subroutine xGEQP3. This subroutine is a Blas-3
 *>     version of the QR factorization with column pivoting.
 *>   o Matrix B (the right hand side) is updated with Blas-3.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -187,10 +186,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -201,18 +199,12 @@
 *
 *> \ingroup complex16GEsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
-*>
-*> \endverbatim
+*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA \n 
+*>    E. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
+*>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain \n
 *>
 *  =====================================================================
       SUBROUTINE ZGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
diff --git a/SRC/zgemqrt.f b/SRC/zgemqrt.f
index ece75902..0be8eb05 100644
--- a/SRC/zgemqrt.f
+++ b/SRC/zgemqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEMQRT( SIDE, TRANS, M, N, K, NB, V, LDV, T, LDT, 
 *                          C, LDC, WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16   V( LDV, * ), C( LDC, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEMQRT overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> generated using the compact WY representation as returned by ZGEQRT. 
 *>
 *> Q is of order M if SIDE = 'L' and of order N  if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgeql2.f b/SRC/zgeql2.f
index 1137bc79..56087c6b 100644
--- a/SRC/zgeql2.f
+++ b/SRC/zgeql2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQL2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQL2 computes a QL factorization of a complex m by n matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqlf.f b/SRC/zgeqlf.f
index beaaf5e1..dfd232af 100644
--- a/SRC/zgeqlf.f
+++ b/SRC/zgeqlf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQLF computes a QL factorization of a complex M-by-N matrix A:
 *> A = Q * L.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(m-k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in
 *>  A(1:m-k+i-1,n-k+i), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqp3.f b/SRC/zgeqp3.f
index e98296a6..a160ae44 100644
--- a/SRC/zgeqp3.f
+++ b/SRC/zgeqp3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK,
 *                          INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQP3 computes a QR factorization with column pivoting of a
 *> matrix A:  A*P = Q*R  using Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -119,10 +118,9 @@
 *>          = 0: successful exit.
 *>          < 0: if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -133,10 +131,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -150,13 +147,14 @@
 *>  where tau is a real/complex scalar, and v is a real/complex vector
 *>  with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in
 *>  A(i+1:m,i), and tau in TAU(i).
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK,
      $                   INFO )
diff --git a/SRC/zgeqpf.f b/SRC/zgeqpf.f
index eb112a58..ad0cef47 100644
--- a/SRC/zgeqpf.f
+++ b/SRC/zgeqpf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine ZGEQP3.
 *>
 *> ZGEQPF computes a QR factorization with column pivoting of a
 *> complex M-by-N matrix A: A*P = Q*R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -120,10 +118,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -146,7 +143,6 @@
 *>    University of Zagreb, Croatia.
 *>  -- April 2011                                                      --
 *>  For more details see LAPACK Working Note 176.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqr2.f b/SRC/zgeqr2.f
index 38f7550e..3eb01fd4 100644
--- a/SRC/zgeqr2.f
+++ b/SRC/zgeqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQR2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQR2 computes a QR factorization of a complex m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqr2p.f b/SRC/zgeqr2p.f
index 8b379d35..0f1b18d4 100644
--- a/SRC/zgeqr2p.f
+++ b/SRC/zgeqr2p.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQR2P( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQR2P computes a QR factorization of a complex m by n matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,10 +100,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -119,7 +116,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqrf.f b/SRC/zgeqrf.f
index e11b19d8..3314c822 100644
--- a/SRC/zgeqrf.f
+++ b/SRC/zgeqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQRF computes a QR factorization of a complex M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqrfp.f b/SRC/zgeqrfp.f
index bd084038..6db027c6 100644
--- a/SRC/zgeqrfp.f
+++ b/SRC/zgeqrfp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQRFP computes a QR factorization of a complex M-by-N matrix A:
 *> A = Q * R.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -117,10 +115,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -134,7 +131,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
 *>  and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqrt.f b/SRC/zgeqrt.f
index 4541ff15..3d09f67b 100644
--- a/SRC/zgeqrt.f
+++ b/SRC/zgeqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQRT( M, N, NB, A, LDA, T, LDT, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16 A( LDA, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQRT computes a blocked QR factorization of a complex M-by-N matrix A
 *> using the compact WY representation of Q.  
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,11 +112,11 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
 *>  below the diagonal. For example, if M=5 and N=3, the matrix V is
 *>
@@ -138,7 +136,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = (T1 T2 ... TB).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqrt2.f b/SRC/zgeqrt2.f
index 337bef41..544fdf32 100644
--- a/SRC/zgeqrt2.f
+++ b/SRC/zgeqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGEQRT2( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQRT2 computes a QR factorization of a complex M-by-N matrix A, 
 *> using the compact WY representation of Q. 
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -125,7 +122,6 @@
 *>               H = I - V * T * V**H
 *>
 *>  where V**H is the conjugate transpose of V.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgeqrt3.f b/SRC/zgeqrt3.f
index 0925a5d9..fdd498f9 100644
--- a/SRC/zgeqrt3.f
+++ b/SRC/zgeqrt3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE ZGEQRT3( M, N, A, LDA, T, LDT, INFO )
 * 
@@ -27,22 +27,21 @@
 *       COMPLEX*16   A( LDA, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGEQRT3 recursively computes a QR factorization of a complex M-by-N 
 *> matrix A, using the compact WY representation of Q. 
 *>
 *> Based on the algorithm of Elmroth and Gustavson, 
 *> IBM J. Res. Develop. Vol 44 No. 4 July 2000.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -106,10 +104,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix V stores the elementary reflectors H(i) in the i-th column
@@ -130,7 +127,6 @@
 *>  where V**H is the conjugate transpose of V.
 *>
 *>  For details of the algorithm, see Elmroth and Gustavson (cited above).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgerfs.f b/SRC/zgerfs.f
index a720ac95..78973ae1 100644
--- a/SRC/zgerfs.f
+++ b/SRC/zgerfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGERFS( TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -32,20 +32,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGERFS improves the computed solution to a system of linear
 *> equations and provides error bounds and backward error estimates for
 *> the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -162,16 +161,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgerfsx.f b/SRC/zgerfsx.f
index 4e5aaa19..4f341253 100644
--- a/SRC/zgerfsx.f
+++ b/SRC/zgerfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGERFSX( TRANS, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           R, C, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZGERFSX improves the computed solution to a system of linear
 *>    equations and provides error bounds and backward error estimates
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED, R
 *>    and C below. In this case, the solution and error bounds returned
 *>    are for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -398,10 +395,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgerq2.f b/SRC/zgerq2.f
index 86fcb363..7c419f2e 100644
--- a/SRC/zgerq2.f
+++ b/SRC/zgerq2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGERQ2( M, N, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGERQ2 computes an RQ factorization of a complex m by n matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,10 +102,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -121,7 +118,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on
 *>  exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgerqf.f b/SRC/zgerqf.f
index bc04520c..a16082ef 100644
--- a/SRC/zgerqf.f
+++ b/SRC/zgerqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,19 +27,18 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGERQF computes an RQ factorization of a complex M-by-N matrix A:
 *> A = R * Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -119,10 +117,9 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -136,7 +133,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(n-k+i+1:n) = 0 and v(n-k+i) = 1; conjg(v(1:n-k+i-1)) is stored on
 *>  exit in A(m-k+i,1:n-k+i-1), and tau in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgesc2.f b/SRC/zgesc2.f
index d442f6bf..86f76c22 100644
--- a/SRC/zgesc2.f
+++ b/SRC/zgesc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), RHS( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGESC2 solves a system of linear equations
 *>
@@ -42,11 +42,10 @@
 *> with a general N-by-N matrix A using the LU factorization with
 *> complete pivoting computed by ZGETC2.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -94,10 +93,9 @@
 *>           On exit, SCALE contains the scale factor. SCALE is chosen
 *>           0 <= SCALE <= 1 to prevent owerflow in the solution.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -108,18 +106,12 @@
 *
 *> \ingroup complex16GEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
 *
diff --git a/SRC/zgesdd.f b/SRC/zgesdd.f
index 42c53ca6..be14d1e9 100644
--- a/SRC/zgesdd.f
+++ b/SRC/zgesdd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK,
 *                          LWORK, RWORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGESDD computes the singular value decomposition (SVD) of a complex
 *> M-by-N matrix A, optionally computing the left and/or right singular
@@ -59,11 +59,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -200,10 +199,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  The updating process of DBDSDC did not converge.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -214,18 +212,12 @@
 *
 *> \ingroup complex16GEsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK,
      $                   LWORK, RWORK, IWORK, INFO )
diff --git a/SRC/zgesv.f b/SRC/zgesv.f
index 1fcd0a1a..d96c1b6f 100644
--- a/SRC/zgesv.f
+++ b/SRC/zgesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGESV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -44,11 +44,10 @@
 *> where P is a permutation matrix, L is unit lower triangular, and U is
 *> upper triangular.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -107,10 +106,9 @@
 *>                has been completed, but the factor U is exactly
 *>                singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgesvd.f b/SRC/zgesvd.f
index 3609a381..875345d7 100644
--- a/SRC/zgesvd.f
+++ b/SRC/zgesvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT,
 *                          WORK, LWORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGESVD computes the singular value decomposition (SVD) of a complex
 *> M-by-N matrix A, optionally computing the left and/or right singular
@@ -51,11 +51,10 @@
 *> U and V are the left and right singular vectors of A.
 *>
 *> Note that the routine returns V**H, not V.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -198,10 +197,9 @@
 *>                did not converge to zero. See the description of RWORK
 *>                above for details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgesvx.f b/SRC/zgesvx.f
index 48b29df3..0ccf53d1 100644
--- a/SRC/zgesvx.f
+++ b/SRC/zgesvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGESVX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                          EQUED, R, C, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGESVX uses the LU factorization to compute the solution to a complex
 *> system of linear equations
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -87,11 +90,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -330,10 +332,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 
diff --git a/SRC/zgesvxx.f b/SRC/zgesvxx.f
index e7ee1295..72bfdc82 100644
--- a/SRC/zgesvxx.f
+++ b/SRC/zgesvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW,
@@ -39,13 +39,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZGESVXX uses the LU factorization to compute the solution to a
 *>    complex*16 system of linear equations  A * X = B,  where A is an
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what ZGESVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -109,11 +110,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so
 *>    that it solves the original system before equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -520,10 +520,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgetc2.f b/SRC/zgetc2.f
index 6845de4c..1651a756 100644
--- a/SRC/zgetc2.f
+++ b/SRC/zgetc2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGETC2 computes an LU factorization, using complete pivoting, of the
 *> n-by-n matrix A. The factorization has the form A = P * L * U * Q,
@@ -40,11 +40,10 @@
 *> unit diagonal elements and U is upper triangular.
 *>
 *> This is a level 1 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>                one tries to solve for x in Ax = b. So U is perturbed
 *>                to avoid the overflow.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,18 +102,12 @@
 *
 *> \ingroup complex16GEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO )
 *
diff --git a/SRC/zgetf2.f b/SRC/zgetf2.f
index 533e00ee..a771ad5b 100644
--- a/SRC/zgetf2.f
+++ b/SRC/zgetf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETF2( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGETF2 computes an LU factorization of a general m-by-n matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>               singular, and division by zero will occur if it is used
 *>               to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgetrf.f b/SRC/zgetrf.f
index a3af9613..f32d3ea7 100644
--- a/SRC/zgetrf.f
+++ b/SRC/zgetrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETRF( M, N, A, LDA, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGETRF computes an LU factorization of a general M-by-N matrix A
 *> using partial pivoting with row interchanges.
@@ -44,11 +44,10 @@
 *> triangular (upper trapezoidal if m < n).
 *>
 *> This is the right-looking Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -93,10 +92,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgetri.f b/SRC/zgetri.f
index 8e929bfd..4798edbe 100644
--- a/SRC/zgetri.f
+++ b/SRC/zgetri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -28,22 +28,21 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGETRI computes the inverse of a matrix using the LU factorization
 *> computed by ZGETRF.
 *>
 *> This method inverts U and then computes inv(A) by solving the system
 *> inv(A)*L = inv(U) for inv(A).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0:  if INFO = i, U(i,i) is exactly zero; the matrix is
 *>                singular and its inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgetrs.f b/SRC/zgetrs.f
index 1186b470..f73f9b79 100644
--- a/SRC/zgetrs.f
+++ b/SRC/zgetrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGETRS solves a system of linear equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B
 *> with a general N-by-N matrix A using the LU factorization computed
 *> by ZGETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zggbak.f b/SRC/zggbak.f
index 4b6635df..4b79151e 100644
--- a/SRC/zggbak.f
+++ b/SRC/zggbak.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V,
 *                          LDV, INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX*16         V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGBAK forms the right or left eigenvectors of a complex generalized
 *> eigenvalue problem A*x = lambda*B*x, by backward transformation on
 *> the computed eigenvectors of the balanced pair of matrices output by
 *> ZGGBAL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -123,10 +122,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -137,15 +135,13 @@
 *
 *> \ingroup complex16GBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. Ward, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zggbal.f b/SRC/zggbal.f
index 2e7c0093..452f7eba 100644
--- a/SRC/zggbal.f
+++ b/SRC/zggbal.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE,
 *                          RSCALE, WORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGBAL balances a pair of general complex matrices (A,B).  This
 *> involves, first, permuting A and B by similarity transformations to
@@ -46,11 +46,10 @@
 *> Balancing may reduce the 1-norm of the matrices, and improve the
 *> accuracy of the computed eigenvalues and/or eigenvectors in the
 *> generalized eigenvalue problem A*x = lambda*B*x.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -152,10 +151,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -166,15 +164,13 @@
 *
 *> \ingroup complex16GBcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  See R.C. WARD, Balancing the generalized eigenvalue problem,
 *>                 SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgges.f b/SRC/zgges.f
index 5c1456ef..ca0efe77 100644
--- a/SRC/zgges.f
+++ b/SRC/zgges.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB,
 *                         SDIM, ALPHA, BETA, VSL, LDVSL, VSR, LDVSR, WORK,
@@ -38,11 +38,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGES computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, the generalized complex Schur
@@ -70,11 +70,10 @@
 *> A pair of matrices (S,T) is in generalized complex Schur form if S
 *> and T are upper triangular and, in addition, the diagonal elements
 *> of T are non-negative real numbers.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -253,10 +252,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering falied in ZTGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zggesx.f b/SRC/zggesx.f
index e7f8329e..4a368713 100644
--- a/SRC/zggesx.f
+++ b/SRC/zggesx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGESX( JOBVSL, JOBVSR, SORT, SELCTG, SENSE, N, A, LDA,
 *                          B, LDB, SDIM, ALPHA, BETA, VSL, LDVSL, VSR,
@@ -41,11 +41,11 @@
 *       EXTERNAL           SELCTG
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGESX computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, the complex Schur form (S,T),
@@ -74,11 +74,10 @@
 *> A pair of matrices (S,T) is in generalized complex Schur form if T is
 *> upper triangular with non-negative diagonal and S is upper
 *> triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVSL
 *> \verbatim
@@ -312,10 +311,9 @@
 *>                      be caused due to scaling.
 *>                =N+3: reordering failed in ZTGSEN.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zggev.f b/SRC/zggev.f
index 155b19ce..f4e69063 100644
--- a/SRC/zggev.f
+++ b/SRC/zggev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGEV( JOBVL, JOBVR, N, A, LDA, B, LDB, ALPHA, BETA,
 *                         VL, LDVL, VR, LDVR, WORK, LWORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGEV computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B), the generalized eigenvalues, and optionally, the left and/or
@@ -59,11 +59,10 @@
 *>              u(j)**H * A = lambda(j) * u(j)**H * B
 *>
 *> where u(j)**H is the conjugate-transpose of u(j).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBVL
 *> \verbatim
@@ -201,10 +200,9 @@
 *>          > N:  =N+1: other then QZ iteration failed in DHGEQZ,
 *>                =N+2: error return from DTGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zggevx.f b/SRC/zggevx.f
index a02451af..4f8db7c0 100644
--- a/SRC/zggevx.f
+++ b/SRC/zggevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGEVX( BALANC, JOBVL, JOBVR, SENSE, N, A, LDA, B, LDB,
 *                          ALPHA, BETA, VL, LDVL, VR, LDVR, ILO, IHI,
@@ -38,11 +38,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGEVX computes for a pair of N-by-N complex nonsymmetric matrices
 *> (A,B) the generalized eigenvalues, and optionally, the left and/or
@@ -68,11 +68,10 @@
 *>                  u(j)**H * A  = lambda(j) * u(j)**H * B.
 *> where u(j)**H is the conjugate-transpose of u(j).
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] BALANC
 *> \verbatim
@@ -327,10 +326,9 @@
 *>          > N:  =N+1: other than QZ iteration failed in ZHGEQZ.
 *>                =N+2: error return from ZTGEVC.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -341,10 +339,9 @@
 *
 *> \ingroup complex16GEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Balancing a matrix pair (A,B) includes, first, permuting rows and
@@ -369,7 +366,6 @@
 *>
 *>  For further explanation of the reciprocal condition numbers RCONDE
 *>  and RCONDV, see section 4.11 of LAPACK User's Guide.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zggglm.f b/SRC/zggglm.f
index fd48a9db..ed7862ff 100644
--- a/SRC/zggglm.f
+++ b/SRC/zggglm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGGLM( N, M, P, A, LDA, B, LDB, D, X, Y, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGGLM solves a general Gauss-Markov linear model (GLM) problem:
 *>
@@ -61,11 +61,10 @@
 *>                  x
 *>
 *> where inv(B) denotes the inverse of B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -169,10 +168,9 @@
 *>                rank( A B ) < N; the least squares solution could not
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgghrd.f b/SRC/zgghrd.f
index a9ae228f..f6d52def 100644
--- a/SRC/zgghrd.f
+++ b/SRC/zgghrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q,
 *                          LDQ, Z, LDZ, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGHRD reduces a pair of complex matrices (A,B) to generalized upper
 *> Hessenberg form using unitary transformations, where A is a
@@ -61,11 +61,10 @@
 *> If Q1 is the unitary matrix from the QR factorization of B in the
 *> original equation A*x = lambda*B*x, then ZGGHRD reduces the original
 *> problem to generalized Hessenberg form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -178,10 +177,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -192,16 +190,14 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine reduces A to Hessenberg and B to triangular form by
 *>  an unblocked reduction, as described in _Matrix_Computations_,
 *>  by Golub and van Loan (Johns Hopkins Press).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgglse.f b/SRC/zgglse.f
index 56629ca6..7cd7db67 100644
--- a/SRC/zgglse.f
+++ b/SRC/zgglse.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGLSE solves the linear equality-constrained least squares (LSE)
 *> problem:
@@ -52,11 +52,10 @@
 *> matrices (B, A) given by
 *>
 *>    B = (0 R)*Q,   A = Z*T*Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>                    ( (B) )
 *>                be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zggqrf.f b/SRC/zggqrf.f
index 9aad8ba1..24d6472c 100644
--- a/SRC/zggqrf.f
+++ b/SRC/zggqrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGQRF( N, M, P, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGQRF computes a generalized QR factorization of an N-by-M matrix A
 *> and an N-by-P matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z**H denotes the
 *> conjugate transpose of matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -165,10 +164,9 @@
 *>           = 0:  successful exit
 *>           < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,10 +177,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -212,7 +209,6 @@
 *>  B(n-k+i,1:p-k+i-1), and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine ZUNGRQ.
 *>  To use Z to update another matrix, use LAPACK subroutine ZUNMRQ.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zggrqf.f b/SRC/zggrqf.f
index 63ed62ff..9d49e2fa 100644
--- a/SRC/zggrqf.f
+++ b/SRC/zggrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGRQF( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK,
 *                          LWORK, INFO )
@@ -29,11 +29,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGRQF computes a generalized RQ factorization of an M-by-N matrix A
 *> and a P-by-N matrix B:
@@ -62,11 +62,10 @@
 *>
 *> where inv(B) denotes the inverse of the matrix B, and Z**H denotes the
 *> conjugate transpose of the matrix Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -164,10 +163,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO=-i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -178,10 +176,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of elementary reflectors
@@ -211,7 +208,6 @@
 *>  and taub in TAUB(i).
 *>  To form Z explicitly, use LAPACK subroutine ZUNGQR.
 *>  To use Z to update another matrix, use LAPACK subroutine ZUNMQR.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zggsvd.f b/SRC/zggsvd.f
index 0928f177..3faa195b 100644
--- a/SRC/zggsvd.f
+++ b/SRC/zggsvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
 *                          LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
@@ -33,11 +33,11 @@
 *      $                   U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGSVD computes the generalized singular value decomposition (GSVD)
 *> of an M-by-N complex matrix A and P-by-N complex matrix B:
@@ -116,11 +116,10 @@
 *>
 *>                       X = Q*(  I   0    )
 *>                             (  0 inv(R) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -297,10 +296,12 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, the Jacobi-type procedure failed to
 *>                converge.  For further details, see subroutine ZTGSJA.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  TOLA    DOUBLE PRECISION
 *>  TOLB    DOUBLE PRECISION
 *>          TOLA and TOLB are the thresholds to determine the effective
@@ -310,10 +311,9 @@
 *>          The size of TOLA and TOLB may affect the size of backward
 *>          errors of the decomposition.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -324,18 +324,12 @@
 *
 *> \ingroup complex16OTHERsing
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  2-96 Based on modifications by
 *>     Ming Gu and Huan Ren, Computer Science Division, University of
 *>     California at Berkeley, USA
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZGGSVD( JOBU, JOBV, JOBQ, M, N, P, K, L, A, LDA, B,
      $                   LDB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK,
diff --git a/SRC/zggsvp.f b/SRC/zggsvp.f
index 005f361a..566f2c33 100644
--- a/SRC/zggsvp.f
+++ b/SRC/zggsvp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGGSVP( JOBU, JOBV, JOBQ, M, P, N, A, LDA, B, LDB,
 *                          TOLA, TOLB, K, L, U, LDU, V, LDV, Q, LDQ,
@@ -34,11 +34,11 @@
 *      $                   TAU( * ), U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGGSVP computes unitary matrices U, V and Q such that
 *>
@@ -63,11 +63,10 @@
 *> This decomposition is the preprocessing step for computing the
 *> Generalized Singular Value Decomposition (GSVD), see subroutine
 *> ZGGSVD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -236,10 +235,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -250,16 +248,14 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The subroutine uses LAPACK subroutine ZGEQPF for the QR factorization
 *>  with column pivoting to detect the effective numerical rank of the
 *>  a matrix. It may be replaced by a better rank determination strategy.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zgtcon.f b/SRC/zgtcon.f
index 7e958219..544abed7 100644
--- a/SRC/zgtcon.f
+++ b/SRC/zgtcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGTCON( NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND,
 *                          WORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         D( * ), DL( * ), DU( * ), DU2( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGTCON estimates the reciprocal of the condition number of a complex
 *> tridiagonal matrix A using the LU factorization as computed by
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgtrfs.f b/SRC/zgtrfs.f
index e6902eb9..78daea7e 100644
--- a/SRC/zgtrfs.f
+++ b/SRC/zgtrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGTRFS( TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2,
 *                          IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK,
@@ -34,20 +34,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is tridiagonal, and provides
 *> error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -185,16 +184,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgtsv.f b/SRC/zgtsv.f
index f80df4f8..cfef9289 100644
--- a/SRC/zgtsv.f
+++ b/SRC/zgtsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGTSV( N, NRHS, DL, D, DU, B, LDB, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         B( LDB, * ), D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGTSV  solves the equation
 *>
@@ -42,11 +42,10 @@
 *>
 *> Note that the equation  A**T *X = B  may be solved by interchanging the
 *> order of the arguments DU and DL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                has not been computed.  The factorization has not been
 *>                completed unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgtsvx.f b/SRC/zgtsvx.f
index 9bf49032..3b300c3b 100644
--- a/SRC/zgtsvx.f
+++ b/SRC/zgtsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGTSVX( FACT, TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF,
 *                          DU2, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGTSVX uses the LU factorization to compute the solution to a complex
 *> system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
@@ -48,9 +48,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -72,11 +75,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
@@ -274,10 +276,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 
diff --git a/SRC/zgttrf.f b/SRC/zgttrf.f
index cd46a004..c800e2ec 100644
--- a/SRC/zgttrf.f
+++ b/SRC/zgttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGTTRF( N, DL, D, DU, DU2, IPIV, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGTTRF computes an LU factorization of a complex tridiagonal matrix A
 *> using elimination with partial pivoting and row interchanges.
@@ -42,11 +42,10 @@
 *> where L is a product of permutation and unit lower bidiagonal
 *> matrices and U is upper triangular with nonzeros in only the main
 *> diagonal and first two superdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                singular, and division by zero will occur if it is used
 *>                to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgttrs.f b/SRC/zgttrs.f
index c90b88c4..02fa8aaf 100644
--- a/SRC/zgttrs.f
+++ b/SRC/zgttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGTTRS( TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB,
 *                          INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX*16         B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGTTRS solves one of the systems of equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by ZGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zgtts2.f b/SRC/zgtts2.f
index df39cae2..c608b83e 100644
--- a/SRC/zgtts2.f
+++ b/SRC/zgtts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZGTTS2( ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         B( LDB, * ), D( * ), DL( * ), DU( * ), DU2( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZGTTS2 solves one of the systems of equations
 *>    A * X = B,  A**T * X = B,  or  A**H * X = B,
 *> with a tridiagonal matrix A using the LU factorization computed
 *> by ZGTTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITRANS
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhbev.f b/SRC/zhbev.f
index 4d7f6f27..a8ce8338 100644
--- a/SRC/zhbev.f
+++ b/SRC/zhbev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBEV( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                         RWORK, INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX*16         AB( LDAB, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBEV computes all the eigenvalues and, optionally, eigenvectors of
 *> a complex Hermitian band matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -136,10 +135,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhbevd.f b/SRC/zhbevd.f
index cf745abb..1a791daf 100644
--- a/SRC/zhbevd.f
+++ b/SRC/zhbevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBEVD( JOBZ, UPLO, N, KD, AB, LDAB, W, Z, LDZ, WORK,
 *                          LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AB( LDAB, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBEVD computes all the eigenvalues and, optionally, eigenvectors of
 *> a complex Hermitian band matrix A.  If eigenvectors are desired, it
@@ -47,11 +47,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -199,10 +198,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhbevx.f b/SRC/zhbevx.f
index 16cb51e9..9af58270 100644
--- a/SRC/zhbevx.f
+++ b/SRC/zhbevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBEVX( JOBZ, RANGE, UPLO, N, KD, AB, LDAB, Q, LDQ, VL,
 *                          VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK,
@@ -34,21 +34,20 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian band matrix A.  Eigenvalues and eigenvectors
 *> can be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -243,10 +242,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhbgst.f b/SRC/zhbgst.f
index 82c1df9c..41fa819a 100644
--- a/SRC/zhbgst.f
+++ b/SRC/zhbgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBGST( VECT, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, X,
 *                          LDX, WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBGST reduces a complex Hermitian-definite banded generalized
 *> eigenproblem  A*x = lambda*B*x  to standard form  C*y = lambda*y,
@@ -45,11 +45,10 @@
 *> split Cholesky factorization. A is overwritten by C = X**H*A*X, where
 *> X = S**(-1)*Q and Q is a unitary matrix chosen to preserve the
 *> bandwidth of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -149,10 +148,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhbgv.f b/SRC/zhbgv.f
index 108c5403..d35c22f6 100644
--- a/SRC/zhbgv.f
+++ b/SRC/zhbgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBGV( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W, Z,
 *                         LDZ, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite banded eigenproblem, of
 *> the form A*x=(lambda)*B*x. Here A and B are assumed to be Hermitian
 *> and banded, and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -167,10 +166,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhbgvd.f b/SRC/zhbgvd.f
index 77f37dc3..02284e7b 100644
--- a/SRC/zhbgvd.f
+++ b/SRC/zhbgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
 *                          Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK,
@@ -34,11 +34,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite banded eigenproblem, of
@@ -52,11 +52,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -230,10 +229,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -244,17 +242,11 @@
 *
 *> \ingroup complex16OTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZHBGVD( JOBZ, UPLO, N, KA, KB, AB, LDAB, BB, LDBB, W,
      $                   Z, LDZ, WORK, LWORK, RWORK, LRWORK, IWORK,
diff --git a/SRC/zhbgvx.f b/SRC/zhbgvx.f
index c5bbfb86..6733eead 100644
--- a/SRC/zhbgvx.f
+++ b/SRC/zhbgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
 *                          LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
@@ -35,11 +35,11 @@
 *      $                   WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBGVX computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite banded eigenproblem, of
@@ -47,11 +47,10 @@
 *> and banded, and B is also positive definite.  Eigenvalues and
 *> eigenvectors can be selected by specifying either all eigenvalues,
 *> a range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -269,10 +268,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -283,17 +281,11 @@
 *
 *> \ingroup complex16OTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZHBGVX( JOBZ, RANGE, UPLO, N, KA, KB, AB, LDAB, BB,
      $                   LDBB, Q, LDQ, VL, VU, IL, IU, ABSTOL, M, W, Z,
diff --git a/SRC/zhbtrd.f b/SRC/zhbtrd.f
index 0fa7f4ea..4d940dfa 100644
--- a/SRC/zhbtrd.f
+++ b/SRC/zhbtrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHBTRD( VECT, UPLO, N, KD, AB, LDAB, D, E, Q, LDQ,
 *                          WORK, INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         AB( LDAB, * ), Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHBTRD reduces a complex Hermitian band matrix A to real symmetric
 *> tridiagonal form T by a unitary similarity transformation:
 *> Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -139,10 +138,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -153,14 +151,12 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by Linda Kaufman, Bell Labs.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhecon.f b/SRC/zhecon.f
index 8d2b8e01..a28825ec 100644
--- a/SRC/zhecon.f
+++ b/SRC/zhecon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHECON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHECON estimates the reciprocal of the condition number of a complex
 *> Hermitian matrix A using the factorization A = U*D*U**H or
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zheequb.f b/SRC/zheequb.f
index 67482904..a965211f 100644
--- a/SRC/zheequb.f
+++ b/SRC/zheequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYEQUB computes row and column scalings intended to equilibrate a
 *> symmetric matrix A and reduce its condition number
@@ -44,11 +44,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zheev.f b/SRC/zheev.f
index 3a0c65c2..9e54f883 100644
--- a/SRC/zheev.f
+++ b/SRC/zheev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEEV( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
 *                         INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEEV computes all eigenvalues and, optionally, eigenvectors of a
 *> complex Hermitian matrix A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zheevd.f b/SRC/zheevd.f
index 20d932a9..916b6173 100644
--- a/SRC/zheevd.f
+++ b/SRC/zheevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
 *                          LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEEVD computes all eigenvalues and, optionally, eigenvectors of a
 *> complex Hermitian matrix A.  If eigenvectors are desired, it uses a
@@ -47,11 +47,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -178,10 +177,9 @@
 *>                lying in rows and columns INFO/(N+1) through
 *>                mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -192,18 +190,16 @@
 *
 *> \ingroup complex16HEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
+*> \par Further Details:
+*  =====================
 *>
 *>  Modified description of INFO. Sven, 16 Feb 05.
-*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
 *>
 *  =====================================================================
       SUBROUTINE ZHEEVD( JOBZ, UPLO, N, A, LDA, W, WORK, LWORK, RWORK,
diff --git a/SRC/zheevr.f b/SRC/zheevr.f
index c59f26c0..261b3931 100644
--- a/SRC/zheevr.f
+++ b/SRC/zheevr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK,
@@ -34,11 +34,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEEVR computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian matrix A.  Eigenvalues and eigenvectors can
@@ -97,11 +97,10 @@
 *> hence may abort due to a floating point exception in environments
 *> which do not handle NaNs and infinities in the ieee standard default
 *> manner.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -321,10 +320,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  Internal error
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -335,21 +333,15 @@
 *
 *> \ingroup complex16HEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
+*>     Inderjit Dhillon, IBM Almaden, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
 *>     Ken Stanley, Computer Science Division, University of
-*>       California at Berkeley, USA
+*>       California at Berkeley, USA \n
 *>     Jason Riedy, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>
-*> \endverbatim
+*>       California at Berkeley, USA \n
 *>
 *  =====================================================================
       SUBROUTINE ZHEEVR( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
diff --git a/SRC/zheevx.f b/SRC/zheevx.f
index 02bac469..7ba66d05 100644
--- a/SRC/zheevx.f
+++ b/SRC/zheevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEEVX( JOBZ, RANGE, UPLO, N, A, LDA, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, LWORK, RWORK,
@@ -33,21 +33,20 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian matrix A.  Eigenvalues and eigenvectors can
 *> be selected by specifying either a range of values or a range of
 *> indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -235,10 +234,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhegs2.f b/SRC/zhegs2.f
index eaa65340..9aae29ca 100644
--- a/SRC/zhegs2.f
+++ b/SRC/zhegs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEGS2( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEGS2 reduces a complex Hermitian-definite generalized
 *> eigenproblem to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H *A*L.
 *>
 *> B must have been previously factorized as U**H *U or L*L**H by ZPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhegst.f b/SRC/zhegst.f
index dd95053d..ca867234 100644
--- a/SRC/zhegst.f
+++ b/SRC/zhegst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEGST( ITYPE, UPLO, N, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEGST reduces a complex Hermitian-definite generalized
 *> eigenproblem to standard form.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L.
 *>
 *> B must have been previously factorized as U**H*U or L*L**H by ZPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhegv.f b/SRC/zhegv.f
index f51a7df0..fbeacef7 100644
--- a/SRC/zhegv.f
+++ b/SRC/zhegv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEGV( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                         LWORK, RWORK, INFO )
@@ -30,22 +30,21 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEGV computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be Hermitian and B is also
 *> positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -165,10 +164,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhegvd.f b/SRC/zhegvd.f
index ca7c8435..c2d68af4 100644
--- a/SRC/zhegvd.f
+++ b/SRC/zhegvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
 *                          LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEGVD computes all the eigenvalues, and optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -49,11 +49,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -217,10 +216,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -231,20 +229,21 @@
 *
 *> \ingroup complex16HEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  Based on contributions by
-*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
+*> \verbatim
 *>
 *>  Modified so that no backsubstitution is performed if ZHEEVD fails to
 *>  converge (NEIG in old code could be greater than N causing out of
 *>  bounds reference to A - reported by Ralf Meyer).  Also corrected the
 *>  description of INFO and the test on ITYPE. Sven, 16 Feb 05.
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
 *>
 *  =====================================================================
       SUBROUTINE ZHEGVD( ITYPE, JOBZ, UPLO, N, A, LDA, B, LDB, W, WORK,
diff --git a/SRC/zhegvx.f b/SRC/zhegvx.f
index 331f6bbe..923bde81 100644
--- a/SRC/zhegvx.f
+++ b/SRC/zhegvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
 *                          VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
@@ -34,11 +34,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHEGVX computes selected eigenvalues, and optionally, eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -46,11 +46,10 @@
 *> B are assumed to be Hermitian and B is also positive definite.
 *> Eigenvalues and eigenvectors can be selected by specifying either a
 *> range of values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -276,10 +275,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -290,17 +288,11 @@
 *
 *> \ingroup complex16HEeigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZHEGVX( ITYPE, JOBZ, RANGE, UPLO, N, A, LDA, B, LDB,
      $                   VL, VU, IL, IU, ABSTOL, M, W, Z, LDZ, WORK,
diff --git a/SRC/zherfs.f b/SRC/zherfs.f
index eee0f291..c4ad1641 100644
--- a/SRC/zherfs.f
+++ b/SRC/zherfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHERFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -32,20 +32,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHERFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian indefinite, and
 *> provides error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -168,16 +167,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zherfsx.f b/SRC/zherfsx.f
index 0a5e13c7..ccc1715d 100644
--- a/SRC/zherfsx.f
+++ b/SRC/zherfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHERFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -37,13 +37,11 @@
 *      $                   ERR_BNDS_NORM( NRHS, * ),
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZHERFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is Hermitian indefinite, and
@@ -56,11 +54,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -385,10 +382,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhesv.f b/SRC/zhesv.f
index 837d60e8..9fe0da20 100644
--- a/SRC/zhesv.f
+++ b/SRC/zhesv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHESV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK,
 *                         LWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHESV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -48,11 +48,10 @@
 *> triangular matrices, and D is Hermitian and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.  The factored form of A is then
 *> used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhesvx.f b/SRC/zhesvx.f
index 86f88665..68a9a42b 100644
--- a/SRC/zhesvx.f
+++ b/SRC/zhesvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHESVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B,
 *                          LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHESVX uses the diagonal pivoting factorization to compute the
 *> solution to a complex system of linear equations A * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -74,11 +77,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
@@ -265,10 +267,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 
diff --git a/SRC/zhesvxx.f b/SRC/zhesvxx.f
index 01063ade..5437adb6 100644
--- a/SRC/zhesvxx.f
+++ b/SRC/zhesvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHESVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZHESVXX uses the diagonal pivoting factorization to compute the
 *>    solution to a complex*16 system of linear equations A * X = B, where
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what ZHESVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -108,11 +109,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(R) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -487,10 +487,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zheswapr.f b/SRC/zheswapr.f
index 80b01358..b1888d9a 100644
--- a/SRC/zheswapr.f
+++ b/SRC/zheswapr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHESWAPR( UPLO, N, A, LDA, I1, I2)
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       COMPLEX*16          A( LDA, N )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHESWAPR applies an elementary permutation on the rows and the columns of
 *> a hermitian matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          I2 is INTEGER
 *>          Index of the second row to swap
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhetd2.f b/SRC/zhetd2.f
index 1cf3f8e2..cc3bfd6b 100644
--- a/SRC/zhetd2.f
+++ b/SRC/zhetd2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETD2( UPLO, N, A, LDA, D, E, TAU, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETD2 reduces a complex Hermitian matrix A to real symmetric
 *> tridiagonal form T by a unitary similarity transformation:
 *> Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -128,10 +126,9 @@
 *
 *> \ingroup complex16HEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -173,7 +170,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhetf2.f b/SRC/zhetf2.f
index d28ba0a9..08f8b72c 100644
--- a/SRC/zhetf2.f
+++ b/SRC/zhetf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETF2( UPLO, N, A, LDA, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETF2 computes the factorization of a complex Hermitian matrix A
 *> using the Bunch-Kaufman diagonal pivoting method:
@@ -45,11 +45,10 @@
 *> Hermitian and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -110,10 +109,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -124,23 +122,10 @@
 *
 *> \ingroup complex16HEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  09-29-06 - patch from
-*>    Bobby Cheng, MathWorks
-*>
-*>    Replace l.210 and l.393
-*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
-*>    by
-*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN
-*>
-*>  01-01-96 - Based on modifications by
-*>    J. Lewis, Boeing Computer Services Company
-*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**H, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -175,9 +160,25 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*> \verbatim
+*>  09-29-06 - patch from
+*>    Bobby Cheng, MathWorks
+*>
+*>    Replace l.210 and l.393
+*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
+*>    by
+*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN
 *>
+*>  01-01-96 - Based on modifications by
+*>    J. Lewis, Boeing Computer Services Company
+*>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*> \endverbatim
+*
 *  =====================================================================
       SUBROUTINE ZHETF2( UPLO, N, A, LDA, IPIV, INFO )
 *
diff --git a/SRC/zhetrd.f b/SRC/zhetrd.f
index e2b1ae76..da010aa8 100644
--- a/SRC/zhetrd.f
+++ b/SRC/zhetrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETRD( UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETRD reduces a complex Hermitian matrix A to real symmetric
 *> tridiagonal form T by a unitary similarity transformation:
 *> Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -131,10 +130,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -145,10 +143,9 @@
 *
 *> \ingroup complex16HEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -190,7 +187,6 @@
 *>
 *>  where d and e denote diagonal and off-diagonal elements of T, and vi
 *>  denotes an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhetrf.f b/SRC/zhetrf.f
index 38c84d0d..ae79ea7f 100644
--- a/SRC/zhetrf.f
+++ b/SRC/zhetrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETRF computes the factorization of a complex Hermitian matrix A
 *> using the Bunch-Kaufman diagonal pivoting method.  The form of the
@@ -46,11 +46,10 @@
 *> 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -122,10 +121,9 @@
 *>                exactly singular, and division by zero will occur if it
 *>                is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,10 +134,9 @@
 *
 *> \ingroup complex16HEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**H, where
@@ -175,7 +172,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhetri.f b/SRC/zhetri.f
index d7e69fed..9d708e6a 100644
--- a/SRC/zhetri.f
+++ b/SRC/zhetri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETRI( UPLO, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETRI computes the inverse of a complex Hermitian indefinite matrix
 *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by
 *> ZHETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhetri2.f b/SRC/zhetri2.f
index a79684e6..bbc7371f 100644
--- a/SRC/zhetri2.f
+++ b/SRC/zhetri2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETRI2 computes the inverse of a COMPLEX*16 hermitian indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> ZHETRF. ZHETRI2 set the LEADING DIMENSION of the workspace
 *> before calling ZHETRI2X that actually computes the inverse.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhetri2x.f b/SRC/zhetri2x.f
index 789b88d5..056df054 100644
--- a/SRC/zhetri2x.f
+++ b/SRC/zhetri2x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16            A( LDA, * ), WORK( N+NB+1,* )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETRI2X computes the inverse of a COMPLEX*16 Hermitian indefinite matrix
 *> A using the factorization A = U*D*U**H or A = L*D*L**H computed by
 *> ZHETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhetrs.f b/SRC/zhetrs.f
index cd110ef0..2c45f86e 100644
--- a/SRC/zhetrs.f
+++ b/SRC/zhetrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETRS solves a system of linear equations A*X = B with a complex
 *> Hermitian matrix A using the factorization A = U*D*U**H or
 *> A = L*D*L**H computed by ZHETRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhetrs2.f b/SRC/zhetrs2.f
index 01ba7afc..5bc4d278 100644
--- a/SRC/zhetrs2.f
+++ b/SRC/zhetrs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHETRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, 
 *                           WORK, INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX*16       A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHETRS2 solves a system of linear equations A*X = B with a complex
 *> Hermitian matrix A using the factorization A = U*D*U**H or
 *> A = L*D*L**H computed by ZHETRF and converted by ZSYCONV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhfrk.f b/SRC/zhfrk.f
index 22375210..97445309 100644
--- a/SRC/zhfrk.f
+++ b/SRC/zhfrk.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA,
 *                         C )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * ), C( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for C in RFP Format.
 *>
@@ -49,11 +49,10 @@
 *> where alpha and beta are real scalars, C is an n--by--n Hermitian
 *> matrix and A is an n--by--k matrix in the first case and a k--by--n
 *> matrix in the second case.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -152,10 +151,9 @@
 *>           parts of the diagonal elements need not be set, they are
 *>           assumed to be zero, and on exit they are set to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhgeqz.f b/SRC/zhgeqz.f
index 9630edaa..bcec87c1 100644
--- a/SRC/zhgeqz.f
+++ b/SRC/zhgeqz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT,
 *                          ALPHA, BETA, Q, LDQ, Z, LDZ, WORK, LWORK,
@@ -33,11 +33,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHGEQZ computes the eigenvalues of a complex matrix pair (H,T),
 *> where H is an upper Hessenberg matrix and T is upper triangular,
@@ -81,11 +81,10 @@
 *> Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix
 *>      Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973),
 *>      pp. 241--256.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -258,10 +257,9 @@
 *>                     in Schur form, but ALPHA(i) and BETA(i),
 *>                     i=INFO-N+1,...,N should be correct.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -272,15 +270,13 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We assume that complex ABS works as long as its value is less than
 *>  overflow.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhpcon.f b/SRC/zhpcon.f
index 8c65b130..d4e67830 100644
--- a/SRC/zhpcon.f
+++ b/SRC/zhpcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPCON estimates the reciprocal of the condition number of a complex
 *> Hermitian packed matrix A using the factorization A = U*D*U**H or
@@ -42,11 +42,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhpev.f b/SRC/zhpev.f
index 11cc330e..38c9eecb 100644
--- a/SRC/zhpev.f
+++ b/SRC/zhpev.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPEV( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, RWORK,
 *                         INFO )
@@ -30,19 +30,18 @@
 *       COMPLEX*16         AP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPEV computes all the eigenvalues and, optionally, eigenvectors of a
 *> complex Hermitian matrix in packed storage.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -122,10 +121,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhpevd.f b/SRC/zhpevd.f
index 0b035545..319257ba 100644
--- a/SRC/zhpevd.f
+++ b/SRC/zhpevd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPEVD( JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, LWORK,
 *                          RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPEVD computes all the eigenvalues and, optionally, eigenvectors of
 *> a complex Hermitian matrix A in packed storage.  If eigenvectors are
@@ -47,11 +47,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -185,10 +184,9 @@
 *>                off-diagonal elements of an intermediate tridiagonal
 *>                form did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhpevx.f b/SRC/zhpevx.f
index 05590799..7523271d 100644
--- a/SRC/zhpevx.f
+++ b/SRC/zhpevx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPEVX( JOBZ, RANGE, UPLO, N, AP, VL, VU, IL, IU,
 *                          ABSTOL, M, W, Z, LDZ, WORK, RWORK, IWORK,
@@ -33,21 +33,20 @@
 *       COMPLEX*16         AP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPEVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex Hermitian matrix A in packed storage.
 *> Eigenvalues/vectors can be selected by specifying either a range of
 *> values or a range of indices for the desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -216,10 +215,9 @@
 *>          > 0:  if INFO = i, then i eigenvectors failed to converge.
 *>                Their indices are stored in array IFAIL.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhpgst.f b/SRC/zhpgst.f
index 41640849..1b563789 100644
--- a/SRC/zhpgst.f
+++ b/SRC/zhpgst.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPGST( ITYPE, UPLO, N, AP, BP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AP( * ), BP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPGST reduces a complex Hermitian-definite generalized
 *> eigenproblem to standard form, using packed storage.
@@ -44,11 +44,10 @@
 *> B*A*x = lambda*x, and A is overwritten by U*A*U**H or L**H*A*L.
 *>
 *> B must have been previously factorized as U**H*U or L*L**H by ZPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhpgv.f b/SRC/zhpgv.f
index 67f8674b..46e0e545 100644
--- a/SRC/zhpgv.f
+++ b/SRC/zhpgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPGV( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                         RWORK, INFO )
@@ -30,22 +30,21 @@
 *       COMPLEX*16         AP( * ), BP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPGV computes all the eigenvalues and, optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
 *> A*x=(lambda)*B*x,  A*Bx=(lambda)*x,  or B*A*x=(lambda)*x.
 *> Here A and B are assumed to be Hermitian, stored in packed format,
 *> and B is also positive definite.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -149,10 +148,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhpgvd.f b/SRC/zhpgvd.f
index 76cf7d82..5abe0ed2 100644
--- a/SRC/zhpgvd.f
+++ b/SRC/zhpgvd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
 *                          LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AP( * ), BP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPGVD computes all the eigenvalues and, optionally, the eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -50,11 +50,10 @@
 *> digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or
 *> Cray-2. It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -210,10 +209,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -224,17 +222,11 @@
 *
 *> \ingroup complex16OTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZHPGVD( ITYPE, JOBZ, UPLO, N, AP, BP, W, Z, LDZ, WORK,
      $                   LWORK, RWORK, LRWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/zhpgvx.f b/SRC/zhpgvx.f
index 42821bde..153d598f 100644
--- a/SRC/zhpgvx.f
+++ b/SRC/zhpgvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
 *                          IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK,
@@ -33,11 +33,11 @@
 *       COMPLEX*16         AP( * ), BP( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPGVX computes selected eigenvalues and, optionally, eigenvectors
 *> of a complex generalized Hermitian-definite eigenproblem, of the form
@@ -46,11 +46,10 @@
 *> positive definite.  Eigenvalues and eigenvectors can be selected by
 *> specifying either a range of values or a range of indices for the
 *> desired eigenvalues.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ITYPE
 *> \verbatim
@@ -246,10 +245,9 @@
 *>                    The factorization of B could not be completed and
 *>                    no eigenvalues or eigenvectors were computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -260,17 +258,11 @@
 *
 *> \ingroup complex16OTHEReigen
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Mark Fahey, Department of Mathematics, Univ. of Kentucky, USA
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZHPGVX( ITYPE, JOBZ, RANGE, UPLO, N, AP, BP, VL, VU,
      $                   IL, IU, ABSTOL, M, W, Z, LDZ, WORK, RWORK,
diff --git a/SRC/zhprfs.f b/SRC/zhprfs.f
index 214fc50a..81edba3f 100644
--- a/SRC/zhprfs.f
+++ b/SRC/zhprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -32,21 +32,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian indefinite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -156,16 +155,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhpsv.f b/SRC/zhpsv.f
index 2e6cc1b8..569f3cde 100644
--- a/SRC/zhpsv.f
+++ b/SRC/zhpsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -47,11 +47,10 @@
 *> triangular matrices, D is Hermitian and block diagonal with 1-by-1
 *> and 2-by-2 diagonal blocks.  The factored form of A is then used to
 *> solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, so the solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -160,7 +157,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhpsvx.f b/SRC/zhpsvx.f
index 95b1ecb7..a53b7f7d 100644
--- a/SRC/zhpsvx.f
+++ b/SRC/zhpsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X,
 *                          LDX, RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPSVX uses the diagonal pivoting factorization A = U*D*U**H or
 *> A = L*D*L**H to compute the solution to a complex system of linear
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -72,11 +75,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
@@ -238,10 +240,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 
@@ -252,10 +253,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -271,7 +271,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhptrd.f b/SRC/zhptrd.f
index a7e5324e..08011db9 100644
--- a/SRC/zhptrd.f
+++ b/SRC/zhptrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPTRD( UPLO, N, AP, D, E, TAU, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPTRD reduces a complex Hermitian matrix A stored in packed form to
 *> real symmetric tridiagonal form T by a unitary similarity
 *> transformation: Q**H * A * Q = T.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -104,10 +103,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -118,10 +116,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -149,7 +146,6 @@
 *>  where tau is a complex scalar, and v is a complex vector with
 *>  v(1:i) = 0 and v(i+1) = 1; v(i+2:n) is stored on exit in AP,
 *>  overwriting A(i+2:n,i), and tau is stored in TAU(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhptrf.f b/SRC/zhptrf.f
index 97007053..07c5a824 100644
--- a/SRC/zhptrf.f
+++ b/SRC/zhptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPTRF( UPLO, N, AP, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPTRF computes the factorization of a complex Hermitian packed
 *> matrix A using the Bunch-Kaufman diagonal pivoting method:
@@ -43,11 +43,10 @@
 *> where U (or L) is a product of permutation and unit upper (lower)
 *> triangular matrices, and D is Hermitian and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -113,14 +111,10 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  5-96 - Based on modifications by J. Lewis, Boeing Computer Services
-*>         Company
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**H, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -155,9 +149,13 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
+*>  J. Lewis, Boeing Computer Services Company
+*
 *  =====================================================================
       SUBROUTINE ZHPTRF( UPLO, N, AP, IPIV, INFO )
 *
diff --git a/SRC/zhptri.f b/SRC/zhptri.f
index 7cc6a139..7009e612 100644
--- a/SRC/zhptri.f
+++ b/SRC/zhptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPTRI( UPLO, N, AP, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPTRI computes the inverse of a complex Hermitian indefinite matrix
 *> A in packed storage using the factorization A = U*D*U**H or
 *> A = L*D*L**H computed by ZHPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhptrs.f b/SRC/zhptrs.f
index d05c0467..f7c25511 100644
--- a/SRC/zhptrs.f
+++ b/SRC/zhptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHPTRS solves a system of linear equations A*X = B with a complex
 *> Hermitian matrix A stored in packed format using the factorization
 *> A = U*D*U**H or A = L*D*L**H computed by ZHPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zhsein.f b/SRC/zhsein.f
index cd74d721..d2f4f7b9 100644
--- a/SRC/zhsein.f
+++ b/SRC/zhsein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHSEIN( SIDE, EIGSRC, INITV, SELECT, N, H, LDH, W, VL,
 *                          LDVL, VR, LDVR, MM, M, WORK, RWORK, IFAILL,
@@ -34,11 +34,11 @@
 *      $                   W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZHSEIN uses inverse iteration to find specified right and/or left
 *> eigenvectors of a complex upper Hessenberg matrix H.
@@ -49,11 +49,10 @@
 *>              H * x = w * x,     y**h * H = w * y**h
 *>
 *> where y**h denotes the conjugate transpose of the vector y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -217,10 +216,9 @@
 *>                failed to converge; see IFAILL and IFAILR for further
 *>                details.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -231,16 +229,14 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x|+|y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zhseqr.f b/SRC/zhseqr.f
index 00856d8b..1cf8802d 100644
--- a/SRC/zhseqr.f
+++ b/SRC/zhseqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ,
 *                          WORK, LWORK, INFO )
@@ -28,13 +28,12 @@
 *       .. Array Arguments ..
 *       COMPLEX*16         H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
-*  Purpose
-*  =======
+*  
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZHSEQR computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -45,11 +44,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the unitary matrix Q:  A = Q*H*Q**H = (QZ)*H*(QZ)**H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -209,10 +207,9 @@
 *>                If INFO .GT. 0 and COMPZ = 'N', then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -223,6 +220,81 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
+*> \par Contributors:
+*  ==================
+*>
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
+*>
+*>             Default values supplied by
+*>             ILAENV(ISPEC,'ZHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
+*>             It is suggested that these defaults be adjusted in order
+*>             to attain best performance in each particular
+*>             computational environment.
+*>
+*>            ISPEC=12: The ZLAHQR vs ZLAQR0 crossover point.
+*>                      Default: 75. (Must be at least 11.)
+*>
+*>            ISPEC=13: Recommended deflation window size.
+*>                      This depends on ILO, IHI and NS.  NS is the
+*>                      number of simultaneous shifts returned
+*>                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
+*>                      The default for (IHI-ILO+1).LE.500 is NS.
+*>                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
+*>
+*>            ISPEC=14: Nibble crossover point. (See IPARMQ for
+*>                      details.)  Default: 14% of deflation window
+*>                      size.
+*>
+*>            ISPEC=15: Number of simultaneous shifts in a multishift
+*>                      QR iteration.
+*>
+*>                      If IHI-ILO+1 is ...
+*>
+*>                      greater than      ...but less    ... the
+*>                      or equal to ...      than        default is
+*>
+*>                           1               30          NS =   2(+)
+*>                          30               60          NS =   4(+)
+*>                          60              150          NS =  10(+)
+*>                         150              590          NS =  **
+*>                         590             3000          NS =  64
+*>                        3000             6000          NS = 128
+*>                        6000             infinity      NS = 256
+*>
+*>                  (+)  By default some or all matrices of this order
+*>                       are passed to the implicit double shift routine
+*>                       ZLAHQR and this parameter is ignored.  See
+*>                       ISPEC=12 above and comments in IPARMQ for
+*>                       details.
+*>
+*>                 (**)  The asterisks (**) indicate an ad-hoc
+*>                       function of N increasing from 10 to 64.
+*>
+*>            ISPEC=16: Select structured matrix multiply.
+*>                      If the number of simultaneous shifts (specified
+*>                      by ISPEC=15) is less than 14, then the default
+*>                      for ISPEC=16 is 0.  Otherwise the default for
+*>                      ISPEC=16 is 2.
+*> \endverbatim
+*
+*> \par References:
+*  ================
+*>
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
+*> \n
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
+*>       of Matrix Analysis, volume 23, pages 948--973, 2002.
+*
 *  =====================================================================
       SUBROUTINE ZHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ,
      $                   WORK, LWORK, INFO )
@@ -239,75 +311,9 @@
 *     .. Array Arguments ..
       COMPLEX*16         H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * )
 *     ..
-*  ================================================================
-*             Default values supplied by
-*             ILAENV(ISPEC,'ZHSEQR',JOB(:1)//COMPZ(:1),N,ILO,IHI,LWORK).
-*             It is suggested that these defaults be adjusted in order
-*             to attain best performance in each particular
-*             computational environment.
-*
-*            ISPEC=12: The ZLAHQR vs ZLAQR0 crossover point.
-*                      Default: 75. (Must be at least 11.)
-*
-*            ISPEC=13: Recommended deflation window size.
-*                      This depends on ILO, IHI and NS.  NS is the
-*                      number of simultaneous shifts returned
-*                      by ILAENV(ISPEC=15).  (See ISPEC=15 below.)
-*                      The default for (IHI-ILO+1).LE.500 is NS.
-*                      The default for (IHI-ILO+1).GT.500 is 3*NS/2.
-*
-*            ISPEC=14: Nibble crossover point. (See IPARMQ for
-*                      details.)  Default: 14% of deflation window
-*                      size.
-*
-*            ISPEC=15: Number of simultaneous shifts in a multishift
-*                      QR iteration.
-*
-*                      If IHI-ILO+1 is ...
-*
-*                      greater than      ...but less    ... the
-*                      or equal to ...      than        default is
-*
-*                           1               30          NS =   2(+)
-*                          30               60          NS =   4(+)
-*                          60              150          NS =  10(+)
-*                         150              590          NS =  **
-*                         590             3000          NS =  64
-*                        3000             6000          NS = 128
-*                        6000             infinity      NS = 256
-*
-*                  (+)  By default some or all matrices of this order
-*                       are passed to the implicit double shift routine
-*                       ZLAHQR and this parameter is ignored.  See
-*                       ISPEC=12 above and comments in IPARMQ for
-*                       details.
-*
-*                 (**)  The asterisks (**) indicate an ad-hoc
-*                       function of N increasing from 10 to 64.
-*
-*            ISPEC=16: Select structured matrix multiply.
-*                      If the number of simultaneous shifts (specified
-*                      by ISPEC=15) is less than 14, then the default
-*                      for ISPEC=16 is 0.  Otherwise the default for
-*                      ISPEC=16 is 2.
-*
-*  ================================================================
-*     Based on contributions by
-*        Karen Braman and Ralph Byers, Department of Mathematics,
-*        University of Kansas, USA
-*
-*  ================================================================
-*     References:
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
-*       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
-*       929--947, 2002.
-*
-*       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
-*       of Matrix Analysis, volume 23, pages 948--973, 2002.
-*
-*  ================================================================
+*
+*  =====================================================================
+*
 *     .. Parameters ..
 *
 *     ==== Matrices of order NTINY or smaller must be processed by
diff --git a/SRC/zla_gbamv.f b/SRC/zla_gbamv.f
index 1b9fa777..974bd9f1 100644
--- a/SRC/zla_gbamv.f
+++ b/SRC/zla_gbamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_GBAMV( TRANS, M, N, KL, KU, ALPHA, AB, LDAB, X,
 *                             INCX, BETA, Y, INCY )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_GBAMV  performs one of the matrix-vector operations
 *>
@@ -52,11 +52,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -170,10 +169,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gbrcond_c.f b/SRC/zla_gbrcond_c.f
index ca28ce68..28574538 100644
--- a/SRC/zla_gbrcond_c.f
+++ b/SRC/zla_gbrcond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_GBRCOND_C( TRANS, N, KL, KU, AB, 
 *                                                LDAB, AFB, LDAFB, IPIV,
@@ -34,19 +34,18 @@
 *       DOUBLE PRECISION   C( * ), RWORK( * )
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_GBRCOND_C Computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -145,10 +144,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gbrcond_x.f b/SRC/zla_gbrcond_x.f
index f40fd190..3e013f5a 100644
--- a/SRC/zla_gbrcond_x.f
+++ b/SRC/zla_gbrcond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_GBRCOND_X( TRANS, N, KL, KU, AB,
 *                                                LDAB, AFB, LDAFB, IPIV,
@@ -33,19 +33,18 @@
 *       DOUBLE PRECISION   RWORK( * )
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_GBRCOND_X Computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX*16 vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -138,10 +137,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gbrfsx_extended.f b/SRC/zla_gbrfsx_extended.f
index 3df873a4..c82f513f 100644
--- a/SRC/zla_gbrfsx_extended.f
+++ b/SRC/zla_gbrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU,
 *                                       NRHS, AB, LDAB, AFB, LDAFB, IPIV,
@@ -41,11 +41,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_GBRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -391,10 +390,9 @@
 *>       < 0:  if INFO = -i, the ith argument to ZGBTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gbrpvgrw.f b/SRC/zla_gbrpvgrw.f
index 6fb77caa..ce17d2a9 100644
--- a/SRC/zla_gbrpvgrw.f
+++ b/SRC/zla_gbrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_GBRPVGRW( N, KL, KU, NCOLS, AB,
 *                                               LDAB, AFB, LDAFB )
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AB( LDAB, * ), AFB( LDAFB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_GBRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -40,11 +40,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -101,10 +100,9 @@
 *>          LDAFB is INTEGER
 *>     The leading dimension of the array AFB.  LDAFB >= 2*KL+KU+1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_geamv.f b/SRC/zla_geamv.f
index cbf1516a..b7ee5a10 100644
--- a/SRC/zla_geamv.f
+++ b/SRC/zla_geamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA,
 *                              Y, INCY )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_GEAMV  performs one of the matrix-vector operations
 *>
@@ -53,11 +53,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -159,10 +158,9 @@
 *>
 *>  Level 2 Blas routine.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gercond_c.f b/SRC/zla_gercond_c.f
index 6850b54b..c707ad26 100644
--- a/SRC/zla_gercond_c.f
+++ b/SRC/zla_gercond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_GERCOND_C( TRANS, N, A, LDA, AF, 
 *                                                LDAF, IPIV, C, CAPPLY,
@@ -33,19 +33,18 @@
 *       DOUBLE PRECISION   C( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_GERCOND_C computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -126,10 +125,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gercond_x.f b/SRC/zla_gercond_x.f
index f25c805a..07a2bb99 100644
--- a/SRC/zla_gercond_x.f
+++ b/SRC/zla_gercond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_GERCOND_X( TRANS, N, A, LDA, AF,
 *                                                LDAF, IPIV, X, INFO,
@@ -32,19 +32,18 @@
 *       DOUBLE PRECISION   RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_GERCOND_X computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX*16 vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -119,10 +118,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gerfsx_extended.f b/SRC/zla_gerfsx_extended.f
index 1ca6dd37..01f1bd73 100644
--- a/SRC/zla_gerfsx_extended.f
+++ b/SRC/zla_gerfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A,
 *                                       LDA, AF, LDAF, IPIV, COLEQU, C, B,
@@ -40,11 +40,11 @@
 *      $                   ERRS_N( NRHS, * ), ERRS_C( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_GERFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -55,11 +55,10 @@
 *> and ERRS_C for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERRS_N and ERRS_C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -378,10 +377,9 @@
 *>       < 0:  if INFO = -i, the ith argument to ZGETRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_gerpvgrw.f b/SRC/zla_gerpvgrw.f
index 65d38c94..5ee1a6f0 100644
--- a/SRC/zla_gerpvgrw.f
+++ b/SRC/zla_gerpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_GERPVGRW( N, NCOLS, A, LDA, AF,
 *                LDAF )
@@ -28,11 +28,12 @@
 *       COMPLEX*16         A( LDA, * ), AF( LDAF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> ZLA_GERPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -40,11 +41,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -83,10 +83,9 @@
 *>          LDAF is INTEGER
 *>     The leading dimension of the array AF.  LDAF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_heamv.f b/SRC/zla_heamv.f
index 616c3864..5805a671 100644
--- a/SRC/zla_heamv.f
+++ b/SRC/zla_heamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_HEAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y,
 *                             INCY )
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_SYAMV  performs the matrix-vector operation
 *>
@@ -51,11 +51,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -146,10 +145,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -160,10 +158,9 @@
 *
 *> \ingroup complex16HEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Level 2 Blas routine.
@@ -175,7 +172,6 @@
 *>     Richard Hanson, Sandia National Labs.
 *>  -- Modified for the absolute-value product, April 2006
 *>     Jason Riedy, UC Berkeley
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zla_hercond_c.f b/SRC/zla_hercond_c.f
index e572790f..ae7dbad3 100644
--- a/SRC/zla_hercond_c.f
+++ b/SRC/zla_hercond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_HERCOND_C( UPLO, N, A, LDA, AF, 
 *                                                LDAF, IPIV, C, CAPPLY,
@@ -33,19 +33,18 @@
 *       DOUBLE PRECISION   C ( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_HERCOND_C computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -123,10 +122,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_hercond_x.f b/SRC/zla_hercond_x.f
index b317c2ed..0cc6ce55 100644
--- a/SRC/zla_hercond_x.f
+++ b/SRC/zla_hercond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_HERCOND_X( UPLO, N, A, LDA, AF,
 *                                                LDAF, IPIV, X, INFO,
@@ -32,19 +32,18 @@
 *       DOUBLE PRECISION   RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_HERCOND_X computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX*16 vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_herfsx_extended.f b/SRC/zla_herfsx_extended.f
index bd075d97..d2f88adc 100644
--- a/SRC/zla_herfsx_extended.f
+++ b/SRC/zla_herfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_HERFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, IPIV, COLEQU, C, B, LDB,
@@ -42,11 +42,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_HERFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -57,11 +57,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -377,10 +376,9 @@
 *>       < 0:  if INFO = -i, the ith argument to ZHETRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_herpvgrw.f b/SRC/zla_herpvgrw.f
index 65a67390..915e34db 100644
--- a/SRC/zla_herpvgrw.f
+++ b/SRC/zla_herpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_HERPVGRW( UPLO, N, INFO, A, LDA, AF,
 *                                               LDAF, IPIV, WORK )
@@ -31,11 +31,12 @@
 *       DOUBLE PRECISION   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> ZLA_HERPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -43,11 +44,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +106,9 @@
 *> \verbatim
 *>          WORK is COMPLEX*16 array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_lin_berr.f b/SRC/zla_lin_berr.f
index dbeddca1..e4414aa9 100644
--- a/SRC/zla_lin_berr.f
+++ b/SRC/zla_lin_berr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_LIN_BERR ( N, NZ, NRHS, RES, AYB, BERR )
 * 
@@ -28,22 +28,21 @@
 *       COMPLEX*16         RES( N, NRHS )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_LIN_BERR computes componentwise relative backward error from
 *>    the formula
 *>        max(i) ( abs(R(i)) / ( abs(op(A_s))*abs(Y) + abs(B_s) )(i) )
 *>    where abs(Z) is the componentwise absolute value of the matrix
 *>    or vector Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -86,10 +85,9 @@
 *>          BERR is COMPLEX*16 array, dimension (NRHS)
 *>     The componentwise relative backward error from the formula above.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_porcond_c.f b/SRC/zla_porcond_c.f
index 2338a9ef..43fa1fb6 100644
--- a/SRC/zla_porcond_c.f
+++ b/SRC/zla_porcond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_PORCOND_C( UPLO, N, A, LDA, AF, 
 *                                                LDAF, C, CAPPLY, INFO,
@@ -32,19 +32,18 @@
 *       DOUBLE PRECISION   C( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_PORCOND_C Computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_porcond_x.f b/SRC/zla_porcond_x.f
index 7cc09737..fac935ac 100644
--- a/SRC/zla_porcond_x.f
+++ b/SRC/zla_porcond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_PORCOND_X( UPLO, N, A, LDA, AF,
 *                                                LDAF, X, INFO, WORK,
@@ -31,19 +31,18 @@
 *       DOUBLE PRECISION   RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_PORCOND_X Computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX*16 vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_porfsx_extended.f b/SRC/zla_porfsx_extended.f
index 53eaefc2..e13e64fe 100644
--- a/SRC/zla_porfsx_extended.f
+++ b/SRC/zla_porfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, COLEQU, C, B, LDB, Y,
@@ -41,11 +41,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_PORFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -56,11 +56,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -369,10 +368,9 @@
 *>       < 0:  if INFO = -i, the ith argument to ZPOTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_porpvgrw.f b/SRC/zla_porpvgrw.f
index e72f1d41..56a8cd24 100644
--- a/SRC/zla_porpvgrw.f
+++ b/SRC/zla_porpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_PORPVGRW( UPLO, NCOLS, A, LDA, AF, 
 *                                               LDAF, WORK )
@@ -30,11 +30,12 @@
 *       DOUBLE PRECISION   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> ZLA_PORPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -42,11 +43,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -90,10 +90,9 @@
 *> \verbatim
 *>          WORK is COMPLEX*16 array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_syamv.f b/SRC/zla_syamv.f
index 3d1e6918..66ae39fa 100644
--- a/SRC/zla_syamv.f
+++ b/SRC/zla_syamv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_SYAMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y,
 *                             INCY )
@@ -31,11 +31,11 @@
 *       DOUBLE PRECISION   Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_SYAMV  performs the matrix-vector operation
 *>
@@ -52,11 +52,10 @@
 *> "symbolically" zero components are not perturbed.  A zero
 *> entry is considered "symbolic" if all multiplications involved
 *> in computing that entry have at least one zero multiplicand.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -147,10 +146,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -161,10 +159,9 @@
 *
 *> \ingroup complex16SYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Level 2 Blas routine.
@@ -176,7 +173,6 @@
 *>     Richard Hanson, Sandia National Labs.
 *>  -- Modified for the absolute-value product, April 2006
 *>     Jason Riedy, UC Berkeley
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zla_syrcond_c.f b/SRC/zla_syrcond_c.f
index 39704502..1d553ea1 100644
--- a/SRC/zla_syrcond_c.f
+++ b/SRC/zla_syrcond_c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_SYRCOND_C( UPLO, N, A, LDA, AF,
 *                                                LDAF, IPIV, C, CAPPLY,
@@ -33,19 +33,18 @@
 *       DOUBLE PRECISION   C( * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_SYRCOND_C Computes the infinity norm condition number of
 *>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -123,10 +122,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_syrcond_x.f b/SRC/zla_syrcond_x.f
index 3ada9613..8d86dd27 100644
--- a/SRC/zla_syrcond_x.f
+++ b/SRC/zla_syrcond_x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_SYRCOND_X( UPLO, N, A, LDA, AF,
 *                                                LDAF, IPIV, X, INFO,
@@ -32,19 +32,18 @@
 *       DOUBLE PRECISION   RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_SYRCOND_X Computes the infinity norm condition number of
 *>    op(A) * diag(X) where X is a COMPLEX*16 vector.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          RWORK is DOUBLE PRECISION array, dimension (N).
 *>     Workspace.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_syrfsx_extended.f b/SRC/zla_syrfsx_extended.f
index ae0c7ae6..4e6079ad 100644
--- a/SRC/zla_syrfsx_extended.f
+++ b/SRC/zla_syrfsx_extended.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA,
 *                                       AF, LDAF, IPIV, COLEQU, C, B, LDB,
@@ -42,11 +42,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLA_SYRFSX_EXTENDED improves the computed solution to a system of
 *> linear equations by performing extra-precise iterative refinement
@@ -57,11 +57,10 @@
 *> and ERR_BNDS_COMP for details of the error bounds. Note that this
 *> subroutine is only resonsible for setting the second fields of
 *> ERR_BNDS_NORM and ERR_BNDS_COMP.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] PREC_TYPE
 *> \verbatim
@@ -377,10 +376,9 @@
 *>       < 0:  if INFO = -i, the ith argument to ZSYTRS had an illegal
 *>             value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_syrpvgrw.f b/SRC/zla_syrpvgrw.f
index f918c914..fa393015 100644
--- a/SRC/zla_syrpvgrw.f
+++ b/SRC/zla_syrpvgrw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLA_SYRPVGRW( UPLO, N, INFO, A, LDA, AF,
 *                                               LDAF, IPIV, WORK )
@@ -31,11 +31,12 @@
 *       INTEGER            IPIV( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
+*>
 *> 
 *> ZLA_SYRPVGRW computes the reciprocal pivot growth factor
 *> norm(A)/norm(U). The "max absolute element" norm is used. If this is
@@ -43,11 +44,10 @@
 *> (equilibrated) matrix A could be poor. This also means that the
 *> solution X, estimated condition numbers, and error bounds could be
 *> unreliable.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +106,9 @@
 *> \verbatim
 *>          WORK is COMPLEX*16 array, dimension (2*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zla_wwaddw.f b/SRC/zla_wwaddw.f
index f1483cc0..4b04b739 100644
--- a/SRC/zla_wwaddw.f
+++ b/SRC/zla_wwaddw.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLA_WWADDW( N, X, Y, W )
 * 
@@ -27,23 +27,20 @@
 *       COMPLEX*16         X( * ), Y( * ), W( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLA_WWADDW adds a vector W into a doubled-single vector (X, Y).
 *>
 *>    This works for all extant IBM's hex and binary floating point
 *>    arithmetics, but not for decimal.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -68,10 +65,9 @@
 *>          W is COMPLEX*16 array, dimension (N)
 *>            The vector to be added.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlabrd.f b/SRC/zlabrd.f
index 7d25830b..a5af6ff5 100644
--- a/SRC/zlabrd.f
+++ b/SRC/zlabrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y,
 *                          LDY )
@@ -30,11 +30,11 @@
 *      $                   Y( LDY, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLABRD reduces the first NB rows and columns of a complex general
 *> m by n matrix A to upper or lower real bidiagonal form by a unitary
@@ -45,11 +45,10 @@
 *> bidiagonal form.
 *>
 *> This is an auxiliary routine called by ZGEBRD
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -149,10 +148,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -163,10 +161,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrices Q and P are represented as products of elementary
@@ -209,7 +206,6 @@
 *>  where a denotes an element of the original matrix which is unchanged,
 *>  vi denotes an element of the vector defining H(i), and ui an element
 *>  of the vector defining G(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlacgv.f b/SRC/zlacgv.f
index 72530fed..c334ff45 100644
--- a/SRC/zlacgv.f
+++ b/SRC/zlacgv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLACGV( N, X, INCX )
 * 
@@ -27,18 +27,17 @@
 *       COMPLEX*16         X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
 *>
-*> ZLACGV conjugates a complex vector of length N.
+*> \verbatim
 *>
-*>\endverbatim
+*> ZLACGV conjugates a complex vector of length N.
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -59,10 +58,9 @@
 *>          INCX is INTEGER
 *>          The spacing between successive elements of X.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlacn2.f b/SRC/zlacn2.f
index f0de9adb..dbcd777d 100644
--- a/SRC/zlacn2.f
+++ b/SRC/zlacn2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLACN2( N, V, X, EST, KASE, ISAVE )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX*16         V( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLACN2 estimates the 1-norm of a square, complex matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          ISAVE is INTEGER array, dimension (3)
 *>         ISAVE is used to save variables between calls to ZLACN2
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -102,19 +100,13 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
-*>  Contributed by Nick Higham, University of Manchester.
 *>  Originally named CONEST, dated March 16, 1988.
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
-*>  a real or complex matrix, with applications to condition estimation",
-*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
-*>
 *>  Last modified:  April, 1999
 *>
 *>  This is a thread safe version of ZLACON, which uses the array ISAVE
@@ -124,8 +116,19 @@
 *>      JUMP     ISAVE(1)
 *>      J        ISAVE(2)
 *>      ITER     ISAVE(3)
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Nick Higham, University of Manchester
+*
+*> \par References:
+*  ================
+*>
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  a real or complex matrix, with applications to condition estimation",
+*>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
 *  =====================================================================
       SUBROUTINE ZLACN2( N, V, X, EST, KASE, ISAVE )
diff --git a/SRC/zlacon.f b/SRC/zlacon.f
index de548775..da6f13cd 100644
--- a/SRC/zlacon.f
+++ b/SRC/zlacon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLACON( N, V, X, EST, KASE )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         V( N ), X( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLACON estimates the 1-norm of a square, complex matrix A.
 *> Reverse communication is used for evaluating matrix-vector products.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -81,10 +80,9 @@
 *>         whether X should be overwritten by A * X  or A**H * X.
 *>         On the final return from ZLACON, KASE will again be 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -95,23 +93,24 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
+*> \par Further Details:
+*  =====================
+*>
+*>  Originally named CONEST, dated March 16, 1988. \n
+*>  Last modified:  April, 1999
 *
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Contributed by Nick Higham, University of Manchester.
-*>  Originally named CONEST, dated March 16, 1988.
+*>     Nick Higham, University of Manchester
+*
+*> \par References:
+*  ================
 *>
-*>  Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
+*>  N.J. Higham, "FORTRAN codes for estimating the one-norm of
 *>  a real or complex matrix, with applications to condition estimation",
 *>  ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
 *>
-*>  Last modified:  April, 1999
-*>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZLACON( N, V, X, EST, KASE )
 *
diff --git a/SRC/zlacp2.f b/SRC/zlacp2.f
index 00778eb7..8433e5d2 100644
--- a/SRC/zlacp2.f
+++ b/SRC/zlacp2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLACP2( UPLO, M, N, A, LDA, B, LDB )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX*16         B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLACP2 copies all or part of a real two-dimensional matrix A to a
 *> complex matrix B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlacpy.f b/SRC/zlacpy.f
index 9ce09202..9218ee30 100644
--- a/SRC/zlacpy.f
+++ b/SRC/zlacpy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLACPY( UPLO, M, N, A, LDA, B, LDB )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLACPY copies all or part of a two-dimensional matrix A to another
 *> matrix B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -88,10 +87,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlacrm.f b/SRC/zlacrm.f
index c06abf16..577db9b9 100644
--- a/SRC/zlacrm.f
+++ b/SRC/zlacrm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLACRM( M, N, A, LDA, B, LDB, C, LDC, RWORK )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLACRM performs a very simple matrix-matrix multiplication:
 *>          C := A * B,
 *> where A is M by N and complex; B is N by N and real;
 *> C is M by N and complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *> \verbatim
 *>          RWORK is DOUBLE PRECISION array, dimension (2*M*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlacrt.f b/SRC/zlacrt.f
index 8bc43b44..0e66d8e6 100644
--- a/SRC/zlacrt.f
+++ b/SRC/zlacrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLACRT( N, CX, INCX, CY, INCY, C, S )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         CX( * ), CY( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLACRT performs the operation
 *>
@@ -40,11 +40,10 @@
 *>    ( -s  c )( y )      ( y )
 *>
 *> where c and s are complex and the vectors x and y are complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>             [  C   S  ].
 *>             [ -S   C  ]
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zladiv.f b/SRC/zladiv.f
index 9a6ea941..56f57b15 100644
--- a/SRC/zladiv.f
+++ b/SRC/zladiv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       COMPLEX*16     FUNCTION ZLADIV( X, Y )
 * 
@@ -24,20 +24,19 @@
 *       COMPLEX*16         X, Y
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLADIV := X / Y, where X and Y are complex.  The computation of X / Y
 *> will not overflow on an intermediary step unless the results
 *> overflows.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] X
 *> \verbatim
@@ -49,10 +48,9 @@
 *>          Y is COMPLEX*16
 *>          The complex scalars X and Y.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaed0.f b/SRC/zlaed0.f
index 68a86b3d..09b73d27 100644
--- a/SRC/zlaed0.f
+++ b/SRC/zlaed0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAED0( QSIZ, N, D, E, Q, LDQ, QSTORE, LDQS, RWORK,
 *                          IWORK, INFO )
@@ -30,21 +30,20 @@
 *       COMPLEX*16         Q( LDQ, * ), QSTORE( LDQS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Using the divide and conquer method, ZLAED0 computes all eigenvalues
 *> of a symmetric tridiagonal matrix which is one diagonal block of
 *> those from reducing a dense or band Hermitian matrix and
 *> corresponding eigenvectors of the dense or band matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] QSIZ
 *> \verbatim
@@ -129,10 +128,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaed7.f b/SRC/zlaed7.f
index f8891942..fd160c90 100644
--- a/SRC/zlaed7.f
+++ b/SRC/zlaed7.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAED7( N, CUTPNT, QSIZ, TLVLS, CURLVL, CURPBM, D, Q,
 *                          LDQ, RHO, INDXQ, QSTORE, QPTR, PRMPTR, PERM,
@@ -35,11 +35,11 @@
 *       COMPLEX*16         Q( LDQ, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAED7 computes the updated eigensystem of a diagonal
 *> matrix after modification by a rank-one symmetric matrix. This
@@ -71,11 +71,10 @@
 *>       directly using the updated eigenvalues.  The eigenvectors for
 *>       the current problem are multiplied with the eigenvectors from
 *>       the overall problem.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -231,10 +230,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = 1, an eigenvalue did not converge
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaed8.f b/SRC/zlaed8.f
index 6afb698d..1b4056ea 100644
--- a/SRC/zlaed8.f
+++ b/SRC/zlaed8.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAED8( K, N, QSIZ, Q, LDQ, D, RHO, CUTPNT, Z, DLAMDA,
 *                          Q2, LDQ2, W, INDXP, INDX, INDXQ, PERM, GIVPTR,
@@ -34,11 +34,11 @@
 *       COMPLEX*16         Q( LDQ, * ), Q2( LDQ2, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAED8 merges the two sets of eigenvalues together into a single
 *> sorted set.  Then it tries to deflate the size of the problem.
@@ -46,11 +46,10 @@
 *> eigenvalues are close together or if there is a tiny element in the
 *> Z vector.  For each such occurrence the order of the related secular
 *> equation problem is reduced by one.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[out] K
 *> \verbatim
@@ -211,10 +210,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaein.f b/SRC/zlaein.f
index a300b275..1fd9118e 100644
--- a/SRC/zlaein.f
+++ b/SRC/zlaein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAEIN( RIGHTV, NOINIT, N, H, LDH, W, V, B, LDB, RWORK,
 *                          EPS3, SMLNUM, INFO )
@@ -32,20 +32,19 @@
 *       COMPLEX*16         B( LDB, * ), H( LDH, * ), V( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAEIN uses inverse iteration to find a right or left eigenvector
 *> corresponding to the eigenvalue W of a complex upper Hessenberg
 *> matrix H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] RIGHTV
 *> \verbatim
@@ -133,10 +132,9 @@
 *>          = 1:  inverse iteration did not converge; V is set to the
 *>                last iterate.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaesy.f b/SRC/zlaesy.f
index b29491ec..0d7bdf0b 100644
--- a/SRC/zlaesy.f
+++ b/SRC/zlaesy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAESY( A, B, C, RT1, RT2, EVSCAL, CS1, SN1 )
 * 
@@ -24,11 +24,11 @@
 *       COMPLEX*16         A, B, C, CS1, EVSCAL, RT1, RT2, SN1
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAESY computes the eigendecomposition of a 2-by-2 symmetric matrix
 *>    ( ( A, B );( B, C ) )
@@ -41,11 +41,10 @@
 *>
 *> [  CS1     SN1   ] . [ A  B ] . [ CS1    -SN1   ] = [ RT1  0  ]
 *> [ -SN1     CS1   ]   [ B  C ]   [ SN1     CS1   ]   [  0  RT2 ]
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          If EVSCAL .NE. 0,  ( CS1, SN1 ) is the unit right eigenvector
 *>          for RT1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaev2.f b/SRC/zlaev2.f
index e8f0b14f..dc2e70cb 100644
--- a/SRC/zlaev2.f
+++ b/SRC/zlaev2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAEV2( A, B, C, RT1, RT2, CS1, SN1 )
 * 
@@ -25,11 +25,11 @@
 *       COMPLEX*16         A, B, C, SN1
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAEV2 computes the eigendecomposition of a 2-by-2 Hermitian matrix
 *>    [  A         B  ]
@@ -40,11 +40,10 @@
 *>
 *> [ CS1  CONJG(SN1) ] [    A     B ] [ CS1 -CONJG(SN1) ] = [ RT1  0  ]
 *> [-SN1     CS1     ] [ CONJG(B) C ] [ SN1     CS1     ]   [  0  RT2 ].
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] A
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          SN1 is COMPLEX*16
 *>         The vector (CS1, SN1) is a unit right eigenvector for RT1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -101,10 +99,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  RT1 is accurate to a few ulps barring over/underflow.
@@ -119,7 +116,6 @@
 *>  Overflow is possible only if RT1 is within a factor of 5 of overflow.
 *>  Underflow is harmless if the input data is 0 or exceeds
 *>     underflow_threshold / macheps.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlag2c.f b/SRC/zlag2c.f
index c40e4deb..f0e50fe2 100644
--- a/SRC/zlag2c.f
+++ b/SRC/zlag2c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAG2C( M, N, A, LDA, SA, LDSA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAG2C converts a COMPLEX*16 matrix, SA, to a COMPLEX matrix, A.
 *>
@@ -41,11 +41,10 @@
 *> RMAX. If not the convertion is aborted and a flag is raised.
 *>
 *> This is an auxiliary routine so there is no argument checking.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -92,10 +91,9 @@
 *>                PRECISION overflow threshold, in this case, the content
 *>                of SA in exit is unspecified.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlags2.f b/SRC/zlags2.f
index 4c49c565..2c477e02 100644
--- a/SRC/zlags2.f
+++ b/SRC/zlags2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAGS2( UPPER, A1, A2, A3, B1, B2, B3, CSU, SNU, CSV,
 *                          SNV, CSQ, SNQ )
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A2, B2, SNQ, SNU, SNV
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAGS2 computes 2-by-2 unitary matrices U, V and Q, such
 *> that if ( UPPER ) then
@@ -63,11 +63,10 @@
 *> then the transformed (2,2) element of B is not zero, except when the
 *> first rows of input A and B are parallel and the second rows are
 *> zero.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPPER
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          SNQ is COMPLEX*16
 *>          The desired unitary matrix Q.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlagtm.f b/SRC/zlagtm.f
index 6b8e85ec..e4833b32 100644
--- a/SRC/zlagtm.f
+++ b/SRC/zlagtm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA,
 *                          B, LDB )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAGTM performs a matrix-vector product of the form
 *>
@@ -44,11 +44,10 @@
 *> where A is a tridiagonal matrix of order N, B and X are N by NRHS
 *> matrices, and alpha and beta are real scalars, each of which may be
 *> 0., 1., or -1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -129,10 +128,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(N,1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlahef.f b/SRC/zlahef.f
index 04650bda..1fad4933 100644
--- a/SRC/zlahef.f
+++ b/SRC/zlahef.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAHEF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAHEF computes a partial factorization of a complex Hermitian
 *> matrix A using the Bunch-Kaufman diagonal pivoting method. The
@@ -52,11 +52,10 @@
 *> ZLAHEF is an auxiliary routine called by ZHETRF. It uses blocked code
 *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or
 *> A22 (if UPLO = 'L').
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -142,10 +141,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlahqr.f b/SRC/zlahqr.f
index 4c955ce2..79fc06ef 100644
--- a/SRC/zlahqr.f
+++ b/SRC/zlahqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
 *                          IHIZ, Z, LDZ, INFO )
@@ -29,21 +29,20 @@
 *       COMPLEX*16         H( LDH, * ), W( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLAHQR is an auxiliary routine called by CHSEQR to update the
 *>    eigenvalues and Schur decomposition already computed by CHSEQR, by
 *>    dealing with the Hessenberg submatrix in rows and columns ILO to
 *>    IHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -163,10 +162,9 @@
 *>                  where U is the orthogonal matrix in (*)
 *>                  (regardless of the value of WANTT.)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -177,10 +175,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Contributors:
+*  ==================
+*>
 *> \verbatim
 *>
 *>     02-96 Based on modifications by
@@ -192,7 +189,6 @@
 *>     It is (1) more robust against overflow and underflow and
 *>     (2) adopts the more conservative Ahues & Tisseur stopping
 *>     criterion (LAWN 122, 1997).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlahr2.f b/SRC/zlahr2.f
index 12f7c628..da371b54 100644
--- a/SRC/zlahr2.f
+++ b/SRC/zlahr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAHR2 reduces the first NB columns of A complex general n-BY-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -41,11 +41,10 @@
 *> Q as a block reflector I - V*T*V**H, and also the matrix Y = A * V * T.
 *>
 *> This is an auxiliary routine called by ZGEHRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -129,10 +127,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -172,16 +169,15 @@
 *>  Gejin. Note that the entries of A(1:K,2:NB) differ from those
 *>  returned by the original LAPACK-3.0's DLAHRD routine. (This
 *>  subroutine is not backward compatible with LAPACK-3.0's DLAHRD.)
-*>
-*>  References
-*>  ==========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  Gregorio Quintana-Orti and Robert van de Geijn, "Improving the
 *>  performance of reduction to Hessenberg form," ACM Transactions on
 *>  Mathematical Software, 32(2):180-194, June 2006.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZLAHR2( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 *
diff --git a/SRC/zlahrd.f b/SRC/zlahrd.f
index d3781b93..9b375b31 100644
--- a/SRC/zlahrd.f
+++ b/SRC/zlahrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
 * 
@@ -28,11 +28,11 @@
 *      $                   Y( LDY, NB )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAHRD reduces the first NB columns of a complex general n-by-(n-k+1)
 *> matrix A so that elements below the k-th subdiagonal are zero. The
@@ -43,11 +43,10 @@
 *> This is an OBSOLETE auxiliary routine. 
 *> This routine will be 'deprecated' in a  future release.
 *> Please use the new routine ZLAHR2 instead.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -116,10 +115,9 @@
 *>          LDY is INTEGER
 *>          The leading dimension of the array Y. LDY >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -130,10 +128,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix Q is represented as a product of nb elementary reflectors
@@ -167,7 +164,6 @@
 *>  where a denotes an element of the original matrix A, h denotes a
 *>  modified element of the upper Hessenberg matrix H, and vi denotes an
 *>  element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlaic1.f b/SRC/zlaic1.f
index 0e7480ce..204e1bfd 100644
--- a/SRC/zlaic1.f
+++ b/SRC/zlaic1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAIC1( JOB, J, X, SEST, W, GAMMA, SESTPR, S, C )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         W( J ), X( J )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAIC1 applies one step of incremental condition estimation in
 *> its simplest version:
@@ -60,11 +60,10 @@
 *>                                           [ conjg(gamma) ]
 *>
 *> where  alpha =  x**H * w.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -120,10 +119,9 @@
 *>          C is COMPLEX*16
 *>          Cosine needed in forming xhat.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlals0.f b/SRC/zlals0.f
index c7a68817..c99d1cfa 100644
--- a/SRC/zlals0.f
+++ b/SRC/zlals0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
 *                          PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
@@ -35,11 +35,11 @@
 *       COMPLEX*16         B( LDB, * ), BX( LDBX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLALS0 applies back the multiplying factors of either the left or the
 *> right singular vector matrix of a diagonal matrix appended by a row
@@ -70,11 +70,10 @@
 *> (3R) The inverse transformation of (2L).
 *>
 *> (4R) The inverse transformation of (1L).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -246,10 +245,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -260,19 +258,13 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE ZLALS0( ICOMPQ, NL, NR, SQRE, NRHS, B, LDB, BX, LDBX,
      $                   PERM, GIVPTR, GIVCOL, LDGCOL, GIVNUM, LDGNUM,
diff --git a/SRC/zlalsa.f b/SRC/zlalsa.f
index 2477c1ef..93d4a6a9 100644
--- a/SRC/zlalsa.f
+++ b/SRC/zlalsa.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
 *                          LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
@@ -36,11 +36,11 @@
 *       COMPLEX*16         B( LDB, * ), BX( LDBX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLALSA is an itermediate step in solving the least squares problem
 *> by computing the SVD of the coefficient matrix in compact form (The
@@ -52,11 +52,10 @@
 *> ICOMPQ = 1, ZLALSA applies the right singular vector matrix to the
 *> right hand side. The singular vector matrices were generated in
 *> compact form by ZLALSA.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] ICOMPQ
 *> \verbatim
@@ -243,10 +242,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -257,19 +255,13 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE ZLALSA( ICOMPQ, SMLSIZ, N, NRHS, B, LDB, BX, LDBX, U,
      $                   LDU, VT, K, DIFL, DIFR, Z, POLES, GIVPTR,
diff --git a/SRC/zlalsd.f b/SRC/zlalsd.f
index de471868..a4d4e4f6 100644
--- a/SRC/zlalsd.f
+++ b/SRC/zlalsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
 *                          RANK, WORK, RWORK, IWORK, INFO )
@@ -32,11 +32,11 @@
 *       COMPLEX*16         B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLALSD uses the singular value decomposition of A to solve the least
 *> squares problem of finding X to minimize the Euclidean norm of each
@@ -54,11 +54,10 @@
 *> which subtract like the Cray XMP, Cray YMP, Cray C 90, or Cray 2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -165,10 +164,9 @@
 *>               working on the submatrix lying in rows and columns
 *>               INFO/(N+1) through MOD(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -179,19 +177,13 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Ming Gu and Ren-Cang Li, Computer Science Division, University of
-*>       California at Berkeley, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>
-*> \endverbatim
-*>
+*>       California at Berkeley, USA \n
+*>     Osni Marques, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE ZLALSD( UPLO, SMLSIZ, N, NRHS, D, E, B, LDB, RCOND,
      $                   RANK, WORK, RWORK, IWORK, INFO )
diff --git a/SRC/zlangb.f b/SRC/zlangb.f
index 9961ac31..0d0ecd80 100644
--- a/SRC/zlangb.f
+++ b/SRC/zlangb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANGB( NORM, N, KL, KU, AB, LDAB,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANGB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n band matrix  A,  with kl sub-diagonals and ku super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANGB returns the value
+*> \return ZLANGB
+*> \verbatim
 *>
 *>    ZLANGB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -110,10 +108,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlange.f b/SRC/zlange.f
index bd58749a..ab78224b 100644
--- a/SRC/zlange.f
+++ b/SRC/zlange.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANGE( NORM, M, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANGE  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANGE returns the value
+*> \return ZLANGE
+*> \verbatim
 *>
 *>    ZLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -101,10 +99,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlangt.f b/SRC/zlangt.f
index cb972016..82767d7d 100644
--- a/SRC/zlangt.f
+++ b/SRC/zlangt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANGT( NORM, N, DL, D, DU )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         D( * ), DL( * ), DU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANGT  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANGT returns the value
+*> \return ZLANGT
+*> \verbatim
 *>
 *>    ZLANGT = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -55,11 +54,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -92,10 +90,9 @@
 *>          DU is COMPLEX*16 array, dimension (N-1)
 *>          The (n-1) super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlanhb.f b/SRC/zlanhb.f
index f051298d..5bce9f86 100644
--- a/SRC/zlanhb.f
+++ b/SRC/zlanhb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANHB( NORM, UPLO, N, K, AB, LDAB,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANHB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n hermitian band matrix A,  with k super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANHB returns the value
+*> \return ZLANHB
+*> \verbatim
 *>
 *>    ZLANHB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -117,10 +115,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlanhe.f b/SRC/zlanhe.f
index f5769de7..81333552 100644
--- a/SRC/zlanhe.f
+++ b/SRC/zlanhe.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANHE( NORM, UPLO, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANHE  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex hermitian matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANHE returns the value
+*> \return ZLANHE
+*> \verbatim
 *>
 *>    ZLANHE = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -110,10 +108,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlanhf.f b/SRC/zlanhf.f
index 7e9e136d..05447811 100644
--- a/SRC/zlanhf.f
+++ b/SRC/zlanhf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANHF( NORM, TRANSR, UPLO, N, A, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANHF  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex Hermitian matrix A in RFP format.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANHF returns the value
+*> \return ZLANHF
+*> \verbatim
 *>
 *>    ZLANHF = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a  matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -124,10 +122,9 @@
 *>            where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>            WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +135,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -245,7 +241,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlanhp.f b/SRC/zlanhp.f
index 50ff9cce..37d366b7 100644
--- a/SRC/zlanhp.f
+++ b/SRC/zlanhp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANHP( NORM, UPLO, N, AP, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANHP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex hermitian matrix A,  supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANHP returns the value
+*> \return ZLANHP
+*> \verbatim
 *>
 *>    ZLANHP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -103,10 +101,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlanhs.f b/SRC/zlanhs.f
index 3023546a..78927837 100644
--- a/SRC/zlanhs.f
+++ b/SRC/zlanhs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANHS( NORM, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANHS  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> Hessenberg matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANHS returns the value
+*> \return ZLANHS
+*> \verbatim
 *>
 *>    ZLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -95,10 +93,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlanht.f b/SRC/zlanht.f
index 3d3820af..dbaf479d 100644
--- a/SRC/zlanht.f
+++ b/SRC/zlanht.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANHT( NORM, N, D, E )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANHT  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex Hermitian tridiagonal matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANHT returns the value
+*> \return ZLANHT
+*> \verbatim
 *>
 *>    ZLANHT = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -87,10 +85,9 @@
 *>          E is COMPLEX*16 array, dimension (N-1)
 *>          The (n-1) sub-diagonal or super-diagonal elements of A.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlansb.f b/SRC/zlansb.f
index c50d3a3f..dcc5ccbb 100644
--- a/SRC/zlansb.f
+++ b/SRC/zlansb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANSB( NORM, UPLO, N, K, AB, LDAB,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANSB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n symmetric band matrix A,  with k super-diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANSB returns the value
+*> \return ZLANSB
+*> \verbatim
 *>
 *>    ZLANSB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -115,10 +113,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlansp.f b/SRC/zlansp.f
index 5d596f25..d70288dd 100644
--- a/SRC/zlansp.f
+++ b/SRC/zlansp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANSP( NORM, UPLO, N, AP, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANSP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex symmetric matrix A,  supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANSP returns the value
+*> \return ZLANSP
+*> \verbatim
 *>
 *>    ZLANSP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -101,10 +99,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlansy.f b/SRC/zlansy.f
index 2ded1efb..b03f0202 100644
--- a/SRC/zlansy.f
+++ b/SRC/zlansy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANSY( NORM, UPLO, N, A, LDA, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANSY  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> complex symmetric matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANSY returns the value
+*> \return ZLANSY
+*> \verbatim
 *>
 *>    ZLANSY = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -109,10 +107,9 @@
 *>          where LWORK >= N when NORM = 'I' or '1' or 'O'; otherwise,
 *>          WORK is not referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlantb.f b/SRC/zlantb.f
index c8203add..899b00ad 100644
--- a/SRC/zlantb.f
+++ b/SRC/zlantb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANTB( NORM, UPLO, DIAG, N, K, AB,
 *                        LDAB, WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANTB  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the element of  largest absolute value  of an
 *> n by n triangular band matrix A,  with ( k + 1 ) diagonals.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANTB returns the value
+*> \return ZLANTB
+*> \verbatim
 *>
 *>    ZLANTB = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -126,10 +124,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlantp.f b/SRC/zlantp.f
index c2b25bc6..e2167f95 100644
--- a/SRC/zlantp.f
+++ b/SRC/zlantp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANTP( NORM, UPLO, DIAG, N, AP, WORK )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANTP  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> triangular matrix A, supplied in packed form.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANTP returns the value
+*> \return ZLANTP
+*> \verbatim
 *>
 *>    ZLANTP = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -56,11 +55,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -111,10 +109,9 @@
 *>          where LWORK >= N when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlantr.f b/SRC/zlantr.f
index c5840c61..ca65ee3e 100644
--- a/SRC/zlantr.f
+++ b/SRC/zlantr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       DOUBLE PRECISION FUNCTION ZLANTR( NORM, UPLO, DIAG, M, N, A, LDA,
 *                        WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLANTR  returns the value of the one norm,  or the Frobenius norm, or
 *> the  infinity norm,  or the  element of  largest absolute value  of a
 *> trapezoidal or triangular matrix A.
+*> \endverbatim
 *>
-*> Description
-*> ===========
-*>
-*> ZLANTR returns the value
+*> \return ZLANTR
+*> \verbatim
 *>
 *>    ZLANTR = ( max(abs(A(i,j))), NORM = 'M' or 'm'
 *>             (
@@ -57,11 +56,10 @@
 *> normI  denotes the  infinity norm  of a matrix  (maximum row sum) and
 *> normF  denotes the  Frobenius norm of a matrix (square root of sum of
 *> squares).  Note that  max(abs(A(i,j)))  is not a consistent matrix norm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -127,10 +125,9 @@
 *>          where LWORK >= M when NORM = 'I'; otherwise, WORK is not
 *>          referenced.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlapll.f b/SRC/zlapll.f
index 4a04fc03..47a489dd 100644
--- a/SRC/zlapll.f
+++ b/SRC/zlapll.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAPLL( N, X, INCX, Y, INCY, SSMIN )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Given two column vectors X and Y, let
 *>
@@ -42,11 +42,10 @@
 *> and then computes the SVD of the 2-by-2 upper triangular matrix R.
 *> The smaller singular value of R is returned in SSMIN, which is used
 *> as the measurement of the linear dependency of the vectors X and Y.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -85,10 +84,9 @@
 *>          SSMIN is DOUBLE PRECISION
 *>          The smallest singular value of the N-by-2 matrix A = ( X Y ).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlapmr.f b/SRC/zlapmr.f
index 9078b064..7ce3e890 100644
--- a/SRC/zlapmr.f
+++ b/SRC/zlapmr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAPMR( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAPMR rearranges the rows of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(M) of the integers 1,...,M.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(I,*) is moved to X(K(I),*) for I = 1,2,...,M.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlapmt.f b/SRC/zlapmt.f
index e1bf40d6..5b9c8a2d 100644
--- a/SRC/zlapmt.f
+++ b/SRC/zlapmt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAPMT( FORWRD, M, N, X, LDX, K )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAPMT rearranges the columns of the M by N matrix X as specified
 *> by the permutation K(1),K(2),...,K(N) of the integers 1,...,N.
@@ -44,11 +44,10 @@
 *> If FORWRD = .FALSE., backward permutation:
 *>
 *>      X(*,J) is moved to X(*,K(J)) for J = 1,2,...,N.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FORWRD
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          internal workspace, but reset to its original value on
 *>          output.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqgb.f b/SRC/zlaqgb.f
index 927ec89f..635f7b08 100644
--- a/SRC/zlaqgb.f
+++ b/SRC/zlaqgb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQGB( M, N, KL, KU, AB, LDAB, R, C, ROWCND, COLCND,
 *                          AMAX, EQUED )
@@ -31,20 +31,19 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQGB equilibrates a general M by N band matrix A with KL
 *> subdiagonals and KU superdiagonals using the row and scaling factors
 *> in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -129,10 +128,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -142,10 +143,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqge.f b/SRC/zlaqge.f
index 857b088b..6f4452be 100644
--- a/SRC/zlaqge.f
+++ b/SRC/zlaqge.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQGE( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX,
 *                          EQUED )
@@ -31,19 +31,18 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQGE equilibrates a general M by N matrix A using the row and
 *> column scaling factors in the vectors R and C.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,12 @@
 *>                  by diag(C).
 *>          = 'B':  Both row and column equilibration, i.e., A has been
 *>                  replaced by diag(R) * A * diag(C).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if row or column scaling
 *>  should be done based on the ratio of the row or column scaling
 *>  factors.  If ROWCND < THRESH, row scaling is done, and if
@@ -125,10 +126,9 @@
 *>  should be done based on the absolute size of the largest matrix
 *>  element.  If AMAX > LARGE or AMAX < SMALL, row scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqhb.f b/SRC/zlaqhb.f
index c96a1081..9500be44 100644
--- a/SRC/zlaqhb.f
+++ b/SRC/zlaqhb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQHB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQHB equilibrates a Hermitian band matrix A 
 *> using the scaling factors in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -124,10 +125,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqhe.f b/SRC/zlaqhe.f
index 1028cdca..059631f2 100644
--- a/SRC/zlaqhe.f
+++ b/SRC/zlaqhe.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQHE( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQHE equilibrates a Hermitian matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -117,10 +118,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqhp.f b/SRC/zlaqhp.f
index f2ae7067..d14d6431 100644
--- a/SRC/zlaqhp.f
+++ b/SRC/zlaqhp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQHP( UPLO, N, AP, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQHP equilibrates a Hermitian matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -109,10 +110,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqp2.f b/SRC/zlaqp2.f
index 4fb11653..5c6cab7e 100644
--- a/SRC/zlaqp2.f
+++ b/SRC/zlaqp2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
 *                          WORK )
@@ -30,20 +30,19 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQP2 computes a QR factorization with column pivoting of
 *> the block A(OFFSET+1:M,1:N).
 *> The block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -114,10 +113,9 @@
 *> \verbatim
 *>          WORK is COMPLEX*16 array, dimension (N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -128,23 +126,25 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
-*>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE ZLAQP2( M, N, OFFSET, A, LDA, JPVT, TAU, VN1, VN2,
      $                   WORK )
diff --git a/SRC/zlaqps.f b/SRC/zlaqps.f
index 8671276e..9a847e35 100644
--- a/SRC/zlaqps.f
+++ b/SRC/zlaqps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
 *                          VN2, AUXV, F, LDF )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * ), AUXV( * ), F( LDF, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQPS computes a step of QR factorization with column pivoting
 *> of a complex M-by-N matrix A by using Blas-3.  It tries to factorize
@@ -46,11 +46,10 @@
 *> columns is returned in KB.
 *>
 *> Block A(1:OFFSET,1:N) is accordingly pivoted, but not factorized.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          LDF is INTEGER
 *>          The leading dimension of the array F. LDF >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -156,23 +154,25 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
 *>    X. Sun, Computer Science Dept., Duke University, USA
-*>
-*>  Partial column norm updating strategy modified by
+*> \n
+*>  Partial column norm updating strategy modified on April 2011
 *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
 *>    University of Zagreb, Croatia.
-*>  -- April 2011                                                      --
-*>  For more details see LAPACK Working Note 176.
-*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
+*> LAPACK Working Note 176
+*
+*> \htmlonly
+*> <a href="http://www.netlib.org/lapack/lawnspdf/lawn176.pdf">[PDF]</a> 
+*> \endhtmlonly 
+*
 *  =====================================================================
       SUBROUTINE ZLAQPS( M, N, OFFSET, NB, KB, A, LDA, JPVT, TAU, VN1,
      $                   VN2, AUXV, F, LDF )
diff --git a/SRC/zlaqr0.f b/SRC/zlaqr0.f
index 71f45987..4ee699e6 100644
--- a/SRC/zlaqr0.f
+++ b/SRC/zlaqr0.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
 *                          IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLAQR0 computes the eigenvalues of a Hessenberg matrix H
 *>    and, optionally, the matrices T and Z from the Schur decomposition
@@ -44,11 +44,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the unitary matrix Q:  A = Q*H*Q**H = (QZ)*H*(QZ)**H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -207,10 +206,9 @@
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -221,28 +219,24 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZLAQR0( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
      $                   IHIZ, Z, LDZ, WORK, LWORK, INFO )
diff --git a/SRC/zlaqr1.f b/SRC/zlaqr1.f
index 461d6048..213cba8a 100644
--- a/SRC/zlaqr1.f
+++ b/SRC/zlaqr1.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQR1( N, H, LDH, S1, S2, V )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         H( LDH, * ), V( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>      Given a 2-by-2 or 3-by-3 matrix H, ZLAQR1 sets v to a
 *>      scalar multiple of the first column of the product
@@ -43,11 +43,10 @@
 *>
 *>      This is useful for starting double implicit shift bulges
 *>      in the QR algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -86,10 +85,9 @@
 *>              A scalar multiple of the first column of the
 *>              matrix K in (*).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -100,17 +98,11 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE ZLAQR1( N, H, LDH, S1, S2, V )
diff --git a/SRC/zlaqr2.f b/SRC/zlaqr2.f
index 7e3b5d0a..8e39ce45 100644
--- a/SRC/zlaqr2.f
+++ b/SRC/zlaqr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT,
@@ -32,11 +32,11 @@
 *      $                   WORK( * ), WV( LDWV, * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLAQR2 is identical to ZLAQR3 except that it avoids
 *>    recursion by calling ZLAHQR instead of ZLAQR4.
@@ -52,11 +52,10 @@
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -247,10 +246,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -261,17 +259,11 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE ZLAQR2( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/zlaqr3.f b/SRC/zlaqr3.f
index 864221ea..10311ad9 100644
--- a/SRC/zlaqr3.f
+++ b/SRC/zlaqr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
 *                          IHIZ, Z, LDZ, NS, ND, SH, V, LDV, NH, T, LDT,
@@ -32,11 +32,11 @@
 *      $                   WORK( * ), WV( LDWV, * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    Aggressive early deflation:
 *>
@@ -49,11 +49,10 @@
 *>    hoped that the final version of H has many zero subdiagonal
 *>    entries.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -244,10 +243,9 @@
 *>          in WORK(1).  No error message related to LWORK is issued
 *>          by XERBLA.  Neither H nor Z are accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -258,17 +256,11 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
-*>
-*> \endverbatim
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
 *>
 *  =====================================================================
       SUBROUTINE ZLAQR3( WANTT, WANTZ, N, KTOP, KBOT, NW, H, LDH, ILOZ,
diff --git a/SRC/zlaqr4.f b/SRC/zlaqr4.f
index 94042bdb..b3f53fc1 100644
--- a/SRC/zlaqr4.f
+++ b/SRC/zlaqr4.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
 *                          IHIZ, Z, LDZ, WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLAQR4 implements one level of recursion for ZLAQR0.
 *>    It is a complete implementation of the small bulge multi-shift
@@ -51,11 +51,10 @@
 *>    matrix Q so that this routine can give the Schur factorization
 *>    of a matrix A which has been reduced to the Hessenberg form H
 *>    by the unitary matrix Q:  A = Q*H*Q**H = (QZ)*H*(QZ)**H.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -213,10 +212,9 @@
 *>                If INFO .GT. 0 and WANTZ is .FALSE., then Z is not
 *>                accessed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -227,28 +225,24 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>     Based on contributions by
-*>        Karen Braman and Ralph Byers, Department of Mathematics,
-*>        University of Kansas, USA
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
 *>
-*>     References:
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
 *>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
 *>       929--947, 2002.
-*>
+*> \n
 *>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
 *>       Algorithm Part II: Aggressive Early Deflation, SIAM Journal
 *>       of Matrix Analysis, volume 23, pages 948--973, 2002.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZLAQR4( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ,
      $                   IHIZ, Z, LDZ, WORK, LWORK, INFO )
diff --git a/SRC/zlaqr5.f b/SRC/zlaqr5.f
index 053c57ec..a1e3c914 100644
--- a/SRC/zlaqr5.f
+++ b/SRC/zlaqr5.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S,
 *                          H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, LDU, NV,
@@ -32,19 +32,18 @@
 *      $                   WH( LDWH, * ), WV( LDWV, * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZLAQR5, called by ZLAQR0, performs a
 *>    single small-bulge multi-shift QR sweep.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTT
 *> \verbatim
@@ -220,10 +219,9 @@
 *>             LDWV is the leading dimension of WV as declared in the
 *>             in the calling subroutine.  LDWV.GE.NV.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -234,6 +232,20 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
+*> \par Contributors:
+*  ==================
+*>
+*>       Karen Braman and Ralph Byers, Department of Mathematics,
+*>       University of Kansas, USA
+*
+*> \par References:
+*  ================
+*>
+*>       K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
+*>       Algorithm Part I: Maintaining Well Focused Shifts, and Level 3
+*>       Performance, SIAM Journal of Matrix Analysis, volume 23, pages
+*>       929--947, 2002.
+*>
 *  =====================================================================
       SUBROUTINE ZLAQR5( WANTT, WANTZ, KACC22, N, KTOP, KBOT, NSHFTS, S,
      $                   H, LDH, ILOZ, IHIZ, Z, LDZ, V, LDV, U, LDU, NV,
@@ -255,19 +267,6 @@
 *     ..
 *
 *  ================================================================
-*     Based on contributions by
-*        Karen Braman and Ralph Byers, Department of Mathematics,
-*        University of Kansas, USA
-*
-*  ================================================================
-*     Reference:
-*
-*     K. Braman, R. Byers and R. Mathias, The Multi-Shift QR
-*     Algorithm Part I: Maintaining Well Focused Shifts, and
-*     Level 3 Performance, SIAM Journal of Matrix Analysis,
-*     volume 23, pages 929--947, 2002.
-*
-*  ================================================================
 *     .. Parameters ..
       COMPLEX*16         ZERO, ONE
       PARAMETER          ( ZERO = ( 0.0d0, 0.0d0 ),
diff --git a/SRC/zlaqsb.f b/SRC/zlaqsb.f
index 81029b8f..ae7976cd 100644
--- a/SRC/zlaqsb.f
+++ b/SRC/zlaqsb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQSB( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQSB equilibrates a symmetric band matrix A using the scaling
 *> factors in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -124,10 +125,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqsp.f b/SRC/zlaqsp.f
index edea5462..3a7d2a67 100644
--- a/SRC/zlaqsp.f
+++ b/SRC/zlaqsp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQSP equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -109,10 +110,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaqsy.f b/SRC/zlaqsy.f
index dc4e8e91..0c675c78 100644
--- a/SRC/zlaqsy.f
+++ b/SRC/zlaqsy.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAQSY( UPLO, N, A, LDA, S, SCOND, AMAX, EQUED )
 * 
@@ -30,19 +30,18 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAQSY equilibrates a symmetric matrix A using the scaling factors
 *> in the vector S.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,12 @@
 *>          = 'N':  No equilibration.
 *>          = 'Y':  Equilibration was done, i.e., A has been replaced by
 *>                  diag(S) * A * diag(S).
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  THRESH is a threshold value used to decide if scaling should be done
 *>  based on the ratio of the scaling factors.  If SCOND < THRESH,
 *>  scaling is done.
@@ -117,10 +118,9 @@
 *>  be done based on the absolute size of the largest matrix element.
 *>  If AMAX > LARGE or AMAX < SMALL, scaling is done.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlar1v.f b/SRC/zlar1v.f
index fea96b18..5d131e04 100644
--- a/SRC/zlar1v.f
+++ b/SRC/zlar1v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
 *                  PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
@@ -35,11 +35,11 @@
 *       COMPLEX*16       Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAR1V computes the (scaled) r-th column of the inverse of
 *> the sumbmatrix in rows B1 through BN of the tridiagonal matrix
@@ -56,11 +56,10 @@
 *> (d) Computation of the (scaled) r-th column of the inverse using the
 *>     twisted factorization obtained by combining the top part of the
 *>     the stationary and the bottom part of the progressive transform.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -204,10 +203,9 @@
 *> \verbatim
 *>          WORK is DOUBLE PRECISION array, dimension (4*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -218,21 +216,15 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE ZLAR1V( N, B1, BN, LAMBDA, D, L, LD, LLD,
      $           PIVMIN, GAPTOL, Z, WANTNC, NEGCNT, ZTZ, MINGMA,
diff --git a/SRC/zlar2v.f b/SRC/zlar2v.f
index 3d763b72..efc50ac5 100644
--- a/SRC/zlar2v.f
+++ b/SRC/zlar2v.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAR2V( N, X, Y, Z, INCX, C, S, INCC )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         S( * ), X( * ), Y( * ), Z( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAR2V applies a vector of complex plane rotations with real cosines
 *> from both sides to a sequence of 2-by-2 complex Hermitian matrices,
@@ -43,11 +43,10 @@
 *>
 *>      (  c(i) conjg(s(i)) ) (       x(i)  z(i) ) ( c(i) -conjg(s(i)) )
 *>      ( -s(i)       c(i)  ) ( conjg(z(i)) y(i) ) ( s(i)        c(i)  )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -96,10 +95,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlarcm.f b/SRC/zlarcm.f
index 6129ca1f..4a7421d8 100644
--- a/SRC/zlarcm.f
+++ b/SRC/zlarcm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARCM( M, N, A, LDA, B, LDB, C, LDC, RWORK )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         B( LDB, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARCM performs a very simple matrix-matrix multiplication:
 *>          C := A * B,
 *> where A is M by M and real; B is M by N and complex;
 *> C is M by N and complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *> \verbatim
 *>          RWORK is DOUBLE PRECISION array, dimension (2*M*N)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlarf.f b/SRC/zlarf.f
index 34730d9b..2fb0f542 100644
--- a/SRC/zlarf.f
+++ b/SRC/zlarf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARF applies a complex elementary reflector H to a complex M-by-N
 *> matrix C, from either the left or the right. H is represented in the
@@ -47,11 +47,10 @@
 *>
 *> To apply H**H, supply conjg(tau) instead
 *> tau.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -113,10 +112,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlarfb.f b/SRC/zlarfb.f
index 2638ac92..e4767ef4 100644
--- a/SRC/zlarfb.f
+++ b/SRC/zlarfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV,
 *                          T, LDT, C, LDC, WORK, LDWORK )
@@ -30,19 +30,18 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARFB applies a complex block reflector H or its transpose H**H to a
 *> complex M-by-N matrix C, from either the left or the right.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,10 +163,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -192,7 +189,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlarfg.f b/SRC/zlarfg.f
index 9802d0e1..cf3bd3fd 100644
--- a/SRC/zlarfg.f
+++ b/SRC/zlarfg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARFG( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARFG generates a complex elementary reflector H of order n, such
 *> that
@@ -53,11 +53,10 @@
 *> and H is taken to be the unit matrix.
 *>
 *> Otherwise  1 <= real(tau) <= 2  and  abs(tau-1) <= 1 .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          TAU is COMPLEX*16
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlarfgp.f b/SRC/zlarfgp.f
index 87e6d668..21a7dc3c 100644
--- a/SRC/zlarfgp.f
+++ b/SRC/zlarfgp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARFGP( N, ALPHA, X, INCX, TAU )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARFGP generates a complex elementary reflector H of order n, such
 *> that
@@ -51,11 +51,10 @@
 *>
 *> If the elements of x are all zero and alpha is real, then tau = 0
 *> and H is taken to be the unit matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          TAU is COMPLEX*16
 *>          The value tau.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlarft.f b/SRC/zlarft.f
index fdef55a0..c562893a 100644
--- a/SRC/zlarft.f
+++ b/SRC/zlarft.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARFT forms the triangular factor T of a complex block reflector H
 *> of order n, which is defined as a product of k elementary reflectors.
@@ -50,11 +50,10 @@
 *> H(i) is stored in the i-th row of the array V, and
 *>
 *>    H  =  I - V**H * T * V
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -122,10 +121,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -136,10 +134,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
@@ -163,7 +160,6 @@
 *>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
 *>                   (     1 v3 )
 *>                   (        1 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlarfx.f b/SRC/zlarfx.f
index 61f612db..7ec6e766 100644
--- a/SRC/zlarfx.f
+++ b/SRC/zlarfx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARFX( SIDE, M, N, V, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARFX applies a complex elementary reflector H to a complex m by n
 *> matrix C, from either the left or the right. H is represented in the
@@ -46,11 +46,10 @@
 *> If tau = 0, then H is taken to be the unit matrix
 *>
 *> This version uses inline code if H has order < 11.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -104,10 +103,9 @@
 *>                                            or (M) if SIDE = 'R'
 *>          WORK is not referenced if H has order < 11.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlargv.f b/SRC/zlargv.f
index 0f2fdef8..364ae2c9 100644
--- a/SRC/zlargv.f
+++ b/SRC/zlargv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARGV( N, X, INCX, Y, INCY, C, INCC )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARGV generates a vector of complex plane rotations with real
 *> cosines, determined by elements of the complex vectors x and y.
@@ -47,11 +47,10 @@
 *> but differ from the BLAS1 routine ZROTG):
 *>    If y(i)=0, then c(i)=1 and s(i)=0.
 *>    If x(i)=0, then c(i)=0 and s(i) is chosen so that r(i) is real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -96,10 +95,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -110,17 +108,15 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  6-6-96 - Modified with a new algorithm by W. Kahan and J. Demmel
 *>
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlarnv.f b/SRC/zlarnv.f
index f58634ab..3079f54a 100644
--- a/SRC/zlarnv.f
+++ b/SRC/zlarnv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARNV( IDIST, ISEED, N, X )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARNV returns a vector of n random complex numbers from a uniform or
 *> normal distribution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IDIST
 *> \verbatim
@@ -73,10 +72,9 @@
 *>          X is COMPLEX*16 array, dimension (N)
 *>          The generated random numbers.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -87,17 +85,15 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  This routine calls the auxiliary routine DLARUV to generate random
 *>  real numbers from a uniform (0,1) distribution, in batches of up to
 *>  128 using vectorisable code. The Box-Muller method is used to
 *>  transform numbers from a uniform to a normal distribution.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlarrv.f b/SRC/zlarrv.f
index e8c75ed9..8968b4be 100644
--- a/SRC/zlarrv.f
+++ b/SRC/zlarrv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,
 *                          ISPLIT, M, DOL, DOU, MINRGP,
@@ -36,20 +36,19 @@
 *       COMPLEX*16        Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARRV computes the eigenvectors of the tridiagonal matrix
 *> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.
 *> The input eigenvalues should have been computed by DLARRE.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -255,10 +254,9 @@
 *>          = 5:  The Rayleigh Quotient Iteration failed to converge to
 *>                full accuracy in MAXITR steps.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -269,21 +267,15 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,
      $                   ISPLIT, M, DOL, DOU, MINRGP,
diff --git a/SRC/zlarscl2.f b/SRC/zlarscl2.f
index 52e8cba1..4df988d3 100644
--- a/SRC/zlarscl2.f
+++ b/SRC/zlarscl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARSCL2 ( M, N, D, X, LDX )
 * 
@@ -28,11 +28,11 @@
 *       DOUBLE PRECISION   D( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARSCL2 performs a reciprocal diagonal scaling on an vector:
 *>   x <-- inv(D) * x
@@ -40,11 +40,10 @@
 *>
 *> Eventually to be replaced by BLAS_zge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -76,10 +75,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlartg.f b/SRC/zlartg.f
index 2c8309ec..823e7688 100644
--- a/SRC/zlartg.f
+++ b/SRC/zlartg.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARTG( F, G, CS, SN, R )
 * 
@@ -25,11 +25,11 @@
 *       COMPLEX*16         F, G, R, SN
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARTG generates a plane rotation so that
 *>
@@ -42,11 +42,10 @@
 *>    F and G are unchanged on return.
 *>    If G=0, then CS=1 and SN=0.
 *>    If F=0, then CS=0 and SN is chosen so that R is real.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] F
 *> \verbatim
@@ -77,10 +76,9 @@
 *>          R is COMPLEX*16
 *>          The nonzero component of the rotated vector.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -91,17 +89,15 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  3-5-96 - Modified with a new algorithm by W. Kahan and J. Demmel
 *>
 *>  This version has a few statements commented out for thread safety
 *>  (machine parameters are computed on each entry). 10 feb 03, SJH.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlartv.f b/SRC/zlartv.f
index fcc525e9..4af0a1c0 100644
--- a/SRC/zlartv.f
+++ b/SRC/zlartv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARTV( N, X, INCX, Y, INCY, C, S, INCC )
 * 
@@ -28,22 +28,21 @@
 *       COMPLEX*16         S( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARTV applies a vector of complex plane rotations with real cosines
 *> to elements of the complex vectors x and y. For i = 1,2,...,n
 *>
 *>    ( x(i) ) := (        c(i)   s(i) ) ( x(i) )
 *>    ( y(i) )    ( -conjg(s(i))  c(i) ) ( y(i) )
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -92,10 +91,9 @@
 *>          INCC is INTEGER
 *>          The increment between elements of C and S. INCC > 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlarz.f b/SRC/zlarz.f
index 48385d11..b4f192f8 100644
--- a/SRC/zlarz.f
+++ b/SRC/zlarz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARZ( SIDE, M, N, L, V, INCV, TAU, C, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         C( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARZ applies a complex elementary reflector H to a complex
 *> M-by-N matrix C, from either the left or the right. H is represented
@@ -49,11 +49,10 @@
 *> tau.
 *>
 *> H is a product of k elementary reflectors as returned by ZTZRZF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -121,10 +120,9 @@
 *>                         (N) if SIDE = 'L'
 *>                      or (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -135,15 +133,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlarzb.f b/SRC/zlarzb.f
index 5498679c..40984ea0 100644
--- a/SRC/zlarzb.f
+++ b/SRC/zlarzb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V,
 *                          LDV, T, LDT, C, LDC, WORK, LDWORK )
@@ -30,21 +30,20 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARZB applies a complex block reflector H or its transpose H**H
 *> to a complex distributed M-by-N  C from the left or the right.
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -156,10 +155,9 @@
 *>          If SIDE = 'L', LDWORK >= max(1,N);
 *>          if SIDE = 'R', LDWORK >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -170,15 +168,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlarzt.f b/SRC/zlarzt.f
index 17c63db5..ea8cf268 100644
--- a/SRC/zlarzt.f
+++ b/SRC/zlarzt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLARZT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         T( LDT, * ), TAU( * ), V( LDV, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLARZT forms the triangular factor T of a complex block reflector
 *> H of order > n, which is defined as a product of k elementary
@@ -53,11 +53,10 @@
 *>    H  =  I - V**H * T * V
 *>
 *> Currently, only STOREV = 'R' and DIRECT = 'B' are supported.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] DIRECT
 *> \verbatim
@@ -125,10 +124,9 @@
 *>          LDT is INTEGER
 *>          The leading dimension of the array T. LDT >= K.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -139,14 +137,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The shape of the matrix V and the storage of the vectors which define
 *>  the H(i) is best illustrated by the following example with n = 5 and
@@ -181,7 +180,6 @@
 *>     V = ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
 *>         ( v1 v2 v3 )
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlascl.f b/SRC/zlascl.f
index 55ab2ded..9e4eff7a 100644
--- a/SRC/zlascl.f
+++ b/SRC/zlascl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO )
 * 
@@ -29,22 +29,21 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLASCL multiplies the M by N complex matrix A by the real scalar
 *> CTO/CFROM.  This is done without over/underflow as long as the final
 *> result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that
 *> A may be full, upper triangular, lower triangular, upper Hessenberg,
 *> or banded.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TYPE
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          0  - successful exit
 *>          <0 - if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlascl2.f b/SRC/zlascl2.f
index bc4898eb..4fb0d182 100644
--- a/SRC/zlascl2.f
+++ b/SRC/zlascl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLASCL2 ( M, N, D, X, LDX )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLASCL2 performs a diagonal scaling on a vector:
 *>   x <-- D * x
@@ -40,11 +40,10 @@
 *>
 *> Eventually to be replaced by BLAS_zge_diag_scale in the new BLAS
 *> standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -76,10 +75,9 @@
 *>          LDX is INTEGER
 *>     The leading dimension of the vector X. LDX >= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaset.f b/SRC/zlaset.f
index 80e2866a..da269036 100644
--- a/SRC/zlaset.f
+++ b/SRC/zlaset.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLASET( UPLO, M, N, ALPHA, BETA, A, LDA )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLASET initializes a 2-D array A to BETA on the diagonal and
 *> ALPHA on the offdiagonals.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlasr.f b/SRC/zlasr.f
index 29a0b277..b6f3c351 100644
--- a/SRC/zlasr.f
+++ b/SRC/zlasr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLASR applies a sequence of real plane rotations to a complex matrix
 *> A, from either the left or the right.
@@ -106,11 +106,10 @@
 *> 
 *> where R(k) appears in rows and columns k and z.  The rotations are
 *> performed without ever forming P(k) explicitly.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -185,10 +184,9 @@
 *>          LDA is INTEGER
 *>          The leading dimension of the array A.  LDA >= max(1,M).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlassq.f b/SRC/zlassq.f
index 67c76acd..8aa13c63 100644
--- a/SRC/zlassq.f
+++ b/SRC/zlassq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLASSQ( N, X, INCX, SCALE, SUMSQ )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLASSQ returns the values scl and ssq such that
 *>
@@ -52,11 +52,10 @@
 *> SCALE and SUMSQ are overwritten by scl and ssq respectively.
 *>
 *> The routine makes only one pass through the vector X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          On entry, the value  sumsq  in the equation above.
 *>          On exit, SUMSQ is overwritten with the value  ssq .
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlaswp.f b/SRC/zlaswp.f
index 0ca515a7..992b4215 100644
--- a/SRC/zlaswp.f
+++ b/SRC/zlaswp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLASWP( N, A, LDA, K1, K2, IPIV, INCX )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLASWP performs a series of row interchanges on the matrix A.
 *> One row interchange is initiated for each of rows K1 through K2 of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -90,10 +89,9 @@
 *>          The increment between successive values of IPIV.  If IPIV
 *>          is negative, the pivots are applied in reverse order.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -104,15 +102,13 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  Modified by
 *>   R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlasyf.f b/SRC/zlasyf.f
index 8a1b39a9..0ffcd562 100644
--- a/SRC/zlasyf.f
+++ b/SRC/zlasyf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLASYF( UPLO, N, NB, KB, A, LDA, IPIV, W, LDW, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLASYF computes a partial factorization of a complex symmetric matrix
 *> A using the Bunch-Kaufman diagonal pivoting method. The partial
@@ -52,11 +52,10 @@
 *> ZLASYF is an auxiliary routine called by ZSYTRF. It uses blocked code
 *> (calling Level 3 BLAS) to update the submatrix A11 (if UPLO = 'U') or
 *> A22 (if UPLO = 'L').
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -142,10 +141,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlat2c.f b/SRC/zlat2c.f
index d635b37d..c7482305 100644
--- a/SRC/zlat2c.f
+++ b/SRC/zlat2c.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAT2C( UPLO, N, A, LDA, SA, LDSA, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAT2C converts a COMPLEX*16 triangular matrix, SA, to a COMPLEX
 *> triangular matrix, A.
@@ -43,11 +43,10 @@
 *> RMAX. If not the convertion is aborted and a flag is raised.
 *>
 *> This is an auxiliary routine so there is no argument checking.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -96,10 +95,9 @@
 *>                PRECISION overflow threshold, in this case, the content
 *>                of the UPLO part of SA in exit is unspecified.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlatbs.f b/SRC/zlatbs.f
index 464d47f2..1919566d 100644
--- a/SRC/zlatbs.f
+++ b/SRC/zlatbs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLATBS( UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X,
 *                          SCALE, CNORM, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AB( LDAB, * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLATBS solves one of the triangular systems
 *>
@@ -49,11 +49,10 @@
 *> overflow, the Level 2 BLAS routine ZTBSV is called.  If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -169,10 +167,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, ZTBSV
@@ -240,7 +237,6 @@
 *>
 *>  and we can safely call ZTBSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlatdf.f b/SRC/zlatdf.f
index 1a4f175f..659068c6 100644
--- a/SRC/zlatdf.f
+++ b/SRC/zlatdf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
 *                          JPIV )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         RHS( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLATDF computes the contribution to the reciprocal Dif-estimate
 *> by solving for x in Z * x = b, where b is chosen such that the norm
@@ -45,11 +45,10 @@
 *> The factorization of Z returned by ZGETC2 has the form
 *> Z = P * L * U * Q, where P and Q are permutation matrices. L is lower
 *> triangular with unit diagonal elements and U is upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -126,10 +125,9 @@
 *>          The pivot indices; for 1 <= j <= N, column j of the
 *>          matrix has been interchanged with column JPIV(j).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -140,33 +138,33 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
+*> \par Further Details:
+*  =====================
+*>
+*>  This routine is a further developed implementation of algorithm
+*>  BSOLVE in [1] using complete pivoting in the LU factorization.
 *
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*>  This routine is a further developed implementation of algorithm
-*>  BSOLVE in [1] using complete pivoting in the LU factorization.
+*
+*> \par References:
+*  ================
 *>
 *>   [1]   Bo Kagstrom and Lars Westin,
 *>         Generalized Schur Methods with Condition Estimators for
 *>         Solving the Generalized Sylvester Equation, IEEE Transactions
 *>         on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751.
-*>
+*>\n
 *>   [2]   Peter Poromaa,
 *>         On Efficient and Robust Estimators for the Separation
 *>         between two Regular Matrix Pairs with Applications in
 *>         Condition Estimation. Report UMINF-95.05, Department of
 *>         Computing Science, Umea University, S-901 87 Umea, Sweden,
 *>         1995.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
      $                   JPIV )
diff --git a/SRC/zlatps.f b/SRC/zlatps.f
index 92607131..d6c1ece4 100644
--- a/SRC/zlatps.f
+++ b/SRC/zlatps.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLATPS( UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE,
 *                          CNORM, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AP( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLATPS solves one of the triangular systems
 *>
@@ -50,11 +50,10 @@
 *> overflow, the Level 2 BLAS routine ZTPSV is called. If the matrix A
 *> is singular (A(j,j) = 0 for some j), then s is set to 0 and a
 *> non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -157,10 +155,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, ZTPSV
@@ -228,7 +225,6 @@
 *>
 *>  and we can safely call ZTPSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlatrd.f b/SRC/zlatrd.f
index c85ed58e..61764e8a 100644
--- a/SRC/zlatrd.f
+++ b/SRC/zlatrd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLATRD( UPLO, N, NB, A, LDA, E, TAU, W, LDW )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), W( LDW, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLATRD reduces NB rows and columns of a complex Hermitian matrix A to
 *> Hermitian tridiagonal form by a unitary similarity
@@ -46,11 +46,10 @@
 *> matrix, of which the lower triangle is supplied.
 *>
 *> This is an auxiliary routine called by ZHETRD.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -132,10 +131,9 @@
 *>          LDW is INTEGER
 *>          The leading dimension of the array W. LDW >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -146,10 +144,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', the matrix Q is represented as a product of elementary
@@ -197,7 +194,6 @@
 *>  where d denotes a diagonal element of the reduced matrix, a denotes
 *>  an element of the original matrix that is unchanged, and vi denotes
 *>  an element of the vector defining H(i).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlatrs.f b/SRC/zlatrs.f
index ad603df7..2c093b1f 100644
--- a/SRC/zlatrs.f
+++ b/SRC/zlatrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE,
 *                          CNORM, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLATRS solves one of the triangular systems
 *>
@@ -49,11 +49,10 @@
 *> unscaled problem will not cause overflow, the Level 2 BLAS routine
 *> ZTRSV is called. If the matrix A is singular (A(j,j) = 0 for some j),
 *> then s is set to 0 and a non-trivial solution to A*x = 0 is returned.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,10 +163,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A rough bound on x is computed; if that is less than overflow, ZTRSV
@@ -236,7 +233,6 @@
 *>
 *>  and we can safely call ZTRSV if 1/M(n) and 1/G(n) are both greater
 *>  than max(underflow, 1/overflow).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlatrz.f b/SRC/zlatrz.f
index deb4c8c3..f164e29b 100644
--- a/SRC/zlatrz.f
+++ b/SRC/zlatrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLATRZ( M, N, L, A, LDA, TAU, WORK )
 * 
@@ -27,21 +27,20 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLATRZ factors the M-by-(M+L) complex upper trapezoidal matrix
 *> [ A1 A2 ] = [ A(1:M,1:M) A(1:M,N-L+1:N) ] as ( R  0 ) * Z by means
 *> of unitary transformations, where  Z is an (M+L)-by-(M+L) unitary
 *> matrix and, R and A1 are M-by-M upper triangular matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -89,10 +88,9 @@
 *> \verbatim
 *>          WORK is COMPLEX*16 array, dimension (M)
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,14 +101,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -136,7 +135,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zlatzm.f b/SRC/zlatzm.f
index 231b5e53..749f92a3 100644
--- a/SRC/zlatzm.f
+++ b/SRC/zlatzm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLATZM( SIDE, M, N, V, INCV, TAU, C1, C2, LDC, WORK )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         C1( LDC, * ), C2( LDC, * ), V( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine ZUNMRZ.
 *>
@@ -54,11 +54,10 @@
 *>        C = [ C1, C2 ] m
 *>               1  n-1
 *> Then C is overwritten by C*P.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -137,10 +136,9 @@
 *>                      (N) if SIDE = 'L'
 *>                      (M) if SIDE = 'R'
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlauu2.f b/SRC/zlauu2.f
index a6c078ad..7caf48e6 100644
--- a/SRC/zlauu2.f
+++ b/SRC/zlauu2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAUU2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAUU2 computes the product U * U**H or L**H * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the unblocked form of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zlauum.f b/SRC/zlauum.f
index 45dbabc9..6a57ca0c 100644
--- a/SRC/zlauum.f
+++ b/SRC/zlauum.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZLAUUM( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZLAUUM computes the product U * U**H or L**H * L, where the triangular
 *> factor U or L is stored in the upper or lower triangular part of
@@ -44,11 +44,10 @@
 *> overwriting the factor L in A.
 *>
 *> This is the blocked form of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpbcon.f b/SRC/zpbcon.f
index 27c73dcc..683ea0f2 100644
--- a/SRC/zpbcon.f
+++ b/SRC/zpbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBCON( UPLO, N, KD, AB, LDAB, ANORM, RCOND, WORK,
 *                          RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex Hermitian positive definite band matrix using
@@ -44,11 +44,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -117,10 +116,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpbequ.f b/SRC/zpbequ.f
index fa2f3a93..236040fb 100644
--- a/SRC/zpbequ.f
+++ b/SRC/zpbequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBEQU( UPLO, N, KD, AB, LDAB, S, SCOND, AMAX, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBEQU computes row and column scalings intended to equilibrate a
 *> Hermitian positive definite band matrix A and reduce its condition
@@ -44,11 +44,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpbrfs.f b/SRC/zpbrfs.f
index 5d975af0..2f473bc6 100644
--- a/SRC/zpbrfs.f
+++ b/SRC/zpbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBRFS( UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite
 *> and banded, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -165,16 +164,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpbstf.f b/SRC/zpbstf.f
index 0e48bfb1..4f613289 100644
--- a/SRC/zpbstf.f
+++ b/SRC/zpbstf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBSTF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBSTF computes a split Cholesky factorization of a complex
 *> Hermitian positive definite band matrix A.
@@ -47,11 +47,10 @@
 *>
 *> where U is upper triangular of order m = (n+kd)/2, and L is lower
 *> triangular of order n-m.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               because the updated element a(i,i) was negative; the
 *>               matrix A is not positive definite.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -151,7 +148,6 @@
 *>
 *>  Array elements marked * are not used by the routine; s12**H denotes
 *>  conjg(s12); the diagonal elements of S are real.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpbsv.f b/SRC/zpbsv.f
index 38a3822e..28a420f2 100644
--- a/SRC/zpbsv.f
+++ b/SRC/zpbsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBSV( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -46,11 +46,10 @@
 *> triangular band matrix, with the same number of superdiagonals or
 *> subdiagonals as A.  The factored form of A is then used to solve the
 *> system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,10 +136,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -162,7 +159,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpbsvx.f b/SRC/zpbsvx.f
index a7739ee7..be4e98b1 100644
--- a/SRC/zpbsvx.f
+++ b/SRC/zpbsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBSVX( FACT, UPLO, N, KD, NRHS, AB, LDAB, AFB, LDAFB,
 *                          EQUED, S, B, LDB, X, LDX, RCOND, FERR, BERR,
@@ -33,11 +33,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to
 *> compute the solution to a complex system of linear equations
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -85,11 +88,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -290,10 +292,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 
@@ -304,10 +305,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -335,7 +335,6 @@
 *>     a31  a42  a53  a64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpbtf2.f b/SRC/zpbtf2.f
index 3b291174..96fbdf31 100644
--- a/SRC/zpbtf2.f
+++ b/SRC/zpbtf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBTF2( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBTF2 computes the Cholesky factorization of a complex Hermitian
 *> positive definite band matrix A.
@@ -44,11 +44,10 @@
 *> of U, and L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -116,10 +114,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -140,7 +137,6 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpbtrf.f b/SRC/zpbtrf.f
index 202dd4c0..65ec22b5 100644
--- a/SRC/zpbtrf.f
+++ b/SRC/zpbtrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AB( LDAB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite band matrix A.
@@ -41,11 +41,10 @@
 *>    A = U**H * U,  if UPLO = 'U', or
 *>    A = L  * L**H,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The band storage scheme is illustrated by the following example, when
@@ -135,12 +132,13 @@
 *>     a31  a42  a53  a64   *    *      l31  l42  l53  l64   *    *
 *>
 *>  Array elements marked * are not used by the routine.
-*>
-*>  Contributed by
-*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
+*>  Peter Mayes and Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
+*
 *  =====================================================================
       SUBROUTINE ZPBTRF( UPLO, N, KD, AB, LDAB, INFO )
 *
diff --git a/SRC/zpbtrs.f b/SRC/zpbtrs.f
index 91950926..ac1c9f95 100644
--- a/SRC/zpbtrs.f
+++ b/SRC/zpbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPBTRS( UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPBTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite band matrix A using the Cholesky factorization
 *> A = U**H *U or A = L*L**H computed by ZPBTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpftrf.f b/SRC/zpftrf.f
index e4e116e6..8547c8db 100644
--- a/SRC/zpftrf.f
+++ b/SRC/zpftrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPFTRF( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,11 +27,11 @@
 *       .. Array Arguments ..
 *       COMPLEX*16         A( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPFTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A.
@@ -42,11 +42,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -196,10 +195,9 @@
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpftri.f b/SRC/zpftri.f
index 35a6fe62..5bd23af2 100644
--- a/SRC/zpftri.f
+++ b/SRC/zpftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPFTRI( TRANSR, UPLO, N, A, INFO )
 * 
@@ -27,20 +27,19 @@
 *       COMPLEX*16         A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPFTRI computes the inverse of a complex Hermitian positive definite
 *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
 *> computed by ZPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -103,10 +101,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -210,7 +207,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpftrs.f b/SRC/zpftrs.f
index e6a259e8..c0a53332 100644
--- a/SRC/zpftrs.f
+++ b/SRC/zpftrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPFTRS( TRANSR, UPLO, N, NRHS, A, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         A( 0: * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPFTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite matrix A using the Cholesky factorization
 *> A = U**H*U or A = L*L**H computed by ZPFTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -111,10 +109,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -218,7 +215,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpocon.f b/SRC/zpocon.f
index 97367cc6..c5e048fb 100644
--- a/SRC/zpocon.f
+++ b/SRC/zpocon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOCON( UPLO, N, A, LDA, ANORM, RCOND, WORK, RWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex Hermitian positive definite matrix using the
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpoequ.f b/SRC/zpoequ.f
index 03fe5e6d..45fd430b 100644
--- a/SRC/zpoequ.f
+++ b/SRC/zpoequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOEQU( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOEQU computes row and column scalings intended to equilibrate a
 *> Hermitian positive definite matrix A and reduce its condition number
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpoequb.f b/SRC/zpoequb.f
index 84d0fc02..b7d6a517 100644
--- a/SRC/zpoequb.f
+++ b/SRC/zpoequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOEQUB( N, A, LDA, S, SCOND, AMAX, INFO )
 * 
@@ -29,11 +29,11 @@
 *       DOUBLE PRECISION   S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOEQUB computes row and column scalings intended to equilibrate a
 *> symmetric positive definite matrix A and reduce its condition number
@@ -43,11 +43,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zporfs.f b/SRC/zporfs.f
index 8d56c397..eb2bd3b7 100644
--- a/SRC/zporfs.f
+++ b/SRC/zporfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPORFS( UPLO, N, NRHS, A, LDA, AF, LDAF, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPORFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite,
 *> and provides error bounds and backward error estimates for the
 *> solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,16 +158,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zporfsx.f b/SRC/zporfsx.f
index a1fb9b00..61e360f2 100644
--- a/SRC/zporfsx.f
+++ b/SRC/zporfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPORFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, S, B,
 *                           LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -37,13 +37,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZPORFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric positive
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -377,10 +374,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zposv.f b/SRC/zposv.f
index 683f2870..43dcfa73 100644
--- a/SRC/zposv.f
+++ b/SRC/zposv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and  L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zposvx.f b/SRC/zposvx.f
index cf60118d..f86f63ef 100644
--- a/SRC/zposvx.f
+++ b/SRC/zposvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                          S, B, LDB, X, LDX, RCOND, FERR, BERR, WORK,
@@ -33,11 +33,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOSVX uses the Cholesky factorization A = U**H*U or A = L*L**H to
 *> compute the solution to a complex system of linear equations
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -85,11 +88,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -286,10 +288,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 
diff --git a/SRC/zposvxx.f b/SRC/zposvxx.f
index 20a334a0..1b281f5a 100644
--- a/SRC/zposvxx.f
+++ b/SRC/zposvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, EQUED,
 *                           S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -37,13 +37,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZPOSVXX uses the Cholesky factorization A = U**T*U or A = L*L**T
 *>    to compute the solution to a complex*16 system of linear equations
@@ -64,9 +62,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what ZPOSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -104,11 +105,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -474,10 +474,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpotf2.f b/SRC/zpotf2.f
index 2abd1b32..0621b439 100644
--- a/SRC/zpotf2.f
+++ b/SRC/zpotf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOTF2( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOTF2 computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>               positive definite, and the factorization could not be
 *>               completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpotrf.f b/SRC/zpotrf.f
index 23106172..81a3c701 100644
--- a/SRC/zpotrf.f
+++ b/SRC/zpotrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOTRF( UPLO, N, A, LDA, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A.
@@ -43,11 +43,10 @@
 *> where U is an upper triangular matrix and L is lower triangular.
 *>
 *> This is the block version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -92,10 +91,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpotri.f b/SRC/zpotri.f
index b9e39530..124fa13b 100644
--- a/SRC/zpotri.f
+++ b/SRC/zpotri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOTRI( UPLO, N, A, LDA, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOTRI computes the inverse of a complex Hermitian positive definite
 *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
 *> computed by ZPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -80,10 +79,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpotrs.f b/SRC/zpotrs.f
index 0bc7147b..75015c44 100644
--- a/SRC/zpotrs.f
+++ b/SRC/zpotrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPOTRS( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPOTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite matrix A using the Cholesky factorization
 *> A = U**H * U or A = L * L**H computed by ZPOTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zppcon.f b/SRC/zppcon.f
index 864e8e0c..779b593c 100644
--- a/SRC/zppcon.f
+++ b/SRC/zppcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPCON( UPLO, N, AP, ANORM, RCOND, WORK, RWORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex Hermitian positive definite packed matrix using
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zppequ.f b/SRC/zppequ.f
index 5ddf0a77..ab8426f1 100644
--- a/SRC/zppequ.f
+++ b/SRC/zppequ.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPEQU( UPLO, N, AP, S, SCOND, AMAX, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPEQU computes row and column scalings intended to equilibrate a
 *> Hermitian positive definite matrix A in packed storage and reduce
@@ -44,11 +44,10 @@
 *> This choice of S puts the condition number of B within a factor N of
 *> the smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -102,10 +101,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpprfs.f b/SRC/zpprfs.f
index 01977a93..c62868f7 100644
--- a/SRC/zpprfs.f
+++ b/SRC/zpprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPRFS( UPLO, N, NRHS, AP, AFP, B, LDB, X, LDX, FERR,
 *                          BERR, WORK, RWORK, INFO )
@@ -31,21 +31,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -147,16 +146,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zppsv.f b/SRC/zppsv.f
index 030bd5ec..91419923 100644
--- a/SRC/zppsv.f
+++ b/SRC/zppsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPSV( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -45,11 +45,10 @@
 *> where U is an upper triangular matrix and L is a lower triangular
 *> matrix.  The factored form of A is then used to solve the system of
 *> equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>                positive definite, so the factorization could not be
 *>                completed, and the solution has not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -123,10 +121,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -142,7 +139,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zppsvx.f b/SRC/zppsvx.f
index f7fec165..8ca73b34 100644
--- a/SRC/zppsvx.f
+++ b/SRC/zppsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPSVX( FACT, UPLO, N, NRHS, AP, AFP, EQUED, S, B, LDB,
 *                          X, LDX, RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPSVX uses the Cholesky factorization A = U**H * U or A = L * L**H to
 *> compute the solution to a complex system of linear equations
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -84,11 +87,10 @@
 *> 6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(S) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] FACT
 *> \verbatim
@@ -272,10 +274,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 
@@ -286,10 +287,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -305,7 +305,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpptrf.f b/SRC/zpptrf.f
index eab3d046..93b27323 100644
--- a/SRC/zpptrf.f
+++ b/SRC/zpptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPTRF( UPLO, N, AP, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPTRF computes the Cholesky factorization of a complex Hermitian
 *> positive definite matrix A stored in packed format.
@@ -41,11 +41,10 @@
 *>    A = U**H * U,  if UPLO = 'U', or
 *>    A = L  * L**H,  if UPLO = 'L',
 *> where U is an upper triangular matrix and L is lower triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -84,10 +83,9 @@
 *>                positive definite, and the factorization could not be
 *>                completed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -117,7 +114,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpptri.f b/SRC/zpptri.f
index 53350477..0b33a02d 100644
--- a/SRC/zpptri.f
+++ b/SRC/zpptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPTRI( UPLO, N, AP, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPTRI computes the inverse of a complex Hermitian positive definite
 *> matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
 *> computed by ZPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -78,10 +77,9 @@
 *>          > 0:  if INFO = i, the (i,i) element of the factor U or L is
 *>                zero, and the inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpptrs.f b/SRC/zpptrs.f
index 257f76f5..90416688 100644
--- a/SRC/zpptrs.f
+++ b/SRC/zpptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPPTRS( UPLO, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPPTRS solves a system of linear equations A*X = B with a Hermitian
 *> positive definite matrix A in packed storage using the Cholesky
 *> factorization A = U**H * U or A = L * L**H computed by ZPPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpstf2.f b/SRC/zpstf2.f
index 472c706f..d5aac67c 100644
--- a/SRC/zpstf2.f
+++ b/SRC/zpstf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPSTF2( UPLO, N, A, LDA, PIV, RANK, TOL, WORK, INFO )
 * 
@@ -31,11 +31,11 @@
 *       INTEGER            PIV( N )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPSTF2 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 2 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 
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 
diff --git a/SRC/zptcon.f b/SRC/zptcon.f
index 7dc3dd33..a6bbd45f 100644
--- a/SRC/zptcon.f
+++ b/SRC/zptcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTCON( N, D, E, ANORM, RCOND, RWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTCON computes the reciprocal of the condition number (in the
 *> 1-norm) of a complex Hermitian positive definite tridiagonal matrix
@@ -43,11 +43,10 @@
 *> Norm(inv(A)) is computed by a direct method, and the reciprocal of
 *> the condition number is computed as
 *>                  RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -108,16 +106,14 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The method used is described in Nicholas J. Higham, "Efficient
 *>  Algorithms for Computing the Condition Number of a Tridiagonal
 *>  Matrix", SIAM J. Sci. Stat. Comput., Vol. 7, No. 1, January 1986.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zpteqr.f b/SRC/zpteqr.f
index 227cdcab..7788a2d6 100644
--- a/SRC/zpteqr.f
+++ b/SRC/zpteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric positive definite tridiagonal matrix by first factoring the
@@ -52,11 +52,10 @@
 *> tridiagonal form, however, may preclude the possibility of obtaining
 *> high relative accuracy in the small eigenvalues of the original
 *> matrix, if these eigenvalues range over many orders of magnitude.)
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                      if INFO = N+i, i off-diagonal elements of the
 *>                      bidiagonal factor did not converge to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zptrfs.f b/SRC/zptrfs.f
index 16e71ca5..5c08efc5 100644
--- a/SRC/zptrfs.f
+++ b/SRC/zptrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTRFS( UPLO, N, NRHS, D, E, DF, EF, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -32,21 +32,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is Hermitian positive definite
 *> and tridiagonal, and provides error bounds and backward error
 *> estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -159,16 +158,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zptsv.f b/SRC/zptsv.f
index 2498e4be..daf34be7 100644
--- a/SRC/zptsv.f
+++ b/SRC/zptsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTSV( N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         B( LDB, * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTSV computes the solution to a complex system of linear equations
 *> A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal
@@ -40,11 +40,10 @@
 *>
 *> A is factored as A = L*D*L**H, and the factored form of A is then
 *> used to solve the system of equations.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -100,10 +99,9 @@
 *>                computed.  The factorization has not been completed
 *>                unless i = N.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zptsvx.f b/SRC/zptsvx.f
index 7137e1c4..64b13647 100644
--- a/SRC/zptsvx.f
+++ b/SRC/zptsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX,
 *                          RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTSVX uses the factorization A = L*D*L**H to compute the solution
 *> to a complex system of linear equations A*X = B, where A is an
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -71,11 +74,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
@@ -215,10 +217,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 
diff --git a/SRC/zpttrf.f b/SRC/zpttrf.f
index 7da80c7e..b96aad91 100644
--- a/SRC/zpttrf.f
+++ b/SRC/zpttrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTTRF( N, D, E, INFO )
 * 
@@ -28,20 +28,19 @@
 *       COMPLEX*16         E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTTRF computes the L*D*L**H factorization of a complex Hermitian
 *> positive definite tridiagonal matrix A.  The factorization may also
 *> be regarded as having the form A = U**H *D*U.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -77,10 +76,9 @@
 *>               be completed, while if k = N, the factorization was
 *>               completed, but D(N) <= 0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zpttrs.f b/SRC/zpttrs.f
index e0bf1f99..4f2f8460 100644
--- a/SRC/zpttrs.f
+++ b/SRC/zpttrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTTRS( UPLO, N, NRHS, D, E, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         B( LDB, * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTTRS solves a tridiagonal system of the form
 *>    A * X = B
@@ -41,11 +41,10 @@
 *> D is a diagonal matrix specified in the vector D, U (or L) is a unit
 *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in
 *> the vector E, and X and B are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -106,10 +105,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zptts2.f b/SRC/zptts2.f
index 0f9608fc..3e252255 100644
--- a/SRC/zptts2.f
+++ b/SRC/zptts2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZPTTS2( IUPLO, N, NRHS, D, E, B, LDB )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         B( LDB, * ), E( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZPTTS2 solves a tridiagonal system of the form
 *>    A * X = B
@@ -40,11 +40,10 @@
 *> D is a diagonal matrix specified in the vector D, U (or L) is a unit
 *> bidiagonal matrix whose superdiagonal (subdiagonal) is specified in
 *> the vector E, and X and B are N by NRHS matrices.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IUPLO
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          LDB is INTEGER
 *>          The leading dimension of the array B.  LDB >= max(1,N).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zrot.f b/SRC/zrot.f
index f1acc533..316b9384 100644
--- a/SRC/zrot.f
+++ b/SRC/zrot.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZROT( N, CX, INCX, CY, INCY, C, S )
 * 
@@ -29,19 +29,18 @@
 *       COMPLEX*16         CX( * ), CY( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZROT   applies a plane rotation, where the cos (C) is real and the
 *> sin (S) is complex, and the vectors CX and CY are complex.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -88,10 +87,9 @@
 *>             [ -conjg(S)   C  ]
 *>          where C*C + S*CONJG(S) = 1.0.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zspcon.f b/SRC/zspcon.f
index f66fa352..0f0a36d3 100644
--- a/SRC/zspcon.f
+++ b/SRC/zspcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPCON( UPLO, N, AP, IPIV, ANORM, RCOND, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex symmetric packed matrix A using the
@@ -42,11 +42,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -103,10 +102,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zspmv.f b/SRC/zspmv.f
index 4daf3024..e0c6bea7 100644
--- a/SRC/zspmv.f
+++ b/SRC/zspmv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPMV( UPLO, N, ALPHA, AP, X, INCX, BETA, Y, INCY )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AP( * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPMV  performs the matrix-vector operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha and beta are scalars, x and y are n element vectors and
 *> A is an n by n symmetric matrix, supplied in packed form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -136,10 +135,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zspr.f b/SRC/zspr.f
index 977d3265..fc763af1 100644
--- a/SRC/zspr.f
+++ b/SRC/zspr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPR( UPLO, N, ALPHA, X, INCX, AP )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AP( * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPR    performs the symmetric rank 1 operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha is a complex scalar, x is an n element vector and A is an
 *> n by n symmetric matrix, supplied in packed form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -117,10 +116,9 @@
 *>           not be set, they are assumed to be zero, and on exit they
 *>           are set to zero.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsprfs.f b/SRC/zsprfs.f
index 8985b8c0..03258cca 100644
--- a/SRC/zsprfs.f
+++ b/SRC/zsprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -32,21 +32,20 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite
 *> and packed, and provides error bounds and backward error estimates
 *> for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -156,16 +155,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zspsv.f b/SRC/zspsv.f
index fa16bfd3..b4d3f846 100644
--- a/SRC/zspsv.f
+++ b/SRC/zspsv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPSV( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -47,11 +47,10 @@
 *> triangular matrices, D is symmetric and block diagonal with 1-by-1
 *> and 2-by-2 diagonal blocks.  The factored form of A is then used to
 *> solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, so the solution could not be
 *>                computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -160,7 +157,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zspsvx.f b/SRC/zspsvx.f
index b28194dc..78a96da8 100644
--- a/SRC/zspsvx.f
+++ b/SRC/zspsvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPSVX( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X,
 *                          LDX, RCOND, FERR, BERR, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPSVX uses the diagonal pivoting factorization A = U*D*U**T or
 *> A = L*D*L**T to compute the solution to a complex system of linear
@@ -46,9 +46,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -72,11 +75,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
@@ -238,10 +240,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 
@@ -252,10 +253,9 @@
 *
 *> \ingroup complex16OTHERsolve
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The packed storage scheme is illustrated by the following example
@@ -271,7 +271,6 @@
 *>  Packed storage of the upper triangle of A:
 *>
 *>  AP = [ a11, a12, a22, a13, a23, a33, a14, a24, a34, a44 ]
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zsptrf.f b/SRC/zsptrf.f
index 2cbb295b..74d5f491 100644
--- a/SRC/zsptrf.f
+++ b/SRC/zsptrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPTRF( UPLO, N, AP, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPTRF computes the factorization of a complex symmetric matrix A
 *> stored in packed format using the Bunch-Kaufman diagonal pivoting
@@ -44,11 +44,10 @@
 *> where U (or L) is a product of permutation and unit upper (lower)
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -114,10 +112,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  5-96 - Based on modifications by J. Lewis, Boeing Computer Services
@@ -156,7 +153,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zsptri.f b/SRC/zsptri.f
index 4400a3f3..64a3973a 100644
--- a/SRC/zsptri.f
+++ b/SRC/zsptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPTRI( UPLO, N, AP, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPTRI computes the inverse of a complex symmetric indefinite matrix
 *> A in packed storage using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by ZSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsptrs.f b/SRC/zsptrs.f
index b36222d4..d81ac743 100644
--- a/SRC/zsptrs.f
+++ b/SRC/zsptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSPTRS( UPLO, N, NRHS, AP, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSPTRS solves a system of linear equations A*X = B with a complex
 *> symmetric matrix A stored in packed format using the factorization
 *> A = U*D*U**T or A = L*D*L**T computed by ZSPTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -100,10 +99,9 @@
 *>          = 0:  successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zstedc.f b/SRC/zstedc.f
index 88c6d32f..25a4897f 100644
--- a/SRC/zstedc.f
+++ b/SRC/zstedc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK,
 *                          LRWORK, IWORK, LIWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSTEDC computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the divide and conquer method.
@@ -49,11 +49,10 @@
 *> which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2.
 *> It could conceivably fail on hexadecimal or decimal machines
 *> without guard digits, but we know of none.  See DLAED3 for details.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -191,10 +190,9 @@
 *>                working on the submatrix lying in rows and columns
 *>                INFO/(N+1) through mod(INFO,N+1).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -205,18 +203,12 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Jeff Rutter, Computer Science Division, University of California
-*>     at Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Jeff Rutter, Computer Science Division, University of California
+*> at Berkeley, USA
+*
 *  =====================================================================
       SUBROUTINE ZSTEDC( COMPZ, N, D, E, Z, LDZ, WORK, LWORK, RWORK,
      $                   LRWORK, IWORK, LIWORK, INFO )
diff --git a/SRC/zstegr.f b/SRC/zstegr.f
index c8e61aef..22313899 100644
--- a/SRC/zstegr.f
+++ b/SRC/zstegr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                  ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
@@ -33,11 +33,11 @@
 *       COMPLEX*16         Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSTEGR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -59,11 +59,10 @@
 *> NaNs.  Normal execution may create these exceptiona values and hence
 *> may abort due to a floating point exception in environments which
 *> do not conform to the IEEE-754 standard.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -232,10 +231,9 @@
 *>                the nonzero error code returned by DLARRE or
 *>                ZLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -246,19 +244,13 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Inderjit Dhillon, IBM Almaden, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, LBNL/NERSC, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Inderjit Dhillon, IBM Almaden, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, LBNL/NERSC, USA \n
+*
 *  =====================================================================
       SUBROUTINE ZSTEGR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $           ABSTOL, M, W, Z, LDZ, ISUPPZ, WORK, LWORK, IWORK,
diff --git a/SRC/zstein.f b/SRC/zstein.f
index 894b56c0..a4b20e4b 100644
--- a/SRC/zstein.f
+++ b/SRC/zstein.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSTEIN( N, D, E, M, W, IBLOCK, ISPLIT, Z, LDZ, WORK,
 *                          IWORK, IFAIL, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSTEIN computes the eigenvectors of a real symmetric tridiagonal
 *> matrix T corresponding to specified eigenvalues, using inverse
@@ -49,11 +49,10 @@
 *> transformation to the eigenvectors of a complex Hermitian matrix
 *> which was reduced to tridiagonal form.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -153,10 +152,12 @@
 *>          > 0: if INFO = i, then i eigenvectors failed to converge
 *>               in MAXITS iterations.  Their indices are stored in
 *>               array IFAIL.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  MAXITS  INTEGER, default = 5
 *>          The maximum number of iterations performed.
 *>
@@ -164,10 +165,9 @@
 *>          The number of iterations performed after norm growth
 *>          criterion is satisfied, should be at least 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zstemr.f b/SRC/zstemr.f
index 233aa44d..a576d5ef 100644
--- a/SRC/zstemr.f
+++ b/SRC/zstemr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
 *                          M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
@@ -34,11 +34,11 @@
 *       COMPLEX*16         Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSTEMR computes selected eigenvalues and, optionally, eigenvectors
 *> of a real symmetric tridiagonal matrix T. Any such unreduced matrix has
@@ -107,11 +107,10 @@
 *> Since LAPACK drivers overwrite the matrix data with the eigenvectors,
 *> ZSTEMR accepts complex workspace to facilitate interoperability
 *> with ZUNMTR or ZUPMTR.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBZ
 *> \verbatim
@@ -303,10 +302,9 @@
 *>                the nonzero error code returned by DLARRE or
 *>                ZLARRV, respectively.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -317,21 +315,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Beresford Parlett, University of California, Berkeley, USA
-*>     Jim Demmel, University of California, Berkeley, USA
-*>     Inderjit Dhillon, University of Texas, Austin, USA
-*>     Osni Marques, LBNL/NERSC, USA
-*>     Christof Voemel, University of California, Berkeley, USA
-*>
-*> \endverbatim
+*> \par Contributors:
+*  ==================
 *>
+*> Beresford Parlett, University of California, Berkeley, USA \n
+*> Jim Demmel, University of California, Berkeley, USA \n
+*> Inderjit Dhillon, University of Texas, Austin, USA \n
+*> Osni Marques, LBNL/NERSC, USA \n
+*> Christof Voemel, University of California, Berkeley, USA \n
+*
 *  =====================================================================
       SUBROUTINE ZSTEMR( JOBZ, RANGE, N, D, E, VL, VU, IL, IU,
      $                   M, W, Z, LDZ, NZC, ISUPPZ, TRYRAC, WORK, LWORK,
diff --git a/SRC/zsteqr.f b/SRC/zsteqr.f
index 30557d7b..30c7c36b 100644
--- a/SRC/zsteqr.f
+++ b/SRC/zsteqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
 * 
@@ -29,22 +29,21 @@
 *       COMPLEX*16         Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSTEQR computes all eigenvalues and, optionally, eigenvectors of a
 *> symmetric tridiagonal matrix using the implicit QL or QR method.
 *> The eigenvectors of a full or band complex Hermitian matrix can also
 *> be found if ZHETRD or ZHPTRD or ZHBTRD has been used to reduce this
 *> matrix to tridiagonal form.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPZ
 *> \verbatim
@@ -117,10 +116,9 @@
 *>                matrix which is unitarily similar to the original
 *>                matrix.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsycon.f b/SRC/zsycon.f
index 6146b0b4..ca325c70 100644
--- a/SRC/zsycon.f
+++ b/SRC/zsycon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYCON( UPLO, N, A, LDA, IPIV, ANORM, RCOND, WORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYCON estimates the reciprocal of the condition number (in the
 *> 1-norm) of a complex symmetric matrix A using the factorization
@@ -43,11 +43,10 @@
 *>
 *> An estimate is obtained for norm(inv(A)), and the reciprocal of the
 *> condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsyconv.f b/SRC/zsyconv.f
index 57112124..d116ccba 100644
--- a/SRC/zsyconv.f
+++ b/SRC/zsyconv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYCONV( UPLO, WAY, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYCONV converts A given by ZHETRF into L and D or vice-versa.
 *> Get nondiagonal elements of D (returned in workspace) and 
 *> apply or reverse permutation done in TRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -97,10 +96,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsyequb.f b/SRC/zsyequb.f
index 2d4a45d8..a0b4c56a 100644
--- a/SRC/zsyequb.f
+++ b/SRC/zsyequb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 * 
@@ -30,11 +30,11 @@
 *       DOUBLE PRECISION   S( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYEQUB computes row and column scalings intended to equilibrate a
 *> symmetric matrix A and reduce its condition number
@@ -44,11 +44,10 @@
 *> choice of S puts the condition number of B within a factor N of the
 *> smallest possible condition number over all possible diagonal
 *> scalings.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *>          > 0:  if INFO = i, the i-th diagonal element is nonpositive.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -127,19 +125,14 @@
 *
 *> \ingroup complex16SYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par References:
+*  ================
 *>
-*>  Reference: Livne, O.E. and Golub, G.H., "Scaling by Binormalization",
-*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004.
-*>  DOI 10.1023/B:NUMA.0000016606.32820.69
+*>  Livne, O.E. and Golub, G.H., "Scaling by Binormalization", \n
+*>  Numerical Algorithms, vol. 35, no. 1, pp. 97-120, January 2004. \n
+*>  DOI 10.1023/B:NUMA.0000016606.32820.69 \n 
 *>  Tech report version: http://ruready.utah.edu/archive/papers/bin.pdf
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZSYEQUB( UPLO, N, A, LDA, S, SCOND, AMAX, WORK, INFO )
 *
diff --git a/SRC/zsymv.f b/SRC/zsymv.f
index 03d9567f..858e7a01 100644
--- a/SRC/zsymv.f
+++ b/SRC/zsymv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYMV( UPLO, N, ALPHA, A, LDA, X, INCX, BETA, Y, INCY )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), X( * ), Y( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYMV  performs the matrix-vector  operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha and beta are scalars, x and y are n element vectors and
 *> A is an n by n symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -142,10 +141,9 @@
 *>           Y. INCY must not be zero.
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsyr.f b/SRC/zsyr.f
index adb4be39..2f02d1cd 100644
--- a/SRC/zsyr.f
+++ b/SRC/zsyr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYR( UPLO, N, ALPHA, X, INCX, A, LDA )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), X( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYR   performs the symmetric rank 1 operation
 *>
@@ -41,11 +41,10 @@
 *>
 *> where alpha is a complex scalar, x is an n element vector and A is an
 *> n by n symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -120,10 +119,9 @@
 *>           max( 1, N ).
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsyrfs.f b/SRC/zsyrfs.f
index 2ed039d9..1d123406 100644
--- a/SRC/zsyrfs.f
+++ b/SRC/zsyrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYRFS( UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B, LDB,
 *                          X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -32,20 +32,19 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYRFS improves the computed solution to a system of linear
 *> equations when the coefficient matrix is symmetric indefinite, and
 *> provides error bounds and backward error estimates for the solution.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -168,16 +167,17 @@
 *>          INFO is INTEGER
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  ITMAX is the maximum number of steps of iterative refinement.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsyrfsx.f b/SRC/zsyrfsx.f
index ae66d58c..0f72a2e4 100644
--- a/SRC/zsyrfsx.f
+++ b/SRC/zsyrfsx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYRFSX( UPLO, EQUED, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           S, B, LDB, X, LDX, RCOND, BERR, N_ERR_BNDS,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZSYRFSX improves the computed solution to a system of linear
 *>    equations when the coefficient matrix is symmetric indefinite, and
@@ -57,11 +55,10 @@
 *>    before calling this routine, as described by arguments EQUED and S
 *>    below. In this case, the solution and error bounds returned are
 *>    for the original unequilibrated system.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -386,10 +383,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsysv.f b/SRC/zsysv.f
index 5e9270fa..27ea908d 100644
--- a/SRC/zsysv.f
+++ b/SRC/zsysv.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYSV( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK,
 *                         LWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYSV computes the solution to a complex system of linear equations
 *>    A * X = B,
@@ -48,11 +48,10 @@
 *> triangular matrices, and D is symmetric and block diagonal with
 *> 1-by-1 and 2-by-2 diagonal blocks.  The factored form of A is then
 *> used to solve the system of equations A * X = B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -155,10 +154,9 @@
 *>               has been completed, but the block diagonal matrix D is
 *>               exactly singular, so the solution could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsysvx.f b/SRC/zsysvx.f
index addd8fe6..38f0bc7f 100644
--- a/SRC/zsysvx.f
+++ b/SRC/zsysvx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYSVX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV, B,
 *                          LDB, X, LDX, RCOND, FERR, BERR, WORK, LWORK,
@@ -34,11 +34,11 @@
 *      $                   WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYSVX uses the diagonal pivoting factorization to compute the
 *> solution to a complex system of linear equations A * X = B,
@@ -47,9 +47,12 @@
 *>
 *> Error bounds on the solution and a condition estimate are also
 *> provided.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *> The following steps are performed:
 *>
@@ -74,11 +77,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
@@ -265,10 +267,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 
diff --git a/SRC/zsysvxx.f b/SRC/zsysvxx.f
index 0394fee7..dd56bb0e 100644
--- a/SRC/zsysvxx.f
+++ b/SRC/zsysvxx.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYSVXX( FACT, UPLO, N, NRHS, A, LDA, AF, LDAF, IPIV,
 *                           EQUED, S, B, LDB, X, LDX, RCOND, RPVGRW, BERR,
@@ -38,13 +38,11 @@
 *      $                   ERR_BNDS_COMP( NRHS, * ), RWORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
-*> Purpose
-*>    =======
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *>    ZSYSVXX uses the diagonal pivoting factorization to compute the
 *>    solution to a complex*16 system of linear equations A * X = B, where
@@ -65,9 +63,12 @@
 *>    errors or warnings, but we cannot make that claim for general
 *>    user-provided factorizations and equilibration factors if they
 *>    differ from what ZSYSVXX would itself produce.
+*> \endverbatim
+*
+*> \par Description:
+*  =================
 *>
-*> Description
-*> ===========
+*> \verbatim
 *>
 *>    The following steps are performed:
 *>
@@ -108,11 +109,10 @@
 *>    6. If equilibration was used, the matrix X is premultiplied by
 *>    diag(R) so that it solves the original system before
 *>    equilibration.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \verbatim
 *>     Some optional parameters are bundled in the PARAMS array.  These
@@ -487,10 +487,9 @@
 *>         about all of the right-hand sides check ERR_BNDS_NORM or
 *>         ERR_BNDS_COMP.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsyswapr.f b/SRC/zsyswapr.f
index dc243023..0f912e16 100644
--- a/SRC/zsyswapr.f
+++ b/SRC/zsyswapr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYSWAPR( UPLO, N, A, LDA, I1, I2)
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       COMPLEX*16       A( LDA, N )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYSWAPR applies an elementary permutation on the rows and the columns of
 *> a symmetric matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -87,10 +86,9 @@
 *>          I2 is INTEGER
 *>          Index of the second row to swap
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsytf2.f b/SRC/zsytf2.f
index 225b676a..73865b4b 100644
--- a/SRC/zsytf2.f
+++ b/SRC/zsytf2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYTF2 computes the factorization of a complex symmetric matrix A
 *> using the Bunch-Kaufman diagonal pivoting method:
@@ -45,11 +45,10 @@
 *> block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the unblocked version of the algorithm, calling Level 2 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -110,10 +109,9 @@
 *>               exactly singular, and division by zero will occur if it
 *>               is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -124,22 +122,10 @@
 *
 *> \ingroup complex16SYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Further Details:
+*  =====================
 *>
-*>  09-29-06 - patch from
-*>    Bobby Cheng, MathWorks
-*>
-*>    Replace l.209 and l.377
-*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
-*>    by
-*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN
-*>
-*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
-*>         Company
+*> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
 *>     U = P(n)*U(n)* ... *P(k)U(k)* ...,
@@ -174,9 +160,25 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
+*
+*> \par Contributors:
+*  ==================
+*>
+*> \verbatim
+*>
+*>  09-29-06 - patch from
+*>    Bobby Cheng, MathWorks
 *>
+*>    Replace l.209 and l.377
+*>         IF( MAX( ABSAKK, COLMAX ).EQ.ZERO ) THEN
+*>    by
+*>         IF( (MAX( ABSAKK, COLMAX ).EQ.ZERO) .OR. DISNAN(ABSAKK) ) THEN
+*>
+*>  1-96 - Based on modifications by J. Lewis, Boeing Computer Services
+*>         Company
+*> \endverbatim
+*
 *  =====================================================================
       SUBROUTINE ZSYTF2( UPLO, N, A, LDA, IPIV, INFO )
 *
diff --git a/SRC/zsytrf.f b/SRC/zsytrf.f
index dd206451..c6ff3d35 100644
--- a/SRC/zsytrf.f
+++ b/SRC/zsytrf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYTRF( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYTRF computes the factorization of a complex symmetric matrix A
 *> using the Bunch-Kaufman diagonal pivoting method.  The form of the
@@ -46,11 +46,10 @@
 *> with 1-by-1 and 2-by-2 diagonal blocks.
 *>
 *> This is the blocked version of the algorithm, calling Level 3 BLAS.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -127,10 +126,9 @@
 *>                exactly singular, and division by zero will occur if it
 *>                is used to solve a system of equations.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -141,10 +139,9 @@
 *
 *> \ingroup complex16SYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  If UPLO = 'U', then A = U*D*U**T, where
@@ -180,7 +177,6 @@
 *>  If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k).
 *>  If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k),
 *>  and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zsytri.f b/SRC/zsytri.f
index 09cbb2cc..31c46cca 100644
--- a/SRC/zsytri.f
+++ b/SRC/zsytri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYTRI( UPLO, N, A, LDA, IPIV, WORK, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYTRI computes the inverse of a complex symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> ZSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsytri2.f b/SRC/zsytri2.f
index dc8decb4..150bac79 100644
--- a/SRC/zsytri2.f
+++ b/SRC/zsytri2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYTRI2( UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO )
 * 
@@ -29,21 +29,20 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYTRI2 computes the inverse of a COMPLEX*16 hermitian indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> ZSYTRF. ZSYTRI2 sets the LEADING DIMENSION of the workspace
 *> before calling ZSYTRI2X that actually computes the inverse.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsytri2x.f b/SRC/zsytri2x.f
index 83456834..b03bcfdf 100644
--- a/SRC/zsytri2x.f
+++ b/SRC/zsytri2x.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYTRI2X( UPLO, N, A, LDA, IPIV, WORK, NB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), WORK( N+NB+1,* )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYTRI2X computes the inverse of a complex symmetric indefinite matrix
 *> A using the factorization A = U*D*U**T or A = L*D*L**T computed by
 *> ZSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          > 0: if INFO = i, D(i,i) = 0; the matrix is singular and its
 *>               inverse could not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsytrs.f b/SRC/zsytrs.f
index 646b426c..a7ec1e52 100644
--- a/SRC/zsytrs.f
+++ b/SRC/zsytrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYTRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 * 
@@ -29,20 +29,19 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYTRS solves a system of linear equations A*X = B with a complex
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by ZSYTRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -105,10 +104,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zsytrs2.f b/SRC/zsytrs2.f
index 81dd04f6..38fbf0cd 100644
--- a/SRC/zsytrs2.f
+++ b/SRC/zsytrs2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZSYTRS2( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, 
 *                           WORK, INFO )
@@ -30,20 +30,19 @@
 *       COMPLEX*16       A( LDA, * ), B( LDB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZSYTRS2 solves a system of linear equations A*X = B with a real
 *> symmetric matrix A using the factorization A = U*D*U**T or
 *> A = L*D*L**T computed by ZSYTRF and converted by ZSYCONV.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztbcon.f b/SRC/ztbcon.f
index 60df906f..8fd82406 100644
--- a/SRC/ztbcon.f
+++ b/SRC/ztbcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTBCON( NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK,
 *                          RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AB( LDAB, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTBCON estimates the reciprocal of the condition number of a
 *> triangular band matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -127,10 +126,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztbrfs.f b/SRC/ztbrfs.f
index 83a201fa..2e4dfea9 100644
--- a/SRC/ztbrfs.f
+++ b/SRC/ztbrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTBRFS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTBRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular band
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by ZTBTRS or some other
 *> means before entering this routine.  ZTBRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -172,10 +171,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztbtrs.f b/SRC/ztbtrs.f
index be0745aa..3bc721a8 100644
--- a/SRC/ztbtrs.f
+++ b/SRC/ztbtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTBTRS( UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B,
 *                          LDB, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AB( LDAB, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTBTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular band matrix of order N, and B is an
 *> N-by-NRHS matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -130,10 +129,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztfsm.f b/SRC/ztfsm.f
index 1e1f00e2..79c56078 100644
--- a/SRC/ztfsm.f
+++ b/SRC/ztfsm.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTFSM( TRANSR, SIDE, UPLO, TRANS, DIAG, M, N, ALPHA, A,
 *                         B, LDB )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( 0: * ), B( 0: LDB-1, 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> Level 3 BLAS like routine for A in RFP Format.
 *>
@@ -50,11 +50,10 @@
 *> A is in Rectangular Full Packed (RFP) Format.
 *>
 *> The matrix X is overwritten on B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -174,10 +173,9 @@
 *>           max( 1, m ).
 *>           Unchanged on exit.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -188,10 +186,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -295,7 +292,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztftri.f b/SRC/ztftri.f
index f94c530d..d6cf0976 100644
--- a/SRC/ztftri.f
+++ b/SRC/ztftri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTFTRI( TRANSR, UPLO, DIAG, N, A, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         A( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTFTRI computes the inverse of a triangular matrix A stored in RFP
 *> format.
 *>
 *> This is a Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -112,10 +110,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -219,7 +216,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztfttp.f b/SRC/ztfttp.f
index d19432f8..27623209 100644
--- a/SRC/ztfttp.f
+++ b/SRC/ztfttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTFTTP( TRANSR, UPLO, N, ARF, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         AP( 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTFTTP copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -85,10 +84,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -99,10 +97,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -206,7 +203,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztfttr.f b/SRC/ztfttr.f
index 43a9c0b8..45e1fc12 100644
--- a/SRC/ztfttr.f
+++ b/SRC/ztfttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTFTTR( TRANSR, UPLO, N, ARF, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTFTTR copies a triangular matrix A from rectangular full packed
 *> format (TF) to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,10 +105,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -214,7 +211,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztgevc.f b/SRC/ztgevc.f
index 3787015c..426f7cde 100644
--- a/SRC/ztgevc.f
+++ b/SRC/ztgevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGEVC( SIDE, HOWMNY, SELECT, N, S, LDS, P, LDP, VL,
 *                          LDVL, VR, LDVR, MM, M, WORK, RWORK, INFO )
@@ -33,11 +33,11 @@
 *       ..
 *  
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGEVC computes some or all of the right and/or left eigenvectors of
 *> a pair of complex matrices (S,P), where S and P are upper triangular.
@@ -63,11 +63,10 @@
 *> If Q and Z are the unitary factors from the generalized Schur
 *> factorization of a matrix pair (A,B), then Z*X and Q*Y
 *> are the matrices of right and left eigenvectors of (A,B).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -203,10 +202,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztgex2.f b/SRC/ztgex2.f
index 3eea8c69..07169149 100644
--- a/SRC/ztgex2.f
+++ b/SRC/ztgex2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, J1, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGEX2 swaps adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22)
 *> in an upper triangular matrix pair (A, B) by an unitary equivalence
@@ -49,11 +49,10 @@
 *>        Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H
 *>        Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -145,10 +144,9 @@
 *>                from generalized Schur form; the problem is ill-
 *>                conditioned. 
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -159,26 +157,28 @@
 *
 *> \ingroup complex16GEauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
-*>
-*>  Based on contributions by
-*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
-*>     Umea University, S-901 87 Umea, Sweden.
+*> \par Further Details:
+*  =====================
 *>
 *>  In the current code both weak and strong stability tests are
 *>  performed. The user can omit the strong stability test by changing
 *>  the internal logical parameter WANDS to .FALSE.. See ref. [2] for
 *>  details.
+*
+*> \par Contributors:
+*  ==================
+*>
+*>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+*>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
+*> \n
 *>  [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
 *>      Eigenvalues of a Regular Matrix Pair (A, B) and Condition
 *>      Estimation: Theory, Algorithms and Software, Report UMINF-94.04,
@@ -186,8 +186,6 @@
 *>      Sweden, 1994. Also as LAPACK Working Note 87. To appear in
 *>      Numerical Algorithms, 1996.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
      $                   LDZ, J1, INFO )
diff --git a/SRC/ztgexc.f b/SRC/ztgexc.f
index 65905b65..acc814a0 100644
--- a/SRC/ztgexc.f
+++ b/SRC/ztgexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
 *                          LDZ, IFST, ILST, INFO )
@@ -30,11 +30,11 @@
 *      $                   Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGEXC reorders the generalized Schur decomposition of a complex
 *> matrix pair (A,B), using an unitary equivalence transformation
@@ -49,11 +49,10 @@
 *>
 *>        Q(in) * A(in) * Z(in)**H = Q(out) * A(out) * Z(out)**H
 *>        Q(in) * B(in) * Z(in)**H = Q(out) * B(out) * Z(out)**H
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] WANTQ
 *> \verbatim
@@ -155,10 +154,9 @@
 *>                and ILST points to the first row of the current
 *>                position of the block being moved.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -169,28 +167,27 @@
 *
 *> \ingroup complex16GEcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
+*> \n
 *>  [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
 *>      Eigenvalues of a Regular Matrix Pair (A, B) and Condition
 *>      Estimation: Theory, Algorithms and Software, Report
 *>      UMINF - 94.04, Department of Computing Science, Umea University,
 *>      S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87.
 *>      To appear in Numerical Algorithms, 1996.
-*>
+*> \n
 *>  [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
 *>      Separation between Regular Matrix Pairs, Report UMINF - 93.23,
@@ -199,8 +196,6 @@
 *>      Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
 *>      1996.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
      $                   LDZ, IFST, ILST, INFO )
diff --git a/SRC/ztgsen.f b/SRC/ztgsen.f
index 66455442..28361758 100644
--- a/SRC/ztgsen.f
+++ b/SRC/ztgsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB,
 *                          ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF,
@@ -36,11 +36,11 @@
 *      $                   BETA( * ), Q( LDQ, * ), WORK( * ), Z( LDZ, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGSEN reorders the generalized Schur decomposition of a complex
 *> matrix pair (A, B) (in terms of an unitary equivalence trans-
@@ -65,11 +65,10 @@
 *> and norms of "projections" onto left and right eigenspaces w.r.t.
 *> the selected cluster in the (1,1)-block.
 *>
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] IJOB
 *> \verbatim
@@ -282,10 +281,9 @@
 *>                (A, B) may have been partially reordered.
 *>                If requested, 0 is returned in DIF(*), PL and PR.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -296,10 +294,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  ZTGSEN first collects the selected eigenvalues by computing unitary
@@ -400,26 +397,29 @@
 *>  based estimate DIF is not wanted (see ZLATDF), then the parameter
 *>  IDIFJB (see below) should be changed from 3 to 4 (routine ZLATDF
 *>  (IJOB = 2 will be used)). See ZTGSYL for more details.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*>  References
-*>  ==========
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
 *>      M.S. Moonen et al (eds), Linear Algebra for Large Scale and
 *>      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
-*>
+*> \n
 *>  [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
 *>      Eigenvalues of a Regular Matrix Pair (A, B) and Condition
 *>      Estimation: Theory, Algorithms and Software, Report
 *>      UMINF - 94.04, Department of Computing Science, Umea University,
 *>      S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87.
 *>      To appear in Numerical Algorithms, 1996.
-*>
+*> \n
 *>  [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
 *>      Separation between Regular Matrix Pairs, Report UMINF - 93.23,
@@ -428,8 +428,6 @@
 *>      Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
 *>      1996.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB,
      $                   ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF,
diff --git a/SRC/ztgsja.f b/SRC/ztgsja.f
index 7567e9df..7fa0bc68 100644
--- a/SRC/ztgsja.f
+++ b/SRC/ztgsja.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B,
 *                          LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV,
@@ -34,11 +34,11 @@
 *      $                   U( LDU, * ), V( LDV, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGSJA computes the generalized singular value decomposition (GSVD)
 *> of two complex upper triangular (or trapezoidal) matrices A and B.
@@ -124,11 +124,10 @@
 *> The computation of the unitary transformation matrices U, V or Q
 *> is optional.  These matrices may either be formed explicitly, or they
 *> may be postmultiplied into input matrices U1, V1, or Q1.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU
 *> \verbatim
@@ -332,19 +331,20 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          = 1:  the procedure does not converge after MAXIT cycles.
+*> \endverbatim
+*
+*> \par Internal Parameters:
+*  =========================
 *>
-*>  Internal Parameters
-*>  ===================
-*>
+*> \verbatim
 *>  MAXIT   INTEGER
 *>          MAXIT specifies the total loops that the iterative procedure
 *>          may take. If after MAXIT cycles, the routine fails to
 *>          converge, we return INFO = 1.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -355,10 +355,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  ZTGSJA essentially uses a variant of Kogbetliantz algorithm to reduce
@@ -373,7 +372,6 @@
 *>                C1**2 + S1**2 = I,
 *>
 *>  and R1 is an L-by-L nonsingular upper triangular matrix.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztgsna.f b/SRC/ztgsna.f
index fa9cb872..21394be5 100644
--- a/SRC/ztgsna.f
+++ b/SRC/ztgsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL,
 *                          LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK,
@@ -34,22 +34,21 @@
 *      $                   VR( LDVR, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or eigenvectors of a matrix pair (A, B).
 *>
 *> (A, B) must be in generalized Schur canonical form, that is, A and
 *> B are both upper triangular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -205,10 +204,9 @@
 *>          = 0: Successful exit
 *>          < 0: If INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -219,10 +217,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of the i-th generalized
@@ -275,13 +272,18 @@
 *>                      EPS * norm(A, B) / DIF(i).
 *>
 *>  See ref. [2-3] for more details and further references.
+*> \endverbatim
+*
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
-*>  References
-*>  ==========
+*> \verbatim
 *>
 *>  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
 *>      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
@@ -302,7 +304,6 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75.
 *>      To appear in ACM Trans. on Math. Software, Vol 22, No 1, 1996.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztgsy2.f b/SRC/ztgsy2.f
index 2a85b8a1..1717e7f6 100644
--- a/SRC/ztgsy2.f
+++ b/SRC/ztgsy2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
@@ -32,11 +32,11 @@
 *      $                   D( LDD, * ), E( LDE, * ), F( LDF, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGSY2 solves the generalized Sylvester equation
 *>
@@ -73,11 +73,10 @@
 *> of an upper bound on the separation between to matrix pairs. Then
 *> the input (A, D), (B, E) are sub-pencils of two matrix pairs in
 *> ZTGSYL.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -236,10 +235,9 @@
 *>            >0: The matrix pairs (A, D) and (B, E) have common or very
 *>                close eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -250,18 +248,12 @@
 *
 *> \ingroup complex16SYauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
-*>
-*> \endverbatim
-*>
+*
 *  =====================================================================
       SUBROUTINE ZTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
      $                   LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
diff --git a/SRC/ztgsyl.f b/SRC/ztgsyl.f
index da509d69..416387ba 100644
--- a/SRC/ztgsyl.f
+++ b/SRC/ztgsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
 *                          LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK,
@@ -35,11 +35,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTGSYL solves the generalized Sylvester equation:
 *>
@@ -79,11 +79,10 @@
 *> reciprocal of the smallest singular value of Z.
 *>
 *> This is a level-3 BLAS algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -252,10 +251,9 @@
 *>            >0: (A, D) and (B, E) have common or very close
 *>                eigenvalues.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -266,15 +264,14 @@
 *
 *> \ingroup complex16SYcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>     Bo Kagstrom and Peter Poromaa, Department of Computing Science,
 *>     Umea University, S-901 87 Umea, Sweden.
+*
+*> \par References:
+*  ================
 *>
 *>  [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
 *>      for Solving the Generalized Sylvester Equation and Estimating the
@@ -283,18 +280,16 @@
 *>      Sweden, December 1993, Revised April 1994, Also as LAPACK Working
 *>      Note 75.  To appear in ACM Trans. on Math. Software, Vol 22,
 *>      No 1, 1996.
-*>
+*> \n
 *>  [2] B. Kagstrom, A Perturbation Analysis of the Generalized Sylvester
 *>      Equation (AR - LB, DR - LE ) = (C, F), SIAM J. Matrix Anal.
 *>      Appl., 15(4):1045-1060, 1994.
-*>
+*> \n
 *>  [3] B. Kagstrom and L. Westin, Generalized Schur Methods with
 *>      Condition Estimators for Solving the Generalized Sylvester
 *>      Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7,
 *>      July 1989, pp 745-751.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
      $                   LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK,
diff --git a/SRC/ztpcon.f b/SRC/ztpcon.f
index df13fa40..cabb219d 100644
--- a/SRC/ztpcon.f
+++ b/SRC/ztpcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPCON( NORM, UPLO, DIAG, N, AP, RCOND, WORK, RWORK,
 *                          INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         AP( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPCON estimates the reciprocal of the condition number of a packed
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -114,10 +113,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztpmqrt.f b/SRC/ztpmqrt.f
index 116d8eb6..809fb8e5 100644
--- a/SRC/ztpmqrt.f
+++ b/SRC/ztpmqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPMQRT( SIDE, TRANS, M, N, K, L, NB, V, LDV, T, LDT,
 *                           A, LDA, B, LDB, WORK, INFO )
@@ -30,20 +30,19 @@
 *      $          WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPMQRT applies a complex orthogonal matrix Q obtained from a 
 *> "triangular-pentagonal" complex block reflector H to a general
 *> complex matrix C, which consists of two blocks A and B.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -167,10 +166,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -181,10 +179,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The columns of the pentagonal matrix V contain the elementary reflectors
@@ -213,7 +210,6 @@
 *>  If TRANS='N' and SIDE='R', C is on exit replaced with C * Q.
 *>
 *>  If TRANS='C' and SIDE='R', C is on exit replaced with C * Q**H.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztpqrt.f b/SRC/ztpqrt.f
index ae9d23cf..f2b1eba4 100644
--- a/SRC/ztpqrt.f
+++ b/SRC/ztpqrt.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPQRT( M, N, L, NB, A, LDA, B, LDB, T, LDT, WORK,
 *                          INFO )
@@ -28,21 +28,20 @@
 *       COMPLEX*16 A( LDA, * ), B( LDB, * ), T( LDT, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPQRT computes a blocked QR factorization of a complex 
 *> "triangular-pentagonal" matrix C, which is composed of a 
 *> triangular block A and pentagonal block B, using the compact 
 *> WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -124,10 +123,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -138,11 +136,11 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
+*>
 *>  The input matrix C is a (N+M)-by-N matrix  
 *>
 *>               C = [ A ]
@@ -185,7 +183,6 @@
 *>  for the last block) T's are stored in the NB-by-N matrix T as
 *>
 *>               T = [T1 T2 ... TB].
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztpqrt2.f b/SRC/ztpqrt2.f
index 44aaf9d1..ec9ac11a 100644
--- a/SRC/ztpqrt2.f
+++ b/SRC/ztpqrt2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO )
 * 
@@ -27,20 +27,19 @@
 *       COMPLEX*16   A( LDA, * ), B( LDB, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPQRT2 computes a QR factorization of a complex "triangular-pentagonal"
 *> matrix C, which is composed of a triangular block A and pentagonal block B, 
 *> using the compact WY representation for Q.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -125,10 +123,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The input matrix C is a (N+M)-by-N matrix  
@@ -171,7 +168,6 @@
 *>
 *>  where W**H is the conjugate transpose of W and T is the upper triangular
 *>  factor of the block reflector.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztprfb.f b/SRC/ztprfb.f
index bce429bf..7f46d9c7 100644
--- a/SRC/ztprfb.f
+++ b/SRC/ztprfb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPRFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, 
 *                          V, LDV, T, LDT, A, LDA, B, LDB, WORK, LDWORK )
@@ -30,20 +30,20 @@
 *      $          V( LDV, * ), WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPRFB applies a complex "triangular-pentagonal" block reflector H or its 
 *> conjugate transpose H**H to a complex matrix C, which is composed of two 
 *> blocks A and B, either from the left or right.
 *> 
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -185,10 +185,9 @@
 *>          If SIDE = 'L', LDWORK >= K; 
 *>          if SIDE = 'R', LDWORK >= M.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -199,10 +198,9 @@
 *
 *> \ingroup complex16OTHERauxiliary
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The matrix C is a composite matrix formed from blocks A and B.
@@ -247,7 +245,6 @@
 *>  If STOREV = 'R' and SIDE = 'L', V is K-by-M with V2 K-by-L.
 *>
 *>  If STOREV = 'R' and SIDE = 'R', V is K-by-N with V2 K-by-L.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztprfs.f b/SRC/ztprfs.f
index 961caf46..1e143d0b 100644
--- a/SRC/ztprfs.f
+++ b/SRC/ztprfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPRFS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX,
 *                          FERR, BERR, WORK, RWORK, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         AP( * ), B( LDB, * ), WORK( * ), X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular packed
@@ -43,11 +43,10 @@
 *> The solution matrix X must be computed by ZTPTRS or some other
 *> means before entering this routine.  ZTPRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -158,10 +157,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztptri.f b/SRC/ztptri.f
index 3f03982d..f8d5e310 100644
--- a/SRC/ztptri.f
+++ b/SRC/ztptri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPTRI( UPLO, DIAG, N, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPTRI computes the inverse of a complex upper or lower triangular
 *> matrix A stored in packed format.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -83,10 +82,9 @@
 *>          > 0:  if INFO = i, A(i,i) is exactly zero.  The triangular
 *>                matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -97,10 +95,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  A triangular matrix A can be transferred to packed storage using one
@@ -115,7 +112,6 @@
 *>      1    CONTINUE                    1    CONTINUE
 *>           JC = JC + J                      JC = JC + N - J + 1
 *>      2 CONTINUE                       2 CONTINUE
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztptrs.f b/SRC/ztptrs.f
index ab2581e4..24312dd7 100644
--- a/SRC/ztptrs.f
+++ b/SRC/ztptrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPTRS( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AP( * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *> where A is a triangular matrix of order N stored in packed format,
 *> and B is an N-by-NRHS matrix.  A check is made to verify that A is
 *> nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -115,10 +114,9 @@
 *>                indicating that the matrix is singular and the
 *>                solutions X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztpttf.f b/SRC/ztpttf.f
index d25082dc..9e223709 100644
--- a/SRC/ztpttf.f
+++ b/SRC/ztpttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPTTF( TRANSR, UPLO, N, AP, ARF, INFO )
 * 
@@ -27,19 +27,18 @@
 *       .. Array Arguments ..
 *       COMPLEX*16         AP( 0: * ), ARF( 0: * )
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPTTF copies a triangular matrix A from standard packed format (TP)
 *> to rectangular full packed format (TF).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -84,10 +83,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -98,10 +96,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -205,7 +202,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztpttr.f b/SRC/ztpttr.f
index 1b777414..70e99ab8 100644
--- a/SRC/ztpttr.f
+++ b/SRC/ztpttr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTPTTR( UPLO, N, AP, A, LDA, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTPTTR copies a triangular matrix A from standard packed format (TP)
 *> to standard full format (TR).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrcon.f b/SRC/ztrcon.f
index 86842233..469914a0 100644
--- a/SRC/ztrcon.f
+++ b/SRC/ztrcon.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRCON( NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK,
 *                          RWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         A( LDA, * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRCON estimates the reciprocal of the condition number of a
 *> triangular matrix A, in either the 1-norm or the infinity-norm.
@@ -44,11 +44,10 @@
 *> norm(inv(A)), then the reciprocal of the condition number is
 *> computed as
 *>    RCOND = 1 / ( norm(A) * norm(inv(A)) ).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] NORM
 *> \verbatim
@@ -121,10 +120,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrevc.f b/SRC/ztrevc.f
index 40a41c97..f41ddefd 100644
--- a/SRC/ztrevc.f
+++ b/SRC/ztrevc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, MM, M, WORK, RWORK, INFO )
@@ -32,11 +32,11 @@
 *      $                   WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTREVC computes some or all of the right and/or left eigenvectors of
 *> a complex upper triangular matrix T.
@@ -57,11 +57,10 @@
 *> input matrix.  If Q is the unitary factor that reduces a matrix A to
 *> Schur form T, then Q*X and Q*Y are the matrices of right and left
 *> eigenvectors of A.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -188,10 +187,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -202,10 +200,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The algorithm used in this program is basically backward (forward)
@@ -215,7 +212,6 @@
 *>  Each eigenvector is normalized so that the element of largest
 *>  magnitude has magnitude 1; here the magnitude of a complex number
 *>  (x,y) is taken to be |x| + |y|.
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztrexc.f b/SRC/ztrexc.f
index aa5e8e79..a8f1df9f 100644
--- a/SRC/ztrexc.f
+++ b/SRC/ztrexc.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         Q( LDQ, * ), T( LDT, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTREXC reorders the Schur factorization of a complex matrix
 *> A = Q*T*Q**H, so that the diagonal element of T with row index IFST
@@ -41,11 +41,10 @@
 *> The Schur form T is reordered by a unitary similarity transformation
 *> Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by
 *> postmultplying it with Z.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] COMPQ
 *> \verbatim
@@ -109,10 +108,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrrfs.f b/SRC/ztrrfs.f
index c6b5f5ee..7167b3da 100644
--- a/SRC/ztrrfs.f
+++ b/SRC/ztrrfs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRRFS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X,
 *                          LDX, FERR, BERR, WORK, RWORK, INFO )
@@ -31,11 +31,11 @@
 *      $                   X( LDX, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRRFS provides error bounds and backward error estimates for the
 *> solution to a system of linear equations with a triangular
@@ -44,11 +44,10 @@
 *> The solution matrix X must be computed by ZTRTRS or some other
 *> means before entering this routine.  ZTRRFS does not do iterative
 *> refinement because doing so cannot improve the backward error.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -166,10 +165,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrsen.f b/SRC/ztrsen.f
index be3e73de..3e9ad12c 100644
--- a/SRC/ztrsen.f
+++ b/SRC/ztrsen.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, W, M, S,
 *                          SEP, WORK, LWORK, INFO )
@@ -31,11 +31,11 @@
 *       COMPLEX*16         Q( LDQ, * ), T( LDT, * ), W( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRSEN reorders the Schur factorization of a complex matrix
 *> A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in
@@ -45,11 +45,10 @@
 *>
 *> Optionally the routine computes the reciprocal condition numbers of
 *> the cluster of eigenvalues and/or the invariant subspace.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -174,10 +173,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -188,10 +186,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  ZTRSEN first collects the selected eigenvalues by computing a unitary
@@ -261,7 +258,6 @@
 *>  error in the computed right invariant subspace is
 *>
 *>                      EPS * norm(T) / SEP
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztrsna.f b/SRC/ztrsna.f
index ee3222f4..c3154520 100644
--- a/SRC/ztrsna.f
+++ b/SRC/ztrsna.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRSNA( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR,
 *                          LDVR, S, SEP, MM, M, WORK, LDWORK, RWORK,
@@ -33,20 +33,19 @@
 *      $                   WORK( LDWORK, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRSNA estimates reciprocal condition numbers for specified
 *> eigenvalues and/or right eigenvectors of a complex upper triangular
 *> matrix T (or of any matrix Q*T*Q**H with Q unitary).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOB
 *> \verbatim
@@ -189,10 +188,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -203,10 +201,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The reciprocal of the condition number of an eigenvalue lambda is
@@ -245,7 +242,6 @@
 *>  is given by
 *>
 *>                      EPS * norm(T) / SEP(i)
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztrsyl.f b/SRC/ztrsyl.f
index d450a880..32d0394e 100644
--- a/SRC/ztrsyl.f
+++ b/SRC/ztrsyl.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C,
 *                          LDC, SCALE, INFO )
@@ -30,11 +30,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * ), C( LDC, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRSYL solves the complex Sylvester matrix equation:
 *>
@@ -45,11 +45,10 @@
 *> M-by-M and B is N-by-N; the right hand side C and the solution X are
 *> M-by-N; and scale is an output scale factor, set <= 1 to avoid
 *> overflow in X.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANA
 *> \verbatim
@@ -141,10 +140,9 @@
 *>               values were used to solve the equation (but the matrices
 *>               A and B are unchanged).
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrti2.f b/SRC/ztrti2.f
index 79710a6e..a4ee646d 100644
--- a/SRC/ztrti2.f
+++ b/SRC/ztrti2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRTI2( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRTI2 computes the inverse of a complex upper or lower triangular
 *> matrix.
 *>
 *> This is the Level 2 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -95,10 +94,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -k, the k-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrtri.f b/SRC/ztrtri.f
index 198be217..37f4037b 100644
--- a/SRC/ztrtri.f
+++ b/SRC/ztrtri.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRTRI( UPLO, DIAG, N, A, LDA, INFO )
 * 
@@ -28,21 +28,20 @@
 *       COMPLEX*16         A( LDA, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRTRI computes the inverse of a complex upper or lower triangular
 *> matrix A.
 *>
 *> This is the Level 3 BLAS version of the algorithm.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -94,10 +93,9 @@
 *>          > 0: if INFO = i, A(i,i) is exactly zero.  The triangular
 *>               matrix is singular and its inverse can not be computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrtrs.f b/SRC/ztrtrs.f
index 696a579d..860e24dd 100644
--- a/SRC/ztrtrs.f
+++ b/SRC/ztrtrs.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRTRS( UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), B( LDB, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRTRS solves a triangular system of the form
 *>
@@ -41,11 +41,10 @@
 *>
 *> where A is a triangular matrix of order N, and B is an N-by-NRHS
 *> matrix.  A check is made to verify that A is nonsingular.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -124,10 +123,9 @@
 *>               indicating that the matrix is singular and the solutions
 *>               X have not been computed.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztrttf.f b/SRC/ztrttf.f
index 7e8cf0ba..d5233655 100644
--- a/SRC/ztrttf.f
+++ b/SRC/ztrttf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRTTF( TRANSR, UPLO, N, A, LDA, ARF, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         A( 0: LDA-1, 0: * ), ARF( 0: * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRTTF copies a triangular matrix A from standard full format (TR)
 *> to rectangular full packed format (TF) .
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANSR
 *> \verbatim
@@ -93,10 +92,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -107,10 +105,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  We first consider Standard Packed Format when N is even.
@@ -214,7 +211,6 @@
 *>     03 13 23 33 11             33 11 21 31 41 51
 *>     -- -- -- -- --                   -- -- -- --
 *>     04 14 24 34 44             43 44 22 32 42 52
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztrttp.f b/SRC/ztrttp.f
index f12a1ac7..44daa31a 100644
--- a/SRC/ztrttp.f
+++ b/SRC/ztrttp.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTRTTP( UPLO, N, A, LDA, AP, INFO )
 * 
@@ -28,19 +28,18 @@
 *       COMPLEX*16         A( LDA, * ), AP( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTRTTP copies a triangular matrix A from full format (TR) to standard
 *> packed format (TP).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -89,10 +88,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/ztzrqf.f b/SRC/ztzrqf.f
index c172ecf8..4c2db02a 100644
--- a/SRC/ztzrqf.f
+++ b/SRC/ztzrqf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTZRQF( M, N, A, LDA, TAU, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> This routine is deprecated and has been replaced by routine ZTZRZF.
 *>
@@ -44,11 +44,10 @@
 *>
 *> where Z is an N-by-N unitary matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -91,10 +90,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -105,10 +103,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The  factorization is obtained by Householder's method.  The kth
@@ -136,7 +133,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/ztzrzf.f b/SRC/ztzrzf.f
index f6ec0316..a3ef9e02 100644
--- a/SRC/ztzrzf.f
+++ b/SRC/ztzrzf.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZTZRZF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZTZRZF reduces the M-by-N ( M<=N ) complex upper trapezoidal matrix A
 *> to upper triangular form by means of unitary transformations.
@@ -42,11 +42,10 @@
 *>
 *> where Z is an N-by-N unitary matrix and R is an M-by-M upper
 *> triangular matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -122,14 +120,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
+*>
+*> \verbatim
 *>
 *>  The factorization is obtained by Householder's method.  The kth
 *>  transformation matrix, Z( k ), which is used to introduce zeros into
@@ -156,7 +155,6 @@
 *>  Z is given by
 *>
 *>     Z =  Z( 1 ) * Z( 2 ) * ... * Z( m ).
-*>
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zunbdb.f b/SRC/zunbdb.f
index 0db8e984..afd7edff 100644
--- a/SRC/zunbdb.f
+++ b/SRC/zunbdb.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
 *                          X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
@@ -34,11 +34,11 @@
 *      $                   X21( LDX21, * ), X22( LDX22, * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNBDB simultaneously bidiagonalizes the blocks of an M-by-M
 *> partitioned unitary matrix X:
@@ -60,11 +60,10 @@
 *>
 *> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented
 *> implicitly by angles THETA, PHI.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] TRANS
 *> \verbatim
@@ -247,10 +246,9 @@
 *>          = 0:  successful exit.
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -261,10 +259,9 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
+*> \par Further Details:
+*  =====================
+*>
 *> \verbatim
 *>
 *>  The bidiagonal blocks B11, B12, B21, and B22 are represented
@@ -277,15 +274,14 @@
 *>  P1, P2, Q1, and Q2 are represented as products of elementary
 *>  reflectors. See ZUNCSD for details on generating P1, P2, Q1, and Q2
 *>  using ZUNGQR and ZUNGLQ.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
 *>
-*> \endverbatim
-*>
 *  =====================================================================
       SUBROUTINE ZUNBDB( TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12,
      $                   X21, LDX21, X22, LDX22, THETA, PHI, TAUP1,
diff --git a/SRC/zuncsd.f b/SRC/zuncsd.f
index e5c1371c..6e96ff41 100644
--- a/SRC/zuncsd.f
+++ b/SRC/zuncsd.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       RECURSIVE SUBROUTINE ZUNCSD( JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS,
 *                                    SIGNS, M, P, Q, X11, LDX11, X12,
@@ -40,11 +40,11 @@
 *      $                   * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNCSD computes the CS decomposition of an M-by-M partitioned
 *> unitary matrix X:
@@ -61,11 +61,10 @@
 *> (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are
 *> R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in
 *> which R = MIN(P,M-P,Q,M-Q).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] JOBU1
 *> \verbatim
@@ -293,17 +292,16 @@
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value.
 *>          > 0:  ZBBCSD did not converge. See the description of RWORK
 *>                above for details.
-*>
-*>  Reference
-*>  =========
+*> \endverbatim
+*
+*> \par References:
+*  ================
 *>
 *>  [1] Brian D. Sutton. Computing the complete CS decomposition. Numer.
 *>      Algorithms, 50(1):33-65, 2009.
-*> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zung2l.f b/SRC/zung2l.f
index aed3bb0c..8e1a7646 100644
--- a/SRC/zung2l.f
+++ b/SRC/zung2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNG2L( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNG2L generates an m by n complex matrix Q with orthonormal columns,
 *> which is defined as the last n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by ZGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zung2r.f b/SRC/zung2r.f
index dbfabc50..de4550e5 100644
--- a/SRC/zung2r.f
+++ b/SRC/zung2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNG2R( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNG2R generates an m by n complex matrix Q with orthonormal columns,
 *> which is defined as the first n columns of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by ZGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zungbr.f b/SRC/zungbr.f
index 7cfa7c6d..dd2d9a7f 100644
--- a/SRC/zungbr.f
+++ b/SRC/zungbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGBR generates one of the complex unitary matrices Q or P**H
 *> determined by ZGEBRD when reducing a complex matrix A to bidiagonal
@@ -52,11 +52,10 @@
 *> rows of P**H, where n >= m >= k;
 *> if k >= n, P**H = G(n-1) . . . G(2) G(1) and ZUNGBR returns P**H as
 *> an N-by-N matrix.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -142,10 +141,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunghr.f b/SRC/zunghr.f
index 7a558501..a8bb4882 100644
--- a/SRC/zunghr.f
+++ b/SRC/zunghr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,22 +27,21 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGHR generates a complex unitary matrix Q which is defined as the
 *> product of IHI-ILO elementary reflectors of order N, as returned by
 *> ZGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] N
 *> \verbatim
@@ -111,10 +110,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zungl2.f b/SRC/zungl2.f
index 29b6775e..86bb64d4 100644
--- a/SRC/zungl2.f
+++ b/SRC/zungl2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGL2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGL2 generates an m-by-n complex matrix Q with orthonormal rows,
 *> which is defined as the first m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k)**H . . . H(2)**H H(1)**H
 *>
 *> as returned by ZGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -98,10 +97,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunglq.f b/SRC/zunglq.f
index 8b744975..74cb39db 100644
--- a/SRC/zunglq.f
+++ b/SRC/zunglq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGLQ generates an M-by-N complex matrix Q with orthonormal rows,
 *> which is defined as the first M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k)**H . . . H(2)**H H(1)**H
 *>
 *> as returned by ZGELQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -112,10 +111,9 @@
 *>          = 0:  successful exit;
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zungql.f b/SRC/zungql.f
index 6e854bb4..bf77df0d 100644
--- a/SRC/zungql.f
+++ b/SRC/zungql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGQL generates an M-by-N complex matrix Q with orthonormal columns,
 *> which is defined as the last N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(k) . . . H(2) H(1)
 *>
 *> as returned by ZGEQLF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zungqr.f b/SRC/zungqr.f
index a268fedf..578a9a53 100644
--- a/SRC/zungqr.f
+++ b/SRC/zungqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGQR generates an M-by-N complex matrix Q with orthonormal columns,
 *> which is defined as the first N columns of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1) H(2) . . . H(k)
 *>
 *> as returned by ZGEQRF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zungr2.f b/SRC/zungr2.f
index 3c52d362..dcf31797 100644
--- a/SRC/zungr2.f
+++ b/SRC/zungr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGR2( M, N, K, A, LDA, TAU, WORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGR2 generates an m by n complex matrix Q with orthonormal rows,
 *> which is defined as the last m rows of a product of k elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1)**H H(2)**H . . . H(k)**H
 *>
 *> as returned by ZGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zungrq.f b/SRC/zungrq.f
index 5e163bd4..ec1a7171 100644
--- a/SRC/zungrq.f
+++ b/SRC/zungrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -27,11 +27,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGRQ generates an M-by-N complex matrix Q with orthonormal rows,
 *> which is defined as the last M rows of a product of K elementary
@@ -40,11 +40,10 @@
 *>       Q  =  H(1)**H H(2)**H . . . H(k)**H
 *>
 *> as returned by ZGERQF.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] M
 *> \verbatim
@@ -113,10 +112,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument has an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zungtr.f b/SRC/zungtr.f
index 049ec0b6..2d8d2ff7 100644
--- a/SRC/zungtr.f
+++ b/SRC/zungtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNGTR( UPLO, N, A, LDA, TAU, WORK, LWORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNGTR generates a complex unitary matrix Q which is defined as the
 *> product of n-1 elementary reflectors of order N, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -108,10 +107,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunm2l.f b/SRC/zunm2l.f
index 25f8a99e..44f85e65 100644
--- a/SRC/zunm2l.f
+++ b/SRC/zunm2l.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNM2L( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNM2L overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by ZGEQLF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunm2r.f b/SRC/zunm2r.f
index 4efffe0c..ab94d2cc 100644
--- a/SRC/zunm2r.f
+++ b/SRC/zunm2r.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNM2R overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by ZGEQRF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmbr.f b/SRC/zunmbr.f
index 35e62246..b3e23448 100644
--- a/SRC/zunmbr.f
+++ b/SRC/zunmbr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> If VECT = 'Q', ZUNMBR overwrites the general complex M-by-N matrix C
 *> with
@@ -62,11 +62,10 @@
 *> If VECT = 'P', A is assumed to have been a K-by-NQ matrix:
 *> if k < nq, P = G(1) G(2) . . . G(k);
 *> if k >= nq, P = G(1) G(2) . . . G(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] VECT
 *> \verbatim
@@ -180,10 +179,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmhr.f b/SRC/zunmhr.f
index 77f77cf3..46bc2b12 100644
--- a/SRC/zunmhr.f
+++ b/SRC/zunmhr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMHR( SIDE, TRANS, M, N, ILO, IHI, A, LDA, TAU, C,
 *                          LDC, WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMHR overwrites the general complex M-by-N matrix C with
 *>
@@ -46,11 +46,10 @@
 *> IHI-ILO elementary reflectors, as returned by ZGEHRD:
 *>
 *> Q = H(ilo) H(ilo+1) . . . H(ihi-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunml2.f b/SRC/zunml2.f
index 26124be8..a1c03e3e 100644
--- a/SRC/zunml2.f
+++ b/SRC/zunml2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNML2 overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by ZGELQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmlq.f b/SRC/zunmlq.f
index c87e6bd3..8fc799ed 100644
--- a/SRC/zunmlq.f
+++ b/SRC/zunmlq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMLQ overwrites the general complex M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by ZGELQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmql.f b/SRC/zunmql.f
index 67365d78..1ed51171 100644
--- a/SRC/zunmql.f
+++ b/SRC/zunmql.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMQL overwrites the general complex M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by ZGEQLF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmqr.f b/SRC/zunmqr.f
index 0dd18abc..4d1878fb 100644
--- a/SRC/zunmqr.f
+++ b/SRC/zunmqr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMQR overwrites the general complex M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by ZGEQRF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmr2.f b/SRC/zunmr2.f
index 5dcc164a..40f90587 100644
--- a/SRC/zunmr2.f
+++ b/SRC/zunmr2.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMR2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMR2 overwrites the general complex m-by-n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by ZGERQF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -143,10 +142,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmr3.f b/SRC/zunmr3.f
index 347c917b..89a88274 100644
--- a/SRC/zunmr3.f
+++ b/SRC/zunmr3.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMR3( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMR3 overwrites the general complex m by n matrix C with
 *>
@@ -52,11 +52,10 @@
 *>
 *> as returned by ZTZRZF. Q is of order m if SIDE = 'L' and of order n
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -151,10 +150,9 @@
 *>          = 0: successful exit
 *>          < 0: if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -165,15 +163,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zunmrq.f b/SRC/zunmrq.f
index e0ac87b7..7fca3223 100644
--- a/SRC/zunmrq.f
+++ b/SRC/zunmrq.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMRQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMRQ overwrites the general complex M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by ZGERQF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -154,10 +153,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zunmrz.f b/SRC/zunmrz.f
index c1366aae..006e3dbb 100644
--- a/SRC/zunmrz.f
+++ b/SRC/zunmrz.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMRZ( SIDE, TRANS, M, N, K, L, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMRZ overwrites the general complex M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *>
 *> as returned by ZTZRZF. Q is of order M if SIDE = 'L' and of order N
 *> if SIDE = 'R'.
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -162,10 +161,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
@@ -176,15 +174,15 @@
 *
 *> \ingroup complex16OTHERcomputational
 *
-*
-*  Further Details
-*  ===============
-*>\details \b Further \b Details
-*> \verbatim
+*> \par Contributors:
+*  ==================
 *>
-*>  Based on contributions by
 *>    A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+*> \par Further Details:
+*  =====================
 *>
+*> \verbatim
 *> \endverbatim
 *>
 *  =====================================================================
diff --git a/SRC/zunmtr.f b/SRC/zunmtr.f
index a8566fe7..1f119ee0 100644
--- a/SRC/zunmtr.f
+++ b/SRC/zunmtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUNMTR( SIDE, UPLO, TRANS, M, N, A, LDA, TAU, C, LDC,
 *                          WORK, LWORK, INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUNMTR overwrites the general complex M-by-N matrix C with
 *>
@@ -48,11 +48,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -155,10 +154,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zupgtr.f b/SRC/zupgtr.f
index ea63376a..4d803805 100644
--- a/SRC/zupgtr.f
+++ b/SRC/zupgtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUPGTR( UPLO, N, AP, TAU, Q, LDQ, WORK, INFO )
 * 
@@ -28,11 +28,11 @@
 *       COMPLEX*16         AP( * ), Q( LDQ, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUPGTR generates a complex unitary matrix Q which is defined as the
 *> product of n-1 elementary reflectors H(i) of order n, as returned by
@@ -41,11 +41,10 @@
 *> if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
@@ -99,10 +98,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley 
diff --git a/SRC/zupmtr.f b/SRC/zupmtr.f
index 4c691e00..f6c2bead 100644
--- a/SRC/zupmtr.f
+++ b/SRC/zupmtr.f
@@ -15,8 +15,8 @@
 *> [TXT]</a>
 *> \endhtmlonly 
 *
-*  Definition
-*  ==========
+*  Definition:
+*  ===========
 *
 *       SUBROUTINE ZUPMTR( SIDE, UPLO, TRANS, M, N, AP, TAU, C, LDC, WORK,
 *                          INFO )
@@ -29,11 +29,11 @@
 *       COMPLEX*16         AP( * ), C( LDC, * ), TAU( * ), WORK( * )
 *       ..
 *  
-*  Purpose
-*  =======
 *
-*>\details \b Purpose:
-*>\verbatim
+*> \par Purpose:
+*  =============
+*>
+*> \verbatim
 *>
 *> ZUPMTR overwrites the general complex M-by-N matrix C with
 *>
@@ -49,11 +49,10 @@
 *> if UPLO = 'U', Q = H(nq-1) . . . H(2) H(1);
 *>
 *> if UPLO = 'L', Q = H(1) H(2) . . . H(nq-1).
-*>
-*>\endverbatim
+*> \endverbatim
 *
-*  Arguments
-*  =========
+*  Arguments:
+*  ==========
 *
 *> \param[in] SIDE
 *> \verbatim
@@ -134,10 +133,9 @@
 *>          = 0:  successful exit
 *>          < 0:  if INFO = -i, the i-th argument had an illegal value
 *> \endverbatim
-*>
 *
-*  Authors
-*  =======
+*  Authors:
+*  ========
 *
 *> \author Univ. of Tennessee 
 *> \author Univ. of California Berkeley