Interval algorithms for finding the minimal root in a set of multiextremal one-dimensional nondifferentiable functions

SIAM Journal on Scientific Computing

Volumn 24, Issue 2, 2003, Pages 359-376

  Casado, L G ^a   Garcia I ^a   Sergeyev, Ya D ^b,c  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF CALABRIA   (Italy)

^c LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

Author keywords

Branch and bound; Interval analysis; Minimal root

Indexed keywords

ALGORITHMS; FUNCTIONS; PROBLEM SOLVING; SET THEORY;

NONDIFFERENTIABLE FUNCTIONS;

NATURAL SCIENCES COMPUTING;

EID: 0037252494     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827599357590     Document Type: Article

References (24)

1. B. LI, A. LAW, H. RAAFAT, P. NGUYBN, AND Y.-F. YAN, Eigenvalues of tridiagonal matrices: An alternative to Givens' methods, Comput. Math. Appl., 19 (1990), pp. 89-94.
2. D. BEDROSIAN AND J. VLACH, Time-domain analysis of networks with, internally controlled switches, IEEE Trans. Circuits Systems I Fund. Theory Appl., 39 (1992), pp. 199-212.
3. O. CAPRANI, L. HVIDEGAARD, M. MORTENSEN. AND T. SCHNEIDER, Robust and efficient ray intersection of implicit surfaces, Reliab. Comput., 1 (2000), pp. 9-21.
4. L. G. CASADO, I. GARCÍA, AND Y. D. SERGEYEV, Interval branch and bound algorithm for finding the First-Zero-Crossing-Point in one-dimensional functions, Reliab. Comput., 2 (2000), pp. 179-191.
5. J. CLARK, Authenticating edges produced by zero-crossing algorithms, IEEE Trans. Pattern Analysis and Machine Intelligence, 11 (1989), pp. 43-57.
6. P. DAPONTE, D. GRIMALDI, A. MOLINARO, AND Y. D. SERGEYEV, An algorithm for finding the zero crossing of time signals with Lipschitzean derivatives, Measurements, 16 (1995), pp. 37-49.
7. P. DAPONTE, D. GRIMALDI, A. MOLINARO, AND Y. D. SERGEYEV, Fast detection of the first zero-crossing in a measurement signal set, Measurements, 19 (1996), pp. 29-39.
8. R. HAMMER, M. HOCKS, U. KULISCH, AND D. RATZ, C++ Toolbox for Verified Computing, Springer-Verlag, New York, 1995.
9. E. HANSEN, Global Optimization Using Interval Analysis, Monogr. Textbooks Pure Appl. Math. 165, Marcel Dekker, New York, 1992.
10. T. IBARAKI, Theoretical comparisons of search strategies in branch and bound algorithms, Internat. J. Comput. Inform. Sci., 5 (1976), pp. 315-344.
11. D. KALRA AND A. H. BARR, Guaranteed ray intersections with implicit surfaces, Computer Graphics, 23 (1989), pp. 297-306.
12. R. B. KEARFOTT, Rigorous Global Search: Continuous Problems, Kluwer, Dordrecht, The Netherlands, 1996.
13. R. B. KEARFOTT, Empirical evaluation of innovations in interval branch and bound algorithms for nonlinear systems, SIAM J. Sci. Comput., 18 (1997), pp. 574-594.
14. O. KNÜPPEL, BIAS-Basic Interval Arithmetic Subroutines, Tech. report 93.3, University of Hamburg, Hamburg, Germany, 1993.
15. K. MAKINO AND M. BERZ, Higher order verified inclusions of multidimensional systems by Taylor models, Nonlinear Anal., 47 (2001), pp. 3503-3514. Also available online from http://bt.nscl.msu.edu/pub/.
16. S. MALLAT, Zero crossing of a wavelet transform, IEEE Trans. Inform. Theory, 17 (1991), pp. 1019-1033.
17. D. MITCHELL, Robust ray intersection with interval arithmetic, in Proceedings of the Canadian Human-Computer Communications Society Conference on Graphics Interface, Halifax, Nova Scotia, Canada, 1990, pp. 68-74.
18. L. G. MITTEN, Branch and bound methods: General formulation and properties, Oper. Res., 18 (1970), pp. 24-34.
19. R. MOORE, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
20. A. NEUMAIER, Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, UK, 1990.
21. W. PRESS, Y. FLANNER, S. TEUKOLSKY, AND W. VETTERLING, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, Cambridge, UK, 1986.
22. H. RATSCHEK AND J. ROKNE, New Computer Methods for Global Optimization, Ellis Horwood Series: Mathematics and its Applications, John Wiley and Sons, New York, 1988.
23. Y. A. D. SERGEYEV, P. DAPONTE, D. GRIMALDI, AND A. MOLINARO, Two methods for solving optimization problems arising in electronic measurement and electrical engineering, SIAM J. Optim., 10 (1999), pp. 1-21.
24. Q. ZHU, M. KAM, AND R. YEAGER, Non-parametric identification of QAM constellations in noise, in Proceedings of the IEEE Conference on Acoustic, Speech and Signal Processing, IEEE Signal Processing Society, Piscataway, NJ, 1993, pp. 184-187.