A subdivision method for computing nearest gcd with certification
type: Item
instance of: scholarly article
title: A subdivision method for computing nearest gcd with certification
zbMATH Open document ID: 1221.68297
author: Guillaume Chèze
author: Jean-Claude Yakoubsohn
author: André Galligo
author: Bernard Mourrain
published in: Theoretical Computer Science
publication date: 2011-09-12T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 12E05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 5947148
zbMATH Keywords: approximate gcd
zbMATH Keywords: subdivision method
zbMATH Keywords: symbolic-numeric computations
zbMATH Keywords: alpha-theory
describes a project that uses: MultRoot
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.04.018
OpenAlex ID: W1987546967
cites work: A polynomial-time algorithm for the topological type of real algebraic curve
cites work: When are two numerical polynomials relatively prime?
cites work: Q4314299
cites work: Q5301644
cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
cites work: Computing nearest Gcd with certification
cites work: Q4227296
cites work: Q4717939
cites work: Q4717942
cites work: Certified approximate univariate GCDs
cites work: On location and approximation of clusters of zeros of analytic functions
cites work: Detection and validation of clusters of polynomial zeros
cites work: Q3447170
cites work: On approximate GCDs of univariate polynomials
cites work: Algorithms for intersecting parametric and algebraic curves I
cites work: Q4324980
cites work: Global minimization of rational functions and the nearest GCDs
cites work: Approximate GCD and its application to ill-conditioned algebraic equations
cites work: Computation of approximate polynomial GCDs and an extension
cites work: Quasi-gcd computations
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: An iterative method for calculating approximate GCD of univariate polynomials
cites work: A geometric method in nonlinear programming
cites work: The approximate GCD of inexact polynomials
DOI: 10.1016/J.TCS.2011.04.018
description: scientific article; zbMATH DE number 5947148