[BACK]Return to zgebd2.f CVS log [TXT] [DIR] Up to [local] / rpl / lapack / lapack

Diff for /rpl/lapack/lapack/zgebd2.f between versions 1.15 and 1.20

version 1.15, 2016/08/27 15:34:44 version 1.20, 2023/08/07 08:39:16
Line 2 Line 2
 *  *
 *  =========== DOCUMENTATION ===========  *  =========== DOCUMENTATION ===========
 *  *
 * Online html documentation available at   * Online html documentation available at
 *            http://www.netlib.org/lapack/explore-html/   *            http://www.netlib.org/lapack/explore-html/
 *  *
 *> \htmlonly  *> \htmlonly
 *> Download ZGEBD2 + dependencies   *> Download ZGEBD2 + dependencies
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgebd2.f">   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgebd2.f">
 *> [TGZ]</a>   *> [TGZ]</a>
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgebd2.f">   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgebd2.f">
 *> [ZIP]</a>   *> [ZIP]</a>
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgebd2.f">   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgebd2.f">
 *> [TXT]</a>  *> [TXT]</a>
 *> \endhtmlonly   *> \endhtmlonly
 *  *
 *  Definition:  *  Definition:
 *  ===========  *  ===========
 *  *
 *       SUBROUTINE ZGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )  *       SUBROUTINE ZGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )
 *   *
 *       .. Scalar Arguments ..  *       .. Scalar Arguments ..
 *       INTEGER            INFO, LDA, M, N  *       INTEGER            INFO, LDA, M, N
 *       ..  *       ..
Line 27 Line 27
 *       DOUBLE PRECISION   D( * ), E( * )  *       DOUBLE PRECISION   D( * ), E( * )
 *       COMPLEX*16         A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * )  *       COMPLEX*16         A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * )
 *       ..  *       ..
 *    *
 *  *
 *> \par Purpose:  *> \par Purpose:
 *  =============  *  =============
Line 100 Line 100
 *>  *>
 *> \param[out] TAUQ  *> \param[out] TAUQ
 *> \verbatim  *> \verbatim
 *>          TAUQ is COMPLEX*16 array dimension (min(M,N))  *>          TAUQ is COMPLEX*16 array, dimension (min(M,N))
 *>          The scalar factors of the elementary reflectors which  *>          The scalar factors of the elementary reflectors which
 *>          represent the unitary matrix Q. See Further Details.  *>          represent the unitary matrix Q. See Further Details.
 *> \endverbatim  *> \endverbatim
Line 127 Line 127
 *  Authors:  *  Authors:
 *  ========  *  ========
 *  *
 *> \author Univ. of Tennessee   *> \author Univ. of Tennessee
 *> \author Univ. of California Berkeley   *> \author Univ. of California Berkeley
 *> \author Univ. of Colorado Denver   *> \author Univ. of Colorado Denver
 *> \author NAG Ltd.   *> \author NAG Ltd.
 *  
 *> \date September 2012  
 *  *
 *> \ingroup complex16GEcomputational  *> \ingroup complex16GEcomputational
 *  *
Line 189 Line 187
 *  =====================================================================  *  =====================================================================
       SUBROUTINE ZGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )        SUBROUTINE ZGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO )
 *  *
 *  -- LAPACK computational routine (version 3.4.2) --  *  -- LAPACK computational routine --
 *  -- 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..--
 *     September 2012  
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       INTEGER            INFO, LDA, M, N        INTEGER            INFO, LDA, M, N
Line 247 Line 244
             ALPHA = A( I, I )              ALPHA = A( I, I )
             CALL ZLARFG( M-I+1, ALPHA, A( MIN( I+1, M ), I ), 1,              CALL ZLARFG( M-I+1, ALPHA, A( MIN( I+1, M ), I ), 1,
      $                   TAUQ( I ) )       $                   TAUQ( I ) )
             D( I ) = ALPHA              D( I ) = DBLE( ALPHA )
             A( I, I ) = ONE              A( I, I ) = ONE
 *  *
 *           Apply H(i)**H to A(i:m,i+1:n) from the left  *           Apply H(i)**H to A(i:m,i+1:n) from the left
Line 266 Line 263
                ALPHA = A( I, I+1 )                 ALPHA = A( I, I+1 )
                CALL ZLARFG( N-I, ALPHA, A( I, MIN( I+2, N ) ), LDA,                 CALL ZLARFG( N-I, ALPHA, A( I, MIN( I+2, N ) ), LDA,
      $                      TAUP( I ) )       $                      TAUP( I ) )
                E( I ) = ALPHA                 E( I ) = DBLE( ALPHA )
                A( I, I+1 ) = ONE                 A( I, I+1 ) = ONE
 *  *
 *              Apply G(i) to A(i+1:m,i+1:n) from the right  *              Apply G(i) to A(i+1:m,i+1:n) from the right
Line 291 Line 288
             ALPHA = A( I, I )              ALPHA = A( I, I )
             CALL ZLARFG( N-I+1, ALPHA, A( I, MIN( I+1, N ) ), LDA,              CALL ZLARFG( N-I+1, ALPHA, A( I, MIN( I+1, N ) ), LDA,
      $                   TAUP( I ) )       $                   TAUP( I ) )
             D( I ) = ALPHA              D( I ) = DBLE( ALPHA )
             A( I, I ) = ONE              A( I, I ) = ONE
 *  *
 *           Apply G(i) to A(i+1:m,i:n) from the right  *           Apply G(i) to A(i+1:m,i:n) from the right
Line 310 Line 307
                ALPHA = A( I+1, I )                 ALPHA = A( I+1, I )
                CALL ZLARFG( M-I, ALPHA, A( MIN( I+2, M ), I ), 1,                 CALL ZLARFG( M-I, ALPHA, A( MIN( I+2, M ), I ), 1,
      $                      TAUQ( I ) )       $                      TAUQ( I ) )
                E( I ) = ALPHA                 E( I ) = DBLE( ALPHA )
                A( I+1, I ) = ONE                 A( I+1, I ) = ONE
 *  *
 *              Apply H(i)**H to A(i+1:m,i+1:n) from the left  *              Apply H(i)**H to A(i+1:m,i+1:n) from the left
Removed from v.1.15  
changed lines
  Added in v.1.20

CVSweb interface <joel.bertrand@systella.fr>