From d5c30c90bdecf38da1064e2ed52583634573e741 Mon Sep 17 00:00:00 2001 From: julie Date: Tue, 1 Nov 2011 22:02:31 +0000 Subject: Never say never... --- SRC/cuncsd.f | 12 ++++-------- 1 file changed, 4 insertions(+), 8 deletions(-) (limited to 'SRC/cuncsd.f') diff --git a/SRC/cuncsd.f b/SRC/cuncsd.f index f7fdff3a..ad81209c 100644 --- a/SRC/cuncsd.f +++ b/SRC/cuncsd.f @@ -252,8 +252,7 @@ *> \verbatim *> LWORK is INTEGER *> The dimension of the array WORK. -*> \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 no error @@ -275,8 +274,7 @@ *> \verbatim *> LRWORK is INTEGER *> The dimension of the array RWORK. -*> \endverbatim -*> \verbatim +*> *> If LRWORK = -1, then a workspace query is assumed; the routine *> only calculates the optimal size of the RWORK array, returns *> this value as the first entry of the work array, and no error @@ -295,12 +293,10 @@ *> < 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. -*> \endverbatim -*> \verbatim +*> *> Reference *> ========= -*> \endverbatim -*> \verbatim +*> *> [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. *> Algorithms, 50(1):33-65, 2009. *> \endverbatim -- cgit v1.2.3