F08 Chapter Contents
F08 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF08BSF (ZGEQPF)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F08BSF (ZGEQPF) computes the $QR$ factorization, with column pivoting, of a complex $m$ by $n$ matrix.

## 2  Specification

 SUBROUTINE F08BSF ( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO)
 INTEGER M, N, LDA, JPVT(*), INFO REAL (KIND=nag_wp) RWORK(2*N) COMPLEX (KIND=nag_wp) A(LDA,*), TAU(min(M,N)), WORK(N)
The routine may be called by its LAPACK name zgeqpf.

## 3  Description

F08BSF (ZGEQPF) forms the $QR$ factorization, with column pivoting, of an arbitrary rectangular complex $m$ by $n$ matrix.
If $m\ge n$, the factorization is given by:
 $AP= Q R 0 ,$
where $R$ is an $n$ by $n$ upper triangular matrix (with real diagonal elements), $Q$ is an $m$ by $m$ unitary matrix and $P$ is an $n$ by $n$ permutation matrix. It is sometimes more convenient to write the factorization as
 $AP= Q1 Q2 R 0 ,$
which reduces to
 $AP= Q1 R ,$
where ${Q}_{1}$ consists of the first $n$ columns of $Q$, and ${Q}_{2}$ the remaining $m-n$ columns.
If $m, $R$ is trapezoidal, and the factorization can be written
 $AP= Q R1 R2 ,$
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 $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(m,n\right)$ elementary reflectors (see the F08 Chapter Introduction for details). Routines are provided to work with $Q$ in this representation (see Section 8).
Note also that for any $k, the information returned in the first $k$ columns of the array A represents a $QR$ factorization of the first $k$ columns of the permuted matrix $AP$.
The routine allows specified columns of $A$ to be moved to the leading columns of $AP$ 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$ to $m$ over columns $i$ to $n$.

## 4  References

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: ${\mathbf{M}}\ge 0$.
2:     N – INTEGERInput
On entry: $n$, the number of columns of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
3:     A(LDA,$*$) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array A must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the $m$ by $n$ matrix $A$.
On exit: if $m\ge 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, 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 F08BSF (ZGEQPF) is called.
Constraint: ${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{M}}\right)$.
5:     JPVT($*$) – INTEGER arrayInput/Output
Note: the dimension of the array JPVT must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: if ${\mathbf{JPVT}}\left(i\right)\ne 0$, then the $i$ th column of $A$ is moved to the beginning of $AP$ before the decomposition is computed and is fixed in place during the computation. Otherwise, the $i$ 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 ${\mathbf{JPVT}}\left(i\right)=k$, then the $k$th column of $A$ is moved to become the $i$ th column of $AP$; in other words, the columns of $AP$ are the columns of $A$ in the order ${\mathbf{JPVT}}\left(1\right),{\mathbf{JPVT}}\left(2\right),\dots ,{\mathbf{JPVT}}\left(n\right)$.
6:     TAU($\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{M}},{\mathbf{N}}\right)$) – COMPLEX (KIND=nag_wp) arrayOutput
On exit: further details of the unitary matrix $Q$.
7:     WORK(N) – COMPLEX (KIND=nag_wp) arrayWorkspace
8:     RWORK($2×{\mathbf{N}}$) – REAL (KIND=nag_wp) arrayWorkspace
9:     INFO – INTEGEROutput
On exit: ${\mathbf{INFO}}=0$ unless the routine detects an error (see Section 6).

## 6  Error Indicators and Warnings

Errors or warnings detected by the routine:
${\mathbf{INFO}}<0$
If ${\mathbf{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 $\left(A+E\right)$, where
 $E2 = Oε A2 ,$
and $\epsilon$ is the machine precision.

The total number of real floating point operations is approximately $\frac{8}{3}{n}^{2}\left(3m-n\right)$ if $m\ge n$ or $\frac{8}{3}{m}^{2}\left(3n-m\right)$ if $m.
To form the unitary matrix $Q$ F08BSF (ZGEQPF) 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 F08BSF (ZGEQPF).
When $m\ge 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$, F08BSF (ZGEQPF) 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}^{\mathrm{H}}C$, where $C$ is $m$ by $p$.
To compute a $QR$ factorization without column pivoting, use F08ASF (ZGEQRF).
The real analogue of this routine is F08BEF (DGEQPF).

## 9  Example

This example solves the linear least squares problems
 $minimize⁡ Axi - bi 2 , i=1,2$
where ${b}_{1}$ and ${b}_{2}$ are the columns of the matrix $B$,
 $A = 0.47-0.34i -0.40+0.54i 0.60+0.01i 0.80-1.02i -0.32-0.23i -0.05+0.20i -0.26-0.44i -0.43+0.17i 0.35-0.60i -0.52-0.34i 0.87-0.11i -0.34-0.09i 0.89+0.71i -0.45-0.45i -0.02-0.57i 1.14-0.78i -0.19+0.06i 0.11-0.85i 1.44+0.80i 0.07+1.14i$
and
 $B = -0.85-1.63i 2.49+4.01i -2.16+3.52i -0.14+7.98i 4.57-5.71i 8.36-0.28i 6.38-7.40i -3.55+1.29i 8.41+9.39i -6.72+5.03i .$
Here $A$ is approximately rank-deficient, and hence it is preferable to use F08BSF (ZGEQPF) rather than F08ASF (ZGEQRF).

### 9.1  Program Text

Program Text (f08bsfe.f90)

### 9.2  Program Data

Program Data (f08bsfe.d)

### 9.3  Program Results

Program Results (f08bsfe.r)