Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
Authors:
- 1 June 2006
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 51 (12) , 1817-1830
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Resultant properties of gcd of many polynomials and a factorization representation of gcdInternational Journal of Control, 2003
- An algorithm for computing certified approximate GCD of n univariate polynomialsJournal of Pure and Applied Algebra, 1999
- Approximate algebraic computations of algebraic invariants1999
- A matrix pencil based numerical method for the computation of the GCD of polynomialsIEEE Transactions on Automatic Control, 1994
- Computation of the GCD of polynomials using gaussian transformations and shiftingInternational Journal of Control, 1993
- Approximate GCD and its application to ill-conditioned equationsJournal of Computational and Applied Mathematics, 1991
- Grassmann invariants, almost zeros and the determinantal zero, pole assignment problems of linear multivariable systemsInternational Journal of Control, 1984