Lines Matching refs:n1
163 int n1 = nn - 1;
185 while (n1 >= low) {
188 int l = n1;
203 if (l == n1) {
204 H[n1][n1] = H[n1][n1] + exshift;
205 d[n1] = H[n1][n1];
206 e[n1] = 0.0;
207 n1--;
212 } else if (l == n1 - 1) {
213 w = H[n1][n1 - 1] * H[n1 - 1][n1];
214 p = (H[n1 - 1][n1 - 1] - H[n1][n1]) / 2.0;
217 H[n1][n1] = H[n1][n1] + exshift;
218 H[n1 - 1][n1 - 1] = H[n1 - 1][n1 - 1] + exshift;
219 x = H[n1][n1];
229 d[n1 - 1] = x + z;
230 d[n1] = d[n1 - 1];
232 d[n1] = x - w / z;
234 e[n1 - 1] = 0.0;
235 e[n1] = 0.0;
236 x = H[n1][n1 - 1];
246 for (int j = n1 - 1; j < nn; j++) {
247 z = H[n1 - 1][j];
248 H[n1 - 1][j] = q * z + p * H[n1][j];
249 H[n1][j] = q * H[n1][j] - p * z;
254 for (int i = 0; i <= n1; i++) {
255 z = H[i][n1 - 1];
256 H[i][n1 - 1] = q * z + p * H[i][n1];
257 H[i][n1] = q * H[i][n1] - p * z;
263 z = V[i][n1 - 1];
264 V[i][n1 - 1] = q * z + p * V[i][n1];
265 V[i][n1] = q * V[i][n1] - p * z;
271 d[n1 - 1] = x + p;
272 d[n1] = x + p;
273 e[n1 - 1] = z;
274 e[n1] = -z;
276 n1 = n1 - 2;
285 x = H[n1][n1];
288 if (l < n1) {
289 y = H[n1 - 1][n1 - 1];
290 w = H[n1][n1 - 1] * H[n1 - 1][n1];
297 for (int i = low; i <= n1; i++) {
300 s = std::abs(H[n1][n1 - 1]) + std::abs(H[n1 - 1][n1 - 2]);
316 for (int i = low; i <= n1; i++) {
327 int m = n1 - 2;
350 for (int i = m + 2; i <= n1; i++) {
359 for (int k = m; k <= n1 - 1; k++) {
360 bool notlast = (k != n1 - 1);
406 for (int i = 0; i <= std::min(n1, k + 3); i++) {
430 } // while (n1 >= low)
438 for (n1 = nn - 1; n1 >= 0; n1--) {
439 p = d[n1];
440 q = e[n1];
445 int l = n1;
446 H[n1][n1] = 1.0;
447 for (int i = n1 - 1; i >= 0; i--) {
450 for (int j = l; j <= n1; j++) {
451 r = r + H[i][j] * H[j][n1];
460 H[i][n1] = -r / w;
462 H[i][n1] = -r / (eps * norm);
472 H[i][n1] = t;
474 H[i + 1][n1] = (-r - w * t) / x;
476 H[i + 1][n1] = (-s - y * t) / z;
482 t = std::abs(H[i][n1]);
484 for (int j = i; j <= n1; j++) {
485 H[j][n1] = H[j][n1] / t;
492 int l = n1 - 1;
496 n1][n1 - 1]) > std::abs(H[n1 - 1][n1])) {
497 H[n1 - 1][n1 - 1] = q / H[n1][n1 - 1];
498 H[n1 - 1][n1] = -(H[n1][n1] - p) / H[n1][n1 - 1];
500 cdiv(0.0, -H[n1 - 1][n1], H[n1 - 1][n1 - 1] - p, q);
501 H[n1 - 1][n1 - 1] = cdivr;
502 H[n1 - 1][n1] = cdivi;
504 H[n1][n1 - 1] = 0.0;
505 H[n1][n1] = 1.0;
506 for (int i = n1 - 2; i >= 0; i--) {
510 for (int j = l; j <= n1; j++) {
511 ra = ra + H[i][j] * H[j][n1 - 1];
512 sa = sa + H[i][j] * H[j][n1];
524 H[i][n1 - 1] = cdivr;
525 H[i][n1] = cdivi;
540 H[i][n1 - 1] = cdivr;
541 H[i][n1] = cdivi;
543 H[i + 1][n1 - 1] = (-ra - w * H[i][n1 - 1] + q
544 * H[i][n1]) / x;
545 H[i + 1][n1] = (-sa - w * H[i][n1] - q * H[i][n1
548 cdiv(-r - y * H[i][n1 - 1], -s - y * H[i][n1], z,
550 H[i + 1][n1 - 1] = cdivr;
551 H[i + 1][n1] = cdivi;
557 t = std::max(std::abs(H[i][n1 - 1]), std::abs(H[i][n1]));
559 for (int j = i; j <= n1; j++) {
560 H[j][n1 - 1] = H[j][n1 - 1] / t;
561 H[j][n1] = H[j][n1] / t;
