Reliable Computing 1 (4) (1995), pp. 375-381 Matrix computation of Summary: Reliable Computing 1 (4) (1995), pp. 375-381 Matrix computation of polynomial remainder domains subresultant sequences in integral ALKIVIADISG. AKRITAS, EVGENIA K. AKRITAS, and GENADII I. MALASCHONOK We present an impr{wed variant of the matrix-triangularization subresultant prs method [1] fi~r the computation of a greatest comnum divi~w of two polynomials A and B (of degrees m and n, respectively) along with their polynomial remainder ~quence. It is impr~wed in the sense that we obtain complete theoretical results, independent {}fVan Vleck's theorem [13] (which is not always tnle [2, 6]), and, instead of transfornfing a matrix of order 2 .max(m, n) [1], we are now transforming a matrix of order m+ n. An example is al.,a~induded to clarify the concepts. MaTpqHOe SbIqCAeHe cy6pe3yAt,TaHTHBIX IIOAHHOMIIaAbHbIX nocAeAOBaTeABHOCTefl OCTaTKOB B HHTeFpaABHblX 06AaCTXX A. F. AKP//rrAc, E. K. AKPHTAC, F. I/'l. MAAAmOHOK Flpe~lcraBJ'lerl yJlyqnleHH/:,ll~ Bapl.laHT MaTpl.lqHo-rpHaHlyJl.qpH3alIHOHHOlO cy6pe3yJlbTanTHOl'O MeToaa no- :lllHOMtlaJlbl-n~x,u~c:xea<>marem,ti :lnTedl~! 21ByX MHOrOttdleH(}B m n B (CTelleHelTI m ii n C{R)TBC~'I'(YrBeHHO)C O}IHOBpeMeHHI~M HaxoxK31eHHeM Collections: Computer Technologies and Information Sciences