A subspace method for the computation of the GCD of polynomials
Given a set of polynomials \[ Y_i(s)=y_i(0)+\ldots + y_i(d_i)s^{d_i},\quad i=1,\ldots,M, \] the authors present an algorithm to compute a polynomial \(C(s)\) such that \[ Y_i(s)=C(s) H_i(s),\quad i=1,\ldots,M, \] where \(H_i\), \(i=1,\ldots,M,\) have no common roots. The ideas are based on a concept called subspace method and the algorithm can be simply described by well known linear algebra procedures, with the main computation being the null space of an \(M(d+1) \times 2d+1\) matrix, where \(d=\max\{d_1, \ldots , d_M\}\). Heuristics are presented to indicate that the method is robust if data is prone to noise.
- 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
- Robust estimation of GCD with sparse coefficients
- An extended polynomial GCD algorithm using Hankel matrices
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- 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
- Polynomial GCD derived through monic polynomial subtractions
- Blind identification of non-minimum phase ARMA systems
- Computation of the GCD of polynomials using gaussian transformations and shifting
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- Structured low-rank approximation for nonlinear matrices
- Computation of an exact GCRD of several polynomial matrices: QR decomposition approach
- Common factor estimation and two applications in signal processing
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)
