NAG FL Interface
f08bnf (zgelsy)

1 Purpose

f08bnf computes the minimum norm solution to a complex linear least squares problem
minx b-Ax2  
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.

2 Specification

Fortran Interface
Subroutine f08bnf ( m, n, nrhs, a, lda, b, ldb, jpvt, rcond, rank, work, lwork, rwork, info)
Integer, Intent (In) :: m, n, nrhs, lda, ldb, lwork
Integer, Intent (Inout) :: jpvt(*)
Integer, Intent (Out) :: rank, info
Real (Kind=nag_wp), Intent (In) :: rcond
Real (Kind=nag_wp), Intent (Inout) :: rwork(*)
Complex (Kind=nag_wp), Intent (Inout) :: a(lda,*), b(ldb,*)
Complex (Kind=nag_wp), Intent (Out) :: work(max(1,lwork))
C Header Interface
#include <nag.h>
void  f08bnf_ (const Integer *m, const Integer *n, const Integer *nrhs, Complex a[], const Integer *lda, Complex b[], const Integer *ldb, Integer jpvt[], const double *rcond, Integer *rank, Complex work[], const Integer *lwork, double rwork[], Integer *info)
The routine may be called by the names f08bnf, nagf_lapackeig_zgelsy or its LAPACK name zgelsy.

3 Description

The right-hand side vectors are stored as the columns of the m by r matrix B and the solution vectors in the n by r matrix X.
f08bnf first computes a QR factorization with column pivoting
AP= Q R11 R12 0 R22 ,  
with R11 defined as the largest leading sub-matrix 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
AP= Q T11 0 0 0 Z .  
The minimum norm solution is then
X = PZH T11-1 Q1H b 0  
where Q1 consists of the first rank columns of Q.

4 References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia https://www.netlib.org/lapack/lug
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5 Arguments

1: m Integer Input
On entry: m, the number of rows of the matrix A.
Constraint: m0.
2: n Integer Input
On entry: n, the number of columns of the matrix A.
Constraint: n0.
3: nrhs Integer Input
On entry: r, the number of right-hand sides, i.e., the number of columns of the matrices B and X.
Constraint: nrhs0.
4: alda* Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array a must be at least max1,n.
On entry: the m by n matrix A.
On exit: a has been overwritten by details of its complete orthogonal factorization.
5: lda Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f08bnf is called.
Constraint: ldamax1,m.
6: bldb* Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array b must be at least max1,nrhs.
On entry: the m by r right-hand side matrix B.
On exit: the n by r solution matrix X.
7: ldb Integer Input
On entry: the first dimension of the array b as declared in the (sub)program from which f08bnf is called.
Constraint: ldbmax1,m,n.
8: jpvt* Integer array Input/Output
Note: the dimension of the array jpvt must be at least max1,n.
On entry: if jpvti0, the ith column of A is permuted to the front of AP, otherwise column i is a free column.
On exit: if jpvti=k, the ith column of AP was the kth column of A.
9: rcond Real (Kind=nag_wp) Input
On entry: used to determine the effective rank of A, which is defined as the order of the largest leading triangular sub-matrix R11 in the QR factorization of A, whose estimated condition number is <1/rcond.
Suggested value: if the condition number of a is not known then rcond=ε/2 (where ε is machine precision, see x02ajf) is a good choice. Negative values or values less than machine precision should be avoided since this will cause a to have an effective rank=minm,n that could be larger than its actual rank, leading to meaningless results.
10: rank Integer Output
On exit: the effective rank of A, i.e., the order of the sub-matrix R11. This is the same as the order of the sub-matrix T11 in the complete orthogonal factorization of A.
11: workmax1,lwork Complex (Kind=nag_wp) array Workspace
On exit: if info=0, the real part of work1 contains the minimum value of lwork required for optimal performance.
12: lwork Integer Input
On entry: the dimension of the array work as declared in the (sub)program from which f08bnf is called.
If lwork=-1, 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.
Suggested value: for optimal performance,
lwork max k + 2 × n + nb × n+1 , 2 × k + nb × nrhs ,  
where k = minm,n and nb is the optimal block size.
Constraint: lwork k + max2×k,n+1,k+nrhs , where ​ k = minm,n or
lwork=-1.
13: rwork* Real (Kind=nag_wp) array Workspace
Note: the dimension of the array rwork must be at least max1,2×n.
14: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.

7 Accuracy

See Section 4.5 of Anderson et al. (1999) for details of error bounds.

8 Parallelism and Performance

f08bnf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08bnf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The real analogue of this routine is f08baf.

10 Example

This example solves the linear least squares problem
minx b-Ax2  
for the solution, x, of minimum norm, where
A = 0.47-0.34i -0.40+0.54i 0.60+0.01i 0.80-1.02i -0.32-0.23i -0.05+0.20i -0.26-0.44i -0.43+0.17i 0.35-0.60i -0.52-0.34i 0.87-0.11i -0.34-0.09i 0.89+0.71i -0.45-0.45i -0.02-0.57i 1.14-0.78i -0.19+0.06i 0.11-0.85i 1.44+0.80i 0.07+1.14i  
and
b = -1.08-2.59i -2.61-1.49i 3.13-3.61i 7.33-8.01i 9.12+7.63i .  
A tolerance of 0.01 is used to determine the effective rank of A.
Note that the block size (NB) of 64 assumed in this example is not realistic for such a small problem, but should be suitable for large problems.

10.1 Program Text

Program Text (f08bnfe.f90)

10.2 Program Data

Program Data (f08bnfe.d)

10.3 Program Results

Program Results (f08bnfe.r)