Diff for /rpl/lapack/lapack/zgeqr2.f between versions 1.2 and 1.9

version 1.2, 2010/04/21 13:45:29 version 1.9, 2011/07/22 07:38:14
Line 1 Line 1
       SUBROUTINE ZGEQR2( M, N, A, LDA, TAU, WORK, INFO )        SUBROUTINE ZGEQR2( M, N, A, LDA, TAU, WORK, INFO )
 *  *
 *  -- LAPACK routine (version 3.2) --  *  -- LAPACK routine (version 3.3.1) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --  *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--  *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *     November 2006  *  -- April 2011                                                      --
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       INTEGER            INFO, LDA, M, N        INTEGER            INFO, LDA, M, N
Line 57 Line 57
 *  *
 *  Each H(i) has the form  *  Each H(i) has the form
 *  *
 *     H(i) = I - tau * v * v'  *     H(i) = I - tau * v * v**H
 *  *
 *  where tau is a complex scalar, and v is a complex vector with  *  where tau is a complex scalar, and v is a complex vector with
 *  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),  *  v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
Line 74 Line 74
       COMPLEX*16         ALPHA        COMPLEX*16         ALPHA
 *     ..  *     ..
 *     .. External Subroutines ..  *     .. External Subroutines ..
       EXTERNAL           XERBLA, ZLARF, ZLARFP        EXTERNAL           XERBLA, ZLARF, ZLARFG
 *     ..  *     ..
 *     .. Intrinsic Functions ..  *     .. Intrinsic Functions ..
       INTRINSIC          DCONJG, MAX, MIN        INTRINSIC          DCONJG, MAX, MIN
Line 102 Line 102
 *  *
 *        Generate elementary reflector H(i) to annihilate A(i+1:m,i)  *        Generate elementary reflector H(i) to annihilate A(i+1:m,i)
 *  *
          CALL ZLARFP( M-I+1, A( I, I ), A( MIN( I+1, M ), I ), 1,           CALL ZLARFG( M-I+1, A( I, I ), A( MIN( I+1, M ), I ), 1,
      $                TAU( I ) )       $                TAU( I ) )
          IF( I.LT.N ) THEN           IF( I.LT.N ) THEN
 *  *
 *           Apply H(i)' to A(i:m,i+1:n) from the left  *           Apply H(i)**H to A(i:m,i+1:n) from the left
 *  *
             ALPHA = A( I, I )              ALPHA = A( I, I )
             A( I, I ) = ONE              A( I, I ) = ONE

Removed from v.1.2  
changed lines
  Added in v.1.9


CVSweb interface <joel.bertrand@systella.fr>