You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
75 lines
2.0 KiB
75 lines
2.0 KiB
2 years ago
|
/*
|
||
|
|
* Copyright(C) 1999-2020 National Technology & Engineering Solutions
|
||
|
|
* of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with
|
||
|
|
* NTESS, the U.S. Government retains certain rights in this software.
|
||
|
|
*
|
||
|
|
* See packages/seacas/LICENSE for details
|
||
|
|
*/
|
||
|
|
|
||
|
|
/* Eigensolution of real symmetric tridiagonal matrix using the algorithm
|
||
|
|
of Numerical Recipes p. 380. Removed eigenvector calculation and added
|
||
|
|
return codes: 1 if maximum number of iterations is exceeded, 0 otherwise.
|
||
|
|
NOTE CAREFULLY: the vector e is used as workspace, the eigenvals are
|
||
|
|
returned in the vector d. */
|
||
|
|
|
||
|
|
#include <math.h>
|
||
|
|
|
||
|
|
#define SIGN(a, b) ((b) < 0 ? -fabs(a) : fabs(a))
|
||
|
|
|
||
|
|
int ql(double d[], double e[], int n)
|
||
|
|
|
||
|
|
{
|
||
|
|
int m, l, iter, i;
|
||
|
|
double s, r, p, g, f, dd, c, b;
|
||
|
|
|
||
|
|
e[n] = 0.0;
|
||
|
|
|
||
|
|
for (l = 1; l <= n; l++) {
|
||
|
|
iter = 0;
|
||
|
|
do {
|
||
|
|
for (m = l; m <= n - 1; m++) {
|
||
|
|
dd = fabs(d[m]) + fabs(d[m + 1]);
|
||
|
|
if (fabs(e[m]) + dd == dd) {
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (m != l) {
|
||
|
|
if (iter++ == 50) {
|
||
|
|
return (1);
|
||
|
|
/* ... not converging; bail out with error code. */
|
||
|
|
}
|
||
|
|
g = (d[l + 1] - d[l]) / (2.0 * e[l]);
|
||
|
|
r = sqrt((g * g) + 1.0);
|
||
|
|
g = d[m] - d[l] + e[l] / (g + SIGN(r, g));
|
||
|
|
s = c = 1.0;
|
||
|
|
p = 0.0;
|
||
|
|
for (i = m - 1; i >= l; i--) {
|
||
|
|
f = s * e[i];
|
||
|
|
b = c * e[i];
|
||
|
|
if (fabs(f) >= fabs(g)) {
|
||
|
|
c = g / f;
|
||
|
|
r = sqrt((c * c) + 1.0);
|
||
|
|
e[i + 1] = f * r;
|
||
|
|
c *= (s = 1.0 / r);
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
s = f / g;
|
||
|
|
r = sqrt((s * s) + 1.0);
|
||
|
|
e[i + 1] = g * r;
|
||
|
|
s *= (c = 1.0 / r);
|
||
|
|
}
|
||
|
|
g = d[i + 1] - p;
|
||
|
|
r = (d[i] - g) * s + 2.0 * c * b;
|
||
|
|
p = s * r;
|
||
|
|
d[i + 1] = g + p;
|
||
|
|
g = c * r - b;
|
||
|
|
}
|
||
|
|
d[l] = d[l] - p;
|
||
|
|
e[l] = g;
|
||
|
|
e[m] = 0.0;
|
||
|
|
}
|
||
|
|
} while (m != l);
|
||
|
|
}
|
||
|
|
return (0); /* ... things seem ok */
|
||
|
|
}
|