/* clatsy.f -- translated by f2c (version 20061008).
You must link the resulting object file with libf2c:
on Microsoft Windows system, link with libf2c.lib;
on Linux or Unix systems, link with .../path/to/libf2c.a -lm
or, if you install libf2c.a in a standard place, with -lf2c -lm
-- in that order, at the end of the command line, as in
cc *.o -lf2c -lm
Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
http://www.netlib.org/f2c/libf2c.zip
*/
#include "f2c.h"
#include "blaswrap.h"
/* Table of constant values */
static integer c__5 = 5;
static integer c__2 = 2;
/* Subroutine */ int clatsy_(char *uplo, integer *n, complex *x, integer *ldx,
integer *iseed)
{
/* System generated locals */
integer x_dim1, x_offset, i__1, i__2, i__3;
complex q__1, q__2, q__3;
/* Builtin functions */
double sqrt(doublereal), c_abs(complex *);
/* Local variables */
complex a, b, c__;
integer i__, j;
complex r__;
integer n5;
real beta, alpha, alpha3;
extern /* Complex */ VOID clarnd_(complex *, integer *, integer *);
/* -- LAPACK auxiliary test routine (version 3.1) -- */
/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
/* November 2006 */
/* .. Scalar Arguments .. */
/* .. */
/* .. Array Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* CLATSY generates a special test matrix for the complex symmetric */
/* (indefinite) factorization. The pivot blocks of the generated matrix */
/* will be in the following order: */
/* 2x2 pivot block, non diagonalizable */
/* 1x1 pivot block */
/* 2x2 pivot block, diagonalizable */
/* (cycle repeats) */
/* A row interchange is required for each non-diagonalizable 2x2 block. */
/* Arguments */
/* ========= */
/* UPLO (input) CHARACTER */
/* Specifies whether the generated matrix is to be upper or */
/* lower triangular. */
/* = 'U': Upper triangular */
/* = 'L': Lower triangular */
/* N (input) INTEGER */
/* The dimension of the matrix to be generated. */
/* X (output) COMPLEX array, dimension (LDX,N) */
/* The generated matrix, consisting of 3x3 and 2x2 diagonal */
/* blocks which result in the pivot sequence given above. */
/* The matrix outside of these diagonal blocks is zero. */
/* LDX (input) INTEGER */
/* The leading dimension of the array X. */
/* ISEED (input/output) INTEGER array, dimension (4) */
/* On entry, the seed for the random number generator. The last */
/* of the four integers must be odd. (modified on exit) */
/* ===================================================================== */
/* .. Parameters .. */
/* .. */
/* .. Local Scalars .. */
/* .. */
/* .. External Functions .. */
/* .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. Executable Statements .. */
/* Initialize constants */
/* Parameter adjustments */
x_dim1 = *ldx;
x_offset = 1 + x_dim1;
x -= x_offset;
--iseed;
/* Function Body */
alpha = (sqrt(17.f) + 1.f) / 8.f;
beta = alpha - .001f;
alpha3 = alpha * alpha * alpha;
/* UPLO = 'U': Upper triangular storage */
if (*(unsigned char *)uplo == 'U') {
/* Fill the upper triangle of the matrix with zeros. */
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = j;
for (i__ = 1; i__ <= i__2; ++i__) {
i__3 = i__ + j * x_dim1;
x[i__3].r = 0.f, x[i__3].i = 0.f;
/* L10: */
}
/* L20: */
}
n5 = *n / 5;
n5 = *n - n5 * 5 + 1;
i__1 = n5;
for (i__ = *n; i__ >= i__1; i__ += -5) {
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = alpha3 * q__2.r, q__1.i = alpha3 * q__2.i;
a.r = q__1.r, a.i = q__1.i;
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = q__2.r / alpha, q__1.i = q__2.i / alpha;
b.r = q__1.r, b.i = q__1.i;
q__3.r = b.r * 2.f, q__3.i = b.i * 2.f;
q__2.r = q__3.r * 0.f - q__3.i * 1.f, q__2.i = q__3.r * 1.f +
q__3.i * 0.f;
q__1.r = a.r - q__2.r, q__1.i = a.i - q__2.i;
c__.r = q__1.r, c__.i = q__1.i;
q__1.r = c__.r / beta, q__1.i = c__.i / beta;
r__.r = q__1.r, r__.i = q__1.i;
i__2 = i__ + i__ * x_dim1;
x[i__2].r = a.r, x[i__2].i = a.i;
i__2 = i__ - 2 + i__ * x_dim1;
x[i__2].r = b.r, x[i__2].i = b.i;
i__2 = i__ - 2 + (i__ - 1) * x_dim1;
x[i__2].r = r__.r, x[i__2].i = r__.i;
i__2 = i__ - 2 + (i__ - 2) * x_dim1;
x[i__2].r = c__.r, x[i__2].i = c__.i;
i__2 = i__ - 1 + (i__ - 1) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
i__2 = i__ - 3 + (i__ - 3) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
i__2 = i__ - 4 + (i__ - 4) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
if (c_abs(&x[i__ - 3 + (i__ - 3) * x_dim1]) > c_abs(&x[i__ - 4 + (
i__ - 4) * x_dim1])) {
i__2 = i__ - 4 + (i__ - 3) * x_dim1;
i__3 = i__ - 3 + (i__ - 3) * x_dim1;
q__1.r = x[i__3].r * 2.f, q__1.i = x[i__3].i * 2.f;
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
} else {
i__2 = i__ - 4 + (i__ - 3) * x_dim1;
i__3 = i__ - 4 + (i__ - 4) * x_dim1;
q__1.r = x[i__3].r * 2.f, q__1.i = x[i__3].i * 2.f;
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
}
/* L30: */
}
/* Clean-up for N not a multiple of 5. */
i__ = n5 - 1;
if (i__ > 2) {
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = alpha3 * q__2.r, q__1.i = alpha3 * q__2.i;
a.r = q__1.r, a.i = q__1.i;
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = q__2.r / alpha, q__1.i = q__2.i / alpha;
b.r = q__1.r, b.i = q__1.i;
q__3.r = b.r * 2.f, q__3.i = b.i * 2.f;
q__2.r = q__3.r * 0.f - q__3.i * 1.f, q__2.i = q__3.r * 1.f +
q__3.i * 0.f;
q__1.r = a.r - q__2.r, q__1.i = a.i - q__2.i;
c__.r = q__1.r, c__.i = q__1.i;
q__1.r = c__.r / beta, q__1.i = c__.i / beta;
r__.r = q__1.r, r__.i = q__1.i;
i__1 = i__ + i__ * x_dim1;
x[i__1].r = a.r, x[i__1].i = a.i;
i__1 = i__ - 2 + i__ * x_dim1;
x[i__1].r = b.r, x[i__1].i = b.i;
i__1 = i__ - 2 + (i__ - 1) * x_dim1;
x[i__1].r = r__.r, x[i__1].i = r__.i;
i__1 = i__ - 2 + (i__ - 2) * x_dim1;
x[i__1].r = c__.r, x[i__1].i = c__.i;
i__1 = i__ - 1 + (i__ - 1) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
i__ += -3;
}
if (i__ > 1) {
i__1 = i__ + i__ * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
i__1 = i__ - 1 + (i__ - 1) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
if (c_abs(&x[i__ + i__ * x_dim1]) > c_abs(&x[i__ - 1 + (i__ - 1) *
x_dim1])) {
i__1 = i__ - 1 + i__ * x_dim1;
i__2 = i__ + i__ * x_dim1;
q__1.r = x[i__2].r * 2.f, q__1.i = x[i__2].i * 2.f;
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
} else {
i__1 = i__ - 1 + i__ * x_dim1;
i__2 = i__ - 1 + (i__ - 1) * x_dim1;
q__1.r = x[i__2].r * 2.f, q__1.i = x[i__2].i * 2.f;
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
}
i__ += -2;
} else if (i__ == 1) {
i__1 = i__ + i__ * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
--i__;
}
/* UPLO = 'L': Lower triangular storage */
} else {
/* Fill the lower triangle of the matrix with zeros. */
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
i__2 = *n;
for (i__ = j; i__ <= i__2; ++i__) {
i__3 = i__ + j * x_dim1;
x[i__3].r = 0.f, x[i__3].i = 0.f;
/* L40: */
}
/* L50: */
}
n5 = *n / 5;
n5 *= 5;
i__1 = n5;
for (i__ = 1; i__ <= i__1; i__ += 5) {
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = alpha3 * q__2.r, q__1.i = alpha3 * q__2.i;
a.r = q__1.r, a.i = q__1.i;
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = q__2.r / alpha, q__1.i = q__2.i / alpha;
b.r = q__1.r, b.i = q__1.i;
q__3.r = b.r * 2.f, q__3.i = b.i * 2.f;
q__2.r = q__3.r * 0.f - q__3.i * 1.f, q__2.i = q__3.r * 1.f +
q__3.i * 0.f;
q__1.r = a.r - q__2.r, q__1.i = a.i - q__2.i;
c__.r = q__1.r, c__.i = q__1.i;
q__1.r = c__.r / beta, q__1.i = c__.i / beta;
r__.r = q__1.r, r__.i = q__1.i;
i__2 = i__ + i__ * x_dim1;
x[i__2].r = a.r, x[i__2].i = a.i;
i__2 = i__ + 2 + i__ * x_dim1;
x[i__2].r = b.r, x[i__2].i = b.i;
i__2 = i__ + 2 + (i__ + 1) * x_dim1;
x[i__2].r = r__.r, x[i__2].i = r__.i;
i__2 = i__ + 2 + (i__ + 2) * x_dim1;
x[i__2].r = c__.r, x[i__2].i = c__.i;
i__2 = i__ + 1 + (i__ + 1) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
i__2 = i__ + 3 + (i__ + 3) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
i__2 = i__ + 4 + (i__ + 4) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
if (c_abs(&x[i__ + 3 + (i__ + 3) * x_dim1]) > c_abs(&x[i__ + 4 + (
i__ + 4) * x_dim1])) {
i__2 = i__ + 4 + (i__ + 3) * x_dim1;
i__3 = i__ + 3 + (i__ + 3) * x_dim1;
q__1.r = x[i__3].r * 2.f, q__1.i = x[i__3].i * 2.f;
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
} else {
i__2 = i__ + 4 + (i__ + 3) * x_dim1;
i__3 = i__ + 4 + (i__ + 4) * x_dim1;
q__1.r = x[i__3].r * 2.f, q__1.i = x[i__3].i * 2.f;
x[i__2].r = q__1.r, x[i__2].i = q__1.i;
}
/* L60: */
}
/* Clean-up for N not a multiple of 5. */
i__ = n5 + 1;
if (i__ < *n - 1) {
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = alpha3 * q__2.r, q__1.i = alpha3 * q__2.i;
a.r = q__1.r, a.i = q__1.i;
clarnd_(&q__2, &c__5, &iseed[1]);
q__1.r = q__2.r / alpha, q__1.i = q__2.i / alpha;
b.r = q__1.r, b.i = q__1.i;
q__3.r = b.r * 2.f, q__3.i = b.i * 2.f;
q__2.r = q__3.r * 0.f - q__3.i * 1.f, q__2.i = q__3.r * 1.f +
q__3.i * 0.f;
q__1.r = a.r - q__2.r, q__1.i = a.i - q__2.i;
c__.r = q__1.r, c__.i = q__1.i;
q__1.r = c__.r / beta, q__1.i = c__.i / beta;
r__.r = q__1.r, r__.i = q__1.i;
i__1 = i__ + i__ * x_dim1;
x[i__1].r = a.r, x[i__1].i = a.i;
i__1 = i__ + 2 + i__ * x_dim1;
x[i__1].r = b.r, x[i__1].i = b.i;
i__1 = i__ + 2 + (i__ + 1) * x_dim1;
x[i__1].r = r__.r, x[i__1].i = r__.i;
i__1 = i__ + 2 + (i__ + 2) * x_dim1;
x[i__1].r = c__.r, x[i__1].i = c__.i;
i__1 = i__ + 1 + (i__ + 1) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
i__ += 3;
}
if (i__ < *n) {
i__1 = i__ + i__ * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
i__1 = i__ + 1 + (i__ + 1) * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
if (c_abs(&x[i__ + i__ * x_dim1]) > c_abs(&x[i__ + 1 + (i__ + 1) *
x_dim1])) {
i__1 = i__ + 1 + i__ * x_dim1;
i__2 = i__ + i__ * x_dim1;
q__1.r = x[i__2].r * 2.f, q__1.i = x[i__2].i * 2.f;
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
} else {
i__1 = i__ + 1 + i__ * x_dim1;
i__2 = i__ + 1 + (i__ + 1) * x_dim1;
q__1.r = x[i__2].r * 2.f, q__1.i = x[i__2].i * 2.f;
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
}
i__ += 2;
} else if (i__ == *n) {
i__1 = i__ + i__ * x_dim1;
clarnd_(&q__1, &c__2, &iseed[1]);
x[i__1].r = q__1.r, x[i__1].i = q__1.i;
++i__;
}
}
return 0;
/* End of CLATSY */
} /* clatsy_ */