A bisection method for systems of nonlinear equations
ACM Transactions on Mathematical Software (TOMS)
A methodology for solving chemical equilibrium systems
Applied Mathematics and Computation
Box-bisection for solving second-degree systems and the problem of clustering
ACM Transactions on Mathematical Software (TOMS)
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Software for Interval Arithmetic: A Reasonably Portable Package
ACM Transactions on Mathematical Software (TOMS)
Testing Unconstrained Optimization Software
ACM Transactions on Mathematical Software (TOMS)
A Method for Computing All Solutions to Systems of Polynomials Equations
ACM Transactions on Mathematical Software (TOMS)
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
Algorithm 681: INTBIS, a portable interval Newton/bisection package
ACM Transactions on Mathematical Software (TOMS)
Distance approximations for rasterizing implicit curves
ACM Transactions on Graphics (TOG)
Solving systems of nonlinear equations using the nonzero value of the topological degree
ACM Transactions on Mathematical Software (TOMS)
Box-bisection for solving second-degree systems and the problem of clustering
ACM Transactions on Mathematical Software (TOMS)
Solving Nonlinear Systems by Constraint Inversion and Interval Arithmetic
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Finding all solutions of nonlinear equations using the dual simplex method
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Adaptive bisection of numerical CSPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
This paper addresses the task of reliably finding approximations to all solutions to a system of nonlinear equations within a region defined by bounds on each of the individual coordinates. Various forms of generalized bisection were proposed some time ago for this task. This paper systematically compares such generalized bisection algorithms to themselves, to continuation methods, and to hybrid steepest descent/quasi-Newton methods. A specific algorithm containing novel “expansion” and “exclusion” steps is fully described, and the effectiveness of these steps is evaluated. A test problem consisting of a small, high-degree polynomial system that is appropriate for generalized bisection, but very difficult for continuation methods, is presented. This problem forms part of a set of 17 test problems from published literature on the methods being compared; this test set is fully described here.