version 1.20, 2020/05/21 21:45:56
|
version 1.21, 2023/08/07 08:38:48
|
Line 289
|
Line 289
|
*> singular values might be lost. |
*> singular values might be lost. |
*> |
*> |
*> If full SVD is needed, the following two condition numbers are |
*> If full SVD is needed, the following two condition numbers are |
*> useful for the analysis of the algorithm. They are provied for |
*> useful for the analysis of the algorithm. They are provided for |
*> a developer/implementer who is familiar with the details of |
*> a developer/implementer who is familiar with the details of |
*> the method. |
*> the method. |
*> |
*> |
Line 391
|
Line 391
|
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
* |
*> \date June 2016 |
|
* |
|
*> \ingroup doubleGEsing |
*> \ingroup doubleGEsing |
* |
* |
*> \par Further Details: |
*> \par Further Details: |
Line 476
|
Line 474
|
$ M, N, A, LDA, SVA, U, LDU, V, LDV, |
$ M, N, A, LDA, SVA, U, LDU, V, LDV, |
$ WORK, LWORK, IWORK, INFO ) |
$ WORK, LWORK, IWORK, INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.7.1) -- |
* -- LAPACK computational routine -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* June 2016 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
IMPLICIT NONE |
IMPLICIT NONE |
Line 932
|
Line 929
|
* (eg speed by replacing global with restricted window pivoting, such |
* (eg speed by replacing global with restricted window pivoting, such |
* as in SGEQPX from TOMS # 782). Good results will be obtained using |
* as in SGEQPX from TOMS # 782). Good results will be obtained using |
* SGEQPX with properly (!) chosen numerical parameters. |
* SGEQPX with properly (!) chosen numerical parameters. |
* Any improvement of DGEQP3 improves overal performance of DGEJSV. |
* Any improvement of DGEQP3 improves overall performance of DGEJSV. |
* |
* |
* A * P1 = Q1 * [ R1^t 0]^t: |
* A * P1 = Q1 * [ R1^t 0]^t: |
DO 1963 p = 1, N |
DO 1963 p = 1, N |