A subdivision method for computing nearest gcd with certification

DOI10.1016/j.tcs.2011.04.018zbMath1221.68297OpenAlexW1987546967MaRDI QIDQ638509

Jean-Claude Yakoubsohn, Guillaume Chèze, Andre Galligo, Mourrain, Bernard

Publication date: 12 September 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.018

zbMATH Keywords

alpha-theoryapproximate gcdsubdivision methodsymbolic-numeric computations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm ⋮ Variable projection methods for approximate (greatest) common divisor computations

Uses Software

• MultRoot

Cites Work

• Quasi-gcd computations
• A polynomial-time algorithm for the topological type of real algebraic curve
• Approximate GCD and its application to ill-conditioned algebraic equations
• A geometric method in nonlinear programming
• On approximate GCDs of univariate polynomials
• When are two numerical polynomials relatively prime?
• Certified approximate univariate GCDs
• Detection and validation of clusters of polynomial zeros
• Computation of approximate polynomial GCDs and an extension
• Global minimization of rational functions and the nearest GCDs
• On location and approximation of clusters of zeros of analytic functions
• An iterative method for calculating approximate GCD of univariate polynomials
• Computing nearest Gcd with certification
• Complexity of Bezout's Theorem I: Geometric Aspects
• Algorithms for intersecting parametric and algebraic curves I
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• The approximate GCD of inexact polynomials
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A subdivision method for computing nearest gcd with certification