NAG Library Routine Document
f08bsf (zgeqpf) computes the factorization, with column pivoting, of a complex by matrix.
|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
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 its
f08bsf (zgeqpf) forms the factorization, with column pivoting, of an arbitrary rectangular complex by matrix.
, the factorization is given by:
upper triangular matrix (with real diagonal elements),
unitary matrix and
permutation matrix. It is sometimes more convenient to write the factorization as
which reduces to
consists of the first
is trapezoidal, and the factorization can be written
is upper triangular and
is not formed explicitly but is represented as a product of
elementary reflectors (see the F08 Chapter Introduction
for details). Routines are provided to work with
in this representation (see Section 9
Note also that for any
, the information returned in the first
columns of the array a
factorization of the first
columns of the permuted matrix
The routine allows specified columns of to be moved to the leading columns of at the start of the factorization and fixed there. The remaining columns are free to be interchanged so that at the th stage the pivot column is chosen to be the column which maximizes the -norm of elements to over columns to .
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
- 1: – IntegerInput
On entry: , the number of rows of the matrix .
- 2: – IntegerInput
On entry: , the number of columns of the matrix .
- 3: – Complex (Kind=nag_wp) arrayInput/Output
the second dimension of the array a
must be at least
On entry: the by matrix .
, the elements below the diagonal are overwritten by details of the unitary matrix
and the upper triangle is overwritten by the corresponding elements of the
upper triangular matrix
If , the strictly lower triangular part is overwritten by details of the unitary matrix and the remaining elements are overwritten by the corresponding elements of the by upper trapezoidal matrix .
The diagonal elements of are real.
- 4: – IntegerInput
: the first dimension of the array a
as declared in the (sub)program from which f08bsf (zgeqpf)
- 5: – Integer arrayInput/Output
the dimension of the array jpvt
must be at least
On entry: if , the th column of is moved to the beginning of before the decomposition is computed and is fixed in place during the computation. Otherwise, the th column of 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 . More precisely, if , the th column of is moved to become the th column of ; in other words, the columns of are the columns of in the order .
- 6: – Complex (Kind=nag_wp) arrayOutput
On exit: further details of the unitary matrix .
- 7: – Complex (Kind=nag_wp) arrayWorkspace
- 8: – Real (Kind=nag_wp) arrayWorkspace
- 9: – IntegerOutput
unless the routine detects an error (see Section 6
Error Indicators and Warnings
If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
The computed factorization is the exact factorization of a nearby matrix
is the machine precision
Parallelism and Performance
f08bsf (zgeqpf) 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.
The total number of real floating-point operations is approximately if or if .
To form the unitary matrix f08bsf (zgeqpf)
may be followed by a call to f08atf (zungqr)
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)
, it is often only the first
that are required, and they may be formed by the call:
to an arbitrary complex rectangular matrix
, 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, &
To compute a
factorization without column pivoting, use f08asf (zgeqrf)
The real analogue of this routine is f08bef (dgeqpf)
This example solves the linear least squares problems
are the columns of the matrix
is approximately rank-deficient, and hence it is preferable to use f08bsf (zgeqpf)
rather than f08asf (zgeqrf)
Program Text (f08bsfe.f90)
Program Data (f08bsfe.d)
Program Results (f08bsfe.r)