GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
From MaRDI portal
Recommendations
- Computing approximate GCD of multivariate polynomials
- Approximate GCD of multivariate polynomials
- The approximate GCD of inexact polynomials
- A subspace method for the computation of the GCD of polynomials
- Computation of approximate polynomial GCDs and an extension
- A subresultant based subspace method for the computation of polynomial GCDs
- Toward the best algorithm for approximate GCD of univariate polynomials
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- An algorithm for computing certified approximate GCD of n univariate polynomials
- On approximate GCDs of univariate polynomials
Cited in
(5)
This page was built for publication: GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819632)