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
114
115
116
|
/*
Copyright (C) 2008, 2009 William Hart
Copyright (C) 2012 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_poly.h"
void
_acb_poly_mullow_classical(acb_ptr res,
acb_srcptr poly1, slong len1,
acb_srcptr poly2, slong len2, slong n, slong prec)
{
len1 = FLINT_MIN(len1, n);
len2 = FLINT_MIN(len2, n);
if (n == 1)
{
acb_mul(res, poly1, poly2, prec);
}
else if (poly1 == poly2 && len1 == len2)
{
slong i, start, stop;
acb_sqr(res, poly1, prec);
acb_mul(res + 1, poly1, poly1 + 1, prec);
acb_mul_2exp_si(res + 1, res + 1, 1);
for (i = 2; i < FLINT_MIN(n, 2 * len1 - 3); i++)
{
start = FLINT_MAX(0, i - len1 + 1);
stop = FLINT_MIN(len1 - 1, (i + 1) / 2 - 1);
acb_dot(res + i, NULL, 0, poly1 + start, 1,
poly1 + i - start, -1, stop - start + 1, prec);
acb_mul_2exp_si(res + i, res + i, 1);
if (i % 2 == 0 && i / 2 < len1)
acb_addmul(res + i, poly1 + i / 2, poly1 + i / 2, prec);
}
if (len1 > 2 && n >= 2 * len1 - 2)
{
acb_mul(res + 2 * len1 - 3, poly1 + len1 - 1, poly1 + len1 - 2, prec);
acb_mul_2exp_si(res + 2 * len1 - 3, res + 2 * len1 - 3, 1);
}
if (n >= 2 * len1 - 1)
acb_sqr(res + 2 * len1 - 2, poly1 + len1 - 1, prec);
}
else if (len1 == 1)
{
_acb_vec_scalar_mul(res, poly2, n, poly1, prec);
}
else if (len2 == 1)
{
_acb_vec_scalar_mul(res, poly1, n, poly2, prec);
}
else
{
slong i, top1, top2;
acb_mul(res, poly1, poly2, prec);
for (i = 1; i < n; i++)
{
top1 = FLINT_MIN(len1 - 1, i);
top2 = FLINT_MIN(len2 - 1, i);
acb_dot(res + i, NULL, 0, poly1 + i - top2, 1,
poly2 + top2, -1, top1 + top2 - i + 1, prec);
}
}
}
void
acb_poly_mullow_classical(acb_poly_t res, const acb_poly_t poly1,
const acb_poly_t poly2,
slong n, slong prec)
{
slong len_out;
if (poly1->length == 0 || poly2->length == 0 || n == 0)
{
acb_poly_zero(res);
return;
}
len_out = poly1->length + poly2->length - 1;
if (n > len_out)
n = len_out;
if (res == poly1 || res == poly2)
{
acb_poly_t t;
acb_poly_init2(t, n);
_acb_poly_mullow_classical(t->coeffs, poly1->coeffs, poly1->length,
poly2->coeffs, poly2->length, n, prec);
acb_poly_swap(res, t);
acb_poly_clear(t);
}
else
{
acb_poly_fit_length(res, n);
_acb_poly_mullow_classical(res->coeffs, poly1->coeffs, poly1->length,
poly2->coeffs, poly2->length, n, prec);
}
_acb_poly_set_length(res, n);
_acb_poly_normalise(res);
}
|
