Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
From MaRDI portal
Publication:4336717
DOI10.1137/S1064827594266131zbMath0871.65042OpenAlexW2166780466MaRDI QIDQ4336717
Publication date: 1 October 1997
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827594266131
numerical experimentspreconditioninginterval arithmeticbranch-and-bound techniquesinclusion functionbisectiontrisectioninterval Newton methodszeros of nonlinear systems
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
A new exclusion test. ⋮ A certified numerical algorithm for the topology of resultant and discriminant curves ⋮ A new exclusion test for finding the global minimum ⋮ A method for global minimization of functions using the Krawczyk operator ⋮ Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers ⋮ A method to find all the roots of the system of nonlinear algebraic equations based on the Krawczyk operator ⋮ AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS ⋮ An efficient algorithm for finding all solutions of separable systems of nonlinear equations ⋮ Exclusion regions for optimization problems ⋮ On the complexity of exclusion algorithms for optimization ⋮ Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves ⋮ Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
Uses Software
This page was built for publication: Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
