Anonymous user
QR decomposition: Difference between revisions
→{{header|C}}: bugfix #2
(→{{header|C}}: bugfix; still ugly) |
(→{{header|C}}: bugfix #2) |
||
Line 534:
mat q[m->m];
mat z = m, z1;
for (int k = 0; k < m->n && k < m->m - 1; k++) {
double e[m->m], x[m->m], a;
z1 = matrix_minor(z, k);
Line 557:
*Q = q[0];
*R = matrix_mul(q[0], m);
for (int i = 1; i < m->n && i < m->m - 1; i++) {
z1 = matrix_mul(q[i], *Q);
if (i > 1) matrix_delete(*Q);
Line 600:
<pre>
Q
0.846 -0.391 0.
0.423 0.904 -0.
-0.282 0.170 0.
-0.071 0.014
0.141 -0.017 -0.
R
14.177 20.667 -13.402
-0.000 175.043 -70.080
0.000 0.000 -35.
-0.000 -0.000
Q * R
| |||