A subspace method for the computation of the GCD of polynomials

DOI10.1016/S0005-1098(96)00244-0zbMath0922.93016OpenAlexW2074424999WikidataQ127359398 ScholiaQ127359398MaRDI QIDQ1361353

Wanzhi Qiu, Karim Abed-Meraim, Yingbo Hua

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

GCDpolynomialsmatrix pencilsubspace method

Mathematics Subject Classification ID

Related Items (8)

Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ 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 ⋮ Structured low-rank approximation for nonlinear matrices ⋮ Blind identification of non-minimum phase ARMA systems ⋮ Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance ⋮ Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control ⋮ Robust estimation of GCD with sparse coefficients

Cites Work

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

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