OSchip
/
OpenBLAS
Not watched
1
0
Fork 0
Code
Releases 66 Wiki evaluate Activity
Issues 0 Pull Requests 0 Datasets Model Cloudbrain HPC
Browse Source

Fix confusing use of "minor" in inline documentation (Reference-LAPACK PR849)

tags/v0.3.24
Martin Kroeker GitHub 2 years ago
parent
219a73a394
commit
d9a6cacef7
No known key found for this signature in database GPG Key ID: 4AEE18F83AFDEB23
27 changed files with 61 additions and 61 deletions
Split View
Diff Options
Show Stats Download Patch File Download Diff File
  1. +3
    -3
      lapack-netlib/SRC/sla_porpvgrw.f
  2. +3
    -3
      lapack-netlib/SRC/spbsv.f
  3. +5
    -5
      lapack-netlib/SRC/spbsvx.f
  4. +2
    -2
      lapack-netlib/SRC/spbtf2.f
  5. +2
    -2
      lapack-netlib/SRC/spbtrf.f
  6. +2
    -2
      lapack-netlib/SRC/spftrf.f
  7. +3
    -3
      lapack-netlib/SRC/sposv.f
  8. +5
    -5
      lapack-netlib/SRC/sposvx.f
  9. +1
    -1
      lapack-netlib/SRC/sposvxx.f
  10. +2
    -2
      lapack-netlib/SRC/spotf2.f
  11. +2
    -2
      lapack-netlib/SRC/spotrf.f
  12. +2
    -2
      lapack-netlib/SRC/spotrf2.f
  13. +3
    -3
      lapack-netlib/SRC/sppsv.f
  14. +5
    -5
      lapack-netlib/SRC/sppsvx.f
  15. +2
    -2
      lapack-netlib/SRC/spptrf.f
  16. +2
    -2
      lapack-netlib/SRC/spteqr.f
  17. +2
    -2
      lapack-netlib/SRC/sptsv.f
  18. +5
    -5
      lapack-netlib/SRC/sptsvx.f
  19. +2
    -2
      lapack-netlib/SRC/spttrf.f
  20. +1
    -1
      lapack-netlib/SRC/ssbgvx.f
  21. +1
    -1
      lapack-netlib/SRC/sspgv.f
  22. +1
    -1
      lapack-netlib/SRC/sspgvd.f
  23. +1
    -1
      lapack-netlib/SRC/sspgvx.f
  24. +1
    -1
      lapack-netlib/SRC/ssygv.f
  25. +1
    -1
      lapack-netlib/SRC/ssygv_2stage.f
  26. +1
    -1
      lapack-netlib/SRC/ssygvd.f
  27. +1
    -1
      lapack-netlib/SRC/ssygvx.f

+ 3
- 3
lapack-netlib/SRC/sla_porpvgrw.f View File

@@ -132,9 +132,9 @@
*
UPPER = LSAME( 'Upper', UPLO )
*
* SPOTRF will have factored only the NCOLSxNCOLS leading minor, so
* we restrict the growth search to that minor and use only the first
* 2*NCOLS workspace entries.
* SPOTRF will have factored only the NCOLSxNCOLS leading submatrix,
* so we restrict the growth search to that submatrix and use only
* the first 2*NCOLS workspace entries.
*
RPVGRW = 1.0
DO I = 1, 2*NCOLS


+ 3
- 3
lapack-netlib/SRC/spbsv.f View File

@@ -119,9 +119,9 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i of A is not
*> positive definite, so the factorization could not be
*> completed, and the solution has not been computed.
*> > 0: if INFO = i, the leading principal minor of order i
*> of A is not positive, so the factorization could not
*> be completed, and the solution has not been computed.
*> \endverbatim
*
* Authors:


+ 5
- 5
lapack-netlib/SRC/spbsvx.f View File

@@ -71,7 +71,7 @@
*> where U is an upper triangular band matrix, and L is a lower
*> triangular band matrix.
*>
*> 3. If the leading i-by-i principal minor is not positive definite,
*> 3. If the leading principal minor of order i is not positive,
*> then the routine returns with INFO = i. Otherwise, the factored
*> form of A is used to estimate the condition number of the matrix
*> A. If the reciprocal of the condition number is less than machine
@@ -281,10 +281,10 @@
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, and i is
*> <= N: the leading minor of order i of A is
*> not positive definite, so the factorization
*> could not be completed, and the solution has not
*> been computed. RCOND = 0 is returned.
*> <= N: the leading principal minor of order i of A
*> is not positive, so the factorization could not
*> be completed, and the solution has not been
*> computed. RCOND = 0 is returned.
*> = N+1: U is nonsingular, but RCOND is less than machine
*> precision, meaning that the matrix is singular
*> to working precision. Nevertheless, the


+ 2
- 2
lapack-netlib/SRC/spbtf2.f View File

@@ -97,8 +97,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -k, the k-th argument had an illegal value
*> > 0: if INFO = k, the leading minor of order k is not
*> positive definite, and the factorization could not be
*> > 0: if INFO = k, the leading principal minor of order k
*> is not positive, and the factorization could not be
*> completed.
*> \endverbatim
*


+ 2
- 2
lapack-netlib/SRC/spbtrf.f View File

@@ -92,8 +92,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i is not
*> positive definite, and the factorization could not be
*> > 0: if INFO = i, the leading principal minor of order i
*> is not positive, and the factorization could not be
*> completed.
*> \endverbatim
*


+ 2
- 2
lapack-netlib/SRC/spftrf.f View File

@@ -91,8 +91,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i is not
*> positive definite, and the factorization could not be
*> > 0: if INFO = i, the leading principal minor of order i
*> is not positive, and the factorization could not be
*> completed.
*> \endverbatim
*


+ 3
- 3
lapack-netlib/SRC/sposv.f View File

@@ -110,9 +110,9 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i of A is not
*> positive definite, so the factorization could not be
*> completed, and the solution has not been computed.
*> > 0: if INFO = i, the leading principal minor of order i
*> of A is not positive, so the factorization could not
*> be completed, and the solution has not been computed.
*> \endverbatim
*
* Authors:


+ 5
- 5
lapack-netlib/SRC/sposvx.f View File

@@ -71,7 +71,7 @@
*> where U is an upper triangular matrix and L is a lower triangular
*> matrix.
*>
*> 3. If the leading i-by-i principal minor is not positive definite,
*> 3. If the leading principal minor of order i is not positive,
*> then the routine returns with INFO = i. Otherwise, the factored
*> form of A is used to estimate the condition number of the matrix
*> A. If the reciprocal of the condition number is less than machine
@@ -277,10 +277,10 @@
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, and i is
*> <= N: the leading minor of order i of A is
*> not positive definite, so the factorization
*> could not be completed, and the solution has not
*> been computed. RCOND = 0 is returned.
*> <= N: the leading principal minor of order i of A
*> is not positive, so the factorization could not
*> be completed, and the solution has not been
*> computed. RCOND = 0 is returned.
*> = N+1: U is nonsingular, but RCOND is less than machine
*> precision, meaning that the matrix is singular
*> to working precision. Nevertheless, the


+ 1
- 1
lapack-netlib/SRC/sposvxx.f View File

@@ -88,7 +88,7 @@
*> where U is an upper triangular matrix and L is a lower triangular
*> matrix.
*>
*> 3. If the leading i-by-i principal minor is not positive definite,
*> 3. If the leading principal minor of order i is not positive,
*> then the routine returns with INFO = i. Otherwise, the factored
*> form of A is used to estimate the condition number of the matrix
*> A (see argument RCOND). If the reciprocal of the condition number


+ 2
- 2
lapack-netlib/SRC/spotf2.f View File

@@ -89,8 +89,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -k, the k-th argument had an illegal value
*> > 0: if INFO = k, the leading minor of order k is not
*> positive definite, and the factorization could not be
*> > 0: if INFO = k, the leading principal minor of order k
*> is not positive, and the factorization could not be
*> completed.
*> \endverbatim
*


+ 2
- 2
lapack-netlib/SRC/spotrf.f View File

@@ -87,8 +87,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i is not
*> positive definite, and the factorization could not be
*> > 0: if INFO = i, the leading principal minor of order i
*> is not positive, and the factorization could not be
*> completed.
*> \endverbatim
*


+ 2
- 2
lapack-netlib/SRC/spotrf2.f View File

@@ -86,8 +86,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i is not
*> positive definite, and the factorization could not be
*> > 0: if INFO = i, the leading principal minor of order i
*> is not positive, and the factorization could not be
*> completed.
*> \endverbatim
*


+ 3
- 3
lapack-netlib/SRC/sppsv.f View File

@@ -104,9 +104,9 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i of A is not
*> positive definite, so the factorization could not be
*> completed, and the solution has not been computed.
*> > 0: if INFO = i, the leading principal minor of order i
*> of A is not positive, so the factorization could not
*> be completed, and the solution has not been computed.
*> \endverbatim
*
* Authors:


+ 5
- 5
lapack-netlib/SRC/sppsvx.f View File

@@ -69,7 +69,7 @@
*> where U is an upper triangular matrix and L is a lower triangular
*> matrix.
*>
*> 3. If the leading i-by-i principal minor is not positive definite,
*> 3. If the leading principal minor of order i is not positive,
*> then the routine returns with INFO = i. Otherwise, the factored
*> form of A is used to estimate the condition number of the matrix
*> A. If the reciprocal of the condition number is less than machine
@@ -262,10 +262,10 @@
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, and i is
*> <= N: the leading minor of order i of A is
*> not positive definite, so the factorization
*> could not be completed, and the solution has not
*> been computed. RCOND = 0 is returned.
*> <= N: the leading principal minor of order i of A
*> is not positive, so the factorization could not
*> be completed, and the solution has not been
*> computed. RCOND = 0 is returned.
*> = N+1: U is nonsingular, but RCOND is less than machine
*> precision, meaning that the matrix is singular
*> to working precision. Nevertheless, the


+ 2
- 2
lapack-netlib/SRC/spptrf.f View File

@@ -79,8 +79,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i is not
*> positive definite, and the factorization could not be
*> > 0: if INFO = i, the leading principal minor of order i
*> is not positive, and the factorization could not be
*> completed.
*> \endverbatim
*


+ 2
- 2
lapack-netlib/SRC/spteqr.f View File

@@ -123,8 +123,8 @@
*> < 0: if INFO = -i, the i-th argument had an illegal value.
*> > 0: if INFO = i, and i is:
*> <= N the Cholesky factorization of the matrix could
*> not be performed because the i-th principal minor
*> was not positive definite.
*> not be performed because the leading principal
*> minor of order i was not positive.
*> > N the SVD algorithm failed to converge;
*> if INFO = N+i, i off-diagonal elements of the
*> bidiagonal factor did not converge to zero.


+ 2
- 2
lapack-netlib/SRC/sptsv.f View File

@@ -93,8 +93,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, the leading minor of order i is not
*> positive definite, and the solution has not been
*> > 0: if INFO = i, the leading principal minor of order i
*> is not positive, and the solution has not been
*> computed. The factorization has not been completed
*> unless i = N.
*> \endverbatim


+ 5
- 5
lapack-netlib/SRC/sptsvx.f View File

@@ -59,7 +59,7 @@
*> factorization can also be regarded as having the form
*> A = U**T*D*U.
*>
*> 2. If the leading i-by-i principal minor is not positive definite,
*> 2. If the leading principal minor of order i is not positive,
*> then the routine returns with INFO = i. Otherwise, the factored
*> form of A is used to estimate the condition number of the matrix
*> A. If the reciprocal of the condition number is less than machine
@@ -199,10 +199,10 @@
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, and i is
*> <= N: the leading minor of order i of A is
*> not positive definite, so the factorization
*> could not be completed, and the solution has not
*> been computed. RCOND = 0 is returned.
*> <= N: the leading principal minor of order i of A
*> is not positive, so the factorization could not
*> be completed, and the solution has not been
*> computed. RCOND = 0 is returned.
*> = N+1: U is nonsingular, but RCOND is less than machine
*> precision, meaning that the matrix is singular
*> to working precision. Nevertheless, the


+ 2
- 2
lapack-netlib/SRC/spttrf.f View File

@@ -70,8 +70,8 @@
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -k, the k-th argument had an illegal value
*> > 0: if INFO = k, the leading minor of order k is not
*> positive definite; if k < N, the factorization could not
*> > 0: if INFO = k, the leading principal minor of order k
*> is not positive; if k < N, the factorization could not
*> be completed, while if k = N, the factorization was
*> completed, but D(N) <= 0.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/ssbgvx.f View File

@@ -267,7 +267,7 @@
*> Their indices are stored in IFAIL.
*> > N: SPBSTF returned an error code; i.e.,
*> if INFO = N + i, for 1 <= i <= N, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/sspgv.f View File

@@ -139,7 +139,7 @@
*> i off-diagonal elements of an intermediate
*> tridiagonal form did not converge to zero.
*> > N: if INFO = n + i, for 1 <= i <= n, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/sspgvd.f View File

@@ -184,7 +184,7 @@
*> i off-diagonal elements of an intermediate
*> tridiagonal form did not converge to zero;
*> > N: if INFO = N + i, for 1 <= i <= N, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/sspgvx.f View File

@@ -245,7 +245,7 @@
*> i eigenvectors failed to converge. Their indices
*> are stored in array IFAIL.
*> > N: if INFO = N + i, for 1 <= i <= N, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/ssygv.f View File

@@ -154,7 +154,7 @@
*> i off-diagonal elements of an intermediate
*> tridiagonal form did not converge to zero;
*> > N: if INFO = N + i, for 1 <= i <= N, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/ssygv_2stage.f View File

@@ -173,7 +173,7 @@
*> i off-diagonal elements of an intermediate
*> tridiagonal form did not converge to zero;
*> > N: if INFO = N + i, for 1 <= i <= N, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/ssygvd.f View File

@@ -190,7 +190,7 @@
*> the submatrix lying in rows and columns INFO/(N+1)
*> through mod(INFO,N+1);
*> > N: if INFO = N + i, for 1 <= i <= N, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


+ 1
- 1
lapack-netlib/SRC/ssygvx.f View File

@@ -270,7 +270,7 @@
*> i eigenvectors failed to converge. Their indices
*> are stored in array IFAIL.
*> > N: if INFO = N + i, for 1 <= i <= N, then the leading
*> minor of order i of B is not positive definite.
*> principal minor of order i of B is not positive.
*> The factorization of B could not be completed and
*> no eigenvalues or eigenvectors were computed.
*> \endverbatim


Write Preview
Loading…
Cancel
Save