The approximate GCD of inexact polynomials
From MaRDI portal
Recommendations
Cited in
(44)- A computational study of ruled surfaces
- Approximate GCD and its application to ill-conditioned algebraic equations
- An algorithm for computing certified approximate GCD of n univariate polynomials
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Toward the best algorithm for approximate GCD of univariate polynomials
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
- Computing approximate greatest common right divisors of differential polynomials
- A numerical elimination method for polynomial computations
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Approximate factorization of multivariate polynomials using singular value decomposition
- An improved EZ-GCD algorithm for multivariate polynomials
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Approximate GCD of multivariate polynomials
- Extended companion matrix for approximate GCD
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
- A quadratically convergent algorithm for structured low-rank approximation
- Numerical and symbolical methods for the GCD of several polynomials
- Computing multivariate approximate GCD based on Barnett's theorem
- Computing approximate GCD of multivariate polynomials
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- Regularization and matrix computation in numerical polynomial algebra
- scientific article; zbMATH DE number 40793 (Why is no real title available?)
- scientific article; zbMATH DE number 62668 (Why is no real title available?)
- Approximate GCD of several univariate polynomials with small degree perturbations
- Twin-float arithmetic
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1262453 (Why is no real title available?)
- Numerical proper reparametrization of parametric plane curves
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Overdetermined Weierstrass iteration and the nearest consistent system
- Approximate greatest common divisor of several polynomials from Hankel matrices
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- Numerical computation of the genus of an irreducible curve within an algebraic set
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Structured low-rank approximation for nonlinear matrices
- A subdivision method for computing nearest gcd with certification
- Approximate polynomial GCD over integers
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- Validated numerical Hensel lifting
- Multivariate subresultants in roots
This page was built for publication: The approximate GCD of inexact polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657342)
