Certified approximate univariate GCDs

DOI10.1016/S0022-4049(97)00013-3zbMath0891.65015OpenAlexW2061311874MaRDI QIDQ1358910

Ioannis Z. Emiris, Henri Lombardi, Andre Galligo

Publication date: 19 July 1998

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(97)00013-3

zbMATH Keywords

greatest common divisorpolynomialsextended Euclidean algorithmSylvester matrix singular values

Mathematics Subject Classification ID

Related Items (46)

Polynomial computations for blind image deconvolution ⋮ A quadratically convergent algorithm for structured low-rank approximation ⋮ Relaxed NewtonSLRA for approximate GCD ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Multivariate subresultants in roots ⋮ Approximate least common multiple of several polynomials using the ERES division algorithm ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ Bernstein-Bézoutian matrices ⋮ Parametrization of approximate algebraic curves by lines ⋮ Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ The calculation of the degree of an approximate greatest common divisor of two polynomials ⋮ Validated Root Enclosures for Interval Polynomials with Multiplicities ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Approximate GCD of several univariate polynomials with small degree perturbations ⋮ Approximate parametrization of plane algebraic curves by linear systems of curves ⋮ Continuity properties for flat families of polynomials. I: Continuous parametrizations ⋮ A geometrical approach to finding multivariate approximate LCMs and GCDs ⋮ A subdivision method for computing nearest gcd with certification ⋮ Approximate polynomial GCD over integers ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Recursive polynomial remainder sequence and its subresultants ⋮ A structured rank-revealing method for Sylvester matrix ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Computing multiple roots of inexact polynomials ⋮ Rational Hausdorff divisors: a new approach to the approximate parametrization of curves ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ Approximate polynomial GCD: small degree and small height perturbations ⋮ Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis ⋮ Distance bounds of \(\varepsilon\)-points on hypersurfaces ⋮ Method for finding multiple roots of 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 ⋮ A computational study of ruled surfaces ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ An algorithm for computing certified approximate GCD of \(n\) univariate polynomials ⋮ Parametrization of approximate algebraic surfaces by lines ⋮ Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases ⋮ Computation of approximate polynomial GCDs and an extension ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Products of polynomials in many variables
• Quasi-gcd computations
• On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
• On the numerical condition of polynomials in Bernstein form
• Résolution des systèmes d'équations algébriques
• Approximate GCD and its application to ill-conditioned algebraic equations
• Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
• Detection and validation of clusters of polynomial zeros
• Best linear common divisors for approximate degree reduction
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Parallel robots.
• Zur inhomogenen Eliminationstheorie
• An Inequality About Factors of Polynomials
• A matrix pencil based numerical method for the computation of the GCD of polynomials
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

This page was built for publication: Certified approximate univariate GCDs