Developer Reference

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

p?geql2

Computes a QL factorization of a general rectangular matrix (unblocked algorithm).

Syntax

call psgeql2
(
m
,
n
,
a
,
ia
,
ja
,
desca
,
tau
,
work
,
lwork
,
info
)
call pdgeql2
(
m
,
n
,
a
,
ia
,
ja
,
desca
,
tau
,
work
,
lwork
,
info
)
call pcgeql2
(
m
,
n
,
a
,
ia
,
ja
,
desca
,
tau
,
work
,
lwork
,
info
)
call pzgeql2
(
m
,
n
,
a
,
ia
,
ja
,
desca
,
tau
,
work
,
lwork
,
info
)
Description
The
p?geql2
routine
computes a
QL
factorization of a real/complex distributed
m
-by-
n
matrix
sub(
A
) =
A
(
ia
:
ia
+
m
-1,
ja
:
ja
+
n
-1)=
Q
*
L
.
Input Parameters
m
(global)
INTEGER
.
The number of rows in the distributed matrix sub(
A
).
(
m
0)
.
n
(global)
INTEGER
.
The number of columns in the distributed matrix sub(
A
).
(
n
0)
.
a
(local).
REAL
for
psgeql2
DOUBLE PRECISION
for
pdgeql2
COMPLEX
for
pcgeql2
COMPLEX*16
for
pzgeql2
.
Pointer into the local memory to an array of size
(
lld_a
,
LOC
c
(
ja
+
n
-1))
.
On entry, this array contains the local pieces of the
m
-by-
n
distributed matrix sub(
A
) which is to be factored.
ia
,
ja
(global)
INTEGER
.
The row and column indices in the global matrix
A
indicating the first row and the first column of sub(
A
), respectively.
desca
(global and local)
INTEGER
array of size
dlen_
. The array descriptor for the distributed matrix A.
work
(local).
REAL
for
psgeql2
DOUBLE PRECISION
for
pdgeql2
COMPLEX
for
pcgeql2
COMPLEX*16
for
pzgeql2
.
This is a workspace array of size
lwork
.