NAG FL Interface
f08ztf (zggrqf)

Settings help

FL Name Style:


FL Specification Language:


1 Purpose

f08ztf computes a generalized RQ factorization of a complex matrix pair (A,B), where A is an m×n matrix and B is a p×n matrix.

2 Specification

Fortran Interface
Subroutine f08ztf ( m, p, n, a, lda, taua, b, ldb, taub, work, lwork, info)
Integer, Intent (In) :: m, p, n, lda, ldb, lwork
Integer, Intent (Out) :: info
Complex (Kind=nag_wp), Intent (Inout) :: a(lda,*), b(ldb,*)
Complex (Kind=nag_wp), Intent (Out) :: taua(min(m,n)), taub(min(p,n)), work(max(1,lwork))
C Header Interface
#include <nag.h>
void  f08ztf_ (const Integer *m, const Integer *p, const Integer *n, Complex a[], const Integer *lda, Complex taua[], Complex b[], const Integer *ldb, Complex taub[], Complex work[], const Integer *lwork, Integer *info)
The routine may be called by the names f08ztf, nagf_lapackeig_zggrqf or its LAPACK name zggrqf.

3 Description

f08ztf forms the generalized RQ factorization of an m×n matrix A and a p×n matrix B
A = RQ ,   B= ZTQ ,  
where Q is an n×n unitary matrix, Z is a p×p unitary matrix and R and T are of the form
R = { n-mmm0R12() ;   if ​ mn , nm-nR11nR21() ;   if ​ m>n ,  
with R12 or R21 upper triangular,
T = { nnT11p-n0() ;   if ​ pn , pn-ppT11T12() ;   if ​ p<n ,  
with T11 upper triangular.
In particular, if B is square and nonsingular, the generalized RQ factorization of A and B implicitly gives the RQ factorization of AB-1 as
AB-1= (RT-1) ZH .  

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
Anderson E, Bai Z and Dongarra J (1992) Generalized QR factorization and its applications Linear Algebra Appl. (Volume 162–164) 243–271
Hammarling S (1987) The numerical solution of the general Gauss-Markov linear model Mathematics in Signal Processing (eds T S Durrani, J B Abbiss, J E Hudson, R N Madan, J G McWhirter and T A Moore) 441–456 Oxford University Press
Paige C C (1990) Some aspects of generalized QR factorizations . In Reliable Numerical Computation (eds M G Cox and S Hammarling) 73–91 Oxford University Press

5 Arguments

1: m Integer Input
On entry: m, the number of rows of the matrix A.
Constraint: m0.
2: p Integer Input
On entry: p, the number of rows of the matrix B.
Constraint: p0.
3: n Integer Input
On entry: n, the number of columns of the matrices A and B.
Constraint: n0.
4: a(lda,*) Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array a must be at least max(1,n).
On entry: the m×n matrix A.
On exit: if mn, the upper triangle of the subarray a(1:m,n-m+1:n) contains the m×m upper triangular matrix R12.
If mn, the elements on and above the (m-n)th subdiagonal contain the m×n upper trapezoidal matrix R; the remaining elements, with the array taua, represent the unitary matrix Q as a product of min(m,n) elementary reflectors (see Section 3.3.6 in the F08 Chapter Introduction).
5: lda Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f08ztf is called.
Constraint: ldamax(1,m).
6: taua(min(m,n)) Complex (Kind=nag_wp) array Output
On exit: the scalar factors of the elementary reflectors which represent the unitary matrix Q.
7: b(ldb,*) Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array b must be at least max(1,n).
On entry: the p×n matrix B.
On exit: the elements on and above the diagonal of the array contain the min(p,n)×n upper trapezoidal matrix T (T is upper triangular if pn); the elements below the diagonal, with the array taub, represent the unitary matrix Z as a product of elementary reflectors (see Section 3.3.6 in the F08 Chapter Introduction).
8: ldb Integer Input
On entry: the first dimension of the array b as declared in the (sub)program from which f08ztf is called.
Constraint: ldbmax(1,p).
9: taub(min(p,n)) Complex (Kind=nag_wp) array Output
On exit: the scalar factors of the elementary reflectors which represent the unitary matrix Z.
10: work(max(1,lwork)) Complex (Kind=nag_wp) array Workspace
On exit: if info=0, the real part of work(1) contains the minimum value of lwork required for optimal performance.
11: lwork Integer Input
On entry: the dimension of the array work as declared in the (sub)program from which f08ztf 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, lworkmax(n,m,p)×max(nb1,nb2,nb3), where nb1 is the optimal block size for the RQ factorization of an m×n matrix by f08cvf, nb2 is the optimal block size for the QR factorization of a p×n matrix by f08asf, and nb3 is the optimal block size for a call of f08cxf.
Constraint: lworkmax(1,n,m,p) or lwork=-1.
12: 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

The computed generalized RQ factorization is the exact factorization for nearby matrices (A+E) and (B+F), where
E2 = Oε A2   and   F2= Oε B2 ,  
and ε is the machine precision.

8 Parallelism and Performance

f08ztf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08ztf 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 unitary matrices Q and Z may be formed explicitly by calls to f08cwf and f08atf respectively. f08cxf may be used to multiply Q by another matrix and f08auf may be used to multiply Z by another matrix.
The real analogue of this routine is f08zff.

10 Example

This example solves the least squares problem
minimize x c-Ax2   subject to   Bx=d  
where
A = ( 0.96-0.81i -0.03+0.96i -0.91+2.06i -0.05+0.41i -0.98+1.98i -1.20+0.19i -0.66+0.42i -0.81+0.56i 0.62-0.46i 1.01+0.02i 0.63-0.17i -1.11+0.60i 0.37+0.38i 0.19-0.54i -0.98-0.36i 0.22-0.20i 0.83+0.51i 0.20+0.01i -0.17-0.46i 1.47+1.59i 1.08-0.28i 0.20-0.12i -0.07+1.23i 0.26+0.26i ) ,    
B = ( 1 0 -1 0 0 1 0 -1 ) ,   c= ( -2.54+0.09i 1.65-2.26i -2.11-3.96i 1.82+3.30i -6.41+3.77i 2.07+0.66i )   and   d= ( 0 0 ) .  
The constraints Bx=d correspond to x1=x3 and x2=x4.
The solution is obtained by first obtaining a generalized RQ factorization of the matrix pair (A,B). The example illustrates the general solution process, although the above data corresponds to a simple weighted least squares problem.
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 (f08ztfe.f90)

10.2 Program Data

Program Data (f08ztfe.d)

10.3 Program Results

Program Results (f08ztfe.r)