forked from flintlib/flint
-
Notifications
You must be signed in to change notification settings - Fork 0
/
gso.c
102 lines (89 loc) · 2.67 KB
/
gso.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/*=============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2014 Abhinav Baid
******************************************************************************/
#include "d_mat.h"
void
d_mat_gso(d_mat_t B, const d_mat_t A)
{
slong i, j, k;
int flag;
double t, s;
if (B->r != A->r || B->c != A->c)
{
flint_printf("Exception (d_mat_gso). Incompatible dimensions.\n");
abort();
}
if (B == A)
{
d_mat_t t;
d_mat_init(t, A->r, A->c);
d_mat_gso(t, A);
d_mat_swap(B, t);
d_mat_clear(t);
return;
}
if (A->r == 0)
{
return;
}
for (k = 0; k < A->c; k++)
{
for (j = 0; j < A->r; j++)
{
d_mat_entry(B, j, k) = d_mat_entry(A, j, k);
}
flag = 1;
while (flag)
{
t = 0;
for (i = 0; i < k; i++)
{
s = 0;
for (j = 0; j < A->r; j++)
{
s += d_mat_entry(B, j, i) * d_mat_entry(B, j, k);
}
t += s * s;
for (j = 0; j < A->r; j++)
{
d_mat_entry(B, j, k) -= s * d_mat_entry(B, j, i);
}
}
s = 0;
for (j = 0; j < A->r; j++)
{
s += d_mat_entry(B, j, k) * d_mat_entry(B, j, k);
}
t += s;
flag = 0;
if (s < t)
{
if (s * D_EPS == 0)
s = 0;
else
flag = 1;
}
}
s = sqrt(s);
if (s != 0)
s = 1 / s;
for (j = 0; j < A->r; j++)
{
d_mat_entry(B, j, k) *= s;
}
}
}