1CGEQL2(1)                LAPACK routine (version 3.2)                CGEQL2(1)
2
3
4

NAME

6       CGEQL2 - computes a QL factorization of a complex m by n matrix A
7

SYNOPSIS

9       SUBROUTINE CGEQL2( M, N, A, LDA, TAU, WORK, INFO )
10
11           INTEGER        INFO, LDA, M, N
12
13           COMPLEX        A( LDA, * ), TAU( * ), WORK( * )
14

PURPOSE

16       CGEQL2  computes a QL factorization of a complex m by n matrix A: A = Q
17       * L.
18

ARGUMENTS

20       M       (input) INTEGER
21               The number of rows of the matrix A.  M >= 0.
22
23       N       (input) INTEGER
24               The number of columns of the matrix A.  N >= 0.
25
26       A       (input/output) COMPLEX array, dimension (LDA,N)
27               On entry, the m by n matrix A.  On exit, if m >= n,  the  lower
28               triangle  of  the  subarray  A(m-n+1:m,1:n) contains the n by n
29               lower triangular matrix L; if m <= n, the elements on and below
30               the (n-m)-th superdiagonal contain the m by n lower trapezoidal
31               matrix L; the remaining elements, with the array TAU, represent
32               the unitary matrix Q as a product of elementary reflectors (see
33               Further Details).  LDA     (input) INTEGER The  leading  dimen‐
34               sion of the array A.  LDA >= max(1,M).
35
36       TAU     (output) COMPLEX array, dimension (min(M,N))
37               The  scalar  factors  of the elementary reflectors (see Further
38               Details).
39
40       WORK    (workspace) COMPLEX array, dimension (N)
41
42       INFO    (output) INTEGER
43               = 0: successful exit
44               < 0: if INFO = -i, the i-th argument had an illegal value
45

FURTHER DETAILS

47       The matrix Q is represented as a product of elementary reflectors
48          Q = H(k) . . . H(2) H(1), where k = min(m,n).
49       Each H(i) has the form
50          H(i) = I - tau * v * v'
51       where tau is a complex scalar, and v is  a  complex  vector  with  v(m-
52       k+i+1:m) = 0 and v(m-k+i) = 1; v(1:m-k+i-1) is stored on exit in A(1:m-
53       k+i-1,n-k+i), and tau in TAU(i).
54
55
56
57 LAPACK routine (version 3.2)    November 2008                       CGEQL2(1)
Impressum