version 1.12, 2012/12/14 14:22:45
|
version 1.19, 2023/08/07 08:39:19
|
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 ZGEQRF + dependencies |
*> Download ZGEQRF + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqrf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zgeqrf.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqrf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zgeqrf.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqrf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zgeqrf.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
* SUBROUTINE ZGEQRF( 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 |
*> |
*> |
*> ZGEQRF computes a QR factorization of a complex M-by-N matrix A: |
*> ZGEQRF computes a QR factorization of a complex M-by-N matrix A: |
*> A = Q * R. |
*> |
|
*> A = Q * ( R ), |
|
*> ( 0 ) |
|
*> |
|
*> where: |
|
*> |
|
*> Q is a M-by-M orthogonal matrix; |
|
*> R is an upper-triangular N-by-N matrix; |
|
*> 0 is a (M-N)-by-N zero matrix, if M > N. |
|
*> |
*> \endverbatim |
*> \endverbatim |
* |
* |
* Arguments: |
* Arguments: |
Line 86
|
Line 95
|
*> \param[in] LWORK |
*> \param[in] LWORK |
*> \verbatim |
*> \verbatim |
*> LWORK is INTEGER |
*> LWORK is INTEGER |
*> The dimension of the array WORK. LWORK >= max(1,N). |
*> The dimension of the array WORK. |
|
*> LWORK >= 1, if MIN(M,N) = 0, and LWORK >= N, otherwise. |
*> For optimum performance LWORK >= N*NB, where NB is |
*> For optimum performance LWORK >= N*NB, where NB is |
*> the optimal blocksize. |
*> the optimal blocksize. |
*> |
*> |
Line 106
|
Line 116
|
* 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 |
|
* |
* |
*> \ingroup complex16GEcomputational |
*> \ingroup complex16GEcomputational |
* |
* |
Line 136
|
Line 144
|
* ===================================================================== |
* ===================================================================== |
SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.4.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 2011 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
INTEGER INFO, LDA, LWORK, M, N |
INTEGER INFO, LDA, LWORK, M, N |
Line 169
|
Line 176
|
* |
* |
* Test the input arguments |
* Test the input arguments |
* |
* |
|
K = MIN( M, N ) |
INFO = 0 |
INFO = 0 |
NB = ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) |
NB = ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) |
LWKOPT = N*NB |
|
WORK( 1 ) = LWKOPT |
|
LQUERY = ( LWORK.EQ.-1 ) |
LQUERY = ( LWORK.EQ.-1 ) |
IF( M.LT.0 ) THEN |
IF( M.LT.0 ) THEN |
INFO = -1 |
INFO = -1 |
Line 180
|
Line 186
|
INFO = -2 |
INFO = -2 |
ELSE IF( LDA.LT.MAX( 1, M ) ) THEN |
ELSE IF( LDA.LT.MAX( 1, M ) ) THEN |
INFO = -4 |
INFO = -4 |
ELSE IF( LWORK.LT.MAX( 1, N ) .AND. .NOT.LQUERY ) THEN |
ELSE IF( .NOT.LQUERY ) THEN |
INFO = -7 |
IF( LWORK.LE.0 .OR. ( M.GT.0 .AND. LWORK.LT.MAX( 1, N ) ) ) |
|
$ INFO = -7 |
END IF |
END IF |
IF( INFO.NE.0 ) THEN |
IF( INFO.NE.0 ) THEN |
CALL XERBLA( 'ZGEQRF', -INFO ) |
CALL XERBLA( 'ZGEQRF', -INFO ) |
RETURN |
RETURN |
ELSE IF( LQUERY ) THEN |
ELSE IF( LQUERY ) THEN |
|
IF( K.EQ.0 ) THEN |
|
LWKOPT = 1 |
|
ELSE |
|
LWKOPT = N*NB |
|
END IF |
|
WORK( 1 ) = LWKOPT |
RETURN |
RETURN |
END IF |
END IF |
* |
* |
* Quick return if possible |
* Quick return if possible |
* |
* |
K = MIN( M, N ) |
|
IF( K.EQ.0 ) THEN |
IF( K.EQ.0 ) THEN |
WORK( 1 ) = 1 |
WORK( 1 ) = 1 |
RETURN |
RETURN |