Say, I have 2 vectors : — (1,2,3) and (0.3,0.5,1) .
Can FFT be applied to find the multiplication of these 2 polynomials ?
Say, I have 2 vectors : — (1,2,3) and (0.3,0.5,1) .
Can FFT be applied to find the multiplication of these 2 polynomials ?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 161 |
| 2 | adamant | 147 |
| 3 | Um_nik | 145 |
| 4 | Dominater069 | 142 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Yes.
How?
Why did you think that FFT is only applicable to integers? Normal FFT uses floating point numbers in their calculations and the result returned is their floating point convolution. It's worked with as integers for multiplying polynomials with integer coefficients.
I can't do it because i do round in my fft, i have to multiplay the polynomial with a 10^number to make it integer.
I don't understand what you are talking about. FFT is suitable for complex/floating point convolution, there's no need to multiply by some power of 10 to pass integers to FFT.
maybe you think that FFT is NTT?I bass doubles ok but i meant can i multiplay 2.5+3.2*a^1+4.5*a^2 With 3.5+1.3*a^1+3.4*a^2 ? or can i multplay two doubles as a bigdoubles with fft like bigint with fft like this 9493888383893383883.429382828484828482883 without shifting the dot ?
Explain it more clearly.
Ok I want to devide two polynomials, how can i do it?
You can do long division
Why wouldn't you like to shift the dot? Also for big floating point numbers: the mantissa can be FFTed.
Beacause my real problem is to divide 2 bigints. How can i do long division?