whitespace fixes
This commit is contained in:
Axel Kohlmeyer
@ -1,13 +1,13 @@
|
||||
/* fortran/dstedc.f -- translated by f2c (version 20200916).
|
||||
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.,
|
||||
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
|
||||
http://www.netlib.org/f2c/libf2c.zip
|
||||
*/
|
||||
|
||||
#ifdef __cplusplus
|
||||
@ -212,10 +212,10 @@ f"> */
|
||||
/* > Modified by Francoise Tisseur, University of Tennessee */
|
||||
/* > */
|
||||
/* ===================================================================== */
|
||||
/* Subroutine */ int dstedc_(char *compz, integer *n, doublereal *d__,
|
||||
doublereal *e, doublereal *z__, integer *ldz, doublereal *work,
|
||||
integer *lwork, integer *iwork, integer *liwork, integer *info,
|
||||
ftnlen compz_len)
|
||||
/* Subroutine */ int dstedc_(char *compz, integer *n, doublereal *d__,
|
||||
doublereal *e, doublereal *z__, integer *ldz, doublereal *work,
|
||||
integer *lwork, integer *iwork, integer *liwork, integer *info,
|
||||
ftnlen compz_len)
|
||||
{
|
||||
/* System generated locals */
|
||||
integer z_dim1, z_offset, i__1, i__2;
|
||||
@ -231,37 +231,37 @@ f"> */
|
||||
doublereal p;
|
||||
integer ii, lgn;
|
||||
doublereal eps, tiny;
|
||||
extern /* Subroutine */ int dgemm_(char *, char *, integer *, integer *,
|
||||
integer *, doublereal *, doublereal *, integer *, doublereal *,
|
||||
integer *, doublereal *, doublereal *, integer *, ftnlen, ftnlen);
|
||||
extern /* Subroutine */ int dgemm_(char *, char *, integer *, integer *,
|
||||
integer *, doublereal *, doublereal *, integer *, doublereal *,
|
||||
integer *, doublereal *, doublereal *, integer *, ftnlen, ftnlen);
|
||||
extern logical lsame_(char *, char *, ftnlen, ftnlen);
|
||||
extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
|
||||
doublereal *, integer *);
|
||||
extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
|
||||
doublereal *, integer *);
|
||||
integer lwmin;
|
||||
extern /* Subroutine */ int dlaed0_(integer *, integer *, integer *,
|
||||
doublereal *, doublereal *, doublereal *, integer *, doublereal *,
|
||||
integer *, doublereal *, integer *, integer *);
|
||||
extern /* Subroutine */ int dlaed0_(integer *, integer *, integer *,
|
||||
doublereal *, doublereal *, doublereal *, integer *, doublereal *,
|
||||
integer *, doublereal *, integer *, integer *);
|
||||
integer start;
|
||||
extern doublereal dlamch_(char *, ftnlen);
|
||||
extern /* Subroutine */ int dlascl_(char *, integer *, integer *,
|
||||
doublereal *, doublereal *, integer *, integer *, doublereal *,
|
||||
integer *, integer *, ftnlen), dlacpy_(char *, integer *, integer
|
||||
*, doublereal *, integer *, doublereal *, integer *, ftnlen),
|
||||
dlaset_(char *, integer *, integer *, doublereal *, doublereal *,
|
||||
doublereal *, integer *, ftnlen);
|
||||
extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
|
||||
integer *, integer *, ftnlen, ftnlen);
|
||||
extern /* Subroutine */ int dlascl_(char *, integer *, integer *,
|
||||
doublereal *, doublereal *, integer *, integer *, doublereal *,
|
||||
integer *, integer *, ftnlen), dlacpy_(char *, integer *, integer
|
||||
*, doublereal *, integer *, doublereal *, integer *, ftnlen),
|
||||
dlaset_(char *, integer *, integer *, doublereal *, doublereal *,
|
||||
doublereal *, integer *, ftnlen);
|
||||
extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
|
||||
integer *, integer *, ftnlen, ftnlen);
|
||||
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
|
||||
integer finish;
|
||||
extern doublereal dlanst_(char *, integer *, doublereal *, doublereal *,
|
||||
ftnlen);
|
||||
extern doublereal dlanst_(char *, integer *, doublereal *, doublereal *,
|
||||
ftnlen);
|
||||
extern /* Subroutine */ int dsterf_(integer *, doublereal *, doublereal *,
|
||||
integer *), dlasrt_(char *, integer *, doublereal *, integer *,
|
||||
ftnlen);
|
||||
integer *), dlasrt_(char *, integer *, doublereal *, integer *,
|
||||
ftnlen);
|
||||
integer liwmin, icompz;
|
||||
extern /* Subroutine */ int dsteqr_(char *, integer *, doublereal *,
|
||||
doublereal *, doublereal *, integer *, doublereal *, integer *,
|
||||
ftnlen);
|
||||
extern /* Subroutine */ int dsteqr_(char *, integer *, doublereal *,
|
||||
doublereal *, doublereal *, integer *, doublereal *, integer *,
|
||||
ftnlen);
|
||||
doublereal orgnrm;
|
||||
logical lquery;
|
||||
integer smlsiz, storez, strtrw;
|
||||
@ -306,82 +306,82 @@ f"> */
|
||||
lquery = *lwork == -1 || *liwork == -1;
|
||||
|
||||
if (lsame_(compz, (char *)"N", (ftnlen)1, (ftnlen)1)) {
|
||||
icompz = 0;
|
||||
icompz = 0;
|
||||
} else if (lsame_(compz, (char *)"V", (ftnlen)1, (ftnlen)1)) {
|
||||
icompz = 1;
|
||||
icompz = 1;
|
||||
} else if (lsame_(compz, (char *)"I", (ftnlen)1, (ftnlen)1)) {
|
||||
icompz = 2;
|
||||
icompz = 2;
|
||||
} else {
|
||||
icompz = -1;
|
||||
icompz = -1;
|
||||
}
|
||||
if (icompz < 0) {
|
||||
*info = -1;
|
||||
*info = -1;
|
||||
} else if (*n < 0) {
|
||||
*info = -2;
|
||||
*info = -2;
|
||||
} else if (*ldz < 1 || icompz > 0 && *ldz < max(1,*n)) {
|
||||
*info = -6;
|
||||
*info = -6;
|
||||
}
|
||||
|
||||
if (*info == 0) {
|
||||
|
||||
/* Compute the workspace requirements */
|
||||
|
||||
smlsiz = ilaenv_(&c__9, (char *)"DSTEDC", (char *)" ", &c__0, &c__0, &c__0, &c__0, (
|
||||
ftnlen)6, (ftnlen)1);
|
||||
if (*n <= 1 || icompz == 0) {
|
||||
liwmin = 1;
|
||||
lwmin = 1;
|
||||
} else if (*n <= smlsiz) {
|
||||
liwmin = 1;
|
||||
lwmin = *n - 1 << 1;
|
||||
} else {
|
||||
lgn = (integer) (log((doublereal) (*n)) / log(2.));
|
||||
if (pow_ii(&c__2, &lgn) < *n) {
|
||||
++lgn;
|
||||
}
|
||||
if (pow_ii(&c__2, &lgn) < *n) {
|
||||
++lgn;
|
||||
}
|
||||
if (icompz == 1) {
|
||||
smlsiz = ilaenv_(&c__9, (char *)"DSTEDC", (char *)" ", &c__0, &c__0, &c__0, &c__0, (
|
||||
ftnlen)6, (ftnlen)1);
|
||||
if (*n <= 1 || icompz == 0) {
|
||||
liwmin = 1;
|
||||
lwmin = 1;
|
||||
} else if (*n <= smlsiz) {
|
||||
liwmin = 1;
|
||||
lwmin = *n - 1 << 1;
|
||||
} else {
|
||||
lgn = (integer) (log((doublereal) (*n)) / log(2.));
|
||||
if (pow_ii(&c__2, &lgn) < *n) {
|
||||
++lgn;
|
||||
}
|
||||
if (pow_ii(&c__2, &lgn) < *n) {
|
||||
++lgn;
|
||||
}
|
||||
if (icompz == 1) {
|
||||
/* Computing 2nd power */
|
||||
i__1 = *n;
|
||||
lwmin = *n * 3 + 1 + (*n << 1) * lgn + (i__1 * i__1 << 2);
|
||||
liwmin = *n * 6 + 6 + *n * 5 * lgn;
|
||||
} else if (icompz == 2) {
|
||||
i__1 = *n;
|
||||
lwmin = *n * 3 + 1 + (*n << 1) * lgn + (i__1 * i__1 << 2);
|
||||
liwmin = *n * 6 + 6 + *n * 5 * lgn;
|
||||
} else if (icompz == 2) {
|
||||
/* Computing 2nd power */
|
||||
i__1 = *n;
|
||||
lwmin = (*n << 2) + 1 + i__1 * i__1;
|
||||
liwmin = *n * 5 + 3;
|
||||
}
|
||||
}
|
||||
work[1] = (doublereal) lwmin;
|
||||
iwork[1] = liwmin;
|
||||
i__1 = *n;
|
||||
lwmin = (*n << 2) + 1 + i__1 * i__1;
|
||||
liwmin = *n * 5 + 3;
|
||||
}
|
||||
}
|
||||
work[1] = (doublereal) lwmin;
|
||||
iwork[1] = liwmin;
|
||||
|
||||
if (*lwork < lwmin && ! lquery) {
|
||||
*info = -8;
|
||||
} else if (*liwork < liwmin && ! lquery) {
|
||||
*info = -10;
|
||||
}
|
||||
if (*lwork < lwmin && ! lquery) {
|
||||
*info = -8;
|
||||
} else if (*liwork < liwmin && ! lquery) {
|
||||
*info = -10;
|
||||
}
|
||||
}
|
||||
|
||||
if (*info != 0) {
|
||||
i__1 = -(*info);
|
||||
xerbla_((char *)"DSTEDC", &i__1, (ftnlen)6);
|
||||
return 0;
|
||||
i__1 = -(*info);
|
||||
xerbla_((char *)"DSTEDC", &i__1, (ftnlen)6);
|
||||
return 0;
|
||||
} else if (lquery) {
|
||||
return 0;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Quick return if possible */
|
||||
|
||||
if (*n == 0) {
|
||||
return 0;
|
||||
return 0;
|
||||
}
|
||||
if (*n == 1) {
|
||||
if (icompz != 0) {
|
||||
z__[z_dim1 + 1] = 1.;
|
||||
}
|
||||
return 0;
|
||||
if (icompz != 0) {
|
||||
z__[z_dim1 + 1] = 1.;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* If the following conditional clause is removed, then the routine */
|
||||
@ -396,8 +396,8 @@ f"> */
|
||||
/* If COMPZ = 'N', use DSTERF to compute the eigenvalues. */
|
||||
|
||||
if (icompz == 0) {
|
||||
dsterf_(n, &d__[1], &e[1], info);
|
||||
goto L50;
|
||||
dsterf_(n, &d__[1], &e[1], info);
|
||||
goto L50;
|
||||
}
|
||||
|
||||
/* If N is smaller than the minimum divide size (SMLSIZ+1), then */
|
||||
@ -405,40 +405,40 @@ f"> */
|
||||
|
||||
if (*n <= smlsiz) {
|
||||
|
||||
dsteqr_(compz, n, &d__[1], &e[1], &z__[z_offset], ldz, &work[1], info,
|
||||
(ftnlen)1);
|
||||
dsteqr_(compz, n, &d__[1], &e[1], &z__[z_offset], ldz, &work[1], info,
|
||||
(ftnlen)1);
|
||||
|
||||
} else {
|
||||
|
||||
/* If COMPZ = 'V', the Z matrix must be stored elsewhere for later */
|
||||
/* use. */
|
||||
|
||||
if (icompz == 1) {
|
||||
storez = *n * *n + 1;
|
||||
} else {
|
||||
storez = 1;
|
||||
}
|
||||
if (icompz == 1) {
|
||||
storez = *n * *n + 1;
|
||||
} else {
|
||||
storez = 1;
|
||||
}
|
||||
|
||||
if (icompz == 2) {
|
||||
dlaset_((char *)"Full", n, n, &c_b17, &c_b18, &z__[z_offset], ldz, (
|
||||
ftnlen)4);
|
||||
}
|
||||
if (icompz == 2) {
|
||||
dlaset_((char *)"Full", n, n, &c_b17, &c_b18, &z__[z_offset], ldz, (
|
||||
ftnlen)4);
|
||||
}
|
||||
|
||||
/* Scale. */
|
||||
|
||||
orgnrm = dlanst_((char *)"M", n, &d__[1], &e[1], (ftnlen)1);
|
||||
if (orgnrm == 0.) {
|
||||
goto L50;
|
||||
}
|
||||
orgnrm = dlanst_((char *)"M", n, &d__[1], &e[1], (ftnlen)1);
|
||||
if (orgnrm == 0.) {
|
||||
goto L50;
|
||||
}
|
||||
|
||||
eps = dlamch_((char *)"Epsilon", (ftnlen)7);
|
||||
eps = dlamch_((char *)"Epsilon", (ftnlen)7);
|
||||
|
||||
start = 1;
|
||||
start = 1;
|
||||
|
||||
/* while ( START <= N ) */
|
||||
|
||||
L10:
|
||||
if (start <= *n) {
|
||||
if (start <= *n) {
|
||||
|
||||
/* Let FINISH be the position of the next subdiagonal entry */
|
||||
/* such that E( FINISH ) <= TINY or FINISH = N if no such */
|
||||
@ -446,119 +446,119 @@ L10:
|
||||
/* between START and FINISH constitutes an independent */
|
||||
/* sub-problem. */
|
||||
|
||||
finish = start;
|
||||
finish = start;
|
||||
L20:
|
||||
if (finish < *n) {
|
||||
tiny = eps * sqrt((d__1 = d__[finish], abs(d__1))) * sqrt((
|
||||
d__2 = d__[finish + 1], abs(d__2)));
|
||||
if ((d__1 = e[finish], abs(d__1)) > tiny) {
|
||||
++finish;
|
||||
goto L20;
|
||||
}
|
||||
}
|
||||
if (finish < *n) {
|
||||
tiny = eps * sqrt((d__1 = d__[finish], abs(d__1))) * sqrt((
|
||||
d__2 = d__[finish + 1], abs(d__2)));
|
||||
if ((d__1 = e[finish], abs(d__1)) > tiny) {
|
||||
++finish;
|
||||
goto L20;
|
||||
}
|
||||
}
|
||||
|
||||
/* (Sub) Problem determined. Compute its size and solve it. */
|
||||
|
||||
m = finish - start + 1;
|
||||
if (m == 1) {
|
||||
start = finish + 1;
|
||||
goto L10;
|
||||
}
|
||||
if (m > smlsiz) {
|
||||
m = finish - start + 1;
|
||||
if (m == 1) {
|
||||
start = finish + 1;
|
||||
goto L10;
|
||||
}
|
||||
if (m > smlsiz) {
|
||||
|
||||
/* Scale. */
|
||||
|
||||
orgnrm = dlanst_((char *)"M", &m, &d__[start], &e[start], (ftnlen)1);
|
||||
dlascl_((char *)"G", &c__0, &c__0, &orgnrm, &c_b18, &m, &c__1, &d__[
|
||||
start], &m, info, (ftnlen)1);
|
||||
i__1 = m - 1;
|
||||
i__2 = m - 1;
|
||||
dlascl_((char *)"G", &c__0, &c__0, &orgnrm, &c_b18, &i__1, &c__1, &e[
|
||||
start], &i__2, info, (ftnlen)1);
|
||||
orgnrm = dlanst_((char *)"M", &m, &d__[start], &e[start], (ftnlen)1);
|
||||
dlascl_((char *)"G", &c__0, &c__0, &orgnrm, &c_b18, &m, &c__1, &d__[
|
||||
start], &m, info, (ftnlen)1);
|
||||
i__1 = m - 1;
|
||||
i__2 = m - 1;
|
||||
dlascl_((char *)"G", &c__0, &c__0, &orgnrm, &c_b18, &i__1, &c__1, &e[
|
||||
start], &i__2, info, (ftnlen)1);
|
||||
|
||||
if (icompz == 1) {
|
||||
strtrw = 1;
|
||||
} else {
|
||||
strtrw = start;
|
||||
}
|
||||
dlaed0_(&icompz, n, &m, &d__[start], &e[start], &z__[strtrw +
|
||||
start * z_dim1], ldz, &work[1], n, &work[storez], &
|
||||
iwork[1], info);
|
||||
if (*info != 0) {
|
||||
*info = (*info / (m + 1) + start - 1) * (*n + 1) + *info %
|
||||
(m + 1) + start - 1;
|
||||
goto L50;
|
||||
}
|
||||
if (icompz == 1) {
|
||||
strtrw = 1;
|
||||
} else {
|
||||
strtrw = start;
|
||||
}
|
||||
dlaed0_(&icompz, n, &m, &d__[start], &e[start], &z__[strtrw +
|
||||
start * z_dim1], ldz, &work[1], n, &work[storez], &
|
||||
iwork[1], info);
|
||||
if (*info != 0) {
|
||||
*info = (*info / (m + 1) + start - 1) * (*n + 1) + *info %
|
||||
(m + 1) + start - 1;
|
||||
goto L50;
|
||||
}
|
||||
|
||||
/* Scale back. */
|
||||
|
||||
dlascl_((char *)"G", &c__0, &c__0, &c_b18, &orgnrm, &m, &c__1, &d__[
|
||||
start], &m, info, (ftnlen)1);
|
||||
dlascl_((char *)"G", &c__0, &c__0, &c_b18, &orgnrm, &m, &c__1, &d__[
|
||||
start], &m, info, (ftnlen)1);
|
||||
|
||||
} else {
|
||||
if (icompz == 1) {
|
||||
} else {
|
||||
if (icompz == 1) {
|
||||
|
||||
/* Since QR won't update a Z matrix which is larger than */
|
||||
/* the length of D, we must solve the sub-problem in a */
|
||||
/* workspace and then multiply back into Z. */
|
||||
|
||||
dsteqr_((char *)"I", &m, &d__[start], &e[start], &work[1], &m, &
|
||||
work[m * m + 1], info, (ftnlen)1);
|
||||
dlacpy_((char *)"A", n, &m, &z__[start * z_dim1 + 1], ldz, &work[
|
||||
storez], n, (ftnlen)1);
|
||||
dgemm_((char *)"N", (char *)"N", n, &m, &m, &c_b18, &work[storez], n, &
|
||||
work[1], &m, &c_b17, &z__[start * z_dim1 + 1],
|
||||
ldz, (ftnlen)1, (ftnlen)1);
|
||||
} else if (icompz == 2) {
|
||||
dsteqr_((char *)"I", &m, &d__[start], &e[start], &z__[start +
|
||||
start * z_dim1], ldz, &work[1], info, (ftnlen)1);
|
||||
} else {
|
||||
dsterf_(&m, &d__[start], &e[start], info);
|
||||
}
|
||||
if (*info != 0) {
|
||||
*info = start * (*n + 1) + finish;
|
||||
goto L50;
|
||||
}
|
||||
}
|
||||
dsteqr_((char *)"I", &m, &d__[start], &e[start], &work[1], &m, &
|
||||
work[m * m + 1], info, (ftnlen)1);
|
||||
dlacpy_((char *)"A", n, &m, &z__[start * z_dim1 + 1], ldz, &work[
|
||||
storez], n, (ftnlen)1);
|
||||
dgemm_((char *)"N", (char *)"N", n, &m, &m, &c_b18, &work[storez], n, &
|
||||
work[1], &m, &c_b17, &z__[start * z_dim1 + 1],
|
||||
ldz, (ftnlen)1, (ftnlen)1);
|
||||
} else if (icompz == 2) {
|
||||
dsteqr_((char *)"I", &m, &d__[start], &e[start], &z__[start +
|
||||
start * z_dim1], ldz, &work[1], info, (ftnlen)1);
|
||||
} else {
|
||||
dsterf_(&m, &d__[start], &e[start], info);
|
||||
}
|
||||
if (*info != 0) {
|
||||
*info = start * (*n + 1) + finish;
|
||||
goto L50;
|
||||
}
|
||||
}
|
||||
|
||||
start = finish + 1;
|
||||
goto L10;
|
||||
}
|
||||
start = finish + 1;
|
||||
goto L10;
|
||||
}
|
||||
|
||||
/* endwhile */
|
||||
|
||||
if (icompz == 0) {
|
||||
if (icompz == 0) {
|
||||
|
||||
/* Use Quick Sort */
|
||||
|
||||
dlasrt_((char *)"I", n, &d__[1], info, (ftnlen)1);
|
||||
dlasrt_((char *)"I", n, &d__[1], info, (ftnlen)1);
|
||||
|
||||
} else {
|
||||
} else {
|
||||
|
||||
/* Use Selection Sort to minimize swaps of eigenvectors */
|
||||
|
||||
i__1 = *n;
|
||||
for (ii = 2; ii <= i__1; ++ii) {
|
||||
i__ = ii - 1;
|
||||
k = i__;
|
||||
p = d__[i__];
|
||||
i__2 = *n;
|
||||
for (j = ii; j <= i__2; ++j) {
|
||||
if (d__[j] < p) {
|
||||
k = j;
|
||||
p = d__[j];
|
||||
}
|
||||
i__1 = *n;
|
||||
for (ii = 2; ii <= i__1; ++ii) {
|
||||
i__ = ii - 1;
|
||||
k = i__;
|
||||
p = d__[i__];
|
||||
i__2 = *n;
|
||||
for (j = ii; j <= i__2; ++j) {
|
||||
if (d__[j] < p) {
|
||||
k = j;
|
||||
p = d__[j];
|
||||
}
|
||||
/* L30: */
|
||||
}
|
||||
if (k != i__) {
|
||||
d__[k] = d__[i__];
|
||||
d__[i__] = p;
|
||||
dswap_(n, &z__[i__ * z_dim1 + 1], &c__1, &z__[k * z_dim1
|
||||
+ 1], &c__1);
|
||||
}
|
||||
}
|
||||
if (k != i__) {
|
||||
d__[k] = d__[i__];
|
||||
d__[i__] = p;
|
||||
dswap_(n, &z__[i__ * z_dim1 + 1], &c__1, &z__[k * z_dim1
|
||||
+ 1], &c__1);
|
||||
}
|
||||
/* L40: */
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
L50:
|
||||
@ -572,5 +572,5 @@ L50:
|
||||
} /* dstedc_ */
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user