Pages that link to "Item:Q3769862"
From MaRDI portal
The following pages link to Abstract Generalized Bisection and a Cost Bound (Q3769862):
Displaying 19 items.
- Some feasibility sampling procedures in interval methods for constrained global optimization (Q506473) (← links)
- Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
- On the complexity of exclusion algorithms for optimization (Q700180) (← links)
- Calculation of multivariate Chebyshev-type inequalities (Q749992) (← links)
- Interval Newton/generalized bisection when there are singularities near roots (Q1173718) (← links)
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems (Q1180347) (← links)
- What can interval analysis do for global optimization? (Q1186266) (← links)
- Experiments using interval analysis for solving a circuit design problem (Q1310983) (← links)
- Homotopies for solving polynomial systems within a bounded domain (Q1338223) (← links)
- Formulas for the width of interval products (Q1899451) (← links)
- Application of interval Newton's method to chemical engineering problems (Q1904303) (← links)
- A general iterative sparse linear solver and its parallelization for interval Newton methods (Q1904308) (← links)
- Optimizing INTBIS on the CRAY Y-MP (Q1904310) (← links)
- Exclusion regions for optimization problems (Q2250096) (← links)
- Some observations on exclusion regions in branch and bound algorithms (Q2349518) (← links)
- On the problem of starting points for iterative methods (Q2424042) (← links)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
- Computation of Topological Degree Using Interval Arithmetic, and Applications (Q4286593) (← links)
- Bisections above Tight Lower Bounds (Q5200505) (← links)
