Algorithm 681: INTBIS, a portable interval Newton/bisection package
From MaRDI portal
Publication:4371651
DOI10.1145/78928.78931zbMath0900.65152OpenAlexW2030170144MaRDI QIDQ4371651
Manuel Novoa III, Ralph Baker Kearfott
Publication date: 23 March 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1990-16/
optimizationinterval arithmeticsystems of nonlinear equationsreal rootsgeneral bisectionglobal constrained
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)
Related Items
Interval arithmetic for nonlinear problem solving, The cluster problem in multivariate global optimization, PROFIL/BIAS - A fast interval library, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Minimal-energy clusters of hard spheres, Application of interval Newton's method to chemical engineering problems, A general iterative sparse linear solver and its parallelization for interval Newton methods, Optimizing INTBIS on the CRAY Y-MP, Finding all solutions of nonlinearly constrained systems of equations, On the selection of subdivision directions in interval branch-and-bound methods for global optimization, Topographical global initialization for finding all solutions of nonlinear systems with constraints, McLaren's improved snub cube and other new spherical designs in three dimensions, Interval Analysis for Certified Numerical Solution of Problems in Robotics, Dense packings of congruent circles in a circle, Nonsmooth exclusion test for finding all solutions of nonlinear equations, Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification, Interval methods for model qualification: methodology and advanced application, Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems, Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm, Interval-based projection method for under-constrained numerical systems, Efficient interval partitioning-local search collaboration for constraint satisfaction, Neutrino Mixing and the Minimal 3-3-1 Model, Efficient interval partitioning for constrained global optimization, A parser for the interval evaluation of analytical functions and its application to engineering problems, On the complexity of isolating real roots and computing with certainty the topological degree, OPTIMAL INVESTMENT STRATEGY VIA INTERVAL ARITHMETIC, \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers, Node selection strategies in interval branch and bound algorithms, INTBIS, INTERVAL METHODS FOR RIGOROUS INVESTIGATIONS OF PERIODIC ORBITS, 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, Experiments using interval analysis for solving a circuit design problem, Global optimization using interval arithmetic
