Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor

References

• Abdeljaoued J (1997) Algorithmes rapides pour le calcul du polynôme caractéristique Tesis Doctoral, Université de Franche-Comté Francia
   Google Scholar
• Abdeljaoued , J . (1997) . Berkowitz algorithm, maple and computing the characteristic polynomial in an arbitrary commutative ring . MapleTech, Birkhauser , 4 ( 3 )
   Google Scholar
• Akritas AG (1989) Elements of Computer Algebra with Applications, Wiley-Interscience
   Google Scholar
• Basu , S , Pollack , R and Roy , M-F . (2003) . Algorithms in real algebraic geometry . Algorithms and Computations in Mathematics, Springer-Verlag , 10
   Google Scholar
• Berkowitz , SJ . (1984) . On computing the determinant in small parallel time using a small number of processors . Information Processing Letters , 18 : 147 – 150 .
   Google Scholar
• Bini D Pan V (1994) Polynomial and Matrix Computations, Birkhäuser
   Google Scholar
• Brown , WS and Traub , JF . (1971) . On Euclid's algorithm and the theory of subresultants . Journal of Association for Computing Machinery , 118 : 505 – 514 .
   Google Scholar
• Chistov , AL . (1985) . Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic . Proc. FCT '85, Springer Lecture Notes in Computer Science , 199 : 147 – 150 .
   Google Scholar
• Collins , GE . (1967) . Subresultants and reduced polynomial remainder sequences . Journal of Association for Computing Machinery , 14 : 128 – 142 .
   Web of Science ®Google Scholar
• Collins , GE . (1975) . Quantifier elimination for real closed fields by cilindrical algebraic decomposition . Second GI Conference on Automata Theory and formal Languages, Lectures Notes in Computer Science, Springer-Verlag , 33 : 134 – 183 .
   Google Scholar
• Collins GE (1998) Quantifier elimination by cylindrical algebraic decomposition – 20 years of progress Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation, Springer-Verlag pp. 8–23
   Google Scholar
• Diaz-Toca G (2002) Algoritmos eficientes en algebra computacional Ph. D. Thesis, Universidad de Cantabria
   Google Scholar
• Diaz-Toca , G and Gonzalez-Vega , L . (2002) . Barnett's theorem about the greatest common divisor of several univariate polynomials throug Bezout-like matrices . Journal of Symbolic Computation , 34 : 59 – 81 .
   Google Scholar
• Diaz-Toca G Gonzalez-Vega L (2004) Various new expressions for subresultants and their applications Applicable Algebra in Engineering, Communication and Computing to appear
   Google Scholar
• Eberly W (1985) Very fast parallel matrix and polynomial arithmetic Technical Report # 178/85, Phd Thesis, University of Toronto CA 19 27
   Google Scholar
• Faddeev DK Faddeeva VN (1963) Computational Methods of Linear Algebra, W.H. Freeman & Co. San Francisco
   Google Scholar
• Gonzalez-Vega , L , Lombardi , H , Recio , T and Roy , M-F . (1990) . Specialisation de la suite de Sturm et sous-resultants (I) . Informatique Theorique et Applications , 24 ( 6 ) : 561 – 588 .
   Google Scholar
• Griss , Martin L . (1978) . Using an efficient sparse minor expansion. Algorithm to compute polynomial subresultants and the greatest common denominator . IEEE Transactions on Computers , c-27 ( 10 ) : 945 – 949 .
   Google Scholar
• Helmke , U and Fuhrmann , PA . (1989) . Linear Algebra and Its Applications , 122/123/124 : 1039 – 1097 .
   Google Scholar
• Hong H (1998) An improvement of the projection operator in cylindrical algebraic decomposition. Quantifier elimination and cylindrical algebraic decomposition Texts and Monographs in Symbolic Computation, Springer-Verlag 166 173
   Google Scholar
• Krein MG Naimark MA (1981) The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations Linear and Multilinear Algebra 10 265 308 The original Russian version was published in 1936
   Google Scholar
• Loos , R . (1982) . Generalized polynomial remainder sequences . Computer Algebra, Computing Suplementum, Springer-Verlag , 4 : 115 – 138 .
   Google Scholar
• Lombardi , H , Roy , M-F and Safey , M . (2000) . New structure theorem for subresultants . Journal of Symbolic Computation , 29 : 663 – 689 .
   Google Scholar
• Wang D (2000) Subresultants with the Bezout matrix. Computer mathematics Proceedings of the Fourth Asian Symposium on Computer Mathematics (ASCM 2000), World Scientific 19 28
   Google Scholar
• Zippel R (1952) Effective Polynomial Computation, Kluwer Academic Publishers Group
   Google Scholar