diff options
| author | langou <langou@users.noreply.github.com> | 2009-03-11 01:54:40 +0000 |
|---|---|---|
| committer | langou <langou@users.noreply.github.com> | 2009-03-11 01:54:40 +0000 |
| commit | 10b4e113aa1f956449b03a726b46a1f165316a25 (patch) | |
| tree | b4ebee26234ed637fbc7f0180bcc6f158715b811 | |
| parent | 26da0604ee7e7439c7aec03dbdd86ce352fd16c2 (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.
| -rw-r--r-- | SRC/cpstrf.f | 6 | ||||
| -rw-r--r-- | SRC/dpstrf.f | 6 | ||||
| -rw-r--r-- | SRC/spstrf.f | 6 | ||||
| -rw-r--r-- | SRC/zpstrf.f | 6 |
4 files changed, 12 insertions, 12 deletions
diff --git a/SRC/cpstrf.f b/SRC/cpstrf.f index ff99c5ef..89508528 100644 --- a/SRC/cpstrf.f +++ b/SRC/cpstrf.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 REAL array, dimension (2*N) * Work space. * diff --git a/SRC/dpstrf.f b/SRC/dpstrf.f index 14e982a2..13b90bfa 100644 --- a/SRC/dpstrf.f +++ b/SRC/dpstrf.f @@ -53,6 +53,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. * @@ -65,9 +68,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. * diff --git a/SRC/spstrf.f b/SRC/spstrf.f index 92b04a89..cb217dab 100644 --- a/SRC/spstrf.f +++ b/SRC/spstrf.f @@ -53,6 +53,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. * @@ -65,9 +68,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 REAL array, dimension (2*N) * Work space. * 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. * |