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

International Journal of Computer Mathematics

Volumn 81, Issue 10, 2004, Pages 1223-1238

  Abdeljaoued, J ^a   Diaz Toca, G M ^b   Gonzalez Vega, L ^c  

^a UNIVERSITY OF TUNIS   (Tunisia)

^b UNIVERSITY OF MURCIA   (Spain)

^c UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

Bezout matrices; Polynomial gcd; Subresultant

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; POLYNOMIALS;

BEZOUT MATRICES; POLYNOMIAL GCD;

PARAMETER ESTIMATION;

EID: 10844250893     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160412331284178     Document Type: Article

References (25)

1. Abdeljaoued, J. (1997). Algorithmes rapides pour le calcul du polynôme caractéristique. Tesis Doctoral, Université de Franche-Comté, Francia.
2. Abdeljaoued, J. (1997). Berkowitz algorithm, maple and computing the characteristic polynomial in an arbitrary commutative ring. MapleTech, 4(3), Birkhauser.
3. Akritas, A. G. (1989). Elements of Computer Algebra with Applications. Wiley-Interscience.
4. Basu. S., Pollack, R. and Roy, M.-F. (2003). Algorithms in real algebraic geometry. Algorithms and Computations in Mathematics. Vol. 10. Springer-Verlag.
5. Berkowitz, S. J. (1984). On computing the determinant in small parallel time using a small number of processors. Information Processing Letters, 18, 147-150.
6. Bini, D. and Pan, V. (1994). Polynomial and Matrix Computations. Birkhäuser.
7. Brown, W. S. and Traub, J. F. (1971). On Euclid's algorithm and the theory of subresultants. Journal of Association for Computing Machinery. 118, 505-514.
8. Chistov, A. L. (1985). Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. Proc. FCT '85, Springer Lecture Notes in Computer Science. Vol. 199, 147-150.
9. Collins, G. E. (1967). Subresultants and reduced polynomial remainder sequences. Journal of Association for Computing Machinery, 14, 128-142.
10. Collins, G. E. (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. Vol. 33, 134-183, Springer-Verlag.
11. Collins, G. E. (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.
12. Diaz-Toca, G. (2002). Algoritmos eficientes en algebra computacional. Ph. D. Thesis, Universidad de Cantabria.
13. 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.
14. Diaz-Toca, G. and Gonzalez-Vega, L. (2004). Various new expressions for subresultants and their applications. Applicable Algebra in Engineering, Communication and Computing, to appear.
15. Eberly, W. (1985). Very fast parallel matrix and polynomial arithmetic. Technical Report # 178/85, Phd Thesis, University of Toronto CA, 19-27.
16. Faddeev, D. K. and Faddeeva, V. N. (1963). Computational Methods of Linear Algebra. W.H. Freeman & Co., San Francisco.
17. Gonzalez-Vega, L., Lombardi, H., Recio, T. and Roy, M.-F. (1990). Specialisation de la suite de Sturm et sous-resultants (1). Informatique Theorique et Applications, 24(6), 561-588.
18. 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.
19. Helmke, U. and Fuhrmann, P. A. (1989). Linear Algebra and Its Applications, 122/123/124, 1039-1097.
20. 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.
21. Krein, M. G. and Naimark, M. A. (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.
22. Loos, R. (1982). Generalized polynomial remainder sequences. Computer Algebra, Computing Suplementum. 4, Springer-Verlag, 115-138.
23. Lombardi, H., Roy, M.-F. and Safey, M. (2000). New structure theorem for subresultants. Journal of Symbolic Computation, 29, 663-689.
24. 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.
25. Zippel, R. (1952). Effective Polynomial Computation. Kluwer Academic Publishers Group.