ZGELQS
Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd..
November 2006
November 2006
Purpose
Compute a minimum-norm solution
min || A*X - B ||
using the LQ factorization
A = L*Q
computed by ZGELQF.
min || A*X - B ||
using the LQ factorization
A = L*Q
computed by ZGELQF.
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 >= M >= 0.
|
| NRHS |
(input) INTEGER
The number of columns of B. NRHS >= 0.
|
| A |
(input) COMPLEX*16 array, dimension (LDA,N)
Details of the LQ factorization of the original matrix A as
returned by ZGELQF. |
| LDA |
(input) INTEGER
The leading dimension of the array A. LDA >= M.
|
| TAU |
(input) COMPLEX*16 array, dimension (M)
Details of the orthogonal matrix Q.
|
| B |
(input/output) COMPLEX*16 array, dimension (LDB,NRHS)
On entry, the m-by-nrhs right hand side matrix B.
On exit, the n-by-nrhs solution matrix X. |
| LDB |
(input) INTEGER
The leading dimension of the array B. LDB >= N.
|
| WORK |
(workspace) COMPLEX*16 array, dimension (LWORK)
|
| LWORK |
(input) INTEGER
The length of the array WORK. LWORK must be at least NRHS,
and should be at least NRHS*NB, where NB is the block size for this environment. |
| INFO |
(output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value |