Pages that link to "Item:Q1006659"
From MaRDI portal
The following pages link to Subdivision methods for solving polynomial equations (Q1006659):
Displaying 37 items.
- A regularization approach for estimating the type of a plane curve singularity (Q385004) (← links)
- Bernstein Bézoutians and application to intersection problems (Q426192) (← links)
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- Continuous detection of the variations of the intersection curve of two moving quadrics in 3-dimensional projective space (Q491266) (← links)
- Reachability computation for polynomial dynamical systems (Q526433) (← links)
- A robust and efficient method for solving point distance problems by homotopy (Q526832) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
- Computing intersections of planar spline curves using knot insertion (Q625188) (← links)
- Khovanskii-Rolle continuation for real solutions (Q660674) (← links)
- GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems (Q660912) (← 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 the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← links)
- Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
- Representing rational curve segments and surface patches using semi-algebraic sets (Q2010339) (← links)
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints (Q2127702) (← links)
- A unified algebraic framework for fast and precise planar swept volumes and Minkowski sums (Q2154245) (← links)
- Certified numerical real root isolation for bivariate nonlinear systems (Q2156364) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms (Q2200298) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← links)
- A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575) (← links)
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
- Improved subdivision scheme for the root computation of univariate polynomial equations (Q2451335) (← links)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
- Towards a better integration of modelers and black box constraint solvers within the product design process (Q2631961) (← links)
- The Approach of Moments for Polynomial Equations (Q2802518) (← links)
- Solving Polynomial Systems via Truncated Normal Forms (Q4689237) (← links)
- OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS (Q4923349) (← links)
- Symbolic Methods for Solving Algebraic Systems of Equations and Applications for Testing the Structural Stability (Q5118408) (← links)
- A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves (Q5188772) (← links)
- Fat Arcs for Implicitly Defined Curves (Q5189407) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)
- Chebyshev subdivision and reduction methods for solving multivariable systems of equations (Q6650577) (← links)
