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

Diff for /rpl/lapack/lapack/zgelqt3.f between versions 1.4 and 1.5

version 1.4, 2018/05/29 07:18:14 version 1.5, 2023/08/07 08:39:17
Line 6 Line 6
 *            http://www.netlib.org/lapack/explore-html/  *            http://www.netlib.org/lapack/explore-html/
 *  *
 *> \htmlonly  *> \htmlonly
 *> Download DGEQRT3 + dependencies  *> Download ZGELQT3 + dependencies
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgelqt3.f">  *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgelqt3.f">
 *> [TGZ]</a>  *> [TGZ]</a>
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgelqt3.f">  *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgelqt3.f">
Line 33 Line 33
 *>  *>
 *> \verbatim  *> \verbatim
 *>  *>
 *> DGELQT3 recursively computes a LQ factorization of a complex M-by-N  *> ZGELQT3 recursively computes a LQ factorization of a complex M-by-N
 *> matrix A, using the compact WY representation of Q.  *> 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,
Line 58 Line 58
 *> \param[in,out] A  *> \param[in,out] A
 *> \verbatim  *> \verbatim
 *>          A is COMPLEX*16 array, dimension (LDA,N)  *>          A is COMPLEX*16 array, dimension (LDA,N)
 *>          On entry, the real M-by-N matrix A.  On exit, the elements on and  *>          On entry, the complex M-by-N matrix A.  On exit, the elements on and
 *>          below the diagonal contain the N-by-N lower triangular matrix L; the  *>          below the diagonal contain the N-by-N lower triangular matrix L; the
 *>          elements above the diagonal are the rows of V.  See below for  *>          elements above the diagonal are the rows of V.  See below for
 *>          further details.  *>          further details.
Line 100 Line 100
 *> \author Univ. of Colorado Denver  *> \author Univ. of Colorado Denver
 *> \author NAG Ltd.  *> \author NAG Ltd.
 *  *
 *> \date November 2017  
 *  
 *> \ingroup doubleGEcomputational  *> \ingroup doubleGEcomputational
 *  *
 *> \par Further Details:  *> \par Further Details:
Line 131 Line 129
 *  =====================================================================  *  =====================================================================
       RECURSIVE SUBROUTINE ZGELQT3( M, N, A, LDA, T, LDT, INFO )        RECURSIVE SUBROUTINE ZGELQT3( M, N, A, LDA, T, LDT, INFO )
 *  *
 *  -- LAPACK computational routine (version 3.8.0) --  *  -- 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..--
 *     November 2017  
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       INTEGER   INFO, LDA, M, N, LDT        INTEGER   INFO, LDA, M, N, LDT
Line 175 Line 172
 *  *
       IF( M.EQ.1 ) THEN        IF( M.EQ.1 ) THEN
 *  *
 *        Compute Householder transform when N=1  *        Compute Householder transform when M=1
 *  *
          CALL ZLARFG( N, A, A( 1, MIN( 2, N ) ), LDA, T )           CALL ZLARFG( N, A, A( 1, MIN( 2, N ) ), LDA, T )
          T(1,1)=CONJG(T(1,1))           T(1,1)=CONJG(T(1,1))
Removed from v.1.4  
changed lines
  Added in v.1.5

CVSweb interface <joel.bertrand@systella.fr>