version 1.15, 2016/08/27 15:27:12
|
version 1.18, 2017/06/17 11:06:43
|
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 ZGESDD + dependencies |
*> Download ZGESDD + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgesdd.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgesdd.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgesdd.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgesdd.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgesdd.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgesdd.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, |
* SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, |
* WORK, LWORK, RWORK, IWORK, INFO ) |
* WORK, LWORK, RWORK, IWORK, INFO ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* CHARACTER JOBZ |
* CHARACTER JOBZ |
* INTEGER INFO, LDA, LDU, LDVT, LWORK, M, N |
* INTEGER INFO, LDA, LDU, LDVT, LWORK, M, N |
Line 31
|
Line 31
|
* COMPLEX*16 A( LDA, * ), U( LDU, * ), VT( LDVT, * ), |
* COMPLEX*16 A( LDA, * ), U( LDU, * ), VT( LDVT, * ), |
* $ WORK( * ) |
* $ WORK( * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 207
|
Line 207
|
* 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 June 2016 |
*> \date June 2016 |
* |
* |
Line 222
|
Line 222
|
*> Ming Gu and Huan Ren, Computer Science Division, University of |
*> Ming Gu and Huan Ren, Computer Science Division, University of |
*> California at Berkeley, USA |
*> California at Berkeley, USA |
*> |
*> |
*> @precisions fortran z -> c |
|
* ===================================================================== |
* ===================================================================== |
SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, |
SUBROUTINE ZGESDD( JOBZ, M, N, A, LDA, S, U, LDU, VT, LDVT, |
$ WORK, LWORK, RWORK, IWORK, INFO ) |
$ WORK, LWORK, RWORK, IWORK, INFO ) |
implicit none |
implicit none |
* |
* |
* -- LAPACK driver routine (version 3.6.1) -- |
* -- LAPACK driver routine (version 3.7.0) -- |
* -- 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 |
* June 2016 |
Line 331
|
Line 330
|
* real workspace. NB refers to the optimal block size for the |
* real workspace. NB refers to the optimal block size for the |
* immediately following subroutine, as returned by ILAENV.) |
* immediately following subroutine, as returned by ILAENV.) |
* |
* |
IF( INFO.EQ.0 .AND. M.GT.0 .AND. N.GT.0 ) THEN |
IF( INFO.EQ.0 ) THEN |
IF( M.GE.N ) THEN |
MINWRK = 1 |
|
MAXWRK = 1 |
|
IF( M.GE.N .AND. MINMN.GT.0 ) THEN |
* |
* |
* There is no complex work space needed for bidiagonal SVD |
* There is no complex work space needed for bidiagonal SVD |
* The real work space needed for bidiagonal SVD (dbdsdc) is |
* The real work space needed for bidiagonal SVD (dbdsdc) is |
Line 473
|
Line 474
|
MAXWRK = MAX( MAXWRK, 2*N + LWORK_ZUNMBR_PRC_NN ) |
MAXWRK = MAX( MAXWRK, 2*N + LWORK_ZUNMBR_PRC_NN ) |
END IF |
END IF |
END IF |
END IF |
ELSE |
ELSE IF( MINMN.GT.0 ) THEN |
* |
* |
* There is no complex work space needed for bidiagonal SVD |
* There is no complex work space needed for bidiagonal SVD |
* The real work space needed for bidiagonal SVD (dbdsdc) is |
* The real work space needed for bidiagonal SVD (dbdsdc) is |