Computing approximate GCD of multivariate polynomials
From MaRDI portal
Recommendations
Cited in
(17)- Approximate GCD of several univariate polynomials with small degree perturbations
- The approximate GCD of inexact polynomials
- Approximate GCD and its application to ill-conditioned algebraic equations
- Computing sparse GCD of multivariate polynomials via polynomial interpolation
- An improved EZ-GCD algorithm for multivariate polynomials
- An algorithm for computing certified approximate GCD of n univariate polynomials
- A subspace method for the computation of the GCD of polynomials
- Approximate greatest common divisor of several polynomials from Hankel matrices
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Computation of the GCD of polynomials using gaussian transformations and shifting
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- Approximate GCD of multivariate polynomials
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
- Approximate polynomial GCD by approximate syzygies
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
This page was built for publication: Computing approximate GCD of multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447169)
