version 1.4, 2018/05/29 07:18:30
|
version 1.5, 2020/05/21 21:46:09
|
Line 1
|
Line 1
|
|
*> \brief \b ZLASWLQ |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
Line 18
|
Line 19
|
*> |
*> |
*> \verbatim |
*> \verbatim |
*> |
*> |
*> ZLASWLQ computes a blocked Short-Wide LQ factorization of a |
*> ZLASWLQ computes a blocked Tall-Skinny LQ factorization of |
*> M-by-N matrix A, where N >= M: |
*> a complexx M-by-N matrix A for M <= N: |
*> A = L * Q |
*> |
|
*> A = ( L 0 ) * Q, |
|
*> |
|
*> where: |
|
*> |
|
*> Q is a n-by-N orthogonal matrix, stored on exit in an implicit |
|
*> form in the elements above the digonal of the array A and in |
|
*> the elemenst of the array T; |
|
*> L is an lower-triangular M-by-M matrix stored on exit in |
|
*> the elements on and below the diagonal of the array A. |
|
*> 0 is a M-by-(N-M) zero matrix, if M < N, and is not stored. |
|
*> |
*> \endverbatim |
*> \endverbatim |
* |
* |
* Arguments: |
* Arguments: |
Line 150
|
Line 162
|
SUBROUTINE ZLASWLQ( M, N, MB, NB, A, LDA, T, LDT, WORK, LWORK, |
SUBROUTINE ZLASWLQ( M, N, MB, NB, A, LDA, T, LDT, WORK, LWORK, |
$ INFO) |
$ INFO) |
* |
* |
* -- LAPACK computational routine (version 3.7.1) -- |
* -- 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. -- |
* June 2017 |
* June 2017 |