F08AHF (DGELQF) (PDF version)
F08 Chapter Contents
F08 Chapter Introduction
NAG Library Manual

NAG Library Routine DocumentF08AHF (DGELQF)

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

F08AHF (DGELQF) computes the $LQ$ factorization of a real $m$ by $n$ matrix.

2  Specification

 SUBROUTINE F08AHF ( M, N, A, LDA, TAU, WORK, LWORK, INFO)
 INTEGER M, N, LDA, LWORK, INFO REAL (KIND=nag_wp) A(LDA,*), TAU(*), WORK(max(1,LWORK))
The routine may be called by its LAPACK name dgelqf.

3  Description

F08AHF (DGELQF) forms the $LQ$ factorization of an arbitrary rectangular real $m$ by $n$ matrix. No pivoting is performed.
If $m\le n$, the factorization is given by:
 $A = L 0 Q$
where $L$ is an $m$ by $m$ lower triangular matrix and $Q$ is an $n$ by $n$ orthogonal matrix. It is sometimes more convenient to write the factorization as
 $A = L 0 Q1 Q2$
which reduces to
 $A = LQ1 ,$
where ${Q}_{1}$ consists of the first $m$ rows of $Q$, and ${Q}_{2}$ the remaining $n-m$ rows.
If $m>n$, $L$ is trapezoidal, and the factorization can be written
 $A = L1 L2 Q$
where ${L}_{1}$ is lower triangular and ${L}_{2}$ is rectangular.
The $LQ$ factorization of $A$ is essentially the same as the $QR$ factorization of ${A}^{\mathrm{T}}$, since
 $A = L 0 Q⇔AT= QT LT 0 .$
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, the information returned in the first $k$ rows of the array A represents an $LQ$ factorization of the first $k$ rows of the original matrix $A$.

None.

5  Arguments

1:     $\mathrm{M}$ – INTEGERInput
On entry: $m$, the number of rows of the matrix $A$.
Constraint: ${\mathbf{M}}\ge 0$.
2:     $\mathrm{N}$ – INTEGERInput
On entry: $n$, the number of columns of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
3:     $\mathrm{A}\left({\mathbf{LDA}},*\right)$ – REAL (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\le n$, the elements above the diagonal are overwritten by details of the orthogonal matrix $Q$ and the lower triangle is overwritten by the corresponding elements of the $m$ by $m$ lower triangular matrix $L$.
If $m>n$, the strictly upper triangular part is overwritten by details of the orthogonal matrix $Q$ and the remaining elements are overwritten by the corresponding elements of the $m$ by $n$ lower trapezoidal matrix $L$.
4:     $\mathrm{LDA}$ – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F08AHF (DGELQF) is called.
Constraint: ${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{M}}\right)$.
5:     $\mathrm{TAU}\left(*\right)$ – REAL (KIND=nag_wp) arrayOutput
Note: the dimension of the array TAU must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{M}},{\mathbf{N}}\right)\right)$.
On exit: further details of the orthogonal matrix $Q$.
6:     $\mathrm{WORK}\left(\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{LWORK}}\right)\right)$ – REAL (KIND=nag_wp) arrayWorkspace
On exit: if ${\mathbf{INFO}}={\mathbf{0}}$, ${\mathbf{WORK}}\left(1\right)$ contains the minimum value of LWORK required for optimal performance.
7:     $\mathrm{LWORK}$ – INTEGERInput
On entry: the dimension of the array WORK as declared in the (sub)program from which F08AHF (DGELQF) is called.
If ${\mathbf{LWORK}}=-1$, 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.
Suggested value: for optimal performance, ${\mathbf{LWORK}}\ge {\mathbf{M}}×\mathit{nb}$, where $\mathit{nb}$ is the optimal block size.
Constraint: ${\mathbf{LWORK}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{M}}\right)$ or ${\mathbf{LWORK}}=-1$.
8:     $\mathrm{INFO}$ – INTEGEROutput
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
 $E2 = Oε A2 ,$
and $\epsilon$ is the machine precision.

8  Parallelism and Performance

F08AHF (DGELQF) 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 $\frac{2}{3}{m}^{2}\left(3n-m\right)$ if $m\le n$ or $\frac{2}{3}{n}^{2}\left(3m-n\right)$ if $m>n$.
To form the orthogonal matrix $Q$ F08AHF (DGELQF) may be followed by a call to F08AJF (DORGLQ):
```CALL DORGLQ(N,N,MIN(M,N),A,LDA,TAU,WORK,LWORK,INFO)
```
but note that the first dimension of the array A, specified by the argument LDA, must be at least N, which may be larger than was required by F08AHF (DGELQF).
When $m\le n$, it is often only the first $m$ rows of $Q$ that are required, and they may be formed by the call:
```CALL DORGLQ(M,N,M,A,LDA,TAU,WORK,LWORK,INFO)
```
To apply $Q$ to an arbitrary real rectangular matrix $C$, F08AHF (DGELQF) may be followed by a call to F08AKF (DORMLQ). For example,
```CALL DORMLQ('Left','Transpose',M,P,MIN(M,N),A,LDA,TAU,C,LDC, &
WORK,LWORK,INFO)```
forms the matrix product $C={Q}^{\mathrm{T}}C$, where $C$ is $m$ by $p$.
The complex analogue of this routine is F08AVF (ZGELQF).

10  Example

This example finds the minimum norm solutions of the under-determined systems of linear equations
 $Ax1= b1 and Ax2= b2$
where ${b}_{1}$ and ${b}_{2}$ are the columns of the matrix $B$,
 $A = -5.42 3.28 -3.68 0.27 2.06 0.46 -1.65 -3.40 -3.20 -1.03 -4.06 -0.01 -0.37 2.35 1.90 4.31 -1.76 1.13 -3.15 -0.11 1.99 -2.70 0.26 4.50 and B= -2.87 -5.23 1.63 0.29 -3.52 4.76 0.45 -8.41 .$

10.1  Program Text

Program Text (f08ahfe.f90)

10.2  Program Data

Program Data (f08ahfe.d)

10.3  Program Results

Program Results (f08ahfe.r)

F08AHF (DGELQF) (PDF version)
F08 Chapter Contents
F08 Chapter Introduction
NAG Library Manual