--- rpl/lapack/lapack/dgeqrt3.f 2016/08/27 15:34:22 1.7 +++ rpl/lapack/lapack/dgeqrt3.f 2017/06/17 10:53:48 1.8 @@ -2,41 +2,41 @@ * * =========== 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 DGEQRT3 + dependencies -*> -*> [TGZ] -*> -*> [ZIP] -*> +*> Download DGEQRT3 + dependencies +*> +*> [TGZ] +*> +*> [ZIP] +*> *> [TXT] -*> \endhtmlonly +*> \endhtmlonly * * Definition: * =========== * * RECURSIVE SUBROUTINE DGEQRT3( M, N, A, LDA, T, LDT, INFO ) -* +* * .. Scalar Arguments .. * INTEGER INFO, LDA, M, N, LDT * .. * .. Array Arguments .. * DOUBLE PRECISION A( LDA, * ), T( LDT, * ) * .. -* +* * *> \par Purpose: * ============= *> *> \verbatim *> -*> DGEQRT3 recursively computes a QR factorization of a real M-by-N -*> matrix A, using the compact WY representation of Q. +*> DGEQRT3 recursively computes a QR factorization of a real M-by-N +*> matrix A, using the compact WY representation of Q. *> -*> Based on the algorithm of Elmroth and Gustavson, +*> Based on the algorithm of Elmroth and Gustavson, *> IBM J. Res. Develop. Vol 44 No. 4 July 2000. *> \endverbatim * @@ -95,10 +95,10 @@ * 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 June 2016 * @@ -132,7 +132,7 @@ * ===================================================================== RECURSIVE SUBROUTINE DGEQRT3( M, N, A, LDA, T, LDT, INFO ) * -* -- LAPACK computational routine (version 3.6.1) -- +* -- LAPACK computational 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..-- * June 2016 @@ -178,7 +178,7 @@ * Compute Householder transform when N=1 * CALL DLARFG( M, A(1,1), A( MIN( 2, M ), 1 ), 1, T(1,1) ) -* +* ELSE * * Otherwise, split A into blocks... @@ -199,7 +199,7 @@ T( I, J+N1 ) = A( I, J+N1 ) END DO END DO - CALL DTRMM( 'L', 'L', 'T', 'U', N1, N2, ONE, + CALL DTRMM( 'L', 'L', 'T', 'U', N1, N2, ONE, & A, LDA, T( 1, J1 ), LDT ) * CALL DGEMM( 'T', 'N', N1, N2, M-N1, ONE, A( J1, 1 ), LDA, @@ -208,7 +208,7 @@ CALL DTRMM( 'L', 'U', 'T', 'N', N1, N2, ONE, & T, LDT, T( 1, J1 ), LDT ) * - CALL DGEMM( 'N', 'N', M-N1, N2, N1, -ONE, A( J1, 1 ), LDA, + CALL DGEMM( 'N', 'N', M-N1, N2, N1, -ONE, A( J1, 1 ), LDA, & T( 1, J1 ), LDT, ONE, A( J1, J1 ), LDA ) * CALL DTRMM( 'L', 'L', 'N', 'U', N1, N2, ONE, @@ -222,7 +222,7 @@ * * Compute A(J1:M,J1:N) <- (Y2,R2,T2) where Q2 = I - Y2 T2 Y2^H * - CALL DGEQRT3( M-N1, N2, A( J1, J1 ), LDA, + CALL DGEQRT3( M-N1, N2, A( J1, J1 ), LDA, & T( J1, J1 ), LDT, IINFO ) * * Compute T3 = T(1:N1,J1:N) = -T1 Y1^H Y2 T2 @@ -236,13 +236,13 @@ CALL DTRMM( 'R', 'L', 'N', 'U', N1, N2, ONE, & A( J1, J1 ), LDA, T( 1, J1 ), LDT ) * - CALL DGEMM( 'T', 'N', N1, N2, M-N, ONE, A( I1, 1 ), LDA, + CALL DGEMM( 'T', 'N', N1, N2, M-N, ONE, A( I1, 1 ), LDA, & A( I1, J1 ), LDA, ONE, T( 1, J1 ), LDT ) * - CALL DTRMM( 'L', 'U', 'N', 'N', N1, N2, -ONE, T, LDT, + CALL DTRMM( 'L', 'U', 'N', 'N', N1, N2, -ONE, T, LDT, & T( 1, J1 ), LDT ) * - CALL DTRMM( 'R', 'U', 'N', 'N', N1, N2, ONE, + CALL DTRMM( 'R', 'U', 'N', 'N', N1, N2, ONE, & T( J1, J1 ), LDT, T( 1, J1 ), LDT ) * * Y = (Y1,Y2); R = [ R1 A(1:N1,J1:N) ]; T = [T1 T3]