summaryrefslogtreecommitdiff
path: root/SRC/zhegv.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/zhegv.f
parent04670a68760fa27333f8bcef8172f71adc6880ef (diff)
downloadlapack-d5c30c90bdecf38da1064e2ed52583634573e741.tar.gz
lapack-d5c30c90bdecf38da1064e2ed52583634573e741.tar.bz2
lapack-d5c30c90bdecf38da1064e2ed52583634573e741.zip
Never say never...
Diffstat (limited to 'SRC/zhegv.f')
-rw-r--r--SRC/zhegv.f9
1 files changed, 3 insertions, 6 deletions
diff --git a/SRC/zhegv.f b/SRC/zhegv.f
index 8f3c647c..f51a7df0 100644
--- a/SRC/zhegv.f
+++ b/SRC/zhegv.f
@@ -84,8 +84,7 @@
*> upper triangular part of the matrix A. If UPLO = 'L',
*> the leading N-by-N lower triangular part of A contains
*> the lower triangular part of the matrix A.
-*> \endverbatim
-*> \verbatim
+*>
*> On exit, if JOBZ = 'V', then if INFO = 0, A contains the
*> matrix Z of eigenvectors. The eigenvectors are normalized
*> as follows:
@@ -110,8 +109,7 @@
*> contains the upper triangular part of the matrix B.
*> If UPLO = 'L', the leading N-by-N lower triangular part of B
*> contains the lower triangular part of the matrix B.
-*> \endverbatim
-*> \verbatim
+*>
*> On exit, if INFO <= N, the part of B containing the matrix is
*> overwritten by the triangular factor U or L from the Cholesky
*> factorization B = U**H*U or B = L*L**H.
@@ -141,8 +139,7 @@
*> The length of the array WORK. LWORK >= max(1,2*N-1).
*> For optimal efficiency, LWORK >= (NB+1)*N,
*> where NB is the blocksize for ZHETRD returned by ILAENV.
-*> \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