An algorithm for computing certified approximate GCD of n univariate polynomials
From MaRDI portal
An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
Recommendations
- Toward the best algorithm for approximate GCD of univariate polynomials
- On approximate GCDs of univariate polynomials
- An iterative method for calculating approximate GCD of univariate polynomials
- Computation of approximate polynomial GCDs and an extension
- The approximate GCD of inexact polynomials
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Approximate GCD of several univariate polynomials with small degree perturbations
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Computing approximate GCD of multivariate polynomials
- Certified approximate univariate GCDs
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 42759 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1254271 (Why is no real title available?)
- scientific article; zbMATH DE number 953021 (Why is no real title available?)
- Certified approximate univariate GCDs
- Detection and validation of clusters of polynomial zeros
- Products of polynomials in many variables
- Quasi-gcd computations
Cited in
(44)- DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Variable projection methods for approximate (greatest) common divisor computations
- Recursive polynomial remainder sequence and its subresultants
- Approximate GCD and its application to ill-conditioned algebraic equations
- A subresultant based subspace method for the computation of polynomial GCDs
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
- A computational study of ruled surfaces
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- Approximate greatest common divisor of several polynomials from Hankel matrices
- Numerical and symbolical methods for the GCD of several polynomials
- Computing multiple roots of inexact polynomials
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
- The computation of multiple roots of a polynomial
- Approximate GCD a la dedieu
- Approximate GCD of several univariate polynomials with small degree perturbations
- Computing approximate GCD of multivariate polynomials
- 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 polynomial GCD: small degree and small height perturbations
- The ERES method for computing the approximate GCD of several polynomials
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
- Computing GCRDs of approximate differential polynomials
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- An iterative method for calculating approximate GCD of univariate polynomials
- Blind image deconvolution through Bezoutians
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Approximate gcds of polynomials and sparse SOS relaxations
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Computation of approximate polynomial GCDs and an extension
- A subspace method for the computation of the GCD of polynomials
- Regularization and matrix computation in numerical polynomial algebra
- Structured matrix methods computing the greatest common divisor of polynomials
- The approximate GCD of inexact polynomials
- Approximate polynomial GCD by approximate syzygies
- Computation of the topology of real algebraic space curves
- Nearest common root of a set of polynomials: a structured singular value approach
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- Toward the best algorithm for approximate GCD of univariate polynomials
- Overdetermined Weierstrass iteration and the nearest consistent system
- Computing multivariate approximate GCD based on Barnett's theorem
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Approximate polynomial GCD over integers
This page was built for publication: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295792)
