Subdivision methods for solving polynomial equations

DOI10.1016/j.jsc.2008.04.016zbMath1158.13010OpenAlexW2086421911MaRDI QIDQ1006659

Publication date: 25 March 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.016

zbMATH Keywords

complexity subdivision resolution polynomial equation Bernstein basis real solution symbolic-numeric computation Descartes rule

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form, Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints, A rational cubic clipping method for computing real roots of a polynomial, Revisiting the problem of zeros of univariate scalar Béziers, Towards a better integration of modelers and black box constraint solvers within the product design process, A unified algebraic framework for fast and precise planar swept volumes and Minkowski sums, Certified numerical real root isolation for bivariate nonlinear systems, A regularization approach for estimating the type of a plane curve singularity, The complexity of subdivision for diameter-distance tests, Computing intersections of planar spline curves using knot insertion, Counting solutions of a polynomial system locally and exactly, Bernstein Bézoutians and application to intersection problems, Truncated normal forms for solving polynomial systems: generalized and efficient algorithms, Symbolic Methods for Solving Algebraic Systems of Equations and Applications for Testing the Structural Stability, The Bernstein polynomial basis: a centennial retrospective, Improved subdivision scheme for the root computation of univariate polynomial equations, Parallel computation of real solving bivariate polynomial systems by zero-matching method, Khovanskii-Rolle continuation for real solutions, GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems, A generic position based method for real root isolation of zero-dimensional polynomial systems, Globally maximizing the sum of squares of quadratic forms over the unit sphere, Continuous detection of the variations of the intersection curve of two moving quadrics in 3-dimensional projective space, Reachability computation for polynomial dynamical systems, A robust and efficient method for solving point distance problems by homotopy, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, On the complexity of computing with planar algebraic curves, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS, Representing rational curve segments and surface patches using semi-algebraic sets, A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves, Fat Arcs for Implicitly Defined Curves, Solving Polynomial Systems via Truncated Normal Forms, The Approach of Moments for Polynomial Equations, Topology and arrangement computation of semi-algebraic planar curves, A subdivision algorithm to reason on high-degree polynomial constraints over finite domains, On the asymptotic and practical complexity of solving bivariate systems over the reals

Cites Work