floraachy
/
OpenBLAS
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

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

This commit is contained in:
Martin Kroeker 2023-06-22 16:25:24 +02:00 committed by GitHub
parent a20f533b86
commit 7b73666d70
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
26 changed files with 61 additions and 61 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
lapack-netlib/SRC/chegv.f
View File

@ -160,7 +160,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

2
lapack-netlib/SRC/chegv_2stage.f
View File

@ -179,7 +179,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

2
lapack-netlib/SRC/chegvd.f
View File

@ -212,7 +212,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

2
lapack-netlib/SRC/chegvx.f
View File

@ -280,7 +280,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

2
lapack-netlib/SRC/chpgv.f
View File

@ -144,7 +144,7 @@
*> i off-diagonal elements of an intermediate
*> tridiagonal form did not convergeto 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

2
lapack-netlib/SRC/chpgvd.f
View File

@ -205,7 +205,7 @@
*> i off-diagonal elements of an intermediate
*> tridiagonal form did not convergeto 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

2
lapack-netlib/SRC/chpgvx.f
View File

@ -250,7 +250,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

6
lapack-netlib/SRC/cla_porpvgrw.f
View File

@ -140,9 +140,9 @@
* .. Executable Statements ..
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

6
lapack-netlib/SRC/cpbsv.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:

10
lapack-netlib/SRC/cpbsvx.f
View File

@ -70,7 +70,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
@ -280,10 +280,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

4
lapack-netlib/SRC/cpbtf2.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
*

4
lapack-netlib/SRC/cpbtrf.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
*

4
lapack-netlib/SRC/cpftrf.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.
*>
*> Further Notes on RFP Format:

6
lapack-netlib/SRC/cposv.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:

10
lapack-netlib/SRC/cposvx.f
View File

@ -70,7 +70,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
@ -276,10 +276,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
lapack-netlib/SRC/cposvxx.f
View File

@ -87,7 +87,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

4
lapack-netlib/SRC/cpotf2.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
*

4
lapack-netlib/SRC/cpotrf.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
*

4
lapack-netlib/SRC/cpotrf2.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
*

6
lapack-netlib/SRC/cppsv.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:

10
lapack-netlib/SRC/cppsvx.f
View File

@ -69,7 +69,7 @@
*> where U is an upper triangular matrix, L is a lower triangular
*> matrix, and **H indicates conjugate transpose.
*>
*> 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

6
lapack-netlib/SRC/cpptrf.f
View File

@ -79,9 +79,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 is not
*> positive definite, and the factorization could not be
*> completed.
*> > 0: if INFO = i, the leading principal minor of order i
*> is not positive definite, and the factorization could
*> not be completed.
*> \endverbatim
*
* Authors:

4
lapack-netlib/SRC/cpteqr.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.

4
lapack-netlib/SRC/cptsv.f
View File

@ -94,8 +94,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

10
lapack-netlib/SRC/cptsvx.f
View File

@ -60,7 +60,7 @@
*> factorization can also be regarded as having the form
*> A = U**H*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
@ -205,10 +205,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

4
lapack-netlib/SRC/cpttrf.f
View File

@ -71,8 +71,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