Polynomial GCD Derived through Monic Polynomial Subtractions

Algorithm 2

≫

≫ p = [1   −5   2   −6   76   140   −802 954   −4251   13663   −18740   28472   −53504   45776   5212⋯

     −77580   185243   −220631   104794   52458   −193356   248612   −146266   9202   65791⋯

     −87555 55800 −13500  0  0  0  0  0];

≫ q = polyder(p);

≫ q = polygcd(p,q);

≫ p, q, g,

   p =

       1     −5   2    −6        76  140     −802     954       −4251

      13663      −18740  28472      −53504         45776     5212     −77580        185243     –220631

   104794         52458  −193356     248612    −146266     9202    65791      −87555    55800

    −13500   0   0   0     0        0

   q =

     32    −155     60     −174           2128            3780         −20852     23850   −102024

    314249  −412280      597912       −1070080    869744        93816  –1318860 2963888     –3309465

     1467116     681954  −2320272       2734732  –1462660       82818         526328 −612885    334800

    −67500   0       0       0   0

   g =

    1       −5     10  −36       116 −188  308    −620  694

      −214       −496    1348 −1740      1012   28    −692      929          −605

   150     0       0   0   0

≫