NAG FL Interface
f08bef (dgeqpf)

Note: this routine is deprecated. Replaced by f08bff.
Settings help

FL Name Style:

FL Specification Language:

1 Purpose

f08bef computes the QR factorization, with column pivoting, of a real m×n matrix. f08bef is marked as deprecated by LAPACK; the replacement routine is f08bff which makes better use of Level 3 BLAS.

2 Specification

Fortran Interface
Subroutine f08bef ( m, n, a, lda, jpvt, tau, work, info)
Integer, Intent (In) :: m, n, lda
Integer, Intent (Inout) :: jpvt(*)
Integer, Intent (Out) :: info
Real (Kind=nag_wp), Intent (Inout) :: a(lda,*)
Real (Kind=nag_wp), Intent (Out) :: tau(min(m,n)), work(3*n)
C Header Interface
#include <nag.h>
void  f08bef_ (const Integer *m, const Integer *n, double a[], const Integer *lda, Integer jpvt[], double tau[], double work[], Integer *info)
The routine may be called by the names f08bef, nagf_lapackeig_dgeqpf or its LAPACK name dgeqpf.

3 Description

f08bef forms the QR factorization, with column pivoting, of an arbitrary rectangular real m×n matrix.
If mn, the factorization is given by:
AP= Q ( R 0 ) ,  
where R is an n×n upper triangular matrix, Q is an m×m orthogonal matrix and P is an n×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 Q1 consists of the first n columns of Q, and Q2 the remaining m-n columns.
If m<n, R is trapezoidal, and the factorization can be written
AP= Q ( R1 R2 ) ,  
where R1 is upper triangular and R2 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 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 ith 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: m Integer Input
On entry: m, the number of rows of the matrix A.
Constraint: m0.
2: n Integer Input
On entry: n, the number of columns of the matrix A.
Constraint: n0.
3: a(lda,*) Real (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×n matrix A.
On exit: if mn, the elements below the diagonal are overwritten by details of the orthogonal matrix Q and the upper triangle is overwritten by the corresponding elements of the n×n upper triangular matrix R.
If m<n, the strictly lower triangular part is overwritten by details of the orthogonal matrix Q and the remaining elements are overwritten by the corresponding elements of the m×n upper trapezoidal matrix R.
4: lda Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f08bef is called.
Constraint: ldamax(1,m).
5: jpvt(*) Integer array Input/Output
Note: the dimension of the array jpvt must be at least max(1,n).
On entry: if jpvt(i)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 jpvt(i)=k, the kth 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 jpvt(1),jpvt(2),,jpvt(n).
6: tau(min(m,n)) Real (Kind=nag_wp) array Output
On exit: further details of the orthogonal matrix Q.
7: work(3×n) Real (Kind=nag_wp) array Workspace
8: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

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
E2 = O(ε) A2 ,  
and ε is the machine precision.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.
f08bef 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 floating-point operations is approximately 23 n2 (3m-n) if mn or 23 m2 (3n-m) if m<n.
To form the orthogonal matrix Q f08bef may be followed by a call to f08aff :
Call dorgqr(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 f08bef.
When mn, it is often only the first n columns of Q that are required, and they may be formed by the call:
Call dorgqr(m,n,n,a,lda,tau,work,lwork,info)
To apply Q to an arbitrary m×p real rectangular matrix C, f08bef may be followed by a call to f08agf . For example,
Call dormqr('Left','Transpose',m,p,min(m,n),a,lda,tau,c,ldc,work, &
forms the matrix product C=QTC.
To compute a QR factorization without column pivoting, use f08aef.
The complex analogue of this routine is f08bsf.

10 Example

This example finds the basic solutions for the linear least squares problems
minimizeAxi-bi2 ,   i=1,2  
where b1 and b2 are the columns of the matrix B,
A = ( -0.09 0.14 -0.46 0.68 1.29 -1.56 0.20 0.29 1.09 0.51 -1.48 -0.43 0.89 -0.71 -0.96 -1.09 0.84 0.77 2.11 -1.27 0.08 0.55 -1.13 0.14 1.74 -1.59 -0.72 1.06 1.24 0.34 )   and  B= ( -0.01 -0.04 0.04 -0.03 0.05 0.01 -0.03 -0.02 0.02 0.05 -0.06 0.07 ) .  
Here A is approximately rank-deficient, and hence it is preferable to use f08bef rather than f08aef.

10.1 Program Text

Program Text (f08befe.f90)

10.2 Program Data

Program Data (f08befe.d)

10.3 Program Results

Program Results (f08befe.r)