Structured matrix-based methods for polynomial -gcd: analysis and comparisons
From MaRDI portal
Publication:5301644
zbMATH Open1190.65060MaRDI QIDQ5301644FDOQ5301644
Authors: Dario A. Bini, Paola Boito 
Publication date: 20 January 2009
Recommendations
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- Structured matrix based methods for approximate polynomial GCD
- A subresultant based subspace method for the computation of polynomial GCDs
- Structured matrix methods computing the greatest common divisor of polynomials
- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
Cited In (30)
- A hybrid method for computing the intersection and tangency points of plane curves
- A subdivision method for computing nearest gcd with certification
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- Relaxed NewtonSLRA for approximate GCD
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- Approximate GCD of several univariate polynomials with small degree perturbations
- Approximate Polynomial gcd: Small Degree and Small Height Perturbations
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Polynomial computations for blind image deconvolution
- A quadratically convergent algorithm for structured low-rank approximation
- Approximate polynomial GCD: small degree and small height perturbations
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- An extended polynomial GCD algorithm using Hankel matrices
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Toward the best algorithm for approximate GCD of univariate polynomials
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Approximate least common multiple of several polynomials using the ERES division algorithm
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- A subresultant based subspace method for the computation of polynomial GCDs
- On rank and null space computation of the generalized Sylvester matrix
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
This page was built for publication: Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301644)
