Approximate greatest common divisor of many polynomials and generalised resultants

European Control Conference, ECC 2003

Volumn , Issue , 2003, Pages 3583-3586

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

^a CITY UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Approximate; Computations; Greatest common divisor

Indexed keywords

CALCULATIONS; FACTORIZATION; POLYNOMIALS;

APPROXIMATE; APPROXIMATE GCD; APPROXIMATE GREATEST COMMON DIVISORS; GREATEST COMMON DIVISORS; NEW APPROACHES; STRUCTURED MATRIXES; STRUCTURED OPTIMIZATION PROBLEM; TOEPLITZ MATRICES;

MATRIX ALGEBRA;

EID: 84983187888     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.23919/ecc.2003.7086598     Document Type: Conference Paper

References (9)

1. S. Fatouros and N. Karcanias, The GCD of many polynomials and the factorisation of generalised resultants, Research Report, Control Engineering Centre, City University, London, 2002.
2. N. Karcanias, G. Giannakopoulos and M. Hubbard, Almost zeros of a set of polynomials, Int. Journ. Control, 40(1984), 673-698.
3. N. Karcanias and M. Mitrouli, Numerical computation of the least common multiple of a set of polynomials, Reliable Computing, Issue 4, 6(2000b), 439-457.
4. N. Karcanias N. and M. Mitrouli, A Matrix Pencil Based Numerical Method for the Computation of the GCD of Polynomials, IEEE Trans. Autom. Cont., 39(1994), 977-981.
5. N. Karcanias, M. Mitrouli and S. Fatouros, Computation of normal normal factorisation of polynomials using resultant sets, IFAC Symposium on System Structure and Control., Prague, September 2001.
6. M. Mitrouli and N. Karcanias, Computation of the GCD of polynomials using Gaussian transformation and shifting, Int. Journ. Control, 58(1993), 211-228.
7. M. Mitrouli, N. Karcanias and C. Koukouvinos, Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies, Utilitas Mathematica, 50(1996), 65-84.
8. M. Noda M. and T. Sasaki, Approximate GCD and its applications to ill-conditioned algebraic equations, Jour. of Comp. and Appl. Math., 38(1991), 335-351.
9. I. S. Pace and S. Barnett, Comparison of algorithms for calculation of GCD of polynomials, Int. Journ. System Scien., 4(1973), 211-226.