--- rpl/lapack/lapack/dsb2st_kernels.f 2018/05/29 07:18:05 1.4
+++ rpl/lapack/lapack/dsb2st_kernels.f 2020/05/21 21:46:01 1.5
@@ -1,26 +1,26 @@
*> \brief \b DSB2ST_KERNELS
*
* @generated from zhb2st_kernels.f, fortran z -> d, Wed Dec 7 08:22:39 2016
-*
+*
* =========== 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 DSB2ST_KERNELS + dependencies
-*>
-*> [TGZ]
-*>
-*> [ZIP]
-*>
+*> Download DSB2ST_KERNELS + dependencies
+*>
+*> [TGZ]
+*>
+*> [ZIP]
+*>
*> [TXT]
-*> \endhtmlonly
+*> \endhtmlonly
*
* Definition:
* ===========
*
-* SUBROUTINE DSB2ST_KERNELS( UPLO, WANTZ, TTYPE,
+* SUBROUTINE DSB2ST_KERNELS( UPLO, WANTZ, TTYPE,
* ST, ED, SWEEP, N, NB, IB,
* A, LDA, V, TAU, LDVT, WORK)
*
@@ -32,9 +32,9 @@
* INTEGER TTYPE, ST, ED, SWEEP, N, NB, IB, LDA, LDVT
* ..
* .. Array Arguments ..
-* DOUBLE PRECISION A( LDA, * ), V( * ),
+* DOUBLE PRECISION A( LDA, * ), V( * ),
* TAU( * ), WORK( * )
-*
+*
*> \par Purpose:
* =============
*>
@@ -124,7 +124,7 @@
*> LDVT is INTEGER.
*> \endverbatim
*>
-*> \param[in] WORK
+*> \param[out] WORK
*> \verbatim
*> WORK is DOUBLE PRECISION array. Workspace of size nb.
*> \endverbatim
@@ -147,7 +147,7 @@
*> http://doi.acm.org/10.1145/2063384.2063394
*>
*> A. Haidar, J. Kurzak, P. Luszczek, 2013.
-*> An improved parallel singular value algorithm and its implementation
+*> An improved parallel singular value algorithm and its implementation
*> for multicore hardware, In Proceedings of 2013 International Conference
*> for High Performance Computing, Networking, Storage and Analysis (SC '13).
*> Denver, Colorado, USA, 2013.
@@ -155,16 +155,16 @@
*> http://doi.acm.org/10.1145/2503210.2503292
*>
*> A. Haidar, R. Solca, S. Tomov, T. Schulthess and J. Dongarra.
-*> A novel hybrid CPU-GPU generalized eigensolver for electronic structure
+*> A novel hybrid CPU-GPU generalized eigensolver for electronic structure
*> calculations based on fine-grained memory aware tasks.
*> International Journal of High Performance Computing Applications.
*> Volume 28 Issue 2, Pages 196-209, May 2014.
-*> http://hpc.sagepub.com/content/28/2/196
+*> http://hpc.sagepub.com/content/28/2/196
*>
*> \endverbatim
*>
* =====================================================================
- SUBROUTINE DSB2ST_KERNELS( UPLO, WANTZ, TTYPE,
+ SUBROUTINE DSB2ST_KERNELS( UPLO, WANTZ, TTYPE,
$ ST, ED, SWEEP, N, NB, IB,
$ A, LDA, V, TAU, LDVT, WORK)
*
@@ -181,7 +181,7 @@
INTEGER TTYPE, ST, ED, SWEEP, N, NB, IB, LDA, LDVT
* ..
* .. Array Arguments ..
- DOUBLE PRECISION A( LDA, * ), V( * ),
+ DOUBLE PRECISION A( LDA, * ), V( * ),
$ TAU( * ), WORK( * )
* ..
*
@@ -195,8 +195,8 @@
* .. Local Scalars ..
LOGICAL UPPER
INTEGER I, J1, J2, LM, LN, VPOS, TAUPOS,
- $ DPOS, OFDPOS, AJETER
- DOUBLE PRECISION CTMP
+ $ DPOS, OFDPOS, AJETER
+ DOUBLE PRECISION CTMP
* ..
* .. External Subroutines ..
EXTERNAL DLARFG, DLARFX, DLARFY
@@ -209,7 +209,7 @@
* ..
* ..
* .. Executable Statements ..
-*
+*
AJETER = IB + LDVT
UPPER = LSAME( UPLO, 'U' )
@@ -240,10 +240,10 @@
V( VPOS ) = ONE
DO 10 I = 1, LM-1
V( VPOS+I ) = ( A( OFDPOS-I, ST+I ) )
- A( OFDPOS-I, ST+I ) = ZERO
+ A( OFDPOS-I, ST+I ) = ZERO
10 CONTINUE
CTMP = ( A( OFDPOS, ST ) )
- CALL DLARFG( LM, CTMP, V( VPOS+1 ), 1,
+ CALL DLARFG( LM, CTMP, V( VPOS+1 ), 1,
$ TAU( TAUPOS ) )
A( OFDPOS, ST ) = CTMP
*
@@ -281,14 +281,14 @@
*
V( VPOS ) = ONE
DO 30 I = 1, LM-1
- V( VPOS+I ) =
+ V( VPOS+I ) =
$ ( A( DPOS-NB-I, J1+I ) )
A( DPOS-NB-I, J1+I ) = ZERO
30 CONTINUE
CTMP = ( A( DPOS-NB, J1 ) )
CALL DLARFG( LM, CTMP, V( VPOS+1 ), 1, TAU( TAUPOS ) )
A( DPOS-NB, J1 ) = CTMP
-*
+*
CALL DLARFX( 'Right', LN-1, LM, V( VPOS ),
$ TAU( TAUPOS ),
$ A( DPOS-NB+1, J1 ), LDA-1, WORK)
@@ -296,9 +296,9 @@
ENDIF
*
* Lower case
-*
+*
ELSE
-*
+*
IF( WANTZ ) THEN
VPOS = MOD( SWEEP-1, 2 ) * N + ST
TAUPOS = MOD( SWEEP-1, 2 ) * N + ST
@@ -313,9 +313,9 @@
V( VPOS ) = ONE
DO 20 I = 1, LM-1
V( VPOS+I ) = A( OFDPOS+I, ST-1 )
- A( OFDPOS+I, ST-1 ) = ZERO
+ A( OFDPOS+I, ST-1 ) = ZERO
20 CONTINUE
- CALL DLARFG( LM, A( OFDPOS, ST-1 ), V( VPOS+1 ), 1,
+ CALL DLARFG( LM, A( OFDPOS, ST-1 ), V( VPOS+1 ), 1,
$ TAU( TAUPOS ) )
*
LM = ED - ST + 1
@@ -342,7 +342,7 @@
LM = J2-J1+1
*
IF( LM.GT.0) THEN
- CALL DLARFX( 'Right', LM, LN, V( VPOS ),
+ CALL DLARFX( 'Right', LM, LN, V( VPOS ),
$ TAU( TAUPOS ), A( DPOS+NB, ST ),
$ LDA-1, WORK)
*
@@ -359,13 +359,13 @@
V( VPOS+I ) = A( DPOS+NB+I, ST )
A( DPOS+NB+I, ST ) = ZERO
40 CONTINUE
- CALL DLARFG( LM, A( DPOS+NB, ST ), V( VPOS+1 ), 1,
+ CALL DLARFG( LM, A( DPOS+NB, ST ), V( VPOS+1 ), 1,
$ TAU( TAUPOS ) )
*
- CALL DLARFX( 'Left', LM, LN-1, V( VPOS ),
+ CALL DLARFX( 'Left', LM, LN-1, V( VPOS ),
$ ( TAU( TAUPOS ) ),
$ A( DPOS+NB-1, ST+1 ), LDA-1, WORK)
-
+
ENDIF
ENDIF
ENDIF
@@ -374,4 +374,4 @@
*
* END OF DSB2ST_KERNELS
*
- END
+ END