Computing greatest common divisors and squarefree decompositions through matrix methods: The parametric and approximate cases

Linear Algebra and Its Applications

Volumn 412, Issue 2-3, 2006, Pages 222-246

  Diaz Toca, Gema M ^a   Gonzalez Vega, Laureano ^b  

^a UNIVERSITY OF MURCIA   (Spain)

^b UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

Approximate gcd of polynomials; Barnett's method; Singular values

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS;

APPROXIMATE GCD OF POLYNOMIALS; BARNETT'S METHOD; SINGULAR VALUES;

MATRIX ALGEBRA;

EID: 27844599241     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2005.06.028     Document Type: Article

References (16)

1. J. Abdeljaoued, and H. Lombardi Méthodes Matricielles-Introduction à la Complexité Algébrique Series: Mathématiques et Applications, vol. 42 2004 Springer
2. S. Barnett Greatest common divisor of several polynomials Proc. Cambridge Philos. Soc. 1971 263 268
3. T.F. Chan An improved algorithm for computing the singular value decomposition ACM Trans. Math. Software 8 1982 72 83
4. R.M. Corless, P.M. Gianni, B.M. Trager, S. Watt, The singular value decomposition for polynomial systems, in: ACM International Symposium on Symbolic and Algebraic Computation, 1995, pp. 195-207.
5. G. Diaz-Toca, and L. Gonzalez-Vega Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices J. Symbolic Comput. 34 1 2002 59 81
6. I. Emiris, A. Galligo, and H. Lombardi Certified approximate polynomial GCDs J. Pure Appl. Algebra 117-118 1997 229 251
7. G.H. Golub, and C.F. van Loan Matrix Computations 1996 The John Hopkins University Press
8. L. Gonzalez-Vega An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomial Linear Algebra Appl. 247 1996 185 202
9. R. Horn, and C. Johnson Matrix Analysis 1985 Cambridge University Press
10. P. Lancaster, and M. Tismenetsky The Theory of Matrices 1985 Academic Press
11. K. Mulmuley Fast parallel algorithm to compute the rank of a matrix over an arbitrary field Combinatorica 7 1987 101 104
12. V. Pan Computation of approximate polynomial GCDs and an extension Inform. and Comput. 167 2001 71 85
13. D. Rupprecht An algorithm for computing certified approximate GCD of n univariate polynomials J. Pure Appl. Algebra 139 1999 255 284
14. D. Rupprecht, Éléments de géométric algébric approchée. étude du pgcd et de la factorisation, Thèse de l'Université de Nice-Sophia Antipolis, January 2000.
15. Z. Zeng, B.H. Dayton, The approximate GCD of inexact polynomials. Part II: A multivariate algorithm, in: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, 2004, pp. 320-327.
16. L.H. Zhi, M.T. Noda, Approximate GCD of multivariate polynomials, in: Proceedings of ASCM 2000, 2000, pp. 9-18.