version 1.8, 2011/07/22 07:38:14
|
version 1.11, 2012/08/22 09:48:30
|
Line 1
|
Line 1
|
|
*> \brief \b ZGELQF |
|
* |
|
* =========== DOCUMENTATION =========== |
|
* |
|
* Online html documentation available at |
|
* http://www.netlib.org/lapack/explore-html/ |
|
* |
|
*> \htmlonly |
|
*> Download ZGELQF + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgelqf.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgelqf.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgelqf.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
|
* |
|
* .. Scalar Arguments .. |
|
* INTEGER INFO, LDA, LWORK, M, N |
|
* .. |
|
* .. Array Arguments .. |
|
* COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) |
|
* .. |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> ZGELQF computes an LQ factorization of a complex M-by-N matrix A: |
|
*> A = L * Q. |
|
*> \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 elements on and below the diagonal of the array |
|
*> contain the m-by-min(m,n) lower trapezoidal matrix L (L is |
|
*> lower triangular if m <= n); the elements above the diagonal, |
|
*> with the array TAU, represent the unitary matrix Q as a |
|
*> product of elementary reflectors (see Further Details). |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDA |
|
*> \verbatim |
|
*> LDA is INTEGER |
|
*> The leading dimension of the array A. LDA >= max(1,M). |
|
*> \endverbatim |
|
*> |
|
*> \param[out] TAU |
|
*> \verbatim |
|
*> TAU is COMPLEX*16 array, dimension (min(M,N)) |
|
*> The scalar factors of the elementary reflectors (see Further |
|
*> Details). |
|
*> \endverbatim |
|
*> |
|
*> \param[out] WORK |
|
*> \verbatim |
|
*> WORK is COMPLEX*16 array, dimension (MAX(1,LWORK)) |
|
*> On exit, if INFO = 0, WORK(1) returns the optimal LWORK. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LWORK |
|
*> \verbatim |
|
*> LWORK is INTEGER |
|
*> The dimension of the array WORK. LWORK >= max(1,M). |
|
*> For optimum performance LWORK >= M*NB, where NB is the |
|
*> optimal blocksize. |
|
*> |
|
*> If LWORK = -1, then a workspace query is assumed; the routine |
|
*> only calculates the optimal size of the WORK array, returns |
|
*> this value as the first entry of the WORK array, and no error |
|
*> message related to LWORK is issued by XERBLA. |
|
*> \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. |
|
* |
|
*> \date November 2011 |
|
* |
|
*> \ingroup complex16GEcomputational |
|
* |
|
*> \par Further Details: |
|
* ===================== |
|
*> |
|
*> \verbatim |
|
*> |
|
*> The matrix Q is represented as a product of elementary reflectors |
|
*> |
|
*> Q = H(k)**H . . . H(2)**H H(1)**H, where k = min(m,n). |
|
*> |
|
*> Each H(i) has the form |
|
*> |
|
*> H(i) = 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; conjg(v(i+1:n)) is stored on exit in |
|
*> A(i,i+1:n), and tau in TAU(i). |
|
*> \endverbatim |
|
*> |
|
* ===================================================================== |
SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
* |
* |
* -- LAPACK routine (version 3.3.1) -- |
* -- LAPACK computational routine (version 3.4.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..-- |
* -- April 2011 -- |
* November 2011 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
INTEGER INFO, LDA, LWORK, M, N |
INTEGER INFO, LDA, LWORK, M, N |
Line 12
|
Line 147
|
COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) |
COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) |
* .. |
* .. |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* ZGELQF computes an LQ factorization of a complex M-by-N matrix A: |
|
* A = L * Q. |
|
* |
|
* 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 elements on and below the diagonal of the array |
|
* contain the m-by-min(m,n) lower trapezoidal matrix L (L is |
|
* lower triangular if m <= n); the elements above the diagonal, |
|
* with the array TAU, represent the unitary matrix Q as a |
|
* product of elementary reflectors (see Further Details). |
|
* |
|
* LDA (input) INTEGER |
|
* The leading dimension of the array A. LDA >= max(1,M). |
|
* |
|
* TAU (output) COMPLEX*16 array, dimension (min(M,N)) |
|
* The scalar factors of the elementary reflectors (see Further |
|
* Details). |
|
* |
|
* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) |
|
* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. |
|
* |
|
* LWORK (input) INTEGER |
|
* The dimension of the array WORK. LWORK >= max(1,M). |
|
* For optimum performance LWORK >= M*NB, where NB is the |
|
* optimal blocksize. |
|
* |
|
* If LWORK = -1, then a workspace query is assumed; the routine |
|
* only calculates the optimal size of the WORK array, returns |
|
* this value as the first entry of the WORK array, and no error |
|
* message related to LWORK is issued by XERBLA. |
|
* |
|
* 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(k)**H . . . H(2)**H H(1)**H, where k = min(m,n). |
|
* |
|
* Each H(i) has the form |
|
* |
|
* H(i) = 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; conjg(v(i+1:n)) is stored on exit in |
|
* A(i,i+1:n), and tau in TAU(i). |
|
* |
|
* ===================================================================== |
* ===================================================================== |
* |
* |
* .. Local Scalars .. |
* .. Local Scalars .. |