I_love_Saundarya's blog

By I_love_Saundarya, history, 5 years ago, In English

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 ?

»
5 years ago, # |
  Vote: I like it +122 Vote: I do not like it

Yes.

  • »
    »
    13 days ago, # ^ |
      Vote: I like it -51 Vote: I do not like it

    How?

    • »
      »
      »
      13 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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.

      • »
        »
        »
        »
        12 days ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        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.

        • »
          »
          »
          »
          »
          12 days ago, # ^ |
          Rev. 2   Vote: I like it 0 Vote: I do not like it

          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?

          • »
            »
            »
            »
            »
            »
            12 days ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            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 ?

            • »
              »
              »
              »
              »
              »
              »
              12 days ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              Explain it more clearly.

              • »
                »
                »
                »
                »
                »
                »
                »
                12 days ago, # ^ |
                  Vote: I like it 0 Vote: I do not like it

                Ok I want to devide two polynomials, how can i do it?

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  12 days ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  You can do long division

            • »
              »
              »
              »
              »
              »
              »
              12 days ago, # ^ |
              Rev. 2   Vote: I like it 0 Vote: I do not like it

              Why wouldn't you like to shift the dot? Also for big floating point numbers: the mantissa can be FFTed.

              • »
                »
                »
                »
                »
                »
                »
                »
                12 days ago, # ^ |
                Rev. 2   Vote: I like it 0 Vote: I do not like it

                Beacause my real problem is to divide 2 bigints. How can i do long division?