house.c 1.8 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
  1. /* house.c CCMATH mathematics library source code.
  2. *
  3. * Copyright (C) 2000 Daniel A. Atkinson All rights reserved.
  4. * This code may be redistributed under the terms of the GNU library
  5. * public license (LGPL). ( See the lgpl.license file for details.)
  6. * ------------------------------------------------------------------------
  7. */
  8. #include <stdlib.h>
  9. #include "ccmath.h"
  10. void house(double *a, double *d, double *dp, int n)
  11. {
  12. double sc, x, y, h;
  13. int i, j, k, m, e;
  14. double *qw, *qs, *pc, *p;
  15. qs = (double *)calloc(2 * n, sizeof(double));
  16. for (j = 0, qw = qs + n, pc = a; j < n; pc += n + 1)
  17. qw[j++] = *pc;
  18. for (j = 0, pc = a; j < n - 2; ++j, pc += n + 1) {
  19. m = n - j - 1;
  20. for (i = 1, sc = 0.; i <= m; ++i)
  21. sc += pc[i] * pc[i];
  22. if (sc > 0.) {
  23. sc = sqrt(sc);
  24. if ((x = *(pc + 1)) < 0.) {
  25. y = x - sc;
  26. h = 1. / sqrt(-2. * sc * y);
  27. }
  28. else {
  29. y = x + sc;
  30. h = 1. / sqrt(2. * sc * y);
  31. sc = -sc;
  32. }
  33. for (i = 0, qw = pc + 1; i < m; ++i) {
  34. qs[i] = 0.;
  35. if (i)
  36. qw[i] *= h;
  37. else
  38. qw[i] = y * h;
  39. }
  40. for (i = 0, e = j + 2, p = pc + n + 1, h = 0.; i < m;
  41. ++i, p += e++) {
  42. qs[i] += (y = qw[i]) * *p++;
  43. for (k = i + 1; k < m; ++k) {
  44. qs[i] += qw[k] * *p;
  45. qs[k] += y * *p++;
  46. }
  47. h += y * qs[i];
  48. }
  49. for (i = 0; i < m; ++i) {
  50. qs[i] -= h * qw[i];
  51. qs[i] += qs[i];
  52. }
  53. for (i = 0, e = j + 2, p = pc + n + 1; i < m; ++i, p += e++) {
  54. for (k = i; k < m; ++k)
  55. *p++ -= qw[i] * qs[k] + qs[i] * qw[k];
  56. }
  57. }
  58. d[j] = *pc;
  59. dp[j] = sc;
  60. }
  61. d[j] = *pc;
  62. dp[j] = *(pc + 1);
  63. d[j + 1] = *(pc + n + 1);
  64. for (j = 0, pc = a, qw = qs + n; j < n; ++j, pc += n + 1) {
  65. *pc = qw[j];
  66. for (i = 1, p = pc + n; i < n - j; p += n)
  67. pc[i++] = *p;
  68. }
  69. free(qs);
  70. }