NAG Library Routine Document

F08AEF (DGEQRF)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

▸▿ 10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1 Purpose

F08AEF (DGEQRF) computes the

Q R

factorization of a real

m

n

matrix.

2 Specification

SUBROUTINE F08AEF (

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 dgeqrf.

3 Description

F08AEF (DGEQRF) forms the

Q R

factorization of an arbitrary rectangular real

m

n

matrix. No pivoting is performed.

m \geq n

, the factorization is given by:

A = Q (\begin{array}{r} R \\ 0 \end{array}),

where

R

is an

n

n

upper triangular matrix and

Q

is an

m

m

orthogonal matrix. It is sometimes more convenient to write the factorization as

A = (\begin{array}{r} Q_{1} & Q_{2} \end{array}) (\begin{array}{r} R \\ 0 \end{array}),

which reduces to

A = Q_{1} R,

where

Q_{1}

consists of the first

n

columns of

Q

, and

Q_{2}

the remaining

m - n

columns.

m < n

R

is trapezoidal, and the factorization can be written

A = Q (\begin{array}{r} R_{1} & R_{2} \end{array}),

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

\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

Q R

factorization of the first

k

columns of the original matrix

A

4 References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5 Parameters

1: $M$ – INTEGERInput: On entry: $m$ , the number of rows of the matrix $A$ .

Constraint: $M \geq 0$ .
2: $N$ – INTEGERInput: On entry: $n$ , the number of columns of the matrix $A$ .

Constraint: $N \geq 0$ .
3: $A (LDA *)$ – REAL (KIND=nag_wp) arrayInput/Output: Note: the second dimension of the array A must be at least $\max (1, N)$ .

On entry: the $m$ by $n$ matrix $A$ .

On exit: if $m \geq n$ , 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$ by $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$ by $n$ upper trapezoidal matrix $R$ .
4: $LDA$ – INTEGERInput: On entry: the first dimension of the array A as declared in the (sub)program from which F08AEF (DGEQRF) is called.

Constraint: $LDA \geq \max (1, M)$ .
5: $TAU (*)$ – REAL (KIND=nag_wp) arrayOutput: Note: the dimension of the array TAU must be at least $\max (1, \min (M, N))$ .

On exit: further details of the orthogonal matrix $Q$ .
6: $WORK (\max (1, LWORK))$ – REAL (KIND=nag_wp) arrayWorkspace: On exit: if $INFO = 0$ , $WORK (1)$ contains the minimum value of LWORK required for optimal performance.
7: $LWORK$ – INTEGERInput: On entry: the dimension of the array WORK as declared in the (sub)program from which F08AEF (DGEQRF) is called.
If $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, $LWORK \geq N \times nb$ , where $nb$ is the optimal block size.

Constraint: $LWORK \geq \max (1, N)$ or $LWORK = - 1$ .
8: $INFO$ – INTEGEROutput: On exit: $INFO = 0$ unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

$INFO < 0$: 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

{‖E‖}_{2} = O (ε) {‖A‖}_{2},

and

ε

is the machine precision.

8 Parallelism and Performance

F08AEF (DGEQRF) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

F08AEF (DGEQRF) 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} n^{2} (3 m - n)

m \geq n

\frac{2}{3} m^{2} (3 n - m)

m < n

To form the orthogonal matrix

Q

F08AEF (DGEQRF) may be followed by a call to F08AFF (DORGQR):

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 F08AEF (DGEQRF).

When

m \geq n

, 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 real rectangular matrix

C

, F08AEF (DGEQRF) may be followed by a call to F08AGF (DORMQR). For example,

CALL DORMQR('Left','Transpose',M,P,MIN(M,N),A,LDA,TAU,C,LDC,WORK, &
              LWORK,INFO)

forms

C = Q^{T} C

, where

C

m

p

To compute a

Q R

factorization with column pivoting, use F08BBF (DTPQRT) or F08BEF (DGEQPF).

The complex analogue of this routine is F08ASF (ZGEQRF).

10 Example

This example solves the linear least squares problems

minimize {‖A x_{i} - b_{i}‖}_{2}, i = 1, 2

where

b_{1}

and

b_{2}

are the columns of the matrix

B

A = (\begin{array}{r} - 0.57 & - 1.28 & - 0.39 & 0.25 \\ - 1.93 & 1.08 & - 0.31 & - 2.14 \\ 2.30 & 0.24 & 0.40 & - 0.35 \\ - 1.93 & 0.64 & - 0.66 & 0.08 \\ 0.15 & 0.30 & 0.15 & - 2.13 \\ - 0.02 & 1.03 & - 1.43 & 0.50 \end{array}) and B = (\begin{array}{r} - 3.15 & 2.19 \\ - 0.11 & - 3.64 \\ 1.99 & 0.57 \\ - 2.70 & 8.23 \\ 0.26 & - 6.35 \\ 4.50 & - 1.48 \end{array}) .

NAG Library Routine DocumentF08AEF (DGEQRF)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG Library Routine Document

F08AEF (DGEQRF)