renamed DLAORHR_GETRFNP into DLAORHR_COL_GETRFNP, and DLAORHR_GETRFNP2 into DLAORHR_COL_GETRFNP2

Author: scr2016

SRC/CMakeLists.txt

@@ -343,7 +343,7 @@ set(DLASRC
    dgetsls.f dgeqr.f dlatsqr.f dlamtsqr.f dgemqr.f
    dgelq.f dlaswlq.f dlamswlq.f dgemlq.f
    dtplqt.f dtplqt2.f dtpmlqt.f
-   dorhr_col.f dlaorhr_getrfnp.f dlaorhr_getrfnp2.f
+   dorhr_col.f dlaorhr_col_getrfnp.f dlaorhr_col_getrfnp2.f
    dsytrd_2stage.f dsytrd_sy2sb.f dsytrd_sb2st.F dsb2st_kernels.f
    dsyevd_2stage.f dsyev_2stage.f dsyevx_2stage.f dsyevr_2stage.f
    dsbev_2stage.f dsbevx_2stage.f dsbevd_2stage.f dsygv_2stage.f

SRC/Makefile

@@ -377,7 +377,7 @@ DLASRC = \
    dgetsls.o dgeqr.o dlatsqr.o dlamtsqr.o dgemqr.o \
    dgelq.o dlaswlq.o dlamswlq.o dgemlq.o \
    dtplqt.o dtplqt2.o dtpmlqt.o \
-   dorhr_col.o dlaorhr_getrfnp.o dlaorhr_getrfnp2.o \
+   dorhr_col.o dlaorhr_col_getrfnp.o dlaorhr_col_getrfnp2.o \
    dsytrd_2stage.o dsytrd_sy2sb.o dsytrd_sb2st.o dsb2st_kernels.o \
    dsyevd_2stage.o dsyev_2stage.o dsyevx_2stage.o dsyevr_2stage.o \
    dsbev_2stage.o dsbevx_2stage.o dsbevd_2stage.o dsygv_2stage.o \

SRC/dlaorhr_getrfnp.f renamed to SRC/dlaorhr_col_getrfnp.f

@@ -1,24 +1,24 @@
-*> \brief \b DLAORHR_GETRFNP
+*> \brief \b DLAORHR_COL_GETRFNP
 *
 *  =========== DOCUMENTATION ===========
 *
 * Online html documentation available at
 *            http://www.netlib.org/lapack/explore-html/
 *
 *> \htmlonly
-*> Download DLAORHR_GETRFNP + dependencies
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlaorhr_getrfnp.f">
+*> Download DLAORHR_COL_GETRFNP + dependencies
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlaorhr_col_getrfnp.f">
 *> [TGZ]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlaorhr_getrfnp.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlaorhr_col_getrfnp.f">
 *> [ZIP]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlaorhr_getrfnp.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlaorhr_col_getrfnp.f">
 *> [TXT]</a>
 *> \endhtmlonly
 *
 *  Definition:
 *  ===========
 *
-*       SUBROUTINE DLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
+*       SUBROUTINE DLAORHR_COL_GETRFNP( M, N, A, LDA, D, INFO )
 *
 *       .. Scalar Arguments ..
 *       INTEGER            INFO, LDA, M, N
@@ -33,8 +33,8 @@
 *>
 *> \verbatim
 *>
-*> DLAORHR_GETRFNP computes the modified LU factorization without
-*> pivoting of a general M-by-N matrix A. The factorization has
+*> DLAORHR_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 DORHR. In DORHR, 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 DORHR_COL. In DORHR_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 DLAORHR_GETRFNP2.
+*> this routine calls the recursive routine DLAORHR_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 doubleGEcomputational
 *
@@ -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 DLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
+      SUBROUTINE DLAORHR_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 DLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
       INTEGER            IINFO, J, JB, NB
 *     ..
 *     .. External Subroutines ..
-      EXTERNAL           DGEMM, DLAORHR_GETRFNP2, DTRSM, XERBLA
+      EXTERNAL           DGEMM, DLAORHR_COL_GETRFNP2, DTRSM, XERBLA
 *     ..
 *     .. External Functions ..
       INTEGER            ILAENV
@@ -191,7 +191,7 @@ SUBROUTINE DLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
          INFO = -4
       END IF
       IF( INFO.NE.0 ) THEN
-         CALL XERBLA( 'DLAORHR_GETRFNP', -INFO )
+         CALL XERBLA( 'DLAORHR_COL_GETRFNP', -INFO )
          RETURN
       END IF
 *
@@ -203,13 +203,13 @@ SUBROUTINE DLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
 *     Determine the block size for this environment.
 *
 
-      NB = ILAENV( 1, 'DLAORHR_GETRFNP', ' ', M, N, -1, -1 )
+      NB = ILAENV( 1, 'DLAORHR_COL_GETRFNP', ' ', M, N, -1, -1 )
 
       IF( NB.LE.1 .OR. NB.GE.MIN( M, N ) ) THEN
 *
 *        Use unblocked code.
 *
-         CALL DLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
+         CALL DLAORHR_COL_GETRFNP2( M, N, A, LDA, D, INFO )
       ELSE
 *
 *        Use blocked code.
@@ -219,8 +219,8 @@ SUBROUTINE DLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
 *
 *           Factor diagonal and subdiagonal blocks.
 *
-            CALL DLAORHR_GETRFNP2( M-J+1, JB, A( J, J ), LDA, D( J ),
-     $                             IINFO )
+            CALL DLAORHR_COL_GETRFNP2( M-J+1, JB, A( J, J ), LDA,
+     $                                 D( J ), IINFO )
 *
             IF( J+JB.LE.N ) THEN
 *
@@ -243,6 +243,6 @@ SUBROUTINE DLAORHR_GETRFNP( M, N, A, LDA, D, INFO )
       END IF
       RETURN
 *
-*     End of DLAORHR_GETRFNP
+*     End of DLAORHR_COL_GETRFNP
 *
       END

SRC/dlaorhr_getrfnp2.f renamed to SRC/dlaorhr_col_getrfnp2.f

@@ -1,4 +1,4 @@
-*> \brief \b DLAORHR_GETRFNP2
+*> \brief \b DLAORHR_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/dlaorhr_getrfnp2.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlaorhr_col_getrfnp2.f">
 *> [TGZ]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlaorhr_getrfnp2.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlaorhr_col_getrfnp2.f">
 *> [ZIP]</a>
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlaorhr_getrfnp2.f">
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlaorhr_col_getrfnp2.f">
 *> [TXT]</a>
 *> \endhtmlonly
 *
 *  Definition:
 *  ===========
 *
-*       RECURSIVE SUBROUTINE DLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
+*       RECURSIVE SUBROUTINE DLAORHR_COL_GETRFNP2( M, N, A, LDA, D, INFO )
 *
 *       .. Scalar Arguments ..
 *       INTEGER            INFO, LDA, M, N
@@ -33,8 +33,8 @@
 *>
 *> \verbatim
 *>
-*> DLAORHR_GETRFNP2 computes the modified LU factorization without
-*> pivoting of a general M-by-N matrix A. The factorization has
+*> DLAORHR_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 DORHR. In DORHR, 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 DORHR_COL. In DORHR_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].
 *>
-*> DLAORHR_GETRFNP2 is called to factorize a block by the blocked
-*> routine DLAORHR_GETRFNP, which uses blocked code calling
-*. Level 3 BLAS to update the submatrix. However, DLAORHR_GETRFNP2
-*> is self-sufficient and can be used without DLAORHR_GETRFNP.
+*> DLAORHR_COL_GETRFNP2 is called to factorize a block by the blocked
+*> routine DLAORHR_COL_GETRFNP, which uses blocked code calling
+*. Level 3 BLAS to update the submatrix. However, DLAORHR_COL_GETRFNP2
+*> is self-sufficient and can be used without DLAORHR_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 doubleGEcomputational
 *
@@ -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 DLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
+      RECURSIVE SUBROUTINE DLAORHR_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 DLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
          INFO = -4
       END IF
       IF( INFO.NE.0 ) THEN
-         CALL XERBLA( 'DLAORHR_GETRFNP2', -INFO )
+         CALL XERBLA( 'DLAORHR_COL_GETRFNP2', -INFO )
          RETURN
       END IF
 *
@@ -274,7 +274,7 @@ RECURSIVE SUBROUTINE DLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
 *
 *        Factor B11, recursive call
 *
-         CALL DLAORHR_GETRFNP2( N1, N1, A, LDA, D, IINFO )
+         CALL DLAORHR_COL_GETRFNP2( N1, N1, A, LDA, D, IINFO )
 *
 *        Solve for B21
 *
@@ -294,12 +294,12 @@ RECURSIVE SUBROUTINE DLAORHR_GETRFNP2( M, N, A, LDA, D, INFO )
 *
 *        Factor B22, recursive call
 *
-         CALL DLAORHR_GETRFNP2( M-N1, N2, A( N1+1, N1+1 ), LDA,
-     $                          D( N1+1 ), IINFO )
+         CALL DLAORHR_COL_GETRFNP2( M-N1, N2, A( N1+1, N1+1 ), LDA,
+     $                              D( N1+1 ), IINFO )
 *
       END IF
       RETURN
 *
-*     End of DLAORHR_GETRFNP2
+*     End of DLAORHR_COL_GETRFNP2
 *
       END

SRC/dorhr_col.f

@@ -282,7 +282,8 @@ SUBROUTINE DORHR_COL( M, N, NB, A, LDA, T, LDT, D, INFO )
      $                   NPLUSONE
 *     ..
 *     .. External Subroutines ..
-      EXTERNAL           DCOPY, DLAORHR_GETRFNP, DSCAL, DTRSM, XERBLA
+      EXTERNAL           DCOPY, DLAORHR_COL_GETRFNP, DSCAL, DTRSM,
+     $                   XERBLA
 *     ..
 *     .. Intrinsic Functions ..
       INTRINSIC          MAX, MIN
@@ -330,7 +331,7 @@ SUBROUTINE DORHR_COL( M, N, NB, A, LDA, T, LDT, D, INFO )
 *
 *     (1-1) Factor V1 and U.
 
-      CALL DLAORHR_GETRFNP( N, N, A, LDA, D, IINFO )
+      CALL DLAORHR_COL_GETRFNP( N, N, A, LDA, D, IINFO )
 *
 *     (1-2) Solve for V2.
 *

TESTING/LIN/dchkaa.f

@@ -116,7 +116,7 @@ PROGRAM DCHKAA
 *  -- LAPACK test 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
+*     Novemebr 2019
 *
 *  =====================================================================
 *
@@ -677,7 +677,7 @@ PROGRAM DCHKAA
 *
 *        SK:  symmetric indefinite matrices,
 *             with bounded Bunch-Kaufman (rook) pivoting algorithm,
-*             different matrix storage format than SR path version.
+*             differnet matrix storage format than SR path version.
 *
          NTYPES = 10
          CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
@@ -1023,6 +1023,7 @@ PROGRAM DCHKAA
          END IF
 *
       ELSE
+
 *
          WRITE( NOUT, FMT = 9990 )PATH
       END IF