Pages that link to "Item:Q1875033"

The following pages link to Investigation of a subdivision based algorithm for solving systems of polynomial equations. (Q1875033):

Displaying 15 items.

• Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
• Polytope-based computation of polynomial ranges (Q426184) (← links)
• The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
• Reachability computation for polynomial dynamical systems (Q526433) (← links)
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
• A quadratic clipping step with superquadratic convergence for bivariate polynomial systems (Q691650) (← links)
• Topology and arrangement computation of semi-algebraic planar curves (Q735517) (← links)
• On nonsingularity of a polytope of matrices (Q935386) (← links)
• Subdivision methods for solving polynomial equations (Q1006659) (← links)
• Certified numerical real root isolation for bivariate nonlinear systems (Q2156364) (← links)
• 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 (Q2372059) (← links)
• An improved interval global optimization algorithm using higher-order inclusion function forms (Q2569148) (← links)
• OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS (Q4923349) (← links)
• A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves (Q5188772) (← links)
• Robustness and Randomness (Q5302770) (← links)