aboutsummaryrefslogtreecommitdiff
path: root/SRC/zpstrf.f
diff options
context:
space:
mode:
authorlangou <langou@users.noreply.github.com>2009-03-11 01:54:40 +0000
committerlangou <langou@users.noreply.github.com>2009-03-11 01:54:40 +0000
commit10b4e113aa1f956449b03a726b46a1f165316a25 (patch)
treeb4ebee26234ed637fbc7f0180bcc6f158715b811 /SRC/zpstrf.f
parent26da0604ee7e7439c7aec03dbdd86ce352fd16c2 (diff)
The description of LDA in the header was number 8 in the header, while
LDA is the 4th argument in the interface. => Rearrange the header accordingly.
Diffstat (limited to 'SRC/zpstrf.f')
-rw-r--r--SRC/zpstrf.f6
1 files changed, 3 insertions, 3 deletions
diff --git a/SRC/zpstrf.f b/SRC/zpstrf.f
index 827f55da..fff0f9cf 100644
--- a/SRC/zpstrf.f
+++ b/SRC/zpstrf.f
@@ -54,6 +54,9 @@
* On exit, if INFO = 0, the factor U or L from the Cholesky
* factorization as above.
*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
* PIV (output) INTEGER array, dimension (N)
* PIV is such that the nonzero entries are P( PIV(K), K ) = 1.
*
@@ -66,9 +69,6 @@
* will be used. The algorithm terminates at the (K-1)st step
* if the pivot <= TOL.
*
-* LDA (input) INTEGER
-* The leading dimension of the array A. LDA >= max(1,N).
-*
* WORK DOUBLE PRECISION array, dimension (2*N)
* Work space.
*