9 int solvps(
double *a,
double *
b,
int n)
11 double *p, *q, *
r, *s,
t;
15 for (j = 0, p = a; j < n; ++j, p += n + 1) {
16 for (q = a + j * n; q < p; ++q)
21 for (k = j + 1, q = p + n; k < n; ++k, q += n) {
22 for (r = a + j * n, s = a + k * n, t = 0.; r < p;)
28 for (j = 0, p = a; j < n; ++j, p += n + 1) {
29 for (k = 0, q = a + j * n; k < j;)
30 b[j] -= b[k++] * *q++;
33 for (j = n - 1, p = a + n * n - 1; j >= 0; --j, p -= n + 1) {
34 for (k = j + 1, q = p + n; k < n; q += n)
int solvps(double *a, double *b, int n)