The following pages link to (Q2738482):
Displaying 10 items.
- Gauss-Lobatto to Bernstein polynomials transformation (Q955093) (← links)
- Subdivision methods for solving polynomial equations (Q1006659) (← links)
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials (Q1740149) (← links)
- Certified numerical real root isolation for bivariate nonlinear systems (Q2156364) (← 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)
- Bounds for the range of a complex polynomial over a rectangular region (Q2656078) (← links)
- A New Approach Based on Interval Analysis and B-splines Properties for Solving Bivariate Nonlinear Equations Systems (Q3192969) (← links)
- Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique (Q6089640) (← links)
