diff options
author | Julien Langou <julien.langou@ucdenver.edu> | 2016-11-03 08:48:54 +0100 |
---|---|---|
committer | Julien Langou <julien.langou@ucdenver.edu> | 2016-11-03 08:48:54 +0100 |
commit | bbff7393714b29a6ff70e8c1565784cb16a0e746 (patch) | |
tree | 146d4bc89db9148abc4b19e2e453623f1a6c7bbe /SRC/sgelqt.f | |
parent | bd47060bcb3a470520622de69ac1426ca4186f5e (diff) | |
download | lapack-bbff7393714b29a6ff70e8c1565784cb16a0e746.tar.gz lapack-bbff7393714b29a6ff70e8c1565784cb16a0e746.tar.bz2 lapack-bbff7393714b29a6ff70e8c1565784cb16a0e746.zip |
Lots of trailing whitespaces in the files of Syd. Cleaning this. No big deal.
Diffstat (limited to 'SRC/sgelqt.f')
-rw-r--r-- | SRC/sgelqt.f | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/SRC/sgelqt.f b/SRC/sgelqt.f index 6b037811..5c391704 100644 --- a/SRC/sgelqt.f +++ b/SRC/sgelqt.f @@ -2,14 +2,14 @@ * =========== * * SUBROUTINE SGELQT( M, N, MB, A, LDA, T, LDT, WORK, INFO ) -* +* * .. Scalar Arguments .. * INTEGER INFO, LDA, LDT, M, N, MB * .. * .. Array Arguments .. * REAL A( LDA, * ), T( LDT, * ), WORK( * ) * .. -* +* * *> \par Purpose: * ============= @@ -17,7 +17,7 @@ *> \verbatim *> *> DGELQT computes a blocked LQ factorization of a real M-by-N matrix A -*> using the compact WY representation of Q. +*> using the compact WY representation of Q. *> \endverbatim * * Arguments: @@ -86,10 +86,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 November 2013 * @@ -106,14 +106,14 @@ *> V = ( 1 v1 v1 v1 v1 ) *> ( 1 v2 v2 v2 ) *> ( 1 v3 v3 ) -*> +*> *> *> where the vi's represent the vectors which define H(i), which are returned -*> in the matrix A. The 1's along the diagonal of V are not stored in A. +*> in the matrix A. The 1's along the diagonal of V are not stored in A. *> Let K=MIN(M,N). The number of blocks is B = ceiling(K/NB), where each -*> block is of order NB except for the last block, which is of order +*> block is of order NB except for the last block, which is of order *> IB = K - (B-1)*NB. For each of the B blocks, a upper triangular block -*> reflector factor is computed: T1, T2, ..., TB. The NB-by-NB (and IB-by-IB +*> reflector factor is computed: T1, T2, ..., TB. The NB-by-NB (and IB-by-IB *> for the last block) T's are stored in the NB-by-N matrix T as *> *> T = (T1 T2 ... TB). @@ -173,21 +173,21 @@ * DO I = 1, K, MB IB = MIN( K-I+1, MB ) -* +* * Compute the LQ factorization of the current block A(I:M,I:I+IB-1) -* +* CALL SGELQT3( IB, N-I+1, A(I,I), LDA, T(1,I), LDT, IINFO ) IF( I+IB.LE.M ) THEN * * Update by applying H**T to A(I:M,I+IB:N) from the right * CALL SLARFB( 'R', 'N', 'F', 'R', M-I-IB+1, N-I+1, IB, - $ A( I, I ), LDA, T( 1, I ), LDT, + $ A( I, I ), LDA, T( 1, I ), LDT, $ A( I+IB, I ), LDA, WORK , M-I-IB+1 ) END IF END DO RETURN -* +* * End of SGELQT * END |