A subdivision method for computing nearest gcd with certification

DOI10.1016/J.TCS.2011.04.018MaRDI QIDQ638509zbMATH OpenOpenAlexFDO

Authors Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain

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

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

Recommendations

• Computing nearest gcd with certification
• scientific article; zbMATH DE number 1254271
• Approximate GCD a la dedieu
• scientific article; zbMATH DE number 953021
• Certified approximate univariate GCDs

Cites work

• scientific article; zbMATH DE number 5168246 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 953018 (Why is no real title available?)
• scientific article; zbMATH DE number 953021 (Why is no real title available?)
• A geometric method in nonlinear programming
• A polynomial-time algorithm for the topological type of real algebraic curve
• Algorithms for intersecting parametric and algebraic curves I
• An iterative method for calculating approximate GCD of univariate polynomials
• Approximate GCD and its application to ill-conditioned algebraic equations
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Certified approximate univariate GCDs
• Complexity of Bezout's Theorem I: Geometric Aspects
• Computation of approximate polynomial GCDs and an extension
• Computing nearest gcd with certification
• Detection and validation of clusters of polynomial zeros
• Global minimization of rational functions and the nearest GCDs
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On approximate GCDs of univariate polynomials
• On location and approximation of clusters of zeros of analytic functions
• Quasi-gcd computations
• Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
• The approximate GCD of inexact polynomials
• When are two numerical polynomials relatively prime?

Cited in

(7)

• 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
• 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
• Computing nearest gcd with certification
• Overdetermined Weierstrass iteration and the nearest consistent system
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials

Describes a project that uses

Uses Software

• MultRoot

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638509)