diff options
| author | julie <julielangou@users.noreply.github.com> | 2011-11-01 22:02:31 +0000 |
|---|---|---|
| committer | julie <julielangou@users.noreply.github.com> | 2011-11-01 22:02:31 +0000 |
| commit | d5c30c90bdecf38da1064e2ed52583634573e741 (patch) | |
| tree | 480fc5ff31ee14b83116b6428aad79ea6e89362d /SRC/sbbcsd.f | |
| parent | 04670a68760fa27333f8bcef8172f71adc6880ef (diff) | |
Never say never...
Diffstat (limited to 'SRC/sbbcsd.f')
| -rw-r--r-- | SRC/sbbcsd.f | 15 |
1 files changed, 5 insertions, 10 deletions
diff --git a/SRC/sbbcsd.f b/SRC/sbbcsd.f index 4007c609..9099d023 100644 --- a/SRC/sbbcsd.f +++ b/SRC/sbbcsd.f @@ -282,8 +282,7 @@ *> \verbatim *> LWORK is INTEGER *> The dimension of the array WORK. LWORK >= MAX(1,8*Q). -*> \endverbatim -*> \verbatim +*> *> If LWORK = -1, then a workspace query is assumed; the *> routine only calculates the optimal size of the WORK array, *> returns this value as the first entry of the work array, and @@ -298,20 +297,16 @@ *> > 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 -*> \verbatim +*> *> Reference *> ========= -*> \endverbatim -*> \verbatim +*> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. -*> \endverbatim -*> \verbatim +*> *> Internal Parameters *> =================== -*> \endverbatim -*> \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 |