The ERES method for computing the approximate GCD of several polynomials

Applied Numerical Mathematics

Volumn 60, Issue 1-2, 2010, Pages 94-114

  Christou, D ^a   Karcanias, N ^a   Mitrouli, M ^b  

^a CITY UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Approximate greatest common divisor; Gaussian elimination; Partial SVD; Symbolic numeric computations

Indexed keywords

APPROXIMATE GCD; APPROXIMATE SOLUTION; BASIC PRINCIPLES; COMPUTATIONAL PROPERTIES; EFFICIENT IMPLEMENTATION; GAUSSIAN ELIMINATION; GREATEST COMMON DIVISORS; HYBRID IMPLEMENTATION; NUMERIC COMPUTATION; OPTIMIZATION ALGORITHMS; PROJECTIVE SPACES; WORK FOCUS;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; POLYNOMIALS; SIGNAL PROCESSING; SINGULAR VALUE DECOMPOSITION; TOPOLOGY;

COMPUTATIONAL EFFICIENCY;

EID: 71549165486     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apnum.2009.10.002     Document Type: Article

References (33)

1. Barlow J.L. More accurate bidiagonal reduction for computing the singular value decomposition. SIAM J. Matrix Anal. Appl. 23 3 (2002) 761-798
2. Barnett S. Greatest common divisor of several polynomials. Proc. Cambridge Philos. Soc. (1971) 263-268
3. Barnett S. Greatest common divisor from generalized Sylvester matrices. Proc. Cambridge Philos. Soc. 8 (1980) 271-279
4. Blankiship W. A new version of Euclid algorithm. American Mathematics Monthly 70 (1963) 742-744
5. Brown W.S. On Euclid's algorithm and the computation of polynomials greatest common divisors. Journal of the Association for Computer Machinery 18 4 (1971) 478-504
6. Chan T.F. An improved algorithm for computing the singular value decomposition. ACM Trans. Math. Soft. 8 (1982) 72-83
7. R.M. Corless, P.M. Gianni, B.M. Trager, S.M. Watt, The singular value decomposition for polynomial systems, in: Proc. ISSAC '95, Quebec, Canada, 1995, pp. 195-207
8. Datta B.N. Numerical Linear Algebra and Applications (1995), Brooks/Cole Publishing Company - ITP
9. Diaz-Toca G.M., and Gonzalez-Vega L. Computing greatest common divisors and squarefree decompositions through matrix methods: The parametric and approximate cases. Linear Algebra and its Applications 412 (2006) 222-246
10. Emiris I.Z., Galligo A., and Lombardi H. Certified approximate univariate gcds. Journ. Pure and Applied Algebra 117-118 (1997) 229-251
11. Fatouros S., and Karcanias N. Resultant properties of the gcd of many polynomials and a factorisation representation of gcd. Int. Journ. Control 76 16 (2003) 1666-1683
12. Foster L. Rank and null space calculations using matrix decomposition without column interchanges. Linear Algebra and its Applications 74 (1986) 47-71
13. Golub G., and Kahan W. Calculating the singular values and pseudo-inverse of a matrix. SIAM J. Num. Anal. Ser. B 2 (1965) 205-224
14. Golub G., and Loan C.V. Matrix Computations. 2nd ed. (1989), The John Hopkins University Press, Baltimore, London
15. Hirsch M., and Smale S. Differential Equations. Dynamical Systems and Linear Algebra (1974), Academic Press, New York
16. Kailath T. Linear Systems (1980), Prentice Hall, Inc., Englewood Cliffs, NJ
17. Karcanias N. Invariance properties and characterisation of the greatest common divisor of a set of polynomials. Int. Journ. Control 46 (1987) 1751-1760
18. Karcanias N., Fatouros S., Mitrouli M., and Halikias G. Approximate greatest common divisor of many polynomials, generalised resultants and strength of approximation. Computers & Mathematics with Applications 51 12 (2006) 1817-1830
19. Karcanias N., Giannakopoulos G., and Hubbard M. Almost zeros of a set of polynomials. Int. Journ. Control 40 (1984) 439-457
20. Karcanias N., and Mitrouli M. A matrix pencil based numerical method for the computation of the gcd of polynomials. IEEE Trans. Autom. Cont. 39 (1994) 977-981
21. Karcanias N., and Mitrouli M. Approximate algebraic computations of algebraic invariants. Symbolic Methods in Control Systems Analysis and Design. IEE Control Engin. Series vol. 56 (1999) 162-168
22. Karmarkar N., and Lakshman Y.N. On approximate gcds of univariate polynomials. J. Symbolic Computation 26 6 (1998) 653-666
23. J. Leventides, N. Karcanias, Genericity, generic system properties and generic values of invariants, Research Report SDCU 047, Control Engineering Centre, City University, London (May 1996)
24. Marcus M., and Minc M. A Survey of Matrix Theory and Matrix Inequalities (1964), Allyn and Bacon, Boston
25. Mitrouli M., and Karcanias N. Computation of the gcd of polynomials using Gaussian transformation and shifting. Int. Journ. Control 58 (1993) 211-228
26. Noda M., and Sasaki T. Approximate gcd and its applications to ill-conditioned algebraic equations. Journ. of Comp. and Appl. Math. 38 (1991) 335-351
27. Pace I.S., and Barnett S. Comparison of algorithms for calculation of g.c.d. of polynomials. Int. Journ. Control 4 2 (1973) 211-216
28. Rupprecht D. An algorithm for computing certified approximate gcd of n univariate polynomials. Journ. of Pure and Applied Algebra 139 (1999) 255-284
29. Van Huffel S. Partial singular value decomposition algorithm. Journ. of Comp. and Appl. Math. 33 (1990) 105-112
30. Van Huffel S., and Vandewalle J. An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values. Journ. of Comp. and Appl. Math. 19 (1987) 313-330
31. Vardulakis A.I.G., and Stoyle P.N.R. Generalized resultant theorem. IMA Journal of Applied Mathematics 22 3 (1978) 331-335
32. Wonham W.M. Linear Multivariable Control: A Geometric Approach. 2nd ed. (1984), Springer-Verlag, New York
33. Z. Zeng, The approximate gcd of inexact polynomials. Part I: A univariate algorithm, Manuscript, 2004