Division-free computation of subresultants using Bezout matrices

References

• Abdeljaoued , J. and Lombardi , H. 2004 . Méthodes matricielles. Introduction à la complexité algébrique , Berlin/Heidelberg/New York : Springer .
   Google Scholar
• Abdeljaoued , J. , Diaz-Toca , G. and Gonzalez-Vega , L. 2004 . Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor . Int. J. Comput. Math. , 81 : 1223 – 1238 .
   Google Scholar
• Basu , S. , Pollack , R. and Roy , M. F. 2006 . Algorithms in Real Algebraic Geometry , 2 , Berlin/Heidelberg/ New York : Springer .
   Google Scholar
• Berkowitz , S. 1984 . On computing the determinant in small parallel time using a small number of processors . Inform. Process. Lett. , 18 : 147 – 150 .
   Google Scholar
• Borodin , A. , von zur Gathen , J. and Hopcroft , J. 1982 . Fast parallel matrix and GCD computations . Inform. Control , 52 : 241 – 256 .
   Google Scholar
• Brown , W. and Traub , J. 1971 . On Euclid's algorithm and the theory of subresultants . J. Ass. Comput. Mach. , 18 : 504 – 514 .
   Google Scholar
• Chionh , E. , Zhang , M. and Goldman , R. 1999 . Transformations and transitions from the sylvester to the bezout resultant , Department of Computer Science, Rice University . Tech. Rep. TR99-343
   Google Scholar
• Chionh , E. , Zhang , M. and Goldman , R. 2002 . Fast computation of the Bezout and Dixon resultant matrices . J. Symbolic Comput. , 33 : 13 – 29 .
   Google Scholar
• Collins , G. 1967 . Subresultants and reduced polynomial remainder sequences . J. Ass. Comput. Mach. , 14 : 128 – 142 .
   Web of Science ®Google Scholar
• Coppersmith , D. and Winograd , S. 1990 . Matrix multiplication via arithmetic progressions . J. Symbolic Comput. , 9 : 251 – 280 .
   Web of Science ®Google Scholar
• Diaz-Toca , G. and Gonzalez-Vega , L. 2004 . Various new expressions for subresultants and their applications . Appl. Algebra Eng. Commun. Comput. , 15 : 233 – 266 .
   Google Scholar
• Ducos , L. 2000 . Optimizations of the subresultant algorithm . J. Pure Appl. Algeb. , 145 : 149 – 163 .
   Google Scholar
• Geddes , K. , Czapor , S. and Labahn , G. 1992 . Algorithms for Computer Algebra , Norwell, MA, USA : Kluwer Academic Publishers .
   Google Scholar
• Hou , X. and Wang , D. Subresultants with the bezout matrix . Proceedings of the Fourth Asian Symp. on Computer Mathematics (ASCM 2000) . pp. 19 – 28 .
   Google Scholar
• Kaltofen , E. 1989 . Processor-Efficient Parallel Computation of Polynomial Greatest Common Divisor , Troy, NY : Dept. Comput. Sci., Rensselaer Polytechnic Institute . manuscript
   Google Scholar
• Lombardi , H. , Roy , M. F. and Din , M. E. 2000 . New structure theorem for subresultants . J. Symbolic Comput. , 29 : 663 – 689 .
   Google Scholar
• Loos , R. 1982 . “ Generalized polynomial remainder sequences ” . In Computer Algebra – Symbolic and Algebraic Computation , Edited by: Buchberger , B. , Collins , G. and Loos , R. 115 – 138 . Springer, Wien/New York .
   Google Scholar
• Rote , G. 2001 . “ Division-free algorithms for the determinant and the pfaffian: Algebraic and combinatorial approaches ” . In Lecture notes in Computer Science , Edited by: Alt , H. Vol. 2122 , 119 – 135 . Berlin/Heidelberg/New York : Springer .
   Google Scholar
• Samuelson , P. 1942 . A method of determining explicitly the coefficients of the characteristic equation . Ann. Math. Statist. , 13 : 424 – 429 .
   Google Scholar
• von zur Gathen , J. and Lücking , T. 2003 . Subresultants revisited . Theo. Comp. Sci. , : 199 – 239 .
   Google Scholar
• Yap , C. 2000 . Fundamental Problems of Algorithmic Algebra , Oxford : Oxford University Press .
   Google Scholar