Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions

Reliable Computing

Volumn 6, Issue 2, 2000, Pages 179-191

  Casado, Leocadio G ^c   García, Inmaculada F ^c   Sergeyev, Yaroslav D ^a,b  

^a UNIVERSITY OF CALABRIA   (Italy)

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

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012777038     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009917222929     Document Type: Article

References (18)

1. Baoxin Li, Law, A. G., Raafat, H., Nguyen, P. H. and Yan, Y.-F.: Eigenvalues of Tridiagonal Matrices: An Alternative to Givens' Methods, Computers Math. Applic. 19 (4) (1990), pp. 89-94.
2. Bedrosian, D. and Vlach, J.: Time-Domain Analysis of Networks with Internally Controlled Switches, IEEE Transactions on Circuits Syst. CAS-39 (3) (1992), pp. 199-212.
3. Clark, J. J.: Authenticating Edges Produced by Zero-Crossing Algorithms, IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 11 (1989), pp. 43-57.
4. Daponte, P., Grimaldi, D., Molinaro, A., and Sergeyev, Ya. D.: An Algorithm for Finding the Zero Crossing of Time Signals with Lipschitzeans Derivatives, Measurements 16 (1995), pp. 37-49.
5. Daponte, P., Grimaldi, D., Molinaro, A., and Sergeyev, Ya. D.: Fast Detection of the First Zero-Crossing in a Meassurement Signal Set, Measurements 19 (1) (1996), pp. 29-39.
6. Hansen, E.: Global Optimization Using Interval Analysis (Pure and Applied Mathematics 165), Marcel Dekker, New York, 1992.
7. Ibaraki, T.: Theoretical Comparisons of Search Strategies in Branch and Bound Algorithms, Int. J. Comput. Inform. Sci. 5 (1976), pp. 315-344.
8. Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, 1996.
9. Knüppel, O.: BIAS - Basic Interval Arithmetic Subroutines, Technical Report 93.3, University of Hamburg, 1993.
10. Mallat, S.: Zero Crossing of a Wavelet Transform, IEEE Transactions on Information Theory 17 (4) (1991), pp. 1019-1033.
11. Mitten, L. G.: Branch and Bound Methods: General Formulation and Properties, Operation Reseach 18 (1970), pp. 24-34.
12. Moore, R. E.: Interval Analysis, Prentice-Hall, 1966.
13. Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.
14. Press, W. H., Flanner, Y. B. P., Teukolsky, S. A., and Vetterling, W. T.: Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, 1986.
15. Ratschek, H. and Rokne, J.: New Computer Methods for Global Optimization, Ellis Horwood Lmt. (John Willey & Sons), 1988.
16. Ratz, D.: A Nonsmooth Global Optimization Technique Using Slopes - The One-Dimensional Case, Journal of Global Optimization, accepted for publication.
17. Sergeyev, Ya. D., Daponte, P., Grimaldi, D., and Molinaro, A.: Two Methods for Solving Optimization Problems Arising in Electronic Measurement and Electrical Engenieering, SIAM J. Optimization, to appear.
18. Zhu, Q., Kam, M., and Yeager, R.: Non-Parametric Identification of QAM Costellations in Noise, in: IEEE Conference on Acoustic, Speech and Signal Processing, volume 4, 1993, pp. 184-187.