Subdivision methods for solving polynomial equations
type: Item
instance of: scholarly article
title: Subdivision methods for solving polynomial equations
zbMATH Open document ID: 1158.13010
author: J. P. Pavone
author: Bernard Mourrain
published in: Journal of Symbolic Computation
publication date: 2009-03-25T00:00:00Z
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13F55
zbMATH DE Number: 5532875
zbMATH Keywords: resolution
zbMATH Keywords: real solution
zbMATH Keywords: symbolic-numeric computation
zbMATH Keywords: polynomial equation
zbMATH Keywords: subdivision
zbMATH Keywords: Bernstein basis
zbMATH Keywords: Descartes rule
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.jsc.2008.04.016
OpenAlex ID: W2086421911
cites work: Algorithms in real algebraic geometry
cites work: Q4023642
cites work: Subdivision algorithms converge quadratically
cites work: Almost tight recursion tree bounds for the Descartes method
cites work: Real Algebraic Numbers: Complexity Analysis and Experimentation
cites work: Q3997243
cites work: On the numerical condition of polynomials in Bernstein form
cites work: On the optimal stability of the Bernstein basis
cites work: Investigation of a subdivision based algorithm for solving systems of polynomial equations.
cites work: Q2738482
cites work: Q4156973
cites work: Bounds on a polynomial
cites work: Q3207999
cites work: Q5290272
cites work: On the complexity of isolating real roots and computing with certainty the topological degree
cites work: Q2776783
cites work: Convergence of subdivision and degree elevation
cites work: Q4386703
cites work: Q3999419
cites work: Loop detection in surface patch intersections
cites work: Computation of the solutions of nonlinear polynomial systems
cites work: Tame geometry with application in smooth analysis
DOI: 10.1016/J.JSC.2008.04.016
Recommended article: Q4422739
Recommended article: Q5168263
Recommended article: Improved subdivision scheme for the root computation of univariate polynomial equations
Recommended article: Polynomial reproduction in subdivision
Recommended article: Q4370164
Recommended article: Q4877914
Recommended article: Q4903286
Recommended article: An adaptive subdivision method for root finding of univariate polynomials
Recommended article: Stationary subdivision schemes reproducing polynomials
Recommended article: Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes
description: scientific article; zbMATH DE number 5532875