--- rpl/lapack/lapack/zgelss.f 2012/12/14 14:22:45 1.11
+++ rpl/lapack/lapack/zgelss.f 2017/06/17 11:06:42 1.16
@@ -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 ZGELSS + dependencies
-*>
-*> [TGZ]
-*>
-*> [ZIP]
-*>
+*> Download ZGELSS + dependencies
+*>
+*> [TGZ]
+*>
+*> [ZIP]
+*>
*> [TXT]
-*> \endhtmlonly
+*> \endhtmlonly
*
* Definition:
* ===========
*
* SUBROUTINE ZGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
* WORK, LWORK, RWORK, INFO )
-*
+*
* .. Scalar Arguments ..
* INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK
* DOUBLE PRECISION RCOND
@@ -29,7 +29,7 @@
* DOUBLE PRECISION RWORK( * ), S( * )
* COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * )
* ..
-*
+*
*
*> \par Purpose:
* =============
@@ -165,12 +165,12 @@
* Authors:
* ========
*
-*> \author Univ. of Tennessee
-*> \author Univ. of California Berkeley
-*> \author Univ. of Colorado Denver
-*> \author NAG Ltd.
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
*
-*> \date November 2011
+*> \date June 2016
*
*> \ingroup complex16GEsolve
*
@@ -178,10 +178,10 @@
SUBROUTINE ZGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
$ WORK, LWORK, RWORK, INFO )
*
-* -- LAPACK driver routine (version 3.4.0) --
+* -- LAPACK driver routine (version 3.7.0) --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-* November 2011
+* June 2016
*
* .. Scalar Arguments ..
INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK
@@ -285,8 +285,8 @@
* Path 1 - overdetermined or exactly determined
*
* Compute space needed for ZGEBRD
- CALL ZGEBRD( MM, N, A, LDA, S, DUM(1), DUM(1),
- $ DUM(1), DUM(1), -1, INFO )
+ CALL ZGEBRD( MM, N, A, LDA, S, S, DUM(1), DUM(1), DUM(1),
+ $ -1, INFO )
LWORK_ZGEBRD=DUM(1)
* Compute space needed for ZUNMBR
CALL ZUNMBR( 'Q', 'L', 'C', MM, NRHS, N, A, LDA, DUM(1),
@@ -296,7 +296,7 @@
CALL ZUNGBR( 'P', N, N, N, A, LDA, DUM(1),
$ DUM(1), -1, INFO )
LWORK_ZUNGBR=DUM(1)
-* Compute total workspace needed
+* Compute total workspace needed
MAXWRK = MAX( MAXWRK, 2*N + LWORK_ZGEBRD )
MAXWRK = MAX( MAXWRK, 2*N + LWORK_ZUNMBR )
MAXWRK = MAX( MAXWRK, 2*N + LWORK_ZUNGBR )
@@ -315,11 +315,11 @@
$ -1, INFO )
LWORK_ZGELQF=DUM(1)
* Compute space needed for ZGEBRD
- CALL ZGEBRD( M, M, A, LDA, S, DUM(1), DUM(1),
- $ DUM(1), DUM(1), -1, INFO )
+ CALL ZGEBRD( M, M, A, LDA, S, S, DUM(1), DUM(1),
+ $ DUM(1), -1, INFO )
LWORK_ZGEBRD=DUM(1)
* Compute space needed for ZUNMBR
- CALL ZUNMBR( 'Q', 'L', 'C', M, NRHS, N, A, LDA,
+ CALL ZUNMBR( 'Q', 'L', 'C', M, NRHS, N, A, LDA,
$ DUM(1), B, LDB, DUM(1), -1, INFO )
LWORK_ZUNMBR=DUM(1)
* Compute space needed for ZUNGBR
@@ -330,7 +330,7 @@
CALL ZUNMLQ( 'L', 'C', N, NRHS, M, A, LDA, DUM(1),
$ B, LDB, DUM(1), -1, INFO )
LWORK_ZUNMLQ=DUM(1)
-* Compute total workspace needed
+* Compute total workspace needed
MAXWRK = M + LWORK_ZGELQF
MAXWRK = MAX( MAXWRK, 3*M + M*M + LWORK_ZGEBRD )
MAXWRK = MAX( MAXWRK, 3*M + M*M + LWORK_ZUNMBR )
@@ -346,11 +346,11 @@
* Path 2 - underdetermined
*
* Compute space needed for ZGEBRD
- CALL ZGEBRD( M, N, A, LDA, S, DUM(1), DUM(1),
- $ DUM(1), DUM(1), -1, INFO )
+ CALL ZGEBRD( M, N, A, LDA, S, S, DUM(1), DUM(1),
+ $ DUM(1), -1, INFO )
LWORK_ZGEBRD=DUM(1)
* Compute space needed for ZUNMBR
- CALL ZUNMBR( 'Q', 'L', 'C', M, NRHS, M, A, LDA,
+ CALL ZUNMBR( 'Q', 'L', 'C', M, NRHS, M, A, LDA,
$ DUM(1), B, LDB, DUM(1), -1, INFO )
LWORK_ZUNMBR=DUM(1)
* Compute space needed for ZUNGBR