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	f08asf_ (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 f08asf, nagf_lapackeig_zgeqrf or its LAPACK name zgeqrf.

3 Description

f08asf forms the

Q R

factorization of an arbitrary rectangular complex

m \times n

matrix. No pivoting is performed.

m \geq n

, the factorization is given by:

A = Q (\begin{array}{r} R \\ 0 \end{array}),

where

R

is an

n \times n

upper triangular matrix (with real diagonal elements) and

Q

is an

m \times m

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

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

which reduces to

A = Q_{1} R,

where

Q_{1}

consists of the first

n

columns of

Q

, and

Q_{2}

the remaining

m - n

columns.

m < n

R

is trapezoidal, and the factorization can be written

A = Q (\begin{array}{r} R_{1} & R_{2} \end{array}),

where

R_{1}

is upper triangular and

R_{2}

is rectangular.

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 < n

, the information returned in the first

k

columns of the array a represents a

Q R

factorization of the first

k

columns of the original matrix

A

4 References

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: $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 \times n$ matrix $A$ .

On exit: if $m \geq n$ , the elements below the diagonal are overwritten by details of the unitary matrix $Q$ and the upper triangle is overwritten by the corresponding elements of the $n \times n$ upper triangular matrix $R$ .
If $m < n$ , the strictly lower triangular part is overwritten by details of the unitary matrix $Q$ and the remaining elements are overwritten by the corresponding elements of the $m \times n$ upper trapezoidal matrix $R$ .

The diagonal elements of $R$ are real.
4: $lda$ – Integer Input: On entry: the first dimension of the array a as declared in the (sub)program from which f08asf 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 f08asf 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 n \times nb$ , where $nb$ is the optimal block size.

Constraint: $lwork \geq \max (1, n)$ 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

Background information to multithreading can be found in the Multithreading documentation.

f08asf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f08asf 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} n^{2} (3 m - n)

m \geq n

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

m < n

To form the unitary matrix

Q

f08asf may be followed by a call to f08atf :

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

but note that the second dimension of the array a must be at least m, which may be larger than was required by f08asf.

When

m \geq n

, it is often only the first

n

columns of

Q

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

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

To apply

Q

to an arbitrary

m \times p

complex rectangular matrix

C

, f08asf may be followed by a call to f08auf . For example,

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

forms the matrix product

C = Q^{H} C

To compute a

Q R

factorization with column pivoting, use f08btf.

The real analogue of this routine is f08aef.

10 Example

This example solves the linear least squares problems

minimize {‖ A x_{i} - b_{i} ‖}_{2}, i = 1, 2

where

b_{1}

and

b_{2}

are the columns of the matrix

B

A = (\begin{array}{r} 0.96 - 0.81 i & - 0.03 + 0.96 i & - 0.91 + 2.06 i & - 0.05 + 0.41 i \\ - 0.98 + 1.98 i & - 1.20 + 0.19 i & - 0.66 + 0.42 i & - 0.81 + 0.56 i \\ 0.62 - 0.46 i & 1.01 + 0.02 i & 0.63 - 0.17 i & - 1.11 + 0.60 i \\ - 0.37 + 0.38 i & 0.19 - 0.54 i & - 0.98 - 0.36 i & 0.22 - 0.20 i \\ 0.83 + 0.51 i & 0.20 + 0.01 i & - 0.17 - 0.46 i & 1.47 + 1.59 i \\ 1.08 - 0.28 i & 0.20 - 0.12 i & - 0.07 + 1.23 i & 0.26 + 0.26 i \end{array})

and

B = (\begin{array}{r} - 1.54 + 0.76 i & 3.17 - 2.09 i \\ 0.12 - 1.92 i & - 6.53 + 4.18 i \\ - 9.08 - 4.31 i & 7.28 + 0.73 i \\ 7.49 + 3.65 i & 0.91 - 3.97 i \\ - 5.63 - 2.12 i & - 5.46 - 1.64 i \\ 2.37 + 8.03 i & - 2.84 - 5.86 i \end{array}) .

f08as: FL CL CPP AD PY MB

NAG FL Interfacef08asf (zgeqrf)

▸▿ 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
f08asf (zgeqrf)