/* Subroutine */ int cungql_(integer *m, integer *n, integer *k, complex *a,
integer *lda, complex *tau, complex *work, integer *lwork, integer *
info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5;
/* Local variables */
integer i__, j, l, ib, nb, kk, nx, iws, nbmin, iinfo;
extern /* Subroutine */ int cung2l_(integer *, integer *, integer *,
complex *, integer *, complex *, complex *, integer *), clarfb_(
char *, char *, char *, char *, integer *, integer *, integer *,
complex *, integer *, complex *, integer *, complex *, integer *,
complex *, integer *), clarft_(
char *, char *, integer *, integer *, complex *, integer *,
complex *, complex *, integer *), xerbla_(char *,
integer *);
extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
integer *, integer *);
integer ldwork, lwkopt;
logical lquery;
/* -- LAPACK routine (version 3.1) -- */
/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
/* November 2006 */
/* .. Scalar Arguments .. */
/* .. */
/* .. Array Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* CUNGQL generates an M-by-N complex matrix Q with orthonormal columns, */
/* which is defined as the last N columns of a product of K elementary */
/* reflectors of order M */
/* Q = H(k) . . . H(2) H(1) */
/* as returned by CGEQLF. */
/* Arguments */
/* ========= */
/* M (input) INTEGER */
/* The number of rows of the matrix Q. M >= 0. */
/* N (input) INTEGER */
/* The number of columns of the matrix Q. M >= N >= 0. */
/* K (input) INTEGER */
/* The number of elementary reflectors whose product defines the */
/* matrix Q. N >= K >= 0. */
/* A (input/output) COMPLEX array, dimension (LDA,N) */
/* On entry, the (n-k+i)-th column must contain the vector which */
/* defines the elementary reflector H(i), for i = 1,2,...,k, as */
/* returned by CGEQLF in the last k columns of its array */
/* argument A. */
/* On exit, the M-by-N matrix Q. */
/* LDA (input) INTEGER */
/* The first dimension of the array A. LDA >= max(1,M). */
/* TAU (input) COMPLEX array, dimension (K) */
/* TAU(i) must contain the scalar factor of the elementary */
/* reflector H(i), as returned by CGEQLF. */
/* WORK (workspace/output) COMPLEX array, dimension (MAX(1,LWORK)) */
/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* LWORK (input) INTEGER */
/* The dimension of the array WORK. LWORK >= max(1,N). */
/* For optimum performance LWORK >= N*NB, where NB is the */
/* optimal blocksize. */
/* 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. */
/* INFO (output) INTEGER */
/* = 0: successful exit */
/* < 0: if INFO = -i, the i-th argument has an illegal value */
/* ===================================================================== */
/* .. Parameters .. */
/* .. */
/* .. Local Scalars .. */
/* .. */
/* .. External Subroutines .. */
/* .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. External Functions .. */
/* .. */
/* .. Executable Statements .. */
/* Test the input arguments */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1;
a -= a_offset;
--tau;
--work;
/* Function Body */
*info = 0;
lquery = *lwork == -1;
if (*m < 0) {
*info = -1;
} else if (*n < 0 || *n > *m) {
*info = -2;
} else if (*k < 0 || *k > *n) {
*info = -3;
} else if (*lda < max(1,*m)) {
*info = -5;
}
if (*info == 0) {
if (*n == 0) {
lwkopt = 1;
} else {
nb = ilaenv_(&c__1, "CUNGQL", " ", m, n, k, &c_n1);
lwkopt = *n * nb;
}
work[1].r = (real) lwkopt, work[1].i = 0.f;
if (*lwork < max(1,*n) && ! lquery) {
*info = -8;
}
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("CUNGQL", &i__1);
return 0;
} else if (lquery) {
return 0;
}
/* Quick return if possible */
if (*n <= 0) {
return 0;
}
nbmin = 2;
nx = 0;
iws = *n;
if (nb > 1 && nb < *k) {
/* Determine when to cross over from blocked to unblocked code. */
/* Computing MAX */
i__1 = 0, i__2 = ilaenv_(&c__3, "CUNGQL", " ", m, n, k, &c_n1);
nx = max(i__1,i__2);
if (nx < *k) {
/* Determine if workspace is large enough for blocked code. */
ldwork = *n;
iws = ldwork * nb;
if (*lwork < iws) {
/* Not enough workspace to use optimal NB: reduce NB and */
/* determine the minimum value of NB. */
nb = *lwork / ldwork;
/* Computing MAX */
i__1 = 2, i__2 = ilaenv_(&c__2, "CUNGQL", " ", m, n, k, &c_n1);
nbmin = max(i__1,i__2);
}
}
}
if (nb >= nbmin && nb < *k && nx < *k) {
/* Use blocked code after the first block. */
/* The last kk columns are handled by the block method. */
/* Computing MIN */
i__1 = *k, i__2 = (*k - nx + nb - 1) / nb * nb;
kk = min(i__1,i__2);
/* Set A(m-kk+1:m,1:n-kk) to zero. */
i__1 = *n - kk;
for (j = 1; j <= i__1; ++j) {
i__2 = *m;
for (i__ = *m - kk + 1; i__ <= i__2; ++i__) {
i__3 = i__ + j * a_dim1;
a[i__3].r = 0.f, a[i__3].i = 0.f;
/* L10: */
}
/* L20: */
}
} else {
kk = 0;
}
/* Use unblocked code for the first or only block. */
i__1 = *m - kk;
i__2 = *n - kk;
i__3 = *k - kk;
cung2l_(&i__1, &i__2, &i__3, &a[a_offset], lda, &tau[1], &work[1], &iinfo)
;
if (kk > 0) {
/* Use blocked code */
i__1 = *k;
i__2 = nb;
for (i__ = *k - kk + 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ +=
i__2) {
/* Computing MIN */
i__3 = nb, i__4 = *k - i__ + 1;
ib = min(i__3,i__4);
if (*n - *k + i__ > 1) {
/* Form the triangular factor of the block reflector */
/* H = H(i+ib-1) . . . H(i+1) H(i) */
i__3 = *m - *k + i__ + ib - 1;
clarft_("Backward", "Columnwise", &i__3, &ib, &a[(*n - *k +
i__) * a_dim1 + 1], lda, &tau[i__], &work[1], &ldwork);
/* Apply H to A(1:m-k+i+ib-1,1:n-k+i-1) from the left */
i__3 = *m - *k + i__ + ib - 1;
i__4 = *n - *k + i__ - 1;
clarfb_("Left", "No transpose", "Backward", "Columnwise", &
i__3, &i__4, &ib, &a[(*n - *k + i__) * a_dim1 + 1],
lda, &work[1], &ldwork, &a[a_offset], lda, &work[ib +
1], &ldwork);
}
/* Apply H to rows 1:m-k+i+ib-1 of current block */
i__3 = *m - *k + i__ + ib - 1;
cung2l_(&i__3, &ib, &ib, &a[(*n - *k + i__) * a_dim1 + 1], lda, &
tau[i__], &work[1], &iinfo);
/* Set rows m-k+i+ib:m of current block to zero */
i__3 = *n - *k + i__ + ib - 1;
for (j = *n - *k + i__; j <= i__3; ++j) {
i__4 = *m;
for (l = *m - *k + i__ + ib; l <= i__4; ++l) {
i__5 = l + j * a_dim1;
a[i__5].r = 0.f, a[i__5].i = 0.f;
/* L30: */
}
/* L40: */
}
/* L50: */
}
}
work[1].r = (real) iws, work[1].i = 0.f;
return 0;
/* End of CUNGQL */
} /* cungql_ */
/* Subroutine */ int cupgtr_(char *uplo, integer *n, complex *ap, complex *
tau, complex *q, integer *ldq, complex *work, integer *info)
{
/* -- LAPACK routine (version 2.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
September 30, 1994
Purpose
=======
CUPGTR generates a complex unitary matrix Q which is defined as the
product of n-1 elementary reflectors H(i) of order n, as returned by
CHPTRD using packed storage:
if UPLO = 'U', Q = H(n-1) . . . H(2) H(1),
if UPLO = 'L', Q = H(1) H(2) . . . H(n-1).
Arguments
=========
UPLO (input) CHARACTER*1
= 'U': Upper triangular packed storage used in previous
call to CHPTRD;
= 'L': Lower triangular packed storage used in previous
call to CHPTRD.
N (input) INTEGER
The order of the matrix Q. N >= 0.
AP (input) COMPLEX array, dimension (N*(N+1)/2)
The vectors which define the elementary reflectors, as
returned by CHPTRD.
TAU (input) COMPLEX array, dimension (N-1)
TAU(i) must contain the scalar factor of the elementary
reflector H(i), as returned by CHPTRD.
Q (output) COMPLEX array, dimension (LDQ,N)
The N-by-N unitary matrix Q.
LDQ (input) INTEGER
The leading dimension of the array Q. LDQ >= max(1,N).
WORK (workspace) COMPLEX array, dimension (N-1)
INFO (output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
=====================================================================
Test the input arguments
Parameter adjustments
Function Body */
/* System generated locals */
integer q_dim1, q_offset, i__1, i__2, i__3, i__4;
/* Local variables */
static integer i, j;
extern logical lsame_(char *, char *);
static integer iinfo;
static logical upper;
extern /* Subroutine */ int cung2l_(integer *, integer *, integer *,
complex *, integer *, complex *, complex *, integer *), cung2r_(
integer *, integer *, integer *, complex *, integer *, complex *,
complex *, integer *);
static integer ij;
extern /* Subroutine */ int xerbla_(char *, integer *);
#define AP(I) ap[(I)-1]
#define TAU(I) tau[(I)-1]
#define WORK(I) work[(I)-1]
#define Q(I,J) q[(I)-1 + ((J)-1)* ( *ldq)]
*info = 0;
upper = lsame_(uplo, "U");
if (! upper && ! lsame_(uplo, "L")) {
*info = -1;
} else if (*n < 0) {
*info = -2;
} else if (*ldq < max(1,*n)) {
*info = -6;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("CUPGTR", &i__1);
return 0;
}
/* Quick return if possible */
if (*n == 0) {
return 0;
}
if (upper) {
/* Q was determined by a call to CHPTRD with UPLO = 'U'
Unpack the vectors which define the elementary reflectors an
d
set the last row and column of Q equal to those of the unit
matrix */
ij = 2;
i__1 = *n - 1;
for (j = 1; j <= *n-1; ++j) {
i__2 = j - 1;
for (i = 1; i <= j-1; ++i) {
i__3 = i + j * q_dim1;
i__4 = ij;
Q(i,j).r = AP(ij).r, Q(i,j).i = AP(ij).i;
++ij;
/* L10: */
}
ij += 2;
i__2 = *n + j * q_dim1;
Q(*n,j).r = 0.f, Q(*n,j).i = 0.f;
/* L20: */
}
i__1 = *n - 1;
for (i = 1; i <= *n-1; ++i) {
i__2 = i + *n * q_dim1;
Q(i,*n).r = 0.f, Q(i,*n).i = 0.f;
/* L30: */
}
i__1 = *n + *n * q_dim1;
Q(*n,*n).r = 1.f, Q(*n,*n).i = 0.f;
/* Generate Q(1:n-1,1:n-1) */
i__1 = *n - 1;
i__2 = *n - 1;
i__3 = *n - 1;
cung2l_(&i__1, &i__2, &i__3, &Q(1,1), ldq, &TAU(1), &WORK(1), &
iinfo);
} else {
/* Q was determined by a call to CHPTRD with UPLO = 'L'.
Unpack the vectors which define the elementary reflectors an
d
set the first row and column of Q equal to those of the unit
matrix */
i__1 = q_dim1 + 1;
Q(1,1).r = 1.f, Q(1,1).i = 0.f;
i__1 = *n;
for (i = 2; i <= *n; ++i) {
i__2 = i + q_dim1;
Q(i,1).r = 0.f, Q(i,1).i = 0.f;
/* L40: */
}
ij = 3;
i__1 = *n;
for (j = 2; j <= *n; ++j) {
i__2 = j * q_dim1 + 1;
Q(1,j).r = 0.f, Q(1,j).i = 0.f;
i__2 = *n;
for (i = j + 1; i <= *n; ++i) {
i__3 = i + j * q_dim1;
i__4 = ij;
Q(i,j).r = AP(ij).r, Q(i,j).i = AP(ij).i;
++ij;
/* L50: */
}
ij += 2;
/* L60: */
}
if (*n > 1) {
/* Generate Q(2:n,2:n) */
i__1 = *n - 1;
i__2 = *n - 1;
i__3 = *n - 1;
cung2r_(&i__1, &i__2, &i__3, &Q(2,2), ldq, &TAU(1),
&WORK(1), &iinfo);
}
}
return 0;
/* End of CUPGTR */
} /* cupgtr_ */
/* Subroutine */ int cerrql_(char *path, integer *nunit)
{
/* System generated locals */
integer i__1;
real r__1, r__2;
complex q__1;
/* Builtin functions */
integer s_wsle(cilist *), e_wsle(void);
/* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen);
/* Local variables */
complex a[4] /* was [2][2] */, b[2];
integer i__, j;
complex w[2], x[2], af[4] /* was [2][2] */;
integer info;
extern /* Subroutine */ int cgeql2_(integer *, integer *, complex *,
integer *, complex *, complex *, integer *), cung2l_(integer *,
integer *, integer *, complex *, integer *, complex *, complex *,
integer *), cunm2l_(char *, char *, integer *, integer *, integer
*, complex *, integer *, complex *, complex *, integer *, complex
*, integer *), cgeqlf_(integer *, integer *,
complex *, integer *, complex *, complex *, integer *, integer *),
alaesm_(char *, logical *, integer *), cgeqls_(integer *,
integer *, integer *, complex *, integer *, complex *, complex *,
integer *, complex *, integer *, integer *), chkxer_(char *,
integer *, integer *, logical *, logical *), cungql_(
integer *, integer *, integer *, complex *, integer *, complex *,
complex *, integer *, integer *), cunmql_(char *, char *, integer
*, integer *, integer *, complex *, integer *, complex *, complex
*, integer *, complex *, integer *, integer *);
/* Fortran I/O blocks */
static cilist io___1 = { 0, 0, 0, 0, 0 };
/* -- LAPACK test routine (version 3.1) -- */
/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
/* November 2006 */
/* .. Scalar Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* CERRQL tests the error exits for the COMPLEX routines */
/* that use the QL decomposition of a general matrix. */
/* Arguments */
/* ========= */
/* PATH (input) CHARACTER*3 */
/* The LAPACK path name for the routines to be tested. */
/* NUNIT (input) INTEGER */
/* The unit number for output. */
/* ===================================================================== */
/* .. Parameters .. */
/* .. */
/* .. Local Scalars .. */
/* .. */
/* .. Local Arrays .. */
/* .. */
/* .. External Subroutines .. */
/* .. */
/* .. Scalars in Common .. */
/* .. */
/* .. Common blocks .. */
/* .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. Executable Statements .. */
infoc_1.nout = *nunit;
io___1.ciunit = infoc_1.nout;
s_wsle(&io___1);
e_wsle();
/* Set the variables to innocuous values. */
for (j = 1; j <= 2; ++j) {
for (i__ = 1; i__ <= 2; ++i__) {
i__1 = i__ + (j << 1) - 3;
r__1 = 1.f / (real) (i__ + j);
r__2 = -1.f / (real) (i__ + j);
q__1.r = r__1, q__1.i = r__2;
a[i__1].r = q__1.r, a[i__1].i = q__1.i;
i__1 = i__ + (j << 1) - 3;
r__1 = 1.f / (real) (i__ + j);
r__2 = -1.f / (real) (i__ + j);
q__1.r = r__1, q__1.i = r__2;
af[i__1].r = q__1.r, af[i__1].i = q__1.i;
/* L10: */
}
i__1 = j - 1;
b[i__1].r = 0.f, b[i__1].i = 0.f;
i__1 = j - 1;
w[i__1].r = 0.f, w[i__1].i = 0.f;
i__1 = j - 1;
x[i__1].r = 0.f, x[i__1].i = 0.f;
/* L20: */
}
infoc_1.ok = TRUE_;
/* Error exits for QL factorization */
/* CGEQLF */
s_copy(srnamc_1.srnamt, "CGEQLF", (ftnlen)32, (ftnlen)6);
infoc_1.infot = 1;
cgeqlf_(&c_n1, &c__0, a, &c__1, b, w, &c__1, &info);
chkxer_("CGEQLF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cgeqlf_(&c__0, &c_n1, a, &c__1, b, w, &c__1, &info);
chkxer_("CGEQLF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 4;
cgeqlf_(&c__2, &c__1, a, &c__1, b, w, &c__1, &info);
chkxer_("CGEQLF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 7;
cgeqlf_(&c__1, &c__2, a, &c__1, b, w, &c__1, &info);
chkxer_("CGEQLF", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
/* CGEQL2 */
s_copy(srnamc_1.srnamt, "CGEQL2", (ftnlen)32, (ftnlen)6);
infoc_1.infot = 1;
cgeql2_(&c_n1, &c__0, a, &c__1, b, w, &info);
chkxer_("CGEQL2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cgeql2_(&c__0, &c_n1, a, &c__1, b, w, &info);
chkxer_("CGEQL2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 4;
cgeql2_(&c__2, &c__1, a, &c__1, b, w, &info);
chkxer_("CGEQL2", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
/* CGEQLS */
s_copy(srnamc_1.srnamt, "CGEQLS", (ftnlen)32, (ftnlen)6);
infoc_1.infot = 1;
cgeqls_(&c_n1, &c__0, &c__0, a, &c__1, x, b, &c__1, w, &c__1, &info);
chkxer_("CGEQLS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cgeqls_(&c__0, &c_n1, &c__0, a, &c__1, x, b, &c__1, w, &c__1, &info);
chkxer_("CGEQLS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cgeqls_(&c__1, &c__2, &c__0, a, &c__1, x, b, &c__1, w, &c__1, &info);
chkxer_("CGEQLS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 3;
cgeqls_(&c__0, &c__0, &c_n1, a, &c__1, x, b, &c__1, w, &c__1, &info);
chkxer_("CGEQLS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cgeqls_(&c__2, &c__1, &c__0, a, &c__1, x, b, &c__2, w, &c__1, &info);
chkxer_("CGEQLS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 8;
cgeqls_(&c__2, &c__1, &c__0, a, &c__2, x, b, &c__1, w, &c__1, &info);
chkxer_("CGEQLS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 10;
cgeqls_(&c__1, &c__1, &c__2, a, &c__1, x, b, &c__1, w, &c__1, &info);
chkxer_("CGEQLS", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
/* CUNGQL */
s_copy(srnamc_1.srnamt, "CUNGQL", (ftnlen)32, (ftnlen)6);
infoc_1.infot = 1;
cungql_(&c_n1, &c__0, &c__0, a, &c__1, x, w, &c__1, &info);
chkxer_("CUNGQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cungql_(&c__0, &c_n1, &c__0, a, &c__1, x, w, &c__1, &info);
chkxer_("CUNGQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cungql_(&c__1, &c__2, &c__0, a, &c__1, x, w, &c__2, &info);
chkxer_("CUNGQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 3;
cungql_(&c__0, &c__0, &c_n1, a, &c__1, x, w, &c__1, &info);
chkxer_("CUNGQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 3;
cungql_(&c__1, &c__1, &c__2, a, &c__1, x, w, &c__1, &info);
chkxer_("CUNGQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cungql_(&c__2, &c__1, &c__0, a, &c__1, x, w, &c__1, &info);
chkxer_("CUNGQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 8;
cungql_(&c__2, &c__2, &c__0, a, &c__2, x, w, &c__1, &info);
chkxer_("CUNGQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
/* CUNG2L */
s_copy(srnamc_1.srnamt, "CUNG2L", (ftnlen)32, (ftnlen)6);
infoc_1.infot = 1;
cung2l_(&c_n1, &c__0, &c__0, a, &c__1, x, w, &info);
chkxer_("CUNG2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cung2l_(&c__0, &c_n1, &c__0, a, &c__1, x, w, &info);
chkxer_("CUNG2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cung2l_(&c__1, &c__2, &c__0, a, &c__1, x, w, &info);
chkxer_("CUNG2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 3;
cung2l_(&c__0, &c__0, &c_n1, a, &c__1, x, w, &info);
chkxer_("CUNG2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 3;
cung2l_(&c__2, &c__1, &c__2, a, &c__2, x, w, &info);
chkxer_("CUNG2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cung2l_(&c__2, &c__1, &c__0, a, &c__1, x, w, &info);
chkxer_("CUNG2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
/* CUNMQL */
s_copy(srnamc_1.srnamt, "CUNMQL", (ftnlen)32, (ftnlen)6);
infoc_1.infot = 1;
cunmql_("/", "N", &c__0, &c__0, &c__0, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cunmql_("L", "/", &c__0, &c__0, &c__0, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 3;
cunmql_("L", "N", &c_n1, &c__0, &c__0, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 4;
cunmql_("L", "N", &c__0, &c_n1, &c__0, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cunmql_("L", "N", &c__0, &c__0, &c_n1, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cunmql_("L", "N", &c__0, &c__1, &c__1, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cunmql_("R", "N", &c__1, &c__0, &c__1, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 7;
cunmql_("L", "N", &c__2, &c__1, &c__0, a, &c__1, x, af, &c__2, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 7;
cunmql_("R", "N", &c__1, &c__2, &c__0, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 10;
cunmql_("L", "N", &c__2, &c__1, &c__0, a, &c__2, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 12;
cunmql_("L", "N", &c__1, &c__2, &c__0, a, &c__1, x, af, &c__1, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 12;
cunmql_("R", "N", &c__2, &c__1, &c__0, a, &c__1, x, af, &c__2, w, &c__1, &
info);
chkxer_("CUNMQL", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
/* CUNM2L */
s_copy(srnamc_1.srnamt, "CUNM2L", (ftnlen)32, (ftnlen)6);
infoc_1.infot = 1;
cunm2l_("/", "N", &c__0, &c__0, &c__0, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 2;
cunm2l_("L", "/", &c__0, &c__0, &c__0, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 3;
cunm2l_("L", "N", &c_n1, &c__0, &c__0, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 4;
cunm2l_("L", "N", &c__0, &c_n1, &c__0, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cunm2l_("L", "N", &c__0, &c__0, &c_n1, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cunm2l_("L", "N", &c__0, &c__1, &c__1, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 5;
cunm2l_("R", "N", &c__1, &c__0, &c__1, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 7;
cunm2l_("L", "N", &c__2, &c__1, &c__0, a, &c__1, x, af, &c__2, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 7;
cunm2l_("R", "N", &c__1, &c__2, &c__0, a, &c__1, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
infoc_1.infot = 10;
cunm2l_("L", "N", &c__2, &c__1, &c__0, a, &c__2, x, af, &c__1, w, &info);
chkxer_("CUNM2L", &infoc_1.infot, &infoc_1.nout, &infoc_1.lerr, &
infoc_1.ok);
/* Print a summary line. */
alaesm_(path, &infoc_1.ok, &infoc_1.nout);
return 0;
/* End of CERRQL */
} /* cerrql_ */
/* Subroutine */ int cupgtr_(char *uplo, integer *n, complex *ap, complex *
tau, complex *q, integer *ldq, complex *work, integer *info)
{
/* System generated locals */
integer q_dim1, q_offset, i__1, i__2, i__3, i__4;
/* Local variables */
integer i__, j, ij;
integer iinfo;
logical upper;
/* -- LAPACK routine (version 3.2) -- */
/* November 2006 */
/* Purpose */
/* ======= */
/* CUPGTR generates a complex unitary matrix Q which is defined as the */
/* product of n-1 elementary reflectors H(i) of order n, as returned by */
/* CHPTRD using packed storage: */
/* if UPLO = 'U', Q = H(n-1) . . . H(2) H(1), */
/* if UPLO = 'L', Q = H(1) H(2) . . . H(n-1). */
/* Arguments */
/* ========= */
/* UPLO (input) CHARACTER*1 */
/* = 'U': Upper triangular packed storage used in previous */
/* call to CHPTRD; */
/* = 'L': Lower triangular packed storage used in previous */
/* call to CHPTRD. */
/* N (input) INTEGER */
/* The order of the matrix Q. N >= 0. */
/* AP (input) COMPLEX array, dimension (N*(N+1)/2) */
/* The vectors which define the elementary reflectors, as */
/* returned by CHPTRD. */
/* TAU (input) COMPLEX array, dimension (N-1) */
/* TAU(i) must contain the scalar factor of the elementary */
/* reflector H(i), as returned by CHPTRD. */
/* Q (output) COMPLEX array, dimension (LDQ,N) */
/* The N-by-N unitary matrix Q. */
/* LDQ (input) INTEGER */
/* The leading dimension of the array Q. LDQ >= max(1,N). */
/* WORK (workspace) COMPLEX array, dimension (N-1) */
/* INFO (output) INTEGER */
/* = 0: successful exit */
/* < 0: if INFO = -i, the i-th argument had an illegal value */
/* ===================================================================== */
/* Test the input arguments */
/* Parameter adjustments */
--ap;
--tau;
q_dim1 = *ldq;
q_offset = 1 + q_dim1;
q -= q_offset;
--work;
/* Function Body */
*info = 0;
upper = lsame_(uplo, "U");
if (! upper && ! lsame_(uplo, "L")) {
*info = -1;
} else if (*n < 0) {
*info = -2;
} else if (*ldq < max(1,*n)) {
*info = -6;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("CUPGTR", &i__1);
return 0;
}
/* Quick return if possible */
if (*n == 0) {
return 0;
}
if (upper) {
/* Q was determined by a call to CHPTRD with UPLO = 'U' */
/* Unpack the vectors which define the elementary reflectors and */
/* set the last row and column of Q equal to those of the unit */
/* matrix */
ij = 2;
i__1 = *n - 1;
for (j = 1; j <= i__1; ++j) {
i__2 = j - 1;
for (i__ = 1; i__ <= i__2; ++i__) {
i__3 = i__ + j * q_dim1;
i__4 = ij;
q[i__3].r = ap[i__4].r, q[i__3].i = ap[i__4].i;
++ij;
}
ij += 2;
i__2 = *n + j * q_dim1;
q[i__2].r = 0.f, q[i__2].i = 0.f;
}
i__1 = *n - 1;
for (i__ = 1; i__ <= i__1; ++i__) {
i__2 = i__ + *n * q_dim1;
q[i__2].r = 0.f, q[i__2].i = 0.f;
}
i__1 = *n + *n * q_dim1;
q[i__1].r = 1.f, q[i__1].i = 0.f;
/* Generate Q(1:n-1,1:n-1) */
i__1 = *n - 1;
i__2 = *n - 1;
i__3 = *n - 1;
cung2l_(&i__1, &i__2, &i__3, &q[q_offset], ldq, &tau[1], &work[1], &
iinfo);
} else {
/* Q was determined by a call to CHPTRD with UPLO = 'L'. */
/* Unpack the vectors which define the elementary reflectors and */
/* set the first row and column of Q equal to those of the unit */
/* matrix */
i__1 = q_dim1 + 1;
q[i__1].r = 1.f, q[i__1].i = 0.f;
i__1 = *n;
for (i__ = 2; i__ <= i__1; ++i__) {
i__2 = i__ + q_dim1;
q[i__2].r = 0.f, q[i__2].i = 0.f;
}
ij = 3;
i__1 = *n;
for (j = 2; j <= i__1; ++j) {
i__2 = j * q_dim1 + 1;
q[i__2].r = 0.f, q[i__2].i = 0.f;
i__2 = *n;
for (i__ = j + 1; i__ <= i__2; ++i__) {
i__3 = i__ + j * q_dim1;
i__4 = ij;
q[i__3].r = ap[i__4].r, q[i__3].i = ap[i__4].i;
++ij;
}
ij += 2;
}
if (*n > 1) {
/* Generate Q(2:n,2:n) */
i__1 = *n - 1;
i__2 = *n - 1;
i__3 = *n - 1;
cung2r_(&i__1, &i__2, &i__3, &q[(q_dim1 << 1) + 2], ldq, &tau[1],
&work[1], &iinfo);
}
}
return 0;
/* End of CUPGTR */
} /* cupgtr_ */
