|
version 1.17, 2018/05/29 07:18:14
|
version 1.18, 2020/05/21 21:46:04
|
|
Line 34
|
Line 34
|
| *> \verbatim |
*> \verbatim |
| *> |
*> |
| *> ZGELQF computes an LQ factorization of a complex M-by-N matrix A: |
*> ZGELQF computes an LQ factorization of a complex M-by-N matrix A: |
| *> A = L * Q. |
*> |
| |
*> A = ( L 0 ) * Q |
| |
*> |
| |
*> where: |
| |
*> |
| |
*> Q is a N-by-N orthogonal matrix; |
| |
*> L is an lower-triangular M-by-M matrix; |
| |
*> 0 is a M-by-(N-M) zero matrix, if M < N. |
| |
*> |
| *> \endverbatim |
*> \endverbatim |
| * |
* |
| * Arguments: |
* Arguments: |
|
Line 110
|
Line 118
|
| *> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
| *> \author NAG Ltd. |
*> \author NAG Ltd. |
| * |
* |
| *> \date December 2016 |
*> \date November 2019 |
| * |
* |
| *> \ingroup complex16GEcomputational |
*> \ingroup complex16GEcomputational |
| * |
* |
|
Line 135
|
Line 143
|
| * ===================================================================== |
* ===================================================================== |
| SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) |
| * |
* |
| * -- LAPACK computational routine (version 3.7.0) -- |
* -- LAPACK computational routine (version 3.9.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..-- |
| * December 2016 |
* November 2019 |
| * |
* |
| * .. Scalar Arguments .. |
* .. Scalar Arguments .. |
| INTEGER INFO, LDA, LWORK, M, N |
INTEGER INFO, LDA, LWORK, M, N |
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to zgelqf.f CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [local] / rpl / lapack / lapack