diff options
Diffstat (limited to 'SRC/dbbcsd.f')
| -rw-r--r-- | SRC/dbbcsd.f | 42 |
1 files changed, 21 insertions, 21 deletions
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 |