NAG FL Interface
f08bsf (zgeqpf)
1
Purpose
f08bsf computes the
$QR$ factorization, with column pivoting, of a complex
$m$ by
$n$ matrix.
f08bsf is marked as
deprecated by LAPACK; the replacement routine is
f08btf which makes better use of Level 3 BLAS.
2
Specification
Fortran Interface
Integer, Intent (In) 
:: 
m, n, lda 
Integer, Intent (Inout) 
:: 
jpvt(*) 
Integer, Intent (Out) 
:: 
info 
Real (Kind=nag_wp), Intent (Out) 
:: 
rwork(2*n) 
Complex (Kind=nag_wp), Intent (Inout) 
:: 
a(lda,*) 
Complex (Kind=nag_wp), Intent (Out) 
:: 
tau(min(m,n)), work(n) 

C Header Interface
#include <nag.h>
void 
f08bsf_ (const Integer *m, const Integer *n, Complex a[], const Integer *lda, Integer jpvt[], Complex tau[], Complex work[], double rwork[], Integer *info) 

C++ Header Interface
#include <nag.h> extern "C" {
void 
f08bsf_ (const Integer &m, const Integer &n, Complex a[], const Integer &lda, Integer jpvt[], Complex tau[], Complex work[], double rwork[], Integer &info) 
}

The routine may be called by the names f08bsf, nagf_lapackeig_zgeqpf or its LAPACK name zgeqpf.
3
Description
f08bsf 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:
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
which reduces to
where
${Q}_{1}$ consists of the first
$n$ columns of
$Q$, and
${Q}_{2}$ the remaining
$mn$ columns.
If
$m<n$,
$R$ is trapezoidal, and the factorization can be written
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 9).
Note also that for any
$k<n$, 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
Arguments

1:
$\mathbf{m}$ – Integer
Input

On entry: $m$, the number of rows of the matrix $A$.
Constraint:
${\mathbf{m}}\ge 0$.

2:
$\mathbf{n}$ – Integer
Input

On entry: $n$, the number of columns of the matrix $A$.
Constraint:
${\mathbf{n}}\ge 0$.

3:
$\mathbf{a}\left({\mathbf{lda}},*\right)$ – Complex (Kind=nag_wp) array
Input/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<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:
$\mathbf{lda}$ – Integer
Input

On entry: the first dimension of the array
a as declared in the (sub)program from which
f08bsf is called.
Constraint:
${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{m}}\right)$.

5:
$\mathbf{jpvt}\left(*\right)$ – Integer array
Input/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$, 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$, 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:
$\mathbf{tau}\left(\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{m}},{\mathbf{n}}\right)\right)$ – Complex (Kind=nag_wp) array
Output

On exit: further details of the unitary matrix $Q$.

7:
$\mathbf{work}\left({\mathbf{n}}\right)$ – Complex (Kind=nag_wp) array
Workspace


8:
$\mathbf{rwork}\left(2\times {\mathbf{n}}\right)$ – Real (Kind=nag_wp) array
Workspace


9:
$\mathbf{info}$ – Integer
Output
On exit:
${\mathbf{info}}=0$ unless the routine detects an error (see
Section 6).
6
Error Indicators and Warnings
 ${\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
and
$\epsilon $ is the
machine precision.
8
Parallelism and Performance
f08bsf 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 implementationspecific information.
The total number of real floatingpoint operations is approximately $\frac{8}{3}{n}^{2}\left(3mn\right)$ if $m\ge n$ or $\frac{8}{3}{m}^{2}\left(3nm\right)$ if $m<n$.
To form the unitary matrix
$Q$ f08bsf 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
f08bsf.
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 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
$C={Q}^{\mathrm{H}}C$, where
$C$ is
$m$ by
$p$.
To compute a
$QR$ factorization without column pivoting, use
f08asf.
The real analogue of this routine is
f08bef.
10
Example
This example solves the linear least squares problems
where
${b}_{1}$ and
${b}_{2}$ are the columns of the matrix
$B$,
and
Here
$A$ is approximately rankdeficient, and hence it is preferable to use
f08bsf rather than
f08asf.
10.1
Program Text
10.2
Program Data
10.3
Program Results