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
|
/*
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"
int main()
{
slong iter;
flint_rand_t state;
flint_printf("solve_triu....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 2000 * arb_test_multiplier(); iter++)
{
acb_mat_t A, X, B, Y;
slong rows, cols, prec, i, j;
int unit;
prec = 2 + n_randint(state, 200);
if (n_randint(state, 10) == 0)
{
rows = n_randint(state, 60);
cols = n_randint(state, 60);
}
else
{
rows = n_randint(state, 10);
cols = n_randint(state, 10);
}
unit = n_randint(state, 2);
acb_mat_init(A, rows, rows);
acb_mat_init(B, rows, cols);
acb_mat_init(X, rows, cols);
acb_mat_init(Y, rows, cols);
acb_mat_randtest(A, state, prec, 10);
acb_mat_randtest(X, state, prec, 10);
acb_mat_randtest(Y, state, prec, 10);
for (i = 0; i < rows; i++)
{
if (unit)
acb_one(acb_mat_entry(A, i, i));
else
acb_set_ui(acb_mat_entry(A, i, i), 1 + n_randint(state, 100));
for (j = 0; j < i; j++)
acb_zero(acb_mat_entry(A, i, j));
}
acb_mat_mul(B, A, X, prec);
if (unit) /* check that diagonal entries are ignored */
{
for (i = 0; i < rows; i++)
acb_set_ui(acb_mat_entry(A, i, i), 1 + n_randint(state, 100));
}
/* Check Y = A^(-1) * (A * X) = X */
acb_mat_solve_triu(Y, A, B, unit, prec);
if (!acb_mat_overlaps(Y, X))
{
flint_printf("FAIL\n");
flint_printf("A = \n"); acb_mat_printd(A, 10); flint_printf("\n\n");
flint_printf("B = \n"); acb_mat_printd(B, 10); flint_printf("\n\n");
flint_printf("X = \n"); acb_mat_printd(X, 10); flint_printf("\n\n");
flint_printf("Y = \n"); acb_mat_printd(Y, 10); flint_printf("\n\n");
flint_abort();
}
/* Check aliasing */
acb_mat_solve_triu(B, A, B, unit, prec);
if (!acb_mat_equal(B, Y))
{
flint_printf("FAIL (aliasing)\n");
flint_printf("A = \n"); acb_mat_printd(A, 10); flint_printf("\n\n");
flint_printf("B = \n"); acb_mat_printd(B, 10); flint_printf("\n\n");
flint_printf("X = \n"); acb_mat_printd(X, 10); flint_printf("\n\n");
flint_printf("Y = \n"); acb_mat_printd(Y, 10); flint_printf("\n\n");
flint_abort();
}
acb_mat_clear(A);
acb_mat_clear(B);
acb_mat_clear(X);
acb_mat_clear(Y);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}
|
