A subresultant based subspace method for the computation of polynomial GCDs
From MaRDI portal
Recommendations
- A subspace method for the computation of the GCD of polynomials
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
- Computation of approximate polynomial GCDs and an extension
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- Structured matrix-based methods for polynomial -gcd: analysis and comparisons
- Structured matrix based methods for approximate polynomial GCD
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- An algorithm for computing certified approximate GCD of n univariate polynomials
- The ERES method for computing the approximate GCD of several polynomials
Cited in
(9)- A subspace method for the computation of the GCD of polynomials
- Structured matrix methods computing the greatest common divisor of polynomials
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
- On computing polynomial GCDs in alternate bases
- On the computation of the GCD of 2-D polynomials
- scientific article; zbMATH DE number 4096685 (Why is no real title available?)
- Polynomial GCD derived through monic polynomial subtractions
- scientific article; zbMATH DE number 6868511 (Why is no real title available?)
- Structured matrix-based methods for polynomial -gcd: analysis and comparisons
This page was built for publication: A subresultant based subspace method for the computation of polynomial GCDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819622)
