make sure no variable in indefined

Fix some minors issue: extra space, variable names.

1 files changed, 18 insertions, 18 deletions

diff --git a/SRC/cgelqt3.f b/SRC/cgelqt3.f
index 98dbfc63..1dc4c633 100644
--- a/SRC/cgelqt3.f
+++ b/SRC/cgelqt3.f
@@ -2,24 +2,24 @@
 *  ===========
 *
 *       RECURSIVE SUBROUTINE CGELQT3( M, N, A, LDA, T, LDT, INFO )
-* 
+*
 *       .. Scalar Arguments ..
 *       INTEGER   INFO, LDA, M, N, LDT
 *       ..
 *       .. Array Arguments ..
 *       COMPLEX   A( LDA, * ), T( LDT, * )
 *       ..
-*  
+*
 *
 *> \par Purpose:
 *  =============
 *>
 *> \verbatim
 *>
-*> CGELQT3 recursively computes a LQ factorization of a complex M-by-N 
-*> matrix A, using the compact WY representation of Q. 
+*> CGELQT3 recursively computes a LQ factorization of a complex 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
 *
@@ -78,10 +78,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 September 2012
 *
@@ -98,7 +98,7 @@
 *>               V = (  1  v1 v1 v1 v1 )
 *>                   (     1  v2 v2 v2 )
 *>                   (     1  v3 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.  The
@@ -134,7 +134,7 @@
       PARAMETER ( ZERO = (0.0E+00,0.0E+00))
 *     ..
 *     .. Local Scalars ..
-      INTEGER   I, I1, J, J1, N1, N2, IINFO
+      INTEGER   I, I1, J, J1, M1, M2, N1, N2, IINFO
 *     ..
 *     .. External Subroutines ..
       EXTERNAL  CLARFG, CTRMM, CGEMM, XERBLA
@@ -162,7 +162,7 @@
 *
          CALL CLARFG( N, A, A( 1, MIN( 2, N ) ), LDA, T )
          T(1,1)=CONJG(T(1,1))
-*         
+*
       ELSE
 *
 *        Otherwise, split A into blocks...
@@ -183,7 +183,7 @@
                T(  I+M1, J ) = A( I+M1, J )
             END DO
          END DO
-         CALL CTRMM( 'R', 'U', 'C', 'U', M2, M1, ONE, 
+         CALL CTRMM( 'R', 'U', 'C', 'U', M2, M1, ONE,
      &               A, LDA, T( I1, 1 ), LDT )
 *
          CALL CGEMM( 'N', 'C', M2, M1, N-M1, ONE, A( I1, I1 ), LDA,
@@ -192,7 +192,7 @@
          CALL CTRMM( 'R', 'U', 'N', 'N', M2, M1, ONE,
      &               T, LDT, T( I1, 1 ), LDT )
 *
-         CALL CGEMM( 'N', 'N', M2, N-M1, M1, -ONE, T( I1, 1 ), LDT,  
+         CALL CGEMM( 'N', 'N', M2, N-M1, M1, -ONE, T( I1, 1 ), LDT,
      &                A( 1, I1 ), LDA, ONE, A( I1, I1 ), LDA )
 *
          CALL CTRMM( 'R', 'U', 'N', 'U', M2, M1 , ONE,
@@ -207,7 +207,7 @@
 *
 *        Compute A(J1:M,J1:N) <- (Y2,R2,T2) where Q2 = I - Y2 T2 Y2^H
 *
-         CALL CGELQT3( M2, N-M1, A( I1, I1 ), LDA, 
+         CALL CGELQT3( M2, N-M1, A( I1, I1 ), LDA,
      &                T( I1, I1 ), LDT, IINFO )
 *
 *        Compute T3 = T(J1:N1,1:N) = -T1 Y1^H Y2 T2
@@ -224,13 +224,13 @@
          CALL CGEMM( 'N', 'C', M1, M2, N-M, ONE, A( 1, J1 ), LDA,
      &               A( I1, J1 ), LDA, ONE, T( 1, I1 ), LDT )
 *
-         CALL CTRMM( 'L', 'U', 'N', 'N', M1, M2, -ONE, T, LDT, 
+         CALL CTRMM( 'L', 'U', 'N', 'N', M1, M2, -ONE, T, LDT,
      &               T( 1, I1 ), LDT )
 *
-         CALL CTRMM( 'R', 'U', 'N', 'N', M1, M2, ONE, 
+         CALL CTRMM( 'R', 'U', 'N', 'N', M1, M2, ONE,
      &               T( I1, I1 ), LDT, T( 1, I1 ), LDT )
 *
-*         
+*
 *
 *        Y = (Y1,Y2); L = [ L1            0  ];  T = [T1 T3]
 *                         [ A(1:N1,J1:N)  L2 ]       [ 0 T2]