Investigation of a subdivision based algorithm for solving systems of polynomial equations.

DOI10.1016/S0362-546X(01)00166-3zbMath1042.65526OpenAlexW1979084035MaRDI QIDQ1875033

Jürgen Garloff, Andrew Paul Smith

Publication date: 26 August 2004

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0362-546x(01)00166-3

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items

A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, Robustness and Randomness, Certified numerical real root isolation for bivariate nonlinear systems, Polytope-based computation of polynomial ranges, The Bernstein polynomial basis: a centennial retrospective, On nonsingularity of a polytope of matrices, Reachability computation for polynomial dynamical systems, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS, A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves, Topology and arrangement computation of semi-algebraic planar curves, Subdivision methods for solving polynomial equations, An improved interval global optimization algorithm using higher-order inclusion function forms