NAG Library Routine Document

F07ADF (DGETRF)

+− Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Further Comments

+− 9 Example

9.1 Program Text

9.2 Program Data

9.3 Program Results

1 Purpose

F07ADF (DGETRF) computes the

L U

factorization of a real

m

n

matrix.

2 Specification

SUBROUTINE F07ADF (

M, N, A, LDA, IPIV, INFO)

INTEGER	M, N, LDA, IPIV(min(M,N)), INFO
REAL (KIND=nag_wp)	A(LDA,*)

The routine may be called by its LAPACK name dgetrf.

3 Description

F07ADF (DGETRF) forms the

L U

factorization of a real

m

n

matrix

A

A = P L U

, where

P

is a permutation matrix,

L

is lower triangular with unit diagonal elements (lower trapezoidal if

m > n

) and

U

is upper triangular (upper trapezoidal if

m < n

). Usually

A

is square

(m = n)

, and both

L

and

U

are triangular. The routine uses partial pivoting, with row interchanges.

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: the factors $L$ and $U$ from the factorization $A = P L U$ ; the unit diagonal elements of $L$ are not stored.
4: LDA – INTEGERInput: On entry: the first dimension of the array A as declared in the (sub)program from which F07ADF (DGETRF) is called.
Constraint: $LDA \geq \max (1, M)$ .
5: IPIV( $\min (M, N)$ ) – INTEGER arrayOutput: On exit: the pivot indices that define the permutation matrix. At the $i$ th step, if $IPIV (i) > i$ then row $i$ of the matrix $A$ was interchanged with row $IPIV (i)$ , for $i = 1, 2, \dots, \min (m, n)$ . $IPIV (i) \leq i$ indicates that, at the $i$ th step, a row interchange was not required.
6: INFO – INTEGEROutput: On exit: $INFO = 0$ unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

Errors or warnings detected by the routine:

$INFO < 0$: If $INFO = - i$ , the $i$ th parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.

$INFO > 0$: If $INFO = i$ , $U (i, i)$ is exactly zero. The factorization has been completed, but the factor $U$ is exactly singular, and division by zero will occur if it is used to solve a system of equations.

7 Accuracy

The computed factors

L

and

U

are the exact factors of a perturbed matrix

A + E

, where

|E| \leq c (\min (m, n)) ε P |L| |U|,

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

8 Further Comments

The total number of floating point operations is approximately

\frac{2}{3} n^{3}

m = n

(the usual case),

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

m > n

and

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

m < n

A call to this routine with

m = n

may be followed by calls to the routines:

F07AEF (DGETRS) to solve $A X = B$ or $A^{T} X = B$ ;
F07AGF (DGECON) to estimate the condition number of $A$ ;
F07AJF (DGETRI) to compute the inverse of $A$ .

The complex analogue of this routine is F07ARF (ZGETRF).

9 Example

This example computes the

L U

factorization of the matrix

A

, where

A = (\begin{matrix} 1.80 & 2.88 & 2.05 & - 0.89 \\ 5.25 & - 2.95 & - 0.95 & - 3.80 \\ 1.58 & - 2.69 & - 2.90 & - 1.04 \\ - 1.11 & - 0.66 & - 0.59 & 0.80 \end{matrix}) .

NAG Library Routine DocumentF07ADF (DGETRF)

+− Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Further Comments

9 Example

9.1 Program Text

9.2 Program Data

9.3 Program Results

NAG Library Routine Document

F07ADF (DGETRF)