renamed SLAORHR_GETRFNP into SLAORHR_COL_GETRFNP, and SLAORHR_GETRFNP2 into SLAORHR_COL_GETRFNP2

Author: scr2016

SRC/CMakeLists.txt

@@ -148,7 +148,7 @@ set(SLASRC
    sgetsls.f sgeqr.f slatsqr.f slamtsqr.f sgemqr.f
    sgelq.f slaswlq.f slamswlq.f sgemlq.f
    stplqt.f stplqt2.f stpmlqt.f
-   sorhr_col.f slaorhr_getrfnp.f slaorhr_getrfnp2.f
+   sorhr_col.f slaorhr_col_getrfnp.f slaorhr_col_getrfnp2.f
    ssytrd_2stage.f ssytrd_sy2sb.f ssytrd_sb2st.F ssb2st_kernels.f
    ssyevd_2stage.f ssyev_2stage.f ssyevx_2stage.f ssyevr_2stage.f
    ssbev_2stage.f ssbevx_2stage.f ssbevd_2stage.f ssygv_2stage.f

SRC/Makefile

@@ -176,7 +176,7 @@ SLASRC = \
    sgetsls.o sgeqr.o slatsqr.o slamtsqr.o sgemqr.o \
    sgelq.o slaswlq.o slamswlq.o sgemlq.o \
    stplqt.o stplqt2.o stpmlqt.o \
-   sorhr_col.o slaorhr_getrfnp.o slaorhr_getrfnp2.o \
+   sorhr_col.o slaorhr_col_getrfnp.o slaorhr_col_getrfnp2.o \
    ssytrd_2stage.o ssytrd_sy2sb.o ssytrd_sb2st.o ssb2st_kernels.o \
    ssyevd_2stage.o ssyev_2stage.o ssyevx_2stage.o ssyevr_2stage.o \
    ssbev_2stage.o ssbevx_2stage.o ssbevd_2stage.o ssygv_2stage.o \

SRC/slaorhr_getrfnp.f renamed to SRC/slaorhr_col_getrfnp.f

@@ -1,24 +1,24 @@
-*> \brief \b SLAORHR_GETRFNP
+*> \brief \b SLAORHR_COL_GETRFNP
 *
 *  =========== DOCUMENTATION ===========
 *
 * Online html documentation available at
 *            http://www.netlib.org/lapack/explore-html/
 *
 *> \htmlonly
-*> Download SLAORHR_GETRFNP + dependencies
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slaorhr_getrfnp.f">
+*> Download SLAORHR_COL_GETRFNP + dependencies
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slaorhr_col_getrfnp.f">
 *> [TGZ]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slaorhr_getrfnp.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slaorhr_col_getrfnp.f">
 *> [ZIP]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slaorhr_getrfnp.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slaorhr_col_getrfnp.f">
 *> [TXT]</a>
 *> \endhtmlonly
 *
 *  Definition:
 *  ===========
 *
-*       SUBROUTINE SLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
+*       SUBROUTINE SLAORHR_COL_GETRFNP( M, N, A, LDA, D, INFO )
 *
 *       .. Scalar Arguments ..
 *       INTEGER            INFO, LDA, M, N
@@ -33,8 +33,8 @@
 *>
 *> \verbatim
 *>
-*> SLAORHR_GETRFNP computes the modified LU factorization without
-*> pivoting of a general M-by-N matrix A. The factorization has
+*> SLAORHR_COL_GETRFNP computes the modified LU factorization without
+*> pivoting of a real general M-by-N matrix A. The factorization has
 *> the form:
 *>
 *>     A - S = L * U,
@@ -48,27 +48,27 @@
 *>    at least one in absolute value (so that division-by-zero not
 *>    not possible during the division by the diagonal element);
 *>
-*>    L is a m-by-n lower triangular matrix with unit diagonal elements
-*>    (lower trapezoidal if m > n);
+*>    L is a M-by-N lower triangular matrix with unit diagonal elements
+*>    (lower trapezoidal if M > N);
 *>
-*>    and U is a m-by-n upper triangular matrix
-*>    (upper trapezoidal if m < n).
+*>    and U is a M-by-N upper triangular matrix
+*>    (upper trapezoidal if M < N).
 *>
 *> This routine is an auxiliary routine used in the Householder
-*> reconstruction routine SORHR. In SORHR, this routine is applied
-*> to an orthonormal M-by-N matrix A, where each element is bounded
-*> by one in absolute value. With the choice of the matrix S above,
-*> one can show that the diagonal element at each step of Gaussian
-*> elimination is the largest (in absolute value) in the column
-*> on or below the diagonal, so that no pivoting is required for
-*> numerical stability [1].
+*> reconstruction routine SORHR_COL. In SORHR_COL, this routine is
+*> applied to an M-by-N matrix A with orthonormal columns, where each
+*> element is bounded by one in absolute value. With the choice of
+*> the matrix S above, one can show that the diagonal element at each
+*> step of Gaussian elimination is the largest (in absolute value) in
+*> the column on or below the diagonal, so that no pivoting is required
+*> for numerical stability [1].
 *>
 *> For more details on the Householder reconstruction algorithm,
 *> including the modified LU factorization, see [1].
 *>
 *> This is the blocked right-looking version of the algorithm,
 *> calling Level 3 BLAS to update the submatrix. To factorize a block,
-*> this routine calls the recursive routine SLAORHR_GETRFNP2.
+*> this routine calls the recursive routine SLAORHR_COL_GETRFNP2.
 *>
 *> [1] "Reconstructing Householder vectors from tall-skinny QR",
 *>     G. Ballard, J. Demmel, L. Grigori, M. Jacquelin, H.D. Nguyen,
@@ -128,7 +128,7 @@
 *> \author Univ. of Colorado Denver
 *> \author NAG Ltd.
 *
-*> \date June 2019
+*> \date November 2019
 *
 *> \ingroup realGEcomputational
 *
@@ -137,20 +137,20 @@
 *>
 *> \verbatim
 *>
-*> June 2019, Igor Kozachenko,
-*>            Computer Science Division,
-*>            University of California, Berkeley
+*> November 2019, Igor Kozachenko,
+*>                Computer Science Division,
+*>                University of California, Berkeley
 *>
 *> \endverbatim
 *
 *  =====================================================================
-      SUBROUTINE SLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
+      SUBROUTINE SLAORHR_COL_GETRFNP( M, N, A, LDA, D, INFO )
       IMPLICIT NONE
 *
 *  -- LAPACK computational routine (version 3.9.0) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-*     June 2019
+*     November 2019
 *
 *     .. Scalar Arguments ..
       INTEGER            INFO, LDA, M, N
@@ -169,7 +169,7 @@ SUBROUTINE SLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
       INTEGER            IINFO, J, JB, NB
 *     ..
 *     .. External Subroutines ..
-      EXTERNAL           SGEMM, SLAORHR_GETRFNP2, STRSM, XERBLA
+      EXTERNAL           SGEMM, SLAORHR_COL_GETRFNP2, STRSM, XERBLA
 *     ..
 *     .. External Functions ..
       INTEGER            ILAENV
@@ -191,7 +191,7 @@ SUBROUTINE SLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
          INFO = -4
       END IF
       IF( INFO.NE.0 ) THEN
-         CALL XERBLA( 'SLAORHR_GETRFNP', -INFO )
+         CALL XERBLA( 'SLAORHR_COL_GETRFNP', -INFO )
          RETURN
       END IF
 *
@@ -203,13 +203,13 @@ SUBROUTINE SLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
 *     Determine the block size for this environment.
 *
 
-      NB = ILAENV( 1, 'SLAORHR_GETRFNP', ' ', M, N, -1, -1 )
+      NB = ILAENV( 1, 'SLAORHR_COL_GETRFNP', ' ', M, N, -1, -1 )
 
       IF( NB.LE.1 .OR. NB.GE.MIN( M, N ) ) THEN
 *
 *        Use unblocked code.
 *
-         CALL SLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
+         CALL SLAORHR_COL_GETRFNP2( M, N, A, LDA, D, INFO )
       ELSE
 *
 *        Use blocked code.
@@ -219,8 +219,8 @@ SUBROUTINE SLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
 *
 *           Factor diagonal and subdiagonal blocks.
 *
-            CALL SLAORHR_GETRFNP2( M-J+1, JB, A( J, J ), LDA, D( J ),
-     $                             IINFO )
+            CALL SLAORHR_COL_GETRFNP2( M-J+1, JB, A( J, J ), LDA,
+     $                                 D( J ), IINFO )
 *
             IF( J+JB.LE.N ) THEN
 *
@@ -243,6 +243,6 @@ SUBROUTINE SLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
       END IF
       RETURN
 *
-*     End of SLAORHR_GETRFNP
+*     End of SLAORHR_COL_GETRFNP
 *
       END

SRC/slaorhr_getrfnp2.f renamed to SRC/slaorhr_col_getrfnp2.f

@@ -1,4 +1,4 @@
-*> \brief \b SLAORHR_GETRFNP2
+*> \brief \b SLAORHR_COL_GETRFNP2
 *
 *  =========== DOCUMENTATION ===========
 *
@@ -7,18 +7,18 @@
 *
 *> \htmlonly
 *> Download DLAORHR_GETRF2NP + dependencies
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slaorhr_getrfnp2.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slaorhr_col_getrfnp2.f">
 *> [TGZ]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slaorhr_getrfnp2.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slaorhr_col_getrfnp2.f">
 *> [ZIP]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slaorhr_getrfnp2.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slaorhr_col_getrfnp2.f">
 *> [TXT]</a>
 *> \endhtmlonly
 *
 *  Definition:
 *  ===========
 *
-*       RECURSIVE SUBROUTINE SLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
+*       RECURSIVE SUBROUTINE SLAORHR_COL_GETRFNP2( M, N, A, LDA, D, INFO )
 *
 *       .. Scalar Arguments ..
 *       INTEGER            INFO, LDA, M, N
@@ -33,8 +33,8 @@
 *>
 *> \verbatim
 *>
-*> SLAORHR_GETRFNP2 computes the modified LU factorization without
-*> pivoting of a general M-by-N matrix A. The factorization has
+*> SLAORHR_COL_GETRFNP2 computes the modified LU factorization without
+*> pivoting of a real general M-by-N matrix A. The factorization has
 *> the form:
 *>
 *>     A - S = L * U,
@@ -48,20 +48,20 @@
 *>    least one in absolute value (so that division-by-zero not
 *>    possible during the division by the diagonal element);
 *>
-*>    L is a m-by-n lower triangular matrix with unit diagonal elements
-*>    (lower trapezoidal if m > n);
+*>    L is a M-by-N lower triangular matrix with unit diagonal elements
+*>    (lower trapezoidal if M > N);
 *>
-*>    and U is a m-by-n upper triangular matrix
-*>    (upper trapezoidal if m < n).
+*>    and U is a M-by-N upper triangular matrix
+*>    (upper trapezoidal if M < N).
 *>
 *> This routine is an auxiliary routine used in the Householder
-*> reconstruction routine SORHR. In SORHR, this routine is applied
-*> to an orthonormal M-by-N matrix A, where each element is bounded
-*> by one in absolute value. With the choice of the matrix S above,
-*> one can show that the diagonal element at each step of Gaussian
-*> elimination is the largest (in absolute value) in the column
-*> on or below the diagonal, so that no pivoting is required for
-*> numerical stability [1].
+*> reconstruction routine SORHR_COL. In SORHR_COL, this routine is
+*> applied to an M-by-N matrix A with orthonormal columns, where each
+*> element is bounded by one in absolute value. With the choice of
+*> the matrix S above, one can show that the diagonal element at each
+*> step of Gaussian elimination is the largest (in absolute value) in
+*> the column on or below the diagonal, so that no pivoting is required
+*> for numerical stability [1].
 *>
 *> For more details on the Householder reconstruction algorithm,
 *> including the modified LU factorization, see [1].
@@ -82,10 +82,10 @@
 *>
 *> For more details on the recursive LU algorithm, see [2].
 *>
-*> SLAORHR_GETRFNP2 is called to factorize a block by the blocked
-*> routine SLAORHR_GETRFNP, which uses blocked code calling
-*. Level 3 BLAS to update the submatrix. However, SLAORHR_GETRFNP2
-*> is self-sufficient and can be used without SLAORHR_GETRFNP.
+*> SLAORHR_COL_GETRFNP2 is called to factorize a block by the blocked
+*> routine SLAORHR_COL_GETRFNP, which uses blocked code calling
+*. Level 3 BLAS to update the submatrix. However, SLAORHR_COL_GETRFNP2
+*> is self-sufficient and can be used without SLAORHR_COL_GETRFNP.
 *>
 *> [1] "Reconstructing Householder vectors from tall-skinny QR",
 *>     G. Ballard, J. Demmel, L. Grigori, M. Jacquelin, H.D. Nguyen,
@@ -149,7 +149,7 @@
 *> \author Univ. of Colorado Denver
 *> \author NAG Ltd.
 *
-*> \date June 2019
+*> \date November 2019
 *
 *> \ingroup realGEcomputational
 *
@@ -158,20 +158,20 @@
 *>
 *> \verbatim
 *>
-*> June 2019, Igor Kozachenko,
-*>            Computer Science Division,
-*>            University of California, Berkeley
+*> November 2019, Igor Kozachenko,
+*>                Computer Science Division,
+*>                University of California, Berkeley
 *>
 *> \endverbatim
 *
 *  =====================================================================
-      RECURSIVE SUBROUTINE SLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
+      RECURSIVE SUBROUTINE SLAORHR_COL_GETRFNP2( M, N, A, LDA, D, INFO )
       IMPLICIT NONE
 *
 *  -- LAPACK computational routine (version 3.9.0) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-*     June 2019
+*     November 2019
 *
 *     .. Scalar Arguments ..
       INTEGER            INFO, LDA, M, N
@@ -213,7 +213,7 @@ RECURSIVE SUBROUTINE SLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
          INFO = -4
       END IF
       IF( INFO.NE.0 ) THEN
-         CALL XERBLA( 'SLAORHR_GETRFNP2', -INFO )
+         CALL XERBLA( 'SLAORHR_COL_GETRFNP2', -INFO )
          RETURN
       END IF
 *
@@ -274,7 +274,7 @@ RECURSIVE SUBROUTINE SLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
 *
 *        Factor B11, recursive call
 *
-         CALL SLAORHR_GETRFNP2( N1, N1, A, LDA, D, IINFO )
+         CALL SLAORHR_COL_GETRFNP2( N1, N1, A, LDA, D, IINFO )
 *
 *        Solve for B21
 *
@@ -294,12 +294,12 @@ RECURSIVE SUBROUTINE SLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
 *
 *        Factor B22, recursive call
 *
-         CALL SLAORHR_GETRFNP2( M-N1, N2, A( N1+1, N1+1 ), LDA,
+         CALL SLAORHR_COL_GETRFNP2( M-N1, N2, A( N1+1, N1+1 ), LDA,
      $                          D( N1+1 ), IINFO )
 *
       END IF
       RETURN
 *
-*     End of SLAORHR_GETRFNP2
+*     End of SLAORHR_COL_GETRFNP2
 *
       END

SRC/sorhr_col.f

@@ -282,7 +282,7 @@ SUBROUTINE SORHR_COL( M, N, NB, A, LDA, T, LDT, D, INFO )
      $                   NPLUSONE
 *     ..
 *     .. External Subroutines ..
-      EXTERNAL           SCOPY, SLAORHR_GETRFNP, SSCAL, STRSM, XERBLA
+      EXTERNAL           SCOPY, SLAORHR_COL_GETRFNP, SSCAL, STRSM, XERBLA
 *     ..
 *     .. Intrinsic Functions ..
       INTRINSIC          MAX, MIN
@@ -330,7 +330,7 @@ SUBROUTINE SORHR_COL( M, N, NB, A, LDA, T, LDT, D, INFO )
 *
 *     (1-1) Factor V1 and U.
 
-      CALL SLAORHR_GETRFNP( N, N, A, LDA, D, IINFO )
+      CALL SLAORHR_COL_GETRFNP( N, N, A, LDA, D, IINFO )
 *
 *     (1-2) Solve for V2.
 *