An algorithm for computing certified approximate GCD of n univariate polynomials

Journal of Pure and Applied Algebra

Volumn 139, Issue 1, 1999, Pages 255-284

  Rupprecht, David ^a  

^a UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033147489     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(99)00014-6     Document Type: Article

References (11)

1. B. Beauzamy, E. Bombieri, P. Enflo, H.L. Montgomery, Products of polynomials in many variables, J. Number Theory 36 (1990) 219-245.
2. R. Corless, P. Gianni, B. Trager, S. Watt, The singular value decomposition for polynomial systems, in: ACM Internat. Symp. on Symbolic and Algebraic Computation, 1995, pp. 195-207.
3. J. Dégot, Un Théorème de Certification pour le Degré du pgcd Approché de Deux Polynomes, Université de Limoges, Département de Mathématiques, 123 av. Albert Thomas, 87060 Limoges, France, 1996.
4. I.Z. Emiris, A. Galligo, H. Lombardi, Numerical univariate polynomial gcd, in: Proc. AMS-SIAM Summer Seminar on Math. of Numerical Analysis, Lectures in Applied Math., 1995.
5. I.Z. Emiris, A. Galligo, H. Lombardi, Certified approximate univariate gcds, in: Proc. 4th Internat. Effective Methods in Algebraic Geometry (MEGA), 1997, in press.
6. G.H. Golub, C.F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1989.
7. V. Hribernig, H.J. Stetter, Detection and validation of clusters of zeros of polynomials, J. Symbolic Comput. 1996, Special Issue on Validation and Symbolic Computing.
8. N. Karmarkar, Y.N. Lakshman, Approximate polynomial greatest common divisors and nearest singular polynomials, in: ACM Internat. Symp. on Symbolic and Algebraic Computation, 1995.
9. M. Mignotte, Mathématiques pour le Calcul Formel, Presses Universitaires de France, Paris, 1989.
10. V.Y. Pan, Numerical Computation of a Polynomial gcd and Extensions, City Univ. of New York, 1996.
11. A. Schönhage, Quasi-gcd computations, J. Complexity 1 (1985) 118-137.