summaryrefslogtreecommitdiff
path: root/SRC/cggglm.f
diff options
context:
space:
mode:
authorjulie <julielangou@users.noreply.github.com>2011-11-01 22:02:31 +0000
committerjulie <julielangou@users.noreply.github.com>2011-11-01 22:02:31 +0000
commitd5c30c90bdecf38da1064e2ed52583634573e741 (patch)
tree480fc5ff31ee14b83116b6428aad79ea6e89362d /SRC/cggglm.f
parent04670a68760fa27333f8bcef8172f71adc6880ef (diff)
downloadlapack-d5c30c90bdecf38da1064e2ed52583634573e741.tar.gz
lapack-d5c30c90bdecf38da1064e2ed52583634573e741.tar.bz2
lapack-d5c30c90bdecf38da1064e2ed52583634573e741.zip
Never say never...
Diffstat (limited to 'SRC/cggglm.f')
-rw-r--r--SRC/cggglm.f6
1 files changed, 2 insertions, 4 deletions
diff --git a/SRC/cggglm.f b/SRC/cggglm.f
index 22363f0c..16d74fc3 100644
--- a/SRC/cggglm.f
+++ b/SRC/cggglm.f
@@ -130,8 +130,7 @@
*> \param[out] Y
*> \verbatim
*> Y is COMPLEX array, dimension (P)
-*> \endverbatim
-*> \verbatim
+*>
*> On exit, X and Y are the solutions of the GLM problem.
*> \endverbatim
*>
@@ -148,8 +147,7 @@
*> For optimum performance, LWORK >= M+min(N,P)+max(N,P)*NB,
*> where NB is an upper bound for the optimal blocksizes for
*> CGEQRF, CGERQF, CUNMQR and CUNMRQ.
-*> \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