Finding zeros by multilevel subdivision techniques

IMA Journal of Numerical Analysis

Volumn 22, Issue 2, 2002, Pages 167-185

  Dellnitz, Michael ^a   Schütze, Oliver ^a   Sertl, Stefan ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Global zero finding; Newton's method; Step size control

Indexed keywords

DYNAMICAL SYSTEMS; NEWTON-RAPHSON METHOD;

COMPARISON WITH A STANDARD; ITERATION SCHEMES; NEWTON'S METHODS; NUMERICAL EFFICIENCY; STEP-SIZE CONTROLS; SUBDIVISION ALGORITHMS; SUBDIVISION TECHNIQUE; ZERO FINDING;

NUMERICAL METHODS;

EID: 0344153898     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/22.2.167     Document Type: Article

References (24)

1. ALEFELD, G. & HERZBERGER, J. (1983) Introduction to Interval Computations. New York: Academic.
2. ALLGOWER, E. L. & GEORG, K. (1990) Numerical Continuation Methods. Berlin: Springer.
3. CHOW, S. N., MALLET-PARET, J. & YORKE, J. A. (1978) Finding zeros of maps. Math. Comput., 32, 887-899.
4. DELLNITZ, M. & HOHMANN, A. (1997) A subdivision algorithm for the computation of unstable manifolds and global attractors. Numer. Math., 75, 293-317.
5. DELLNITZ, M. & JUNGE, O. (1998) An adaptive subdivision technique for the approximation of attractors and invariant measures. Comput. Visual. Sci., 1, 63-68.
6. DELLNITZ, M., JUNGE, O., STRZODKA, R. & RUMPF, M. (2000) The computation of an invariant set inside a cylinder with a knotted flow. Proc. of Equadiff 99 pp. 1053-1059.
7. DELLNITZ, M., SCHÜTZE, O. & ZHENG, Q. (2002) Locating all the zeros of an analytic function in one complex variable. J. Comput. Appl. Math., 138, 325-333.
8. DENNIS, J. E. & SCHNABEL, R. B. (1983) Numerical Methods for Unconstrained Optimization and Nonlinear Equations. New York: Prentice-Hall.
9. DEVANEY, R. (1989) Chaotic Dynamical Systems. New York: Addison-Wesley.
10. HANSEN, E. (1992) Global Optimization Using Interval Analysis. New York: Dekker.
11. HIMMELBLAU, D. M. (1972) Applied Nonlinear Programming. New York: McGraw-Hill.
12. HIRSCH, M. W. & SMALE, S. (1979) On algorithms for solving f(x) = 0. Commun. Pure Appl. Math., 32, 281-312.
13. HORST, R. & TUY, H. (1996) Global Optimization: Deterministic Approaches. Springer.
14. JUNGE, O. (1999) Mengenorientierte Methoden zur numerischen Analyse dynamischer systeme, PhD Thesis, University of Paderborn.
15. KEARFOTT, B. (1996) Rigorous Global Search: Continuous Problems. Dordrecht: Kluwer.
16. KELLOGG, R. B., LI, T. Y. & YORKE, J. (1976) A constructive proof of the brouwer fixed-point theorem and computational results. SIAM J. Numer. Anal., 13, 473-483.
17. MORÉ, J., GARBOW, B. & HILLSTROM, K. (1981) Testing unconstrained optimization software. ACM Trans. Math. Soft., 7, 11-41.
18. MORGAN, A. (1987) A homotopy for solving general polynomial systems that respects m-homogenuous structures. Appl. Math. Comput., 24, 101-113.
19. PEITGEN, H. O., PRÜFER, M. & SCHMITT, K. (1988) Global aspects of the continuous and discrete newton method: a case study. Acta. Appl. Math., 13, 123-202.
20. SHUB, M. (1987) Global Stability of Dynamical Systems. Springer.
21. STEWART, I., ELMHIRST, T. & COHEN, J. (2000) Symmetry-breaking as an origin of species. Prepress.
22. VERSCHELDE, J. & HAEGEMANS, A. (1994) Homotopies for solving polynomial systems within a bounded domain. Theor. Comput. Sci. A, 133, 165-185.
23. YING, X. & KATZ, N. (1988) A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain. Numer. Math., 53, 143-163.
24. YING, X. & KATZ, N. (1989) A simple reliable solver for all the roots of a nonlinear function in a given domain. Computing, 41, 317-333.