The routine may be called by the names f08btf, nagf_lapackeig_zgeqp3 or its LAPACK name zgeqp3.
f08btf forms the factorization, with column pivoting, of an arbitrary rectangular complex matrix.
If , the factorization is given by:
where is an upper triangular matrix (with real diagonal elements), is an unitary matrix and is an permutation matrix. It is sometimes more convenient to write the factorization as
which reduces to
where consists of the first columns of , and the remaining columns.
If , is trapezoidal, and the factorization can be written
where is upper triangular and is rectangular.
The matrix 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 represents 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 .
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 https://www.netlib.org/lapack/lug
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
Note: the second dimension of the array a
must be at least
On entry: the matrix .
On exit: if , 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 upper trapezoidal matrix .
The diagonal elements of are real.
4: – IntegerInput
On entry: the first dimension of the array a as declared in the (sub)program from which f08btf is called.
5: – Integer arrayInput/Output
Note: 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
Note: the dimension of the array tau
must be at least
On exit: further details of the unitary matrix .
7: – Complex (Kind=nag_wp) arrayWorkspace
On exit: if , the real part of contains the minimum value of lwork required for optimal performance.
8: – IntegerInput
On entry: the dimension of the array work as declared in the (sub)program from which f08btf is called.
If , 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.
for optimal performance, , where is the optimal block size.
9: – Real (Kind=nag_wp) arrayWorkspace
Note: the dimension of the array rwork
must be at least
10: – IntegerOutput
On exit: unless the routine detects an error (see Section 6).
6Error 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 , where
and is the machine precision.
8Parallelism and Performance
f08btf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08btf 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 f08btf may be followed by a call to f08atf
This example solves the linear least squares problems
for the basic solutions and , where
and is the th column of the matrix . The solution is obtained by first obtaining a factorization with column pivoting of the matrix . A tolerance of is used to estimate the rank of from the upper triangular factor, .
Note that the block size (NB) of assumed in this example is not realistic for such a small problem, but should be suitable for large problems.