Pages that link to "Item:Q4371651"
From MaRDI portal
The following pages link to Algorithm 681: INTBIS, a portable interval Newton/bisection package (Q4371651):
Displaying 34 items.
- INTBIS (Q13200) (← links)
- Interval arithmetic for nonlinear problem solving (Q275934) (← links)
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Topographical global initialization for finding all solutions of nonlinear systems with constraints (Q343685) (← links)
- Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification (Q475422) (← links)
- Interval methods for model qualification: methodology and advanced application (Q475446) (← links)
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
- Interval-based projection method for under-constrained numerical systems (Q487645) (← links)
- Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB method (Q1043352) (← links)
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems (Q1180347) (← links)
- Experiments using interval analysis for solving a circuit design problem (Q1310983) (← links)
- Global optimization using interval arithmetic (Q1318309) (← links)
- The cluster problem in multivariate global optimization (Q1338540) (← links)
- PROFIL/BIAS - A fast interval library (Q1340873) (← links)
- Dense packings of congruent circles in a circle (Q1381854) (← links)
- Minimal-energy clusters of hard spheres (Q1900964) (← 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)
- Finding all solutions of nonlinearly constrained systems of equations (Q1904647) (← links)
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
- McLaren's improved snub cube and other new spherical designs in three dimensions (Q1913694) (← links)
- Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
- Interval Analysis for Certified Numerical Solution of Problems in Robotics (Q2930554) (← links)
- OPTIMAL INVESTMENT STRATEGY VIA INTERVAL ARITHMETIC (Q4675932) (← links)
- INTERVAL METHODS FOR RIGOROUS INVESTIGATIONS OF PERIODIC ORBITS (Q5474221) (← links)
- Neutrino Mixing and the Minimal 3-3-1 Model (Q5711003) (← links)
- A parser for the interval evaluation of analytical functions and its application to engineering problems (Q5933504) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
- Interval constraint programming for globally solving catalog-based categorical optimization (Q6541384) (← links)