## Developer Reference

• 2020.2
• 07/15/2020
• Public Content
Contents

# ?geqrfp

Computes the QR factorization of a general m-by-n matrix with non-negative diagonal elements.

## Syntax

Include Files
• mkl.fi
Description
The routine forms the
QR
factorization of a general
m
-by-
n
matrix
A
(see Orthogonal Factorizations). No pivoting is performed. The diagonal entries of
R
are real and nonnegative.
The routine does not form the matrix
Q
Q
is represented as a product of min(
m
,
n
) elementary reflectors. Routines are provided to work with
Q
in this representation.
This routine supports the Progress Routine feature. See Progress Function for details.
Input Parameters
m
INTEGER
.
The number of rows in the matrix
A
(
m
0
).
n
INTEGER
.
The number of columns in
A
(
n
0
).
a
,
work
REAL
for
sgeqrfp
DOUBLE PRECISION
for
dgeqrfp
COMPLEX
for
cgeqrfp
DOUBLE COMPLEX
for
zgeqrfp
.
Arrays:
a
(
lda
,*) contains the matrix
A
. The second dimension of
a
must be at least max(1,
n
).
work
is a workspace array, its dimension
max(1,
lwork
)
.
lda
INTEGER
.
a
; at least max(1,
m
).
lwork
INTEGER
.
The size of the
work
array (
lwork
n
).
If
lwork
= -1
, then 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 by xerbla.
See Application Notes for the suggested value of
lwork
.
Output Parameters
a
Overwritten by the factorization data as follows:
The elements on and above the diagonal of the array contain the min(
m
,
n
)-by-
n
upper trapezoidal matrix
R
(
R
is upper triangular if
m
n
); the elements below the diagonal, with the array
tau
, present the orthogonal matrix
Q
as a product of min(
m
,
n
) elementary reflectors (see Orthogonal Factorizations).