NAG Library Routine Document

F08BTF (ZGEQP3)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

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

1 Purpose

F08BTF (ZGEQP3) computes the

Q R

factorization, with column pivoting, of a complex

m

n

matrix.

2 Specification

SUBROUTINE F08BTF (

M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK, INFO)

INTEGER	M, N, LDA, JPVT(*), LWORK, INFO
REAL (KIND=nag_wp)	RWORK(*)
COMPLEX (KIND=nag_wp)	A(LDA,), TAU(), WORK(max(1,LWORK))

The routine may be called by its LAPACK name zgeqp3.

3 Description

F08BTF (ZGEQP3) forms the

Q R

factorization, with column pivoting, of an arbitrary rectangular complex

m

n

matrix.

m \geq n

, the factorization is given by:

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

where

R

is an

n

n

upper triangular matrix (with real diagonal elements),

Q

is an

m

m

unitary matrix and

P

is an

n

n

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

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

which reduces to

A P = 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 P = 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 permuted matrix

A P

The routine allows specified columns of

A

to be moved to the leading columns of

A P

at the start of the factorization and fixed there. The remaining columns are free to be interchanged so that at the

i

th stage the pivot column is chosen to be the column which maximizes the

2

-norm of elements

i

m

over columns

i

n

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 http://www.netlib.org/lapack/lug

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5 Parameters

1: $M$ – INTEGERInput: On entry: $m$ , the number of rows of the matrix $A$ .

Constraint: $M \geq 0$ .
2: $N$ – INTEGERInput: On entry: $n$ , the number of columns of the matrix $A$ .

Constraint: $N \geq 0$ .
3: $A (LDA *)$ – COMPLEX (KIND=nag_wp) arrayInput/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 \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$ by $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$ by $n$ upper trapezoidal matrix $R$ .

The diagonal elements of $R$ are real.
4: $LDA$ – INTEGERInput: On entry: the first dimension of the array A as declared in the (sub)program from which F08BTF (ZGEQP3) is called.

Constraint: $LDA \geq \max (1, M)$ .
5: $JPVT (*)$ – INTEGER arrayInput/Output: Note: the dimension of the array JPVT must be at least $\max (1, N)$ .

On entry: if $JPVT (j) \neq 0$ , then the $j$ th column of $A$ is moved to the beginning of $A P$ before the decomposition is computed and is fixed in place during the computation. Otherwise, the $j$ th column of $A$ is a free column (i.e., one which may be interchanged during the computation with any other free column).

On exit: details of the permutation matrix $P$ . More precisely, if $JPVT (j) = k$ , then the $k$ th column of $A$ is moved to become the $j$ th column of $A P$ ; in other words, the columns of $A P$ are the columns of $A$ in the order $JPVT (1), JPVT (2), \dots, JPVT (n)$ .
6: $TAU (*)$ – COMPLEX (KIND=nag_wp) arrayOutput: 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$ .
7: $WORK (\max (1, LWORK))$ – COMPLEX (KIND=nag_wp) arrayWorkspace: On exit: if $INFO = 0$ , the real part of $WORK (1)$ contains the minimum value of LWORK required for optimal performance.
8: $LWORK$ – INTEGERInput: On entry: the dimension of the array WORK as declared in the (sub)program from which F08BTF (ZGEQP3) 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 + 1) \times nb$ , where $nb$ is the optimal block size.

Constraint: $LWORK \geq N + 1$ or $LWORK = - 1$ .
9: $RWORK (*)$ – REAL (KIND=nag_wp) arrayWorkspace: Note: the dimension of the array RWORK must be at least $\max (1, 2 \times N)$ .
10: $INFO$ – INTEGEROutput: 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

F08BTF (ZGEQP3) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

F08BTF (ZGEQP3) 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

F08BTF (ZGEQP3) may be followed by a call to F08ATF (ZUNGQR):

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 F08BTF (ZGEQP3).

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 complex rectangular matrix

C

, F08BTF (ZGEQP3) may be followed by a call to F08AUF (ZUNMQR). For example,

CALL ZUNMQR('Left','Conjugate Transpose',M,P,MIN(M,N),A,LDA,TAU, &
              C,LDC,WORK,LWORK,INFO)

forms

C = Q^{H} C

, where

C

m

p

To compute a

Q R

factorization without column pivoting, use F08ASF (ZGEQRF).

The real analogue of this routine is F08BFF (DGEQP3).

10 Example

This example solves the linear least squares problems

\min_{x} {‖b_{j} - A x_{j}‖}_{2}, j = 1, 2

for the basic solutions

x_{1}

and

x_{2}

, where

A = (\begin{array}{r} 0.47 - 0.34 i & - 0.40 + 0.54 i & 0.60 + 0.01 i & 0.80 - 1.02 i \\ - 0.32 - 0.23 i & - 0.05 + 0.20 i & - 0.26 - 0.44 i & - 0.43 + 0.17 i \\ 0.35 - 0.60 i & - 0.52 - 0.34 i & 0.87 - 0.11 i & - 0.34 - 0.09 i \\ 0.89 + 0.71 i & - 0.45 - 0.45 i & - 0.02 - 0.57 i & 1.14 - 0.78 i \\ - 0.19 + 0.06 i & 0.11 - 0.85 i & 1.44 + 0.80 i & 0.07 + 1.14 i \end{array})

and

B = (\begin{array}{r} - 1.08 - 2.59 i & 2.22 + 2.35 i \\ - 2.61 - 1.49 i & 1.62 - 1.48 i \\ 3.13 - 3.61 i & 1.65 + 3.43 i \\ 7.33 - 8.01 i & - 0.98 + 3.08 i \\ 9.12 + 7.63 i & - 2.84 + 2.78 i \end{array}) .

and

b_{j}

is the

j

th column of the matrix

B

. The solution is obtained by first obtaining a

Q R

factorization with column pivoting of the matrix

A

. A tolerance of

0.01

is used to estimate the rank of

A

from the upper triangular factor,

R

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.

NAG Library Routine DocumentF08BTF (ZGEQP3)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

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 Library Routine Document

F08BTF (ZGEQP3)