Algorithm 681: INTBIS, a portable interval Newton/bisection package

Authors:
R. Baker Kearfott;Manuel Novoa, III
Affiliations:
Univ. of Southwestern Louisiana, Lafayette;Univ. of Southwestern Louisiana, Lafayette
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1990

Citing 4
Cited 14

Some tests of generalized bisection

ACM Transactions on Mathematical Software (TOMS)
Preconditioners for the interval Gauss-Seidel method

SIAM Journal on Numerical Analysis
Distribution of mathematical software via electronic mail

ACM SIGNUM Newsletter
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)

Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)

Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library

ACM Transactions on Mathematical Software (TOMS)
A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization

ACM Transactions on Mathematical Software (TOMS)
On the complexity of isolating real roots and computing with certainty the topological degree

Journal of Complexity
On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure

Proceedings of the 2005 ACM symposium on Applied computing
FILIB++, a fast interval library supporting containment computations

ACM Transactions on Mathematical Software (TOMS)
Efficient interval partitioning-Local search collaboration for constraint satisfaction

Computers and Operations Research
Efficient interval partitioning for constrained global optimization

Journal of Global Optimization
Global optimization of non-linear systems of equations by simulating the flight of a projectile in the conformational space

MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Design strategy of serial manipulators with certified constraint satisfaction

IEEE Transactions on Robotics
Interval Analysis for Certified Numerical Solution of Problems in Robotics

International Journal of Applied Mathematics and Computer Science - Verified Methods: Applications in Medicine and Engineering
Filtering numerical CSPs using well-constrained subsystems

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Extensions of the witness method to characterize under-, over- and well-constrained geometric constraint systems

Computer-Aided Design
Interval-based projection method for under-constrained numerical systems

Constraints
Adaptive bisection of numerical CSPs

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a portable software package for finding all real roots of a system of nonlinear equations within a region defined by bounds on the variables. Where practical, the package should find all roots with mathematical certainty. Though based on interval Newton methods, it is self-contained. It allows various control and output options and does not require programming if the equations are polynomials; it is structured for further algorithmic research. Its practicality does not depend in a simple way on the dimension of the system or on the degree of nonlinearity.