version 1.14, 2016/08/27 15:34:45
|
version 1.19, 2023/08/07 08:39:17
|
Line 2
|
Line 2
|
* |
* |
* =========== DOCUMENTATION =========== |
* =========== DOCUMENTATION =========== |
* |
* |
* Online html documentation available at |
* Online html documentation available at |
* http://www.netlib.org/lapack/explore-html/ |
* http://www.netlib.org/lapack/explore-html/ |
* |
* |
*> \htmlonly |
*> \htmlonly |
*> Download ZGELSD + dependencies |
*> Download ZGELSD + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgelsd.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgelsd.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgelsd.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgelsd.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgelsd.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgelsd.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, |
* SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, |
* WORK, LWORK, RWORK, IWORK, INFO ) |
* WORK, LWORK, RWORK, IWORK, INFO ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK |
* INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK |
* DOUBLE PRECISION RCOND |
* DOUBLE PRECISION RCOND |
Line 30
|
Line 30
|
* DOUBLE PRECISION RWORK( * ), S( * ) |
* DOUBLE PRECISION RWORK( * ), S( * ) |
* COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) |
* COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 50
|
Line 50
|
*> |
*> |
*> The problem is solved in three steps: |
*> The problem is solved in three steps: |
*> (1) Reduce the coefficient matrix A to bidiagonal form with |
*> (1) Reduce the coefficient matrix A to bidiagonal form with |
*> Householder tranformations, reducing the original problem |
*> Householder transformations, reducing the original problem |
*> into a "bidiagonal least squares problem" (BLS) |
*> into a "bidiagonal least squares problem" (BLS) |
*> (2) Solve the BLS using a divide and conquer approach. |
*> (2) Solve the BLS using a divide and conquer approach. |
*> (3) Apply back all the Householder tranformations to solve |
*> (3) Apply back all the Householder transformations to solve |
*> the original least squares problem. |
*> the original least squares problem. |
*> |
*> |
*> The effective rank of A is determined by treating as zero those |
*> The effective rank of A is determined by treating as zero those |
Line 90
|
Line 90
|
*> of the matrices B and X. NRHS >= 0. |
*> of the matrices B and X. NRHS >= 0. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in] A |
*> \param[in,out] A |
*> \verbatim |
*> \verbatim |
*> A is COMPLEX*16 array, dimension (LDA,N) |
*> A is COMPLEX*16 array, dimension (LDA,N) |
*> On entry, the M-by-N matrix A. |
*> On entry, the M-by-N matrix A. |
Line 205
|
Line 205
|
* Authors: |
* Authors: |
* ======== |
* ======== |
* |
* |
*> \author Univ. of Tennessee |
*> \author Univ. of Tennessee |
*> \author Univ. of California Berkeley |
*> \author Univ. of California Berkeley |
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
|
*> \date November 2011 |
|
* |
* |
*> \ingroup complex16GEsolve |
*> \ingroup complex16GEsolve |
* |
* |
Line 225
|
Line 223
|
SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, |
SUBROUTINE ZGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, |
$ WORK, LWORK, RWORK, IWORK, INFO ) |
$ WORK, LWORK, RWORK, IWORK, INFO ) |
* |
* |
* -- LAPACK driver routine (version 3.4.0) -- |
* -- LAPACK driver 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..-- |
* November 2011 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK |
INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK |