From 1c3ba600671a59785b0c647d400226b4cc19a11f Mon Sep 17 00:00:00 2001
From: julie <julielangou@users.noreply.github.com>
Date: Thu, 3 Nov 2011 20:32:56 +0000
Subject: 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.
---
 SRC/cbbcsd.f | 42 +++++++++++++++++++++---------------------
 1 file changed, 21 insertions(+), 21 deletions(-)

(limited to 'SRC/cbbcsd.f')

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 
-- 
cgit v1.2.3