Content deleted Content added
Line 135:
== ok, abt some a bit different K idea possible able 4 generalization ==
multiplying A=(a1;a2) with B=(b1;b2) might be planned like this (a1+b1)*(a2+b2), (a1-b1)*(a2-b2), and a1*b1... i think this could challenge Toom-Cook algo, by some K. generalization that use mostly algebraic sums n possibly finding more simplier systems of equation... the algebraic sums to b multiplied that ofer decent agebraig sums of desired coetients might b search evn automatically, by the computer...good luck! (i posted similary tries on Toom - Cook talk page.) [[Special:Contributions/93.118.212.93|93.118.212.93]] ([[User talk:93.118.212.93|talk]]) 10:51, 27 March 2013 (UTC)
... ive tested the idea above but there r just a few matches 4 that, found with the computer , n im not able to make a desirable system of linear equations ,but im trying here another generalization idea, inspired by the Toom-Cook algo also:
lets consider that we want actualy to multiply 2 polinoms A(x)=(h1(x);l1(x)) n B(x)=(h2(x);l2(x))
wedd want the value of the product for some xo=2^k value... we plan to do 3 small multiplications h1(1)*h2(1), l1(1)*l2(1) n (h1+l1)(1)*(h2+l2)(1) but, after obtaining the values (using K. classic algo) we multiply properly with 2^t two of the resulted polynoms action that sooner or later, is expected to ofer the desired results of the multiplication of the two polynoms n aplied to the x0 =2^k value meaning the multiplication is over... time looks pretty appealing, IF its working :) [[Special:Contributions/93.118.212.93|93.118.212.93]] ([[User talk:93.118.212.93|talk]]) 07:06, 28 March 2013 (UTC)
| |||