--- rpl/lapack/lapack/zgesvd.f 2011/11/21 22:19:46 1.9 +++ rpl/lapack/lapack/zgesvd.f 2023/08/07 08:39:19 1.20 @@ -2,25 +2,25 @@ * * =========== DOCUMENTATION =========== * -* Online html documentation available at -* http://www.netlib.org/lapack/explore-html/ +* Online html documentation available at +* http://www.netlib.org/lapack/explore-html/ * *> \htmlonly -*> Download ZGESVD + dependencies -*> -*> [TGZ] -*> -*> [ZIP] -*> +*> Download ZGESVD + dependencies +*> +*> [TGZ] +*> +*> [ZIP] +*> *> [TXT] -*> \endhtmlonly +*> \endhtmlonly * * Definition: * =========== * * SUBROUTINE ZGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, * WORK, LWORK, RWORK, INFO ) -* +* * .. Scalar Arguments .. * CHARACTER JOBU, JOBVT * INTEGER INFO, LDA, LDU, LDVT, LWORK, M, N @@ -30,7 +30,7 @@ * COMPLEX*16 A( LDA, * ), U( LDU, * ), VT( LDVT, * ), * $ WORK( * ) * .. -* +* * *> \par Purpose: * ============= @@ -201,23 +201,20 @@ * Authors: * ======== * -*> \author Univ. of Tennessee -*> \author Univ. of California Berkeley -*> \author Univ. of Colorado Denver -*> \author NAG Ltd. -* -*> \date November 2011 +*> \author Univ. of Tennessee +*> \author Univ. of California Berkeley +*> \author Univ. of Colorado Denver +*> \author NAG Ltd. * *> \ingroup complex16GEsing * * ===================================================================== - SUBROUTINE ZGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, + SUBROUTINE ZGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, $ VT, LDVT, WORK, LWORK, RWORK, INFO ) * -* -- LAPACK driver routine (version 3.4.0) -- +* -- LAPACK driver routine -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- -* November 2011 * * .. Scalar Arguments .. CHARACTER JOBU, JOBVT @@ -321,24 +318,24 @@ * MNTHR = ILAENV( 6, 'ZGESVD', JOBU // JOBVT, M, N, 0, 0 ) * Compute space needed for ZGEQRF - CALL ZGEQRF( M, N, A, LDA, DUM(1), DUM(1), -1, IERR ) - LWORK_ZGEQRF=DUM(1) + CALL ZGEQRF( M, N, A, LDA, CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZGEQRF = INT( CDUM(1) ) * Compute space needed for ZUNGQR - CALL ZUNGQR( M, N, N, A, LDA, DUM(1), DUM(1), -1, IERR ) - LWORK_ZUNGQR_N=DUM(1) - CALL ZUNGQR( M, M, N, A, LDA, DUM(1), DUM(1), -1, IERR ) - LWORK_ZUNGQR_M=DUM(1) + CALL ZUNGQR( M, N, N, A, LDA, CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZUNGQR_N = INT( CDUM(1) ) + CALL ZUNGQR( M, M, N, A, LDA, CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZUNGQR_M = INT( CDUM(1) ) * Compute space needed for ZGEBRD - CALL ZGEBRD( N, N, A, LDA, S, DUM(1), DUM(1), - $ DUM(1), DUM(1), -1, IERR ) - LWORK_ZGEBRD=DUM(1) + CALL ZGEBRD( N, N, A, LDA, S, DUM(1), CDUM(1), + $ CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZGEBRD = INT( CDUM(1) ) * Compute space needed for ZUNGBR - CALL ZUNGBR( 'P', N, N, N, A, LDA, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_P=DUM(1) - CALL ZUNGBR( 'Q', N, N, N, A, LDA, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_Q=DUM(1) + CALL ZUNGBR( 'P', N, N, N, A, LDA, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_P = INT( CDUM(1) ) + CALL ZUNGBR( 'Q', N, N, N, A, LDA, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_Q = INT( CDUM(1) ) * IF( M.GE.MNTHR ) THEN IF( WNTUN ) THEN @@ -443,26 +440,26 @@ * * Path 10 (M at least N, but not much larger) * - CALL ZGEBRD( M, N, A, LDA, S, DUM(1), DUM(1), - $ DUM(1), DUM(1), -1, IERR ) - LWORK_ZGEBRD=DUM(1) + CALL ZGEBRD( M, N, A, LDA, S, DUM(1), CDUM(1), + $ CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZGEBRD = INT( CDUM(1) ) MAXWRK = 2*N + LWORK_ZGEBRD IF( WNTUS .OR. WNTUO ) THEN - CALL ZUNGBR( 'Q', M, N, N, A, LDA, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_Q=DUM(1) + CALL ZUNGBR( 'Q', M, N, N, A, LDA, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_Q = INT( CDUM(1) ) MAXWRK = MAX( MAXWRK, 2*N+LWORK_ZUNGBR_Q ) END IF IF( WNTUA ) THEN - CALL ZUNGBR( 'Q', M, M, N, A, LDA, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_Q=DUM(1) + CALL ZUNGBR( 'Q', M, M, N, A, LDA, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_Q = INT( CDUM(1) ) MAXWRK = MAX( MAXWRK, 2*N+LWORK_ZUNGBR_Q ) END IF IF( .NOT.WNTVN ) THEN MAXWRK = MAX( MAXWRK, 2*N+LWORK_ZUNGBR_P ) - MINWRK = 2*N + M END IF + MINWRK = 2*N + M END IF ELSE IF( MINMN.GT.0 ) THEN * @@ -470,25 +467,26 @@ * MNTHR = ILAENV( 6, 'ZGESVD', JOBU // JOBVT, M, N, 0, 0 ) * Compute space needed for ZGELQF - CALL ZGELQF( M, N, A, LDA, DUM(1), DUM(1), -1, IERR ) - LWORK_ZGELQF=DUM(1) + CALL ZGELQF( M, N, A, LDA, CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZGELQF = INT( CDUM(1) ) * Compute space needed for ZUNGLQ - CALL ZUNGLQ( N, N, M, VT, LDVT, DUM(1), DUM(1), -1, IERR ) - LWORK_ZUNGLQ_N=DUM(1) - CALL ZUNGLQ( M, N, M, A, LDA, DUM(1), DUM(1), -1, IERR ) - LWORK_ZUNGLQ_M=DUM(1) + CALL ZUNGLQ( N, N, M, CDUM(1), N, CDUM(1), CDUM(1), -1, + $ IERR ) + LWORK_ZUNGLQ_N = INT( CDUM(1) ) + CALL ZUNGLQ( M, N, M, A, LDA, CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZUNGLQ_M = INT( CDUM(1) ) * Compute space needed for ZGEBRD - CALL ZGEBRD( M, M, A, LDA, S, DUM(1), DUM(1), - $ DUM(1), DUM(1), -1, IERR ) - LWORK_ZGEBRD=DUM(1) + CALL ZGEBRD( M, M, A, LDA, S, DUM(1), CDUM(1), + $ CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZGEBRD = INT( CDUM(1) ) * Compute space needed for ZUNGBR P - CALL ZUNGBR( 'P', M, M, M, A, N, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_P=DUM(1) + CALL ZUNGBR( 'P', M, M, M, A, N, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_P = INT( CDUM(1) ) * Compute space needed for ZUNGBR Q - CALL ZUNGBR( 'Q', M, M, M, A, N, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_Q=DUM(1) + CALL ZUNGBR( 'Q', M, M, M, A, N, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_Q = INT( CDUM(1) ) IF( N.GE.MNTHR ) THEN IF( WNTVN ) THEN * @@ -592,27 +590,27 @@ * * Path 10t(N greater than M, but not much larger) * - CALL ZGEBRD( M, N, A, LDA, S, DUM(1), DUM(1), - $ DUM(1), DUM(1), -1, IERR ) - LWORK_ZGEBRD=DUM(1) + CALL ZGEBRD( M, N, A, LDA, S, DUM(1), CDUM(1), + $ CDUM(1), CDUM(1), -1, IERR ) + LWORK_ZGEBRD = INT( CDUM(1) ) MAXWRK = 2*M + LWORK_ZGEBRD IF( WNTVS .OR. WNTVO ) THEN * Compute space needed for ZUNGBR P - CALL ZUNGBR( 'P', M, N, M, A, N, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_P=DUM(1) + CALL ZUNGBR( 'P', M, N, M, A, N, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_P = INT( CDUM(1) ) MAXWRK = MAX( MAXWRK, 2*M+LWORK_ZUNGBR_P ) END IF IF( WNTVA ) THEN - CALL ZUNGBR( 'P', N, N, M, A, N, DUM(1), - $ DUM(1), -1, IERR ) - LWORK_ZUNGBR_P=DUM(1) + CALL ZUNGBR( 'P', N, N, M, A, N, CDUM(1), + $ CDUM(1), -1, IERR ) + LWORK_ZUNGBR_P = INT( CDUM(1) ) MAXWRK = MAX( MAXWRK, 2*M+LWORK_ZUNGBR_P ) END IF IF( .NOT.WNTUN ) THEN MAXWRK = MAX( MAXWRK, 2*M+LWORK_ZUNGBR_Q ) - MINWRK = 2*M + N END IF + MINWRK = 2*M + N END IF END IF MAXWRK = MAX( MAXWRK, MINWRK ) @@ -679,8 +677,10 @@ * * Zero out below R * - CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, A( 2, 1 ), - $ LDA ) + IF( N .GT. 1 ) THEN + CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, A( 2, 1 ), + $ LDA ) + END IF IE = 1 ITAUQ = 1 ITAUP = ITAUQ + N @@ -1143,8 +1143,10 @@ * * Zero out below R in A * - CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, - $ A( 2, 1 ), LDA ) + IF( N .GT. 1 ) THEN + CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, + $ A( 2, 1 ), LDA ) + END IF * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) @@ -1320,8 +1322,10 @@ * * Zero out below R in A * - CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, - $ A( 2, 1 ), LDA ) + IF( N .GT. 1 ) THEN + CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, + $ A( 2, 1 ), LDA ) + END IF * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) @@ -1648,8 +1652,10 @@ * * Zero out below R in A * - CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, - $ A( 2, 1 ), LDA ) + IF( N .GT. 1 ) THEN + CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, + $ A( 2, 1 ), LDA ) + END IF * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) @@ -1829,8 +1835,10 @@ * * Zero out below R in A * - CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, - $ A( 2, 1 ), LDA ) + IF( N .GT. 1 ) THEN + CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, + $ A( 2, 1 ), LDA ) + END IF * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB)