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
103
104
105
106
107
108
109
110
111
112
113
|
/*
Copyright (C) 2018 Fredrik Johansson
This file is part of Arb.
Arb is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version. See <http://www.gnu.org/licenses/>.
*/
#include "acb_mat.h"
static void
_apply_permutation(slong * AP, acb_mat_t A, slong * P,
slong n, slong offset)
{
if (n != 0)
{
acb_ptr * Atmp;
slong * APtmp;
slong i;
Atmp = flint_malloc(sizeof(acb_ptr) * n);
APtmp = flint_malloc(sizeof(slong) * n);
for (i = 0; i < n; i++) Atmp[i] = A->rows[P[i] + offset];
for (i = 0; i < n; i++) A->rows[i + offset] = Atmp[i];
for (i = 0; i < n; i++) APtmp[i] = AP[P[i] + offset];
for (i = 0; i < n; i++) AP[i + offset] = APtmp[i];
flint_free(Atmp);
flint_free(APtmp);
}
}
int
acb_mat_lu_recursive(slong * P, acb_mat_t LU, const acb_mat_t A, slong prec)
{
slong i, m, n, r1, r2, n1;
acb_mat_t A0, A1, A00, A01, A10, A11;
slong * P1;
m = A->r;
n = A->c;
if (m <= 1 || n <= 1)
{
return acb_mat_lu_classical(P, LU, A, prec);
}
if (LU != A)
acb_mat_set(LU, A);
n1 = n / 2;
for (i = 0; i < m; i++)
P[i] = i;
P1 = flint_malloc(sizeof(slong) * m);
acb_mat_window_init(A0, LU, 0, 0, m, n1);
acb_mat_window_init(A1, LU, 0, n1, m, n);
r1 = acb_mat_lu(P1, A0, A0, prec);
if (!r1)
{
flint_free(P1);
acb_mat_window_clear(A0);
acb_mat_window_clear(A1);
return 0;
}
/* r1 = rank of A0 */
r1 = FLINT_MIN(m, n1);
_apply_permutation(P, LU, P1, m, 0);
acb_mat_window_init(A00, LU, 0, 0, r1, r1);
acb_mat_window_init(A10, LU, r1, 0, m, r1);
acb_mat_window_init(A01, LU, 0, n1, r1, n);
acb_mat_window_init(A11, LU, r1, n1, m, n);
acb_mat_solve_tril(A01, A00, A01, 1, prec);
{
/* acb_mat_submul(A11, A11, A10, A01, prec); */
acb_mat_t T;
acb_mat_init(T, A10->r, A01->c);
acb_mat_mul(T, A10, A01, prec);
acb_mat_sub(A11, A11, T, prec);
acb_mat_clear(T);
}
r2 = acb_mat_lu(P1, A11, A11, prec);
if (!r2)
r1 = r2 = 0;
else
_apply_permutation(P, LU, P1, m - r1, r1);
flint_free(P1);
acb_mat_window_clear(A00);
acb_mat_window_clear(A01);
acb_mat_window_clear(A10);
acb_mat_window_clear(A11);
acb_mat_window_clear(A0);
acb_mat_window_clear(A1);
return r1 && r2;
}
|
