diff options
Diffstat (limited to 'TESTING')
-rw-r--r-- | TESTING/LIN/clahilb.f | 18 | ||||
-rw-r--r-- | TESTING/LIN/dlahilb.f | 12 | ||||
-rw-r--r-- | TESTING/LIN/slahilb.f | 6 | ||||
-rw-r--r-- | TESTING/LIN/zlahilb.f | 14 | ||||
-rw-r--r-- | TESTING/MATGEN/clahilb.f | 13 | ||||
-rw-r--r-- | TESTING/MATGEN/dlahilb.f | 14 | ||||
-rw-r--r-- | TESTING/MATGEN/slahilb.f | 15 | ||||
-rw-r--r-- | TESTING/MATGEN/zlahilb.f | 12 |
8 files changed, 52 insertions, 52 deletions
diff --git a/TESTING/LIN/clahilb.f b/TESTING/LIN/clahilb.f index 0ce9eb1b..65c13404 100644 --- a/TESTING/LIN/clahilb.f +++ b/TESTING/LIN/clahilb.f @@ -8,11 +8,11 @@ * Definition: * =========== * -* SUBROUTINE CLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, +* SUBROUTINE CLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, * INFO, PATH) * * .. Scalar Arguments .. -* INTEGER T, N, NRHS, LDA, LDX, LDB, INFO +* INTEGER N, NRHS, LDA, LDX, LDB, INFO * .. Array Arguments .. * REAL WORK(N) * COMPLEX A(LDA,N), X(LDX, NRHS), B(LDB, NRHS) @@ -56,7 +56,7 @@ *> *> \param[in] NRHS *> \verbatim -*> NRHS is NRHS +*> NRHS is INTEGER *> The requested number of right-hand sides. *> \endverbatim *> @@ -131,7 +131,7 @@ *> \ingroup complex_lin * * ===================================================================== - SUBROUTINE CLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, + SUBROUTINE CLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, $ INFO, PATH) * * -- LAPACK test routine (version 3.7.0) -- @@ -140,7 +140,7 @@ * December 2016 * * .. Scalar Arguments .. - INTEGER T, N, NRHS, LDA, LDX, LDB, INFO + INTEGER N, NRHS, LDA, LDX, LDB, INFO * .. Array Arguments .. REAL WORK(N) COMPLEX A(LDA,N), X(LDX, NRHS), B(LDB, NRHS) @@ -220,7 +220,8 @@ END DO * * Generate the scaled Hilbert matrix in A -* If we are testing SY routines, take D1_i = D2_i, else, D1_i = D2_i* +* If we are testing SY routines, take +* D1_i = D2_i, else, D1_i = D2_i* IF ( LSAMEN( 2, C2, 'SY' ) ) THEN DO J = 1, N DO I = 1, N @@ -250,8 +251,9 @@ WORK(J) = ( ( (WORK(J-1)/(J-1)) * (J-1 - N) ) /(J-1) ) $ * (N +J -1) END DO -* -* If we are testing SY routines, take D1_i = D2_i, else, D1_i = D2_i* + +* If we are testing SY routines, +* take D1_i = D2_i, else, D1_i = D2_i* IF ( LSAMEN( 2, C2, 'SY' ) ) THEN DO J = 1, NRHS DO I = 1, N diff --git a/TESTING/LIN/dlahilb.f b/TESTING/LIN/dlahilb.f index a1989d57..60b9c27d 100644 --- a/TESTING/LIN/dlahilb.f +++ b/TESTING/LIN/dlahilb.f @@ -8,7 +8,7 @@ * Definition: * =========== * -* SUBROUTINE DLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) +* SUBROUTINE DLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * * .. Scalar Arguments .. * INTEGER N, NRHS, LDA, LDX, LDB, INFO @@ -53,7 +53,7 @@ *> *> \param[in] NRHS *> \verbatim -*> NRHS is NRHS +*> NRHS is INTEGER *> The requested number of right-hand sides. *> \endverbatim *> @@ -122,7 +122,7 @@ *> \ingroup double_lin * * ===================================================================== - SUBROUTINE DLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) + SUBROUTINE DLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * * -- LAPACK test routine (version 3.7.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- @@ -140,7 +140,6 @@ INTEGER TM, TI, R INTEGER M INTEGER I, J - COMPLEX*16 TMP * .. * .. Parameters .. * NMAX_EXACT the largest dimension where the generated data is @@ -203,9 +202,8 @@ * * Generate matrix B as simply the first NRHS columns of M * the * identity. - TMP = DBLE(M) - CALL DLASET('Full', N, NRHS, 0.0D+0, TMP, B, LDB) -* + CALL DLASET('Full', N, NRHS, 0.0D+0, DBLE(M), B, LDB) + * Generate the true solutions in X. Because B = the first NRHS * columns of M*I, the true solutions are just the first NRHS columns * of the inverse Hilbert matrix. diff --git a/TESTING/LIN/slahilb.f b/TESTING/LIN/slahilb.f index be7af415..4a42aaae 100644 --- a/TESTING/LIN/slahilb.f +++ b/TESTING/LIN/slahilb.f @@ -8,7 +8,7 @@ * Definition: * =========== * -* SUBROUTINE SLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) +* SUBROUTINE SLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * * .. Scalar Arguments .. * INTEGER N, NRHS, LDA, LDX, LDB, INFO @@ -53,7 +53,7 @@ *> *> \param[in] NRHS *> \verbatim -*> NRHS is NRHS +*> NRHS is INTEGER *> The requested number of right-hand sides. *> \endverbatim *> @@ -122,7 +122,7 @@ *> \ingroup single_lin * * ===================================================================== - SUBROUTINE SLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) + SUBROUTINE SLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, INFO) * * -- LAPACK test routine (version 3.7.0) -- * -- LAPACK is a software package provided by Univ. of Tennessee, -- diff --git a/TESTING/LIN/zlahilb.f b/TESTING/LIN/zlahilb.f index 98c0303d..a2361cd7 100644 --- a/TESTING/LIN/zlahilb.f +++ b/TESTING/LIN/zlahilb.f @@ -8,7 +8,7 @@ * Definition: * =========== * -* SUBROUTINE ZLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, +* SUBROUTINE ZLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, * INFO, PATH) * * .. Scalar Arguments .. @@ -56,7 +56,7 @@ *> *> \param[in] NRHS *> \verbatim -*> NRHS is NRHS +*> NRHS is INTEGER *> The requested number of right-hand sides. *> \endverbatim *> @@ -131,7 +131,7 @@ *> \ingroup complex16_lin * * ===================================================================== - SUBROUTINE ZLAHILB(N, NRHS, A, LDA, X, LDX, B, LDB, WORK, + SUBROUTINE ZLAHILB( N, NRHS, A, LDA, X, LDX, B, LDB, WORK, $ INFO, PATH) * * -- LAPACK test routine (version 3.7.0) -- @@ -220,7 +220,8 @@ END DO * * Generate the scaled Hilbert matrix in A -* If we are testing SY routines, take D1_i = D2_i, else, D1_i = D2_i* +* If we are testing SY routines, +* take D1_i = D2_i, else, D1_i = D2_i* IF ( LSAMEN( 2, C2, 'SY' ) ) THEN DO J = 1, N DO I = 1, N @@ -250,8 +251,9 @@ WORK(J) = ( ( (WORK(J-1)/(J-1)) * (J-1 - N) ) /(J-1) ) $ * (N +J -1) END DO -* -* If we are testing SY routines, take D1_i = D2_i, else, D1_i = D2_i* + +* If we are testing SY routines, +* take D1_i = D2_i, else, D1_i = D2_i* IF ( LSAMEN( 2, C2, 'SY' ) ) THEN DO J = 1, NRHS DO I = 1, N diff --git a/TESTING/MATGEN/clahilb.f b/TESTING/MATGEN/clahilb.f index 612c6c68..f75ef3ab 100644 --- a/TESTING/MATGEN/clahilb.f +++ b/TESTING/MATGEN/clahilb.f @@ -154,7 +154,7 @@ INTEGER I, J COMPLEX TMP CHARACTER*2 C2 - +* .. * .. Parameters .. * NMAX_EXACT the largest dimension where the generated data is * exact. @@ -163,7 +163,7 @@ * ??? complex uses how many bits ??? INTEGER NMAX_EXACT, NMAX_APPROX, SIZE_D PARAMETER (NMAX_EXACT = 6, NMAX_APPROX = 11, SIZE_D = 8) - +* * d's are generated from random permuation of those eight elements. COMPLEX D1(8), D2(8), INVD1(8), INVD2(8) DATA D1 /(-1,0),(0,1),(-1,-1),(0,-1),(1,0),(-1,1),(1,1),(1,-1)/ @@ -173,7 +173,6 @@ $ (-.5,-.5),(.5,-.5),(.5,.5)/ DATA INVD2 /(-1,0),(0,1),(-.5,-.5),(0,-1),(1,0), $ (-.5,.5),(.5,.5),(.5,-.5)/ - * .. * .. External Functions EXTERNAL CLASET, LSAMEN @@ -204,7 +203,7 @@ IF (N .GT. NMAX_EXACT) THEN INFO = 1 END IF - +* * Compute M = the LCM of the integers [1, 2*N-1]. The largest * reasonable N is small enough that integers suffice (up to N = 11). M = 1 @@ -219,7 +218,7 @@ END DO M = (M / TI) * I END DO - +* * Generate the scaled Hilbert matrix in A * If we are testing SY routines, take * D1_i = D2_i, else, D1_i = D2_i* @@ -238,12 +237,12 @@ END DO END DO END IF - +* * Generate matrix B as simply the first NRHS columns of M * the * identity. TMP = REAL(M) CALL CLASET('Full', N, NRHS, (0.0,0.0), TMP, B, LDB) - +* * Generate the true solutions in X. Because B = the first NRHS * columns of M*I, the true solutions are just the first NRHS columns * of the inverse Hilbert matrix. diff --git a/TESTING/MATGEN/dlahilb.f b/TESTING/MATGEN/dlahilb.f index 7b2badab..7e30b3bc 100644 --- a/TESTING/MATGEN/dlahilb.f +++ b/TESTING/MATGEN/dlahilb.f @@ -1,4 +1,4 @@ -C> \brief \b DLAHILB +*> \brief \b DLAHILB * * =========== DOCUMENTATION =========== * @@ -140,7 +140,7 @@ C> \brief \b DLAHILB INTEGER TM, TI, R INTEGER M INTEGER I, J - +* .. * .. Parameters .. * NMAX_EXACT the largest dimension where the generated data is * exact. @@ -177,7 +177,7 @@ C> \brief \b DLAHILB IF (N .GT. NMAX_EXACT) THEN INFO = 1 END IF - +* * Compute M = the LCM of the integers [1, 2*N-1]. The largest * reasonable N is small enough that integers suffice (up to N = 11). M = 1 @@ -192,14 +192,14 @@ C> \brief \b DLAHILB END DO M = (M / TI) * I END DO - +* * Generate the scaled Hilbert matrix in A DO J = 1, N DO I = 1, N A(I, J) = DBLE(M) / (I + J - 1) END DO END DO - +* * Generate matrix B as simply the first NRHS columns of M * the * identity. CALL DLASET('Full', N, NRHS, 0.0D+0, DBLE(M), B, LDB) @@ -212,12 +212,12 @@ C> \brief \b DLAHILB WORK(J) = ( ( (WORK(J-1)/(J-1)) * (J-1 - N) ) /(J-1) ) $ * (N +J -1) END DO - +* DO J = 1, NRHS DO I = 1, N X(I, J) = (WORK(I)*WORK(J)) / (I + J - 1) END DO END DO - +* END diff --git a/TESTING/MATGEN/slahilb.f b/TESTING/MATGEN/slahilb.f index 170cce62..471e2e75 100644 --- a/TESTING/MATGEN/slahilb.f +++ b/TESTING/MATGEN/slahilb.f @@ -140,7 +140,7 @@ INTEGER TM, TI, R INTEGER M INTEGER I, J - +* .. * .. Parameters .. * NMAX_EXACT the largest dimension where the generated data is * exact. @@ -148,7 +148,6 @@ * a small componentwise relative error. INTEGER NMAX_EXACT, NMAX_APPROX PARAMETER (NMAX_EXACT = 6, NMAX_APPROX = 11) - * .. * .. External Functions EXTERNAL SLASET @@ -177,7 +176,7 @@ IF (N .GT. NMAX_EXACT) THEN INFO = 1 END IF - +* * Compute M = the LCM of the integers [1, 2*N-1]. The largest * reasonable N is small enough that integers suffice (up to N = 11). M = 1 @@ -192,18 +191,18 @@ END DO M = (M / TI) * I END DO - +* * Generate the scaled Hilbert matrix in A DO J = 1, N DO I = 1, N A(I, J) = REAL(M) / (I + J - 1) END DO END DO - +* * Generate matrix B as simply the first NRHS columns of M * the * identity. CALL SLASET('Full', N, NRHS, 0.0, REAL(M), B, LDB) - +* * Generate the true solutions in X. Because B = the first NRHS * columns of M*I, the true solutions are just the first NRHS columns * of the inverse Hilbert matrix. @@ -212,12 +211,12 @@ WORK(J) = ( ( (WORK(J-1)/(J-1)) * (J-1 - N) ) /(J-1) ) $ * (N +J -1) END DO - +* DO J = 1, NRHS DO I = 1, N X(I, J) = (WORK(I)*WORK(J)) / (I + J - 1) END DO END DO - +* END diff --git a/TESTING/MATGEN/zlahilb.f b/TESTING/MATGEN/zlahilb.f index 89210929..24233d7b 100644 --- a/TESTING/MATGEN/zlahilb.f +++ b/TESTING/MATGEN/zlahilb.f @@ -154,7 +154,7 @@ INTEGER I, J COMPLEX*16 TMP CHARACTER*2 C2 - +* .. * .. Parameters .. * NMAX_EXACT the largest dimension where the generated data is * exact. @@ -163,7 +163,7 @@ * ??? complex uses how many bits ??? INTEGER NMAX_EXACT, NMAX_APPROX, SIZE_D PARAMETER (NMAX_EXACT = 6, NMAX_APPROX = 11, SIZE_D = 8) - +* * d's are generated from random permuation of those eight elements. COMPLEX*16 d1(8), d2(8), invd1(8), invd2(8) DATA D1 /(-1,0),(0,1),(-1,-1),(0,-1),(1,0),(-1,1),(1,1),(1,-1)/ @@ -203,7 +203,7 @@ IF (N .GT. NMAX_EXACT) THEN INFO = 1 END IF - +* * Compute M = the LCM of the integers [1, 2*N-1]. The largest * reasonable N is small enough that integers suffice (up to N = 11). M = 1 @@ -218,7 +218,7 @@ END DO M = (M / TI) * I END DO - +* * Generate the scaled Hilbert matrix in A * If we are testing SY routines, * take D1_i = D2_i, else, D1_i = D2_i* @@ -237,12 +237,12 @@ END DO END DO END IF - +* * Generate matrix B as simply the first NRHS columns of M * the * identity. TMP = DBLE(M) CALL ZLASET('Full', N, NRHS, (0.0D+0,0.0D+0), TMP, B, LDB) - +* * Generate the true solutions in X. Because B = the first NRHS * columns of M*I, the true solutions are just the first NRHS columns * of the inverse Hilbert matrix. |