Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation

Computers and Mathematics with Applications

Volumn 51, Issue 12, 2006, Pages 1817-1830

  Karcanias, N ^a   Fatouros, S ^a   Mitrouli, M ^b   Halikias, G H ^a  

^a CITY UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Approximate computations; Greatest common divisor; Polynomials

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATE COMPUTATIONS; FACTORISATION; GREATEST COMMON DIVISOR (GCD); NONGENERIC PROBLEM;

POLYNOMIALS;

EID: 33747069646     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2006.01.010     Document Type: Article

References (13)

1. Karcanias N., and Mitrouli M. Approximate algebraic computations of algebraic invariants. Symbolic methods in control systems analysis and design, IEE Control Engin. Series 56 (1999) 135-168
2. Karcanias N., Giannakopoulos G., and Hubbard M. Almost zeros of a set of polynomials. Int. Journ. Control 40 (1984) 673-698
3. Mitrouli M., and Karcanias N. Computation of the GCD of polynomials using Gaussian transformation and shifting. Int. Journ. Control 58 (1993) 211-228
4. 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
5. Noda M., and Sasaki T. Approximate GCD and its applications to ill-conditioned algebraic equations. Jour. of Comp. and Appl. Math. 38 (1991) 335-351
6. Quebec, Canada. Corless R.M., Gianni P.M., Trager B.M., and Watt S.M. The singular value decomposition for polynomial systems. Proc. ISAAC '95 (1995) 195-207
7. Karmarkar N., and Laksmann Y.N. Approximate polynomial greatest common divisors and nearest singular polynomials. Proc. ISSAC'96 (1996), ACM Press 35-43
8. Chin P., Corless R.M., and Corliss G. Optimization strategies for the approximate gcd problem. Proc. ISSAC'98 (1998), ACM Press, Maui, Hawaii 228-235
9. Rupprecht D. An algorithm for computing certified approximate GCD of n univariate polynomials. Journ. of Pure and Applied Algebra 139 1-3 (1999) 255-2848
10. Fatouros S., and Karcanias N. Resultant properies of the GCD of many polynomials and a factorisation representation of GCD. Int. Journ. Control 76 16 (2003) 1666-1683
11. Fatouros S. Approximate Algebraic Computations in Control Theory. Ph.D. Thesis, Control Engineering Center, School of Engineering and Mathematical Sciences, City University, London (2003)
12. Barnett S. Matrices: Methods and Applications (1992), Clarendon Press, Oxford
13. Vardulakis A.I.G., and Stoyle P.N.R. Generalized resultant theorem. Journ. of IMA 22 (1978) 331-335