A subspace method for the computation of the GCD of polynomials

DOI10.1016/S0005-1098(96)00244-0MaRDI QIDQ1361353zbMATHOpenAlexWikidataFDO

Authors Wanzhi Qiu, Yingbo Hua, Karim Abed-Meraim

Publication date 19 January 1999

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0005-1098(96)00244-0

zbMATH Keywords

GCDmatrix pencilpolynomialssubspace method

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Matrix pencils (15A22)

Recommendations

• A subresultant based subspace method for the computation of polynomial GCDs
• GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
• Computation of approximate polynomial GCDs and an extension
• Numerical and symbolical methods for the GCD of several polynomials
• An iterative method for calculating approximate GCD of univariate polynomials
• Computing approximate GCD of multivariate polynomials
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Computing GCDs of polynomials over algebraic number fields
• The ERES method for computing the approximate GCD of several polynomials
• A fast algorithm for approximate polynomial gcd based on structured matrix computations

Cites work

• A matrix pencil based numerical method for the computation of the GCD of polynomials
• Greatest common divisor via generalized Sylvester and Bezout matrices
• Sensor array processing based on subspace fitting

Cited in

(14)

• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• A subresultant based subspace method for the computation of polynomial GCDs
• GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
• Numerical and symbolical methods for the GCD of several polynomials
• Robust estimation of GCD with sparse coefficients
• Common factor estimation and two applications in signal processing
• Polynomial GCD derived through monic polynomial subtractions
• Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
• An ODE-based method for computing the approximate greatest common divisor of polynomials
• Blind identification of non-minimum phase ARMA systems
• Structured low-rank approximation for nonlinear matrices
• Computation of the GCD of polynomials using gaussian transformations and shifting
• An extended polynomial GCD algorithm using Hankel matrices

This page was built for publication: A subspace method for the computation of the GCD of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361353)