NAG FL Interface
f08zpf (zggglm)

1 Purpose

f08zpf solves a complex general Gauss–Markov linear (least squares) model problem.

2 Specification

Fortran Interface
Subroutine f08zpf ( m, n, p, a, lda, b, ldb, d, x, y, work, lwork, info)
Integer, Intent (In) :: m, n, p, lda, ldb, lwork
Integer, Intent (Out) :: info
Complex (Kind=nag_wp), Intent (Inout) :: a(lda,*), b(ldb,*), d(m)
Complex (Kind=nag_wp), Intent (Out) :: x(n), y(p), work(max(1,lwork))
C Header Interface
#include <nag.h>
void  f08zpf_ (const Integer *m, const Integer *n, const Integer *p, Complex a[], const Integer *lda, Complex b[], const Integer *ldb, Complex d[], Complex x[], Complex y[], Complex work[], const Integer *lwork, Integer *info)
The routine may be called by the names f08zpf, nagf_lapackeig_zggglm or its LAPACK name zggglm.

3 Description

f08zpf solves the complex general Gauss–Markov linear model (GLM) problem
minimize x y2  subject to  d=Ax+By  
where A is an m by n matrix, B is an m by p matrix and d is an m element vector. It is assumed that nmn+p, rankA=n and rankE=m, where E= A B . Under these assumptions, the problem has a unique solution x and a minimal 2-norm solution y, which is obtained using a generalized QR factorization of the matrices A and B.
In particular, if the matrix B is square and nonsingular, then the GLM problem is equivalent to the weighted linear least squares problem
minimize x B-1 d-Ax 2 .  

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
Anderson E, Bai Z and Dongarra J (1992) Generalized QR factorization and its applications Linear Algebra Appl. (Volume 162–164) 243–271

5 Arguments

1: m Integer Input
On entry: m, the number of rows of the matrices A and B.
Constraint: m0.
2: n Integer Input
On entry: n, the number of columns of the matrix A.
Constraint: 0nm.
3: p Integer Input
On entry: p, the number of columns of the matrix B.
Constraint: pm-n.
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 is overwritten.
5: lda Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f08zpf 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,p.
On entry: the m by p matrix B.
On exit: b is overwritten.
7: ldb Integer Input
On entry: the first dimension of the array b as declared in the (sub)program from which f08zpf is called.
Constraint: ldbmax1,m.
8: dm Complex (Kind=nag_wp) array Input/Output
On entry: the left-hand side vector d of the GLM equation.
On exit: d is overwritten.
9: xn Complex (Kind=nag_wp) array Output
On exit: the solution vector x of the GLM problem.
10: yp Complex (Kind=nag_wp) array Output
On exit: the solution vector y of the GLM problem.
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 f08zpf 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, lworkn+minm,p+maxm,p×nb, where nb is the optimal block size.
Constraint: lwork max1,m+n+p or lwork=-1.
13: 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.
info=1
The upper triangular factor R associated with A in the generalized RQ factorization of the pair A,B is singular, so that rankA<n; the least squares solution could not be computed.
info=2
The bottom m-n by m-n part of the upper trapezoidal factor T associated with B in the generalized QR factorization of the pair A,B is singular, so that rankAB<n; the least squares solutions could not be computed.

7 Accuracy

For an error analysis, see Anderson et al. (1992). See also Section 4.6 of Anderson et al. (1999).

8 Parallelism and Performance

f08zpf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08zpf 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

When p=mn, the total number of real floating-point operations is approximately 832m3-n3+16nm2; when p=m=n, the total number of real floating-point operations is approximately 563m3.

10 Example

This example solves the weighted least squares problem
minimize x B-1 d-Ax 2 ,  
where
B = 0.5-1.0i .0i+0.0 .0i+0.0 .0i+0.0 .0i+0.0 1.0-2.0i .0i+0.0 .0i+0.0 .0i+0.0 .0i+0.0 2.0-3.0i .0i+0.0 .0i+0.0 .0i+0.0 .0i+0.0 5.0-4.0i ,  
d = 6.00-0.40i -5.27+0.90i 2.72-2.13i -1.30-2.80i  
and
A = 0.96-0.81i -0.03+0.96i -0.91+2.06i -0.98+1.98i -1.20+0.19i -0.66+0.42i 0.62-0.46i 1.01+0.02i 0.63-0.17i 1.08-0.28i 0.20-0.12i -0.07+1.23i .  
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 (f08zpfe.f90)

10.2 Program Data

Program Data (f08zpfe.d)

10.3 Program Results

Program Results (f08zpfe.r)