NAG Library Function Document
nag_dgeqrf (f08aec)
1 Purpose
nag_dgeqrf (f08aec) computes the factorization of a real by matrix.
2 Specification
| #include <nag.h> |
| #include <nagf08.h> |
| void |
nag_dgeqrf (Nag_OrderType order,
Integer m,
Integer n,
double a[],
Integer pda,
double tau[],
NagError *fail) |
|
3 Description
nag_dgeqrf (f08aec) forms the factorization of an arbitrary rectangular real by matrix. No pivoting is performed.
If
, the factorization is given by:
where
is an
by
upper triangular matrix and
is an
by
orthogonal 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). Functions are provided to work with
in this representation (see
Section 8).
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 original matrix
.
4 References
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
5 Arguments
- 1:
order – Nag_OrderTypeInput
-
On entry: the
order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by
. See
Section 3.2.1.3 in the Essential Introduction for a more detailed explanation of the use of this argument.
Constraint:
or Nag_ColMajor.
- 2:
m – IntegerInput
-
On entry:
, the number of rows of the matrix .
Constraint:
.
- 3:
n – IntegerInput
-
On entry:
, the number of columns of the matrix .
Constraint:
.
- 4:
a[] – doubleInput/Output
-
Note: the dimension,
dim, of the array
a
must be at least
- when
;
- when
.
The
th element of the matrix
is stored in
- when ;
- when .
On entry: the by matrix .
On exit: if
, the elements below the diagonal are overwritten by details of the
orthogonal
matrix
and the upper triangle is overwritten by the corresponding elements of the
by
upper triangular matrix
.
If , the strictly lower triangular part is overwritten by details of the
orthogonal
matrix and the remaining elements are overwritten by the corresponding elements of the by upper trapezoidal matrix .
- 5:
pda – IntegerInput
-
On entry: the stride separating row or column elements (depending on the value of
order) in the array
a.
Constraints:
- if ,
;
- if , .
- 6:
tau[] – doubleOutput
-
Note: the dimension,
dim, of the array
tau
must be at least
.
On exit:
further details of the orthogonal matrix .
- 7:
fail – NagError *Input/Output
-
The NAG error argument (see
Section 3.6 in the Essential Introduction).
6 Error Indicators and Warnings
- NE_ALLOC_FAIL
Dynamic memory allocation failed.
- NE_BAD_PARAM
On entry, argument had an illegal value.
- NE_INT
On entry, .
Constraint: .
On entry, .
Constraint: .
On entry, .
Constraint: .
- NE_INT_2
On entry, and .
Constraint: .
On entry, and .
Constraint: .
- NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact
NAG for assistance.
7 Accuracy
The computed factorization is the exact factorization of a nearby matrix
, where
and
is the
machine precision.
The total number of floating point operations is approximately if or if .
To form the orthogonal matrix
nag_dgeqrf (f08aec) may be followed by a call to
nag_dorgqr (f08afc):
nag_dorgqr(order,m,m,MIN(m,n),&a,pda,tau,&fail)
but note that the second dimension of the array
a must be at least
m, which may be larger than was required by nag_dgeqrf (f08aec).
When
, it is often only the first
columns of
that are required, and they may be formed by the call:
nag_dorgqr(order,m,n,n,&a,pda,tau,&fail)
To apply
to an arbitrary real rectangular matrix
, nag_dgeqrf (f08aec) may be followed by a call to
nag_dormqr (f08agc). For example,
nag_dormqr(order,Nag_LeftSide,Nag_Trans,m,p,MIN(m,n),&a,pda,tau,
+ &c,pdc,&fail)
forms
, where
is
by
.
To compute a
factorization with column pivoting, use
nag_dgeqpf (f08bec).
The complex analogue of this function is
nag_zgeqrf (f08asc).
9 Example
This example solves the linear least squares problems
where
and
are the columns of the matrix
,
9.1 Program Text
Program Text (f08aece.c)
9.2 Program Data
Program Data (f08aece.d)
9.3 Program Results
Program Results (f08aece.r)