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

Diff for /rpl/lapack/lapack/zgeqpf.f between versions 1.2 and 1.19

version 1.2, 2010/04/21 13:45:29 version 1.19, 2023/08/07 08:39:18
Line 1 Line 1
   *> \brief \b ZGEQPF
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at
   *            http://www.netlib.org/lapack/explore-html/
   *
   *> \htmlonly
   *> Download ZGEQPF + dependencies
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqpf.f">
   *> [TGZ]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqpf.f">
   *> [ZIP]</a>
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqpf.f">
   *> [TXT]</a>
   *> \endhtmlonly
   *
   *  Definition:
   *  ===========
   *
   *       SUBROUTINE ZGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO )
   *
   *       .. Scalar Arguments ..
   *       INTEGER            INFO, LDA, M, N
   *       ..
   *       .. Array Arguments ..
   *       INTEGER            JPVT( * )
   *       DOUBLE PRECISION   RWORK( * )
   *       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
   *       ..
   *
   *
   *> \par Purpose:
   *  =============
   *>
   *> \verbatim
   *>
   *> This routine is deprecated and has been replaced by routine ZGEQP3.
   *>
   *> ZGEQPF computes a QR factorization with column pivoting of a
   *> complex M-by-N matrix A: A*P = Q*R.
   *> \endverbatim
   *
   *  Arguments:
   *  ==========
   *
   *> \param[in] M
   *> \verbatim
   *>          M is INTEGER
   *>          The number of rows of the matrix A. M >= 0.
   *> \endverbatim
   *>
   *> \param[in] N
   *> \verbatim
   *>          N is INTEGER
   *>          The number of columns of the matrix A. N >= 0
   *> \endverbatim
   *>
   *> \param[in,out] A
   *> \verbatim
   *>          A is COMPLEX*16 array, dimension (LDA,N)
   *>          On entry, the M-by-N matrix A.
   *>          On exit, the upper triangle of the array contains the
   *>          min(M,N)-by-N upper triangular matrix R; the elements
   *>          below the diagonal, together with the array TAU,
   *>          represent the unitary matrix Q as a product of
   *>          min(m,n) elementary reflectors.
   *> \endverbatim
   *>
   *> \param[in] LDA
   *> \verbatim
   *>          LDA is INTEGER
   *>          The leading dimension of the array A. LDA >= max(1,M).
   *> \endverbatim
   *>
   *> \param[in,out] JPVT
   *> \verbatim
   *>          JPVT is INTEGER array, dimension (N)
   *>          On entry, if JPVT(i) .ne. 0, the i-th column of A is permuted
   *>          to the front of A*P (a leading column); if JPVT(i) = 0,
   *>          the i-th column of A is a free column.
   *>          On exit, if JPVT(i) = k, then the i-th column of A*P
   *>          was the k-th column of A.
   *> \endverbatim
   *>
   *> \param[out] TAU
   *> \verbatim
   *>          TAU is COMPLEX*16 array, dimension (min(M,N))
   *>          The scalar factors of the elementary reflectors.
   *> \endverbatim
   *>
   *> \param[out] WORK
   *> \verbatim
   *>          WORK is COMPLEX*16 array, dimension (N)
   *> \endverbatim
   *>
   *> \param[out] RWORK
   *> \verbatim
   *>          RWORK is DOUBLE PRECISION array, dimension (2*N)
   *> \endverbatim
   *>
   *> \param[out] INFO
   *> \verbatim
   *>          INFO is INTEGER
   *>          = 0:  successful exit
   *>          < 0:  if INFO = -i, the i-th argument had an illegal value
   *> \endverbatim
   *
   *  Authors:
   *  ========
   *
   *> \author Univ. of Tennessee
   *> \author Univ. of California Berkeley
   *> \author Univ. of Colorado Denver
   *> \author NAG Ltd.
   *
   *> \ingroup complex16GEcomputational
   *
   *> \par Further Details:
   *  =====================
   *>
   *> \verbatim
   *>
   *>  The matrix Q is represented as a product of elementary reflectors
   *>
   *>     Q = H(1) H(2) . . . H(n)
   *>
   *>  Each H(i) has the form
   *>
   *>     H = I - tau * v * v**H
   *>
   *>  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).
   *>
   *>  The matrix P is represented in jpvt as follows: If
   *>     jpvt(j) = i
   *>  then the jth column of P is the ith canonical unit vector.
   *>
   *>  Partial column norm updating strategy modified by
   *>    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,
   *>    University of Zagreb, Croatia.
   *>  -- April 2011                                                      --
   *>  For more details see LAPACK Working Note 176.
   *> \endverbatim
   *>
   *  =====================================================================
       SUBROUTINE ZGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO )        SUBROUTINE ZGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO )
 *  *
 *  -- LAPACK deprecated driver routine (version 3.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..--
 *     November 2006  
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       INTEGER            INFO, LDA, M, N        INTEGER            INFO, LDA, M, N
Line 14 Line 159
       COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )        COMPLEX*16         A( LDA, * ), TAU( * ), WORK( * )
 *     ..  *     ..
 *  *
 *  Purpose  
 *  =======  
 *  
 *  This routine is deprecated and has been replaced by routine ZGEQP3.  
 *  
 *  ZGEQPF computes a QR factorization with column pivoting of a  
 *  complex M-by-N matrix A: A*P = Q*R.  
 *  
 *  Arguments  
 *  =========  
 *  
 *  M       (input) INTEGER  
 *          The number of rows of the matrix A. M >= 0.  
 *  
 *  N       (input) INTEGER  
 *          The number of columns of the matrix A. N >= 0  
 *  
 *  A       (input/output) COMPLEX*16 array, dimension (LDA,N)  
 *          On entry, the M-by-N matrix A.  
 *          On exit, the upper triangle of the array contains the  
 *          min(M,N)-by-N upper triangular matrix R; the elements  
 *          below the diagonal, together with the array TAU,  
 *          represent the unitary matrix Q as a product of  
 *          min(m,n) elementary reflectors.  
 *  
 *  LDA     (input) INTEGER  
 *          The leading dimension of the array A. LDA >= max(1,M).  
 *  
 *  JPVT    (input/output) INTEGER array, dimension (N)  
 *          On entry, if JPVT(i) .ne. 0, the i-th column of A is permuted  
 *          to the front of A*P (a leading column); if JPVT(i) = 0,  
 *          the i-th column of A is a free column.  
 *          On exit, if JPVT(i) = k, then the i-th column of A*P  
 *          was the k-th column of A.  
 *  
 *  TAU     (output) COMPLEX*16 array, dimension (min(M,N))  
 *          The scalar factors of the elementary reflectors.  
 *  
 *  WORK    (workspace) COMPLEX*16 array, dimension (N)  
 *  
 *  RWORK   (workspace) DOUBLE PRECISION array, dimension (2*N)  
 *  
 *  INFO    (output) INTEGER  
 *          = 0:  successful exit  
 *          < 0:  if INFO = -i, the i-th argument had an illegal value  
 *  
 *  Further Details  
 *  ===============  
 *  
 *  The matrix Q is represented as a product of elementary reflectors  
 *  
 *     Q = H(1) H(2) . . . H(n)  
 *  
 *  Each H(i) has the form  
 *  
 *     H = I - tau * v * v'  
 *  
 *  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).  
 *  
 *  The matrix P is represented in jpvt as follows: If  
 *     jpvt(j) = i  
 *  then the jth column of P is the ith canonical unit vector.  
 *  
 *  Partial column norm updating strategy modified by  
 *    Z. Drmac and Z. Bujanovic, Dept. of Mathematics,  
 *    University of Zagreb, Croatia.  
 *    June 2006.  
 *  For more details see LAPACK Working Note 176.  
 *  
 *  =====================================================================  *  =====================================================================
 *  *
 *     .. Parameters ..  *     .. Parameters ..
Line 96 Line 171
       COMPLEX*16         AII        COMPLEX*16         AII
 *     ..  *     ..
 *     .. External Subroutines ..  *     .. External Subroutines ..
       EXTERNAL           XERBLA, ZGEQR2, ZLARF, ZLARFP, ZSWAP, ZUNM2R        EXTERNAL           XERBLA, ZGEQR2, ZLARF, ZLARFG, ZSWAP, ZUNM2R
 *     ..  *     ..
 *     .. Intrinsic Functions ..  *     .. Intrinsic Functions ..
       INTRINSIC          ABS, DCMPLX, DCONJG, MAX, MIN, SQRT        INTRINSIC          ABS, DCMPLX, DCONJG, MAX, MIN, SQRT
Line 186 Line 261
 *           Generate elementary reflector H(i)  *           Generate elementary reflector H(i)
 *  *
             AII = A( I, I )              AII = A( I, I )
             CALL ZLARFP( M-I+1, AII, A( MIN( I+1, M ), I ), 1,              CALL ZLARFG( M-I+1, AII, A( MIN( I+1, M ), I ), 1,
      $                   TAU( I ) )       $                   TAU( I ) )
             A( I, I ) = AII              A( I, I ) = AII
 *  *
Line 208 Line 283
 *  *
 *                 NOTE: The following 4 lines follow from the analysis in  *                 NOTE: The following 4 lines follow from the analysis in
 *                 Lapack Working Note 176.  *                 Lapack Working Note 176.
 *                   *
                   TEMP = ABS( A( I, J ) ) / RWORK( J )                    TEMP = ABS( A( I, J ) ) / RWORK( J )
                   TEMP = MAX( ZERO, ( ONE+TEMP )*( ONE-TEMP ) )                    TEMP = MAX( ZERO, ( ONE+TEMP )*( ONE-TEMP ) )
                   TEMP2 = TEMP*( RWORK( J ) / RWORK( N+J ) )**2                    TEMP2 = TEMP*( RWORK( J ) / RWORK( N+J ) )**2
                   IF( TEMP2 .LE. TOL3Z ) THEN                     IF( TEMP2 .LE. TOL3Z ) THEN
                      IF( M-I.GT.0 ) THEN                       IF( M-I.GT.0 ) THEN
                         RWORK( J ) = DZNRM2( M-I, A( I+1, J ), 1 )                          RWORK( J ) = DZNRM2( M-I, A( I+1, J ), 1 )
                         RWORK( N+J ) = RWORK( J )                          RWORK( N+J ) = RWORK( J )
Removed from v.1.2  
changed lines
  Added in v.1.19

CVSweb interface <joel.bertrand@systella.fr>