Empirical evaluation of innovations in interval branch and bound algorithms for nonlinear systems

SIAM Journal on Scientific Computing

Volumn 18, Issue 2, 1997, Pages 574-594

  Kearfott, R Baker ^a  

^a UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

Author keywords

Branch and bound methods; E inflation; Fortran 90; Interval computations; Nonlinear algebraic systems; Second order extensions; Slope matrices

Indexed keywords

BRANCH AND BOUND METHODS; INTERVAL COMPUTATIONS;

ALGEBRA; APPROXIMATION THEORY; CALCULATIONS; COMPUTER SIMULATION; FORTRAN (PROGRAMMING LANGUAGE); MATRIX ALGEBRA; NONLINEAR SYSTEMS; NUMERICAL METHODS; SET THEORY;

ALGORITHMS;

EID: 0031082710     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827594266131     Document Type: Article

References (33)

1. G. ALEFELD AND J. HERZBERGER, Introduction to Interval Computations, Academic Press, New York, 1983.
2. E. ALLGOWER AND K. GEORG, Numerical Continuation Methods: An Introduction, Springer-Verlag, New York, 1990.
3. O. CAPRANI, B. GODTHAAB, AND K. MADSEN, Use of a real-valued local minimum in parallel interval global optimization, Interval Comput., 2 (1993), pp. 71-82.
4. L. C. W. DIXON AND G. P. SZEGÖ, The global optimization problem: An introduction, in Towards Global Optimization 2, L. C. W. Dixon and G. P. Szegö, eds., North-Holland, Amsterdam, 1978, pp. 1-15.
5. E. R. HANSEN, Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.
6. J. HERZBERGER, ed., Topics in Validated Computations, Elsevier Science Publishers, Amsterdam, 1994.
7. C. JANSSON AND O. KNÜPPEL, A Global Minimization Method: The Multi-Dimensional Case, Tech. report 92.1, Informathinstechnik, Technische Universität Hamburg-Harburg, Hamburg, Germany, 1992.
8. R. B. KEARFOTT, Abstract generalized bisection and a cost bound, Math. Comp., 49 (1987), pp. 187-202.
9. R. B. KEARFOTT, Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems, Computing, 47 (1991), pp. 169-191.
10. R. B. KEARFOTT, A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization, ACM Trans. Math. Software, 21 (1995), pp. 63-78.
11. R. B. KEARFOTT, Interval Newton/generalized bisection when there are singularities near roots, Ann. Oper. Res., 25 (1990), pp. 181-196.
12. R. B. KEARFOTT, Preconditioned for the interval Gauss-Seidel method, SIAM J. Numer. Anal., 27 (1990), pp. 804-822.
13. R. B. KEARFOTT, Some tests of generalized bisection, ACM Trans. Math. Software, 13 (1987), pp. 197-220.
14. R. B. KEARFOTT, M. DAWANDE, K.-S. DU, AND C.-Y. HU, Algorithm 737: INTLIB: a portable FORTRAN 77 interval standard function library, ACM Trans. Math. Software, 20 (1994), pp. 447-459.
15. R. B. KEARFOTT AND K. Du, The cluster problem in multivariate global optimization, J. Global Optim., 5 (1994), pp. 253-265.
16. R. B. KEARFOTT, C. Hu, AND M. III NOVOA, A review of preconditioned for the Interval Gauss-Seidel method, Interval Comput., 1 (1991), pp. 59-85.
17. R. B. KEARFOTT AND M. NOVOA, INTBIS, a portable interval Newton/bisection package (Algorithm 681), ACM Trans. Math. Software, 16 (1990), pp. 152-157.
18. R. B. KEARFOTT AND Z. XING, Rigorous Computation of Surface Patch Intersection Curves, University of Southwestern Louisiana, Lafayette, LA, 1993, preprint.
19. O. KNÜPPEL, PROFIL/BIAS-A fast interval library, Computing, 53 (1994), pp. 277-287.
20. R. KRAWCZYK, Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlershranken, Computing, 4 (1969), pp. 187-201.
21. R. KRAWCZYK AND A. NEUMAIER, Interval slopes for rational functions and associated centered forms, SIAM J. Numer. Anal., 22 (1985), pp. 604-616.
22. G. MAYER, Epsilon-inflation in verification algorithms, J. Comput. Appl. Math. 60 (1994), pp. 147-169.
23. V. MLADENOV, An improved interval method for solving nonlinear systems of monotone functions, S. M. Markov, ed., in Mathematical Modelling and Scientific Computing, DATECS Publishing, Sofia, 1993, pp. 23-26.
24. R. E. MOORE, Methods and Applications of Interval Analysis, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1979.
25. R. E. MOORE, A test for existence of solutions to nonlinear systems, SIAM J. Numer. Anal., 14 (1977), pp. 611-615.
26. R. E. MOORE AND S. T. JONES, Safe starting regions for iterative methods, SIAM J. Numer. Anal., 14 (1977), pp. 1051-1065.
27. J. J. MORE, B. S. GARBOW, AND K. E. HILLSTROM, User Guide for MINPACK-1, Tech. report ANL-80-74, Argonne National Laboratories, Argonne, IL, 1980.
28. A. J. MORGAN AND A. P. SOMMESE, Computing all solutions to polynomial systems using homotopy continuation, Appl. Math. Comput., 24 (1987), pp. 115-138.
29. A. NEUMAIER, Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, U.K., 1990.
30. H. RATSCHEK AND J. ROKNE, Computer Methods for the Range of Functions, Horwood, Chichester, U.K., 1984.
31. S. M. RUMP, Kleine Fehlerschranken bei Matrixproblemen, Ph.D. thesis, Universität Karlsruhe, Karlsruhe, Germany, 1980.
32. S. M. RUMP, Verification methods for dense and sparse systems of equations, in Topics in Validated Computations, J. Herzberger, ed., Elsevier Science Publishers, Amsterdam, The Netherlands, 1994.
33. ZH. XING, Rigorous Step Control for Continuation, Ph.D. thesis, University of Southwestern Louisiana, Lafayette, LA, 1993.