Talk:Karatsuba algorithm: Difference between revisions

Content deleted Content added
Line 143:
== A possible generalization aiding by complex number possibilities ? ==
if we have to multiply 2 polinoms but in fact looking 4 their value resulted number obtained for x0= 2^k for the polinom product, we might use as xi, the values that create the system of equations, xi= roots_complex_order_j(1)... j somewhere 1...n, n the numbers of plan partitions: it could help geting a decent system of linear equations thats solves more fast... :) [[Special:Contributions/93.118.212.93|93.118.212.93]] ([[User talk:93.118.212.93|talk]]) 08:21, 28 March 2013 (UTC)
 
:Please locate a proper math forum to discuss your reinventions of the wheel. For instance mathoverflow.net, mathforum.org or the mathematical news groups. Now You are proposing the widely explored application of numerical FFT to polynomial and integer multiplication.--[[User:LutzL|LutzL]] ([[User talk:LutzL|talk]]) 12:54, 28 March 2013 (UTC)