Is there a way to multiply 2 polynomials with complex coefficients by using only 1 FFT and 1 inverse FFT?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | maroonrk | 152 |
4 | nor | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
Is there a way to multiply 2 polynomials with complex coefficients by using only 1 FFT and 1 inverse FFT?
Название |
---|
If you want to calc $$$f(x) * g(x)$$$, you can simply calc $$$(f(x) + g(x)i)^2=f(x)^2 - g(x)^2 +2f(x)g(x)i$$$.
How does that help? f(x)^2-g(x)^2 doesn't have to be real, so how would you extract that part and the part f(x)g(x)? Secondly, squaring is also a multiplication, so your oracle for multiplication uses multiplication...
Squaring can be done in one FFT and one IFFT.
I think that what Rosetxdy means is that if f(x) and g(x) have real coefficients, you can construct (f(x)+ig(x)), square it, and extract the complex part for the answer. I'm not aware of any method to multiply polynomials with non-real coefficients in only 1 FFT and IFFT.
This's my ancient code.:)
Isn't $$$(f(x) + g(x)i)^2 = f(x)^2 - g(x)^2 + 2f(x)g(x)i$$$? I plugged into wolfram alpha :clown:
fixed the typo