Integer, Intent (In)	::	m, n, lda, lwork
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,), tau()
Complex (Kind=nag_wp), Intent (Out)	::	work(max(1,lwork))

C Header Interface

#include <nag.h>

void	f08avf_ (const Integer m, const Integer n, Complex a[], const Integer lda, Complex tau[], Complex work[], const Integer lwork, Integer *info)

The routine may be called by the names f08avf, nagf_lapackeig_zgelqf or its LAPACK name zgelqf.

3 Description

f08avf forms the

L Q

factorization of an arbitrary rectangular complex

m

n

matrix. No pivoting is performed.

m \leq n

, the factorization is given by:

A = (\begin{array}{r} L & 0 \end{array}) Q

where

L

is an

m

m

lower triangular matrix (with real diagonal elements) and

Q

is an

n

n

unitary matrix. It is sometimes more convenient to write the factorization as

A = (\begin{array}{r} L & 0 \end{array}) (\begin{array}{r} Q_{1} \\ Q_{2} \end{array})

which reduces to

A = L Q_{1},

where

Q_{1}

consists of the first

m

rows of

Q

, and

Q_{2}

the remaining

n - m

rows.

m > n

L

is trapezoidal, and the factorization can be written

A = (\begin{array}{r} L_{1} \\ L_{2} \end{array}) Q

where

L_{1}

is lower triangular and

L_{2}

is rectangular.

The

L Q

factorization of

A

is essentially the same as the

Q R

factorization of

A^{H}

, since

A = (\begin{array}{r} L & 0 \end{array}) Q \Leftrightarrow A^{H} = Q^{H} (\begin{array}{r} L^{H} \\ 0 \end{array}) .

The matrix

Q

is not formed explicitly but is represented as a product of

\min (m, n)

elementary reflectors (see the F08 Chapter Introduction for details). Routines are provided to work with

Q

in this representation (see Section 9).

Note also that for any

k < m

, the information returned in the first

k

rows of the array a represents an

L Q

factorization of the first

k

rows of the original matrix

A

4 References

None.

5 Arguments

1: $m$ – Integer Input: On entry: $m$ , the number of rows of the matrix $A$ .

Constraint: $m \geq 0$ .
2: $n$ – Integer Input: On entry: $n$ , the number of columns of the matrix $A$ .

Constraint: $n \geq 0$ .
3: $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$ by $n$ matrix $A$ .

On exit: if $m \leq n$ , the elements above the diagonal are overwritten by details of the unitary matrix $Q$ and the lower triangle is overwritten by the corresponding elements of the $m$ by $m$ lower triangular matrix $L$ .
If $m > n$ , the strictly upper triangular part is overwritten by details of the unitary matrix $Q$ and the remaining elements are overwritten by the corresponding elements of the $m$ by $n$ lower trapezoidal matrix $L$ .
The diagonal elements of $L$ are real.
4: $lda$ – Integer Input: On entry: the first dimension of the array a as declared in the (sub)program from which f08avf is called.

Constraint: $lda \geq \max (1, m)$ .
5: $tau (*)$ – Complex (Kind=nag_wp) array Output: Note: the dimension of the array tau must be at least $\max (1, \min (m, n))$ .

On exit: further details of the unitary matrix $Q$ .
6: $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.
7: $lwork$ – Integer Input: On entry: the dimension of the array work as declared in the (sub)program from which f08avf 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 \geq m \times nb$ , where $nb$ is the optimal block size.

Constraint: $lwork \geq \max (1, m)$ or $lwork = - 1$ .
8: $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 factorization is the exact factorization of a nearby matrix

(A + E)

, where

{‖E‖}_{2} = O (ε) {‖A‖}_{2},

and

ε

is the machine precision.

8 Parallelism and Performance

f08avf 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 total number of real floating-point operations is approximately

\frac{8}{3} m^{2} (3 n - m)

m \leq n

\frac{8}{3} n^{2} (3 m - n)

m > n

To form the unitary matrix

Q

f08avf may be followed by a call to f08awf:

Call zunglq(n,n,min(m,n),a,lda,tau,work,lwork,info)

but note that the first dimension of the array a, specified by the argument lda, must be at least n, which may be larger than was required by f08avf.

When

m \leq n

, it is often only the first

m

rows of

Q

that are required, and they may be formed by the call:

Call zunglq(m,n,m,a,lda,tau,work,lwork,info)

To apply

Q

to an arbitrary complex rectangular matrix

C

, f08avf may be followed by a call to f08axf. For example,

Call zunmlq('Left','Conjugate Transpose',m,p,min(m,n),a,lda,tau, &
             c,ldc,work,lwork,info)

forms the matrix product

C = Q^{H} C

, where

C

m

p

The real analogue of this routine is f08ahf.

10 Example

This example finds the minimum norm solutions of the under-determined systems of linear equations

A x_{1} = b_{1} and A x_{2} = b_{2}

where

b_{1}

and

b_{2}

are the columns of the matrix

B

A = (\begin{array}{r} 0.28 - 0.36 i & 0.50 - 0.86 i & - 0.77 - 0.48 i & 1.58 + 0.66 i \\ - 0.50 - 1.10 i & - 1.21 + 0.76 i & - 0.32 - 0.24 i & - 0.27 - 1.15 i \\ 0.36 - 0.51 i & - 0.07 + 1.33 i & - 0.75 + 0.47 i & - 0.08 + 1.01 i \end{array})

and

B = (\begin{array}{r} - 1.35 + 0.19 i & 4.83 - 2.67 i \\ 9.41 - 3.56 i & - 7.28 + 3.34 i \\ - 7.57 + 6.93 i & 0.62 + 4.53 i \end{array}) .

Interfaces: FL CL AD

NAG FL Interface Introduction

F08 (Lapackeig) Chapter Contents

F08 (Lapackeig) Chapter Introduction

f08av: FL CL AD

NAG FL Interfacef08avf (zgelqf)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f08avf (zgelqf)