Purpose
=======
DGELSY computes the minimum-norm solution to a real linear least
squares problem:
minimize || A * X - B ||
using a complete orthogonal factorization of A. A is an M-by-N
matrix which may be rank-deficient.
Several right hand side vectors b and solution vectors x can be
handled in a single call; they are stored as the columns of the
M-by-NRHS right hand side matrix B and the N-by-NRHS solution
matrix X.
The routine first computes a QR factorization with column pivoting:
A * P = Q * [ R11 R12 ]
[ 0 R22 ]
with R11 defined as the largest leading submatrix whose estimated
condition number is less than 1/RCOND. The order of R11, RANK,
is the effective rank of A.
Then, R22 is considered to be negligible, and R12 is annihilated
by orthogonal transformations from the right, arriving at the
complete orthogonal factorization:
A * P = Q * [ T11 0 ] * Z
[ 0 0 ]
The minimum-norm solution is then
X = P * Z' [ inv(T11)*Q1'*B ]
[ 0 ]
where Q1 consists of the first RANK columns of Q.
This routine is basically identical to the original xGELSX except
three differences:
o The call to the subroutine xGEQPF has been substituted by the
the call to the subroutine xGEQP3. This subroutine is a Blas-3
version of the QR factorization with column pivoting.
o Matrix B (the right hand side) is updated with Blas-3.
o The permutation of matrix B (the right hand side) is faster and
more simple.
Namespace: DotNumerics.LinearAlgebra.CSLapackAssembly: DWSIM.MathOps.DotNumerics (in DWSIM.MathOps.DotNumerics.dll) Version: 1.0.0.0 (1.0.0.0)
Syntax public void Run(
int M,
int N,
int NRHS,
ref double[] A,
int offset_a,
int LDA,
ref double[] B,
int offset_b,
int LDB,
ref int[] JPVT,
int offset_jpvt,
double RCOND,
ref int RANK,
ref double[] WORK,
int offset_work,
int LWORK,
ref int INFO
)
Public Sub Run (
M As Integer,
N As Integer,
NRHS As Integer,
ByRef A As Double(),
offset_a As Integer,
LDA As Integer,
ByRef B As Double(),
offset_b As Integer,
LDB As Integer,
ByRef JPVT As Integer(),
offset_jpvt As Integer,
RCOND As Double,
ByRef RANK As Integer,
ByRef WORK As Double(),
offset_work As Integer,
LWORK As Integer,
ByRef INFO As Integer
)
Request Example
View SourceParameters
- M Int32
-
(input) INTEGER
The number of rows of the matrix A. M .GE. 0.
- N Int32
-
(input) INTEGER
The number of columns of the matrix A. N .GE. 0.
- NRHS Int32
-
(input) INTEGER
The number of right hand sides, i.e., the number of
columns of matrices B and X. NRHS .GE. 0.
- A Double
-
(input/output) DOUBLE PRECISION array, dimension (LDA,N)
On entry, the M-by-N matrix A.
On exit, A has been overwritten by details of its
complete orthogonal factorization.
- offset_a Int32
-
- LDA Int32
-
(input) INTEGER
The leading dimension of the array A. LDA .GE. max(1,M).
- B Double
-
(input/output) DOUBLE PRECISION array, dimension (LDB,NRHS)
On entry, the M-by-NRHS right hand side matrix B.
On exit, the N-by-NRHS solution matrix X.
- offset_b Int32
-
- LDB Int32
-
(input) INTEGER
The leading dimension of the array B. LDB .GE. max(1,M,N).
- JPVT Int32
-
(input/output) INTEGER array, dimension (N)
On entry, if JPVT(i) .ne. 0, the i-th column of A is permuted
to the front of AP, otherwise column i is a free column.
On exit, if JPVT(i) = k, then the i-th column of AP
was the k-th column of A.
- offset_jpvt Int32
-
- RCOND Double
-
(input) DOUBLE PRECISION
RCOND is used to determine the effective rank of A, which
is defined as the order of the largest leading triangular
submatrix R11 in the QR factorization with pivoting of A,
whose estimated condition number .LT. 1/RCOND.
- RANK Int32
-
(output) INTEGER
The effective rank of A, i.e., the order of the submatrix
R11. This is the same as the order of the submatrix T11
in the complete orthogonal factorization of A.
- WORK Double
-
(workspace/output) DOUBLE PRECISION array, dimension (MAX(1,LWORK))
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
- offset_work Int32
-
- LWORK Int32
-
(input) INTEGER
The dimension of the array WORK.
The unblocked strategy requires that:
LWORK .GE. MAX( MN+3*N+1, 2*MN+NRHS ),
where MN = min( M, N ).
The block algorithm requires that:
LWORK .GE. MAX( MN+2*N+NB*(N+1), 2*MN+NB*NRHS ),
where NB is an upper bound on the blocksize returned
by ILAENV for the routines DGEQP3, DTZRZF, STZRQF, DORMQR,
and DORMRZ.
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 Int32
-
(output) INTEGER
= 0: successful exit
.LT. 0: If INFO = -i, the i-th argument had an illegal value.
See Also