version 1.9, 2012/12/14 14:22:45
|
version 1.13, 2017/06/17 10:54:10
|
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 ZGEQRFP + dependencies |
*> Download ZGEQRFP + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqrfp.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqrfp.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqrfp.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqrfp.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqrfp.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqrfp.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE ZGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
* SUBROUTINE ZGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* INTEGER INFO, LDA, LWORK, M, N |
* INTEGER INFO, LDA, LWORK, M, N |
* .. |
* .. |
* .. Array Arguments .. |
* .. Array Arguments .. |
* COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) |
* COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 34
|
Line 34
|
*> \verbatim |
*> \verbatim |
*> |
*> |
*> ZGEQRFP computes a QR factorization of a complex M-by-N matrix A: |
*> ZGEQRFP computes a QR factorization of a complex M-by-N matrix A: |
*> A = Q * R. |
*> A = Q * R. The diagonal entries of R are real and nonnegative. |
*> \endverbatim |
*> \endverbatim |
* |
* |
* Arguments: |
* Arguments: |
Line 58
|
Line 58
|
*> On entry, the M-by-N matrix A. |
*> On entry, the M-by-N matrix A. |
*> On exit, the elements on and above the diagonal of the array |
*> On exit, the elements on and above the diagonal of the array |
*> contain the min(M,N)-by-N upper trapezoidal matrix R (R is |
*> contain the min(M,N)-by-N upper trapezoidal matrix R (R is |
*> upper triangular if m >= n); the elements below the diagonal, |
*> upper triangular if m >= n). The diagonal entries of R |
|
*> are real and nonnegative; The elements below the diagonal, |
*> with the array TAU, represent the unitary matrix Q as a |
*> with the array TAU, represent the unitary matrix Q as a |
*> product of min(m,n) elementary reflectors (see Further |
*> product of min(m,n) elementary reflectors (see Further |
*> Details). |
*> Details). |
Line 106
|
Line 107
|
* 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 November 2011 |
*> \date December 2016 |
* |
* |
*> \ingroup complex16GEcomputational |
*> \ingroup complex16GEcomputational |
* |
* |
Line 131
|
Line 132
|
*> 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), |
*> and tau in TAU(i). |
*> and tau in TAU(i). |
|
*> |
|
*> See Lapack Working Note 203 for details |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
* ===================================================================== |
* ===================================================================== |
SUBROUTINE ZGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
SUBROUTINE ZGEQRFP( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.4.0) -- |
* -- LAPACK computational routine (version 3.7.0) -- |
* -- 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 2011 |
* December 2016 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
INTEGER INFO, LDA, LWORK, M, N |
INTEGER INFO, LDA, LWORK, M, N |