Reliable Computing

, Volume 6, Issue 2, pp 179–191 | Cite as

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

  • Leocadio G. Casado
  • Inmaculada F. García
  • Yaroslav D. Sergeyev


In this paper, new ideas have been incorporated to a basic interval branch-and-bound algorithm which solves the problem of finding zeros in one-dimensional functions. These new ideas are based on the combination of a new rejection criterion, a selection strategy and an easy-to-obtain precondition of the problem at hand. The methodology described here focuses on finding the first zero crossing point, allowing the search of other zero crossing points to be avoided. In addition, a heuristic subdivision criterion has been proposed that, compared to bisection rule, provides improvements in most of the forty problems that have been tested.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.Google Scholar
  2. 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.Google Scholar
  3. 3.
    Clark, J. J.: Authenticathing Edges Produced by Zero-Crossing Algorithms, IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 11 (1989), pp. 43-57.Google Scholar
  4. 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.Google Scholar
  5. 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.Google Scholar
  6. 6.
    Hansen, E.: Global Optimization Using Interval Analysis (Pure and Applied Mathematics 165), Marcel Dekker, New York, 1992.Google Scholar
  7. 7.
    Ibaraki, T.: Theoretical Comparisons of Search Strategies in Branch and Bound Algorithms, Int. J. Comput. Inform. Sci. 5 (1976), pp. 315-344.Google Scholar
  8. 8.
    Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, 1996.Google Scholar
  9. 9.
    Knüppel, O.: BIAS—Basic Interval Arithmetic Subroutines, Technical Report 93.3, University of Hamburg, 1993.Google Scholar
  10. 10.
    Mallat, S.: Zero Crossing of a Wavelet Transform, IEEE Transactions on Information Theory 17(4) (1991), pp. 1019-1033.Google Scholar
  11. 11.
    Mitten, L. G.: Branch and Bound Methods: General Formulation and Properties, Operation Reseach 18 (1970), pp. 24-34.Google Scholar
  12. 12.
    Moore, R. E.: Interval Analysis, Prentice-Hall, 1966.Google Scholar
  13. 13.
    Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.Google Scholar
  14. 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.Google Scholar
  15. 15.
    Ratschek, H. and Rokne, J.: New Computer Methods for Global Optimization, Ellis Horwood Lmt. (John Willey & Sons), 1988.Google Scholar
  16. 16.
    Ratz, D.: A Nonsmooth Global Optimization Technique Using Slopes—The One-Dimensional Case, Journal of Global Optimization, accepted for publication.Google Scholar
  17. 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.Google Scholar
  18. 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.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Leocadio G. Casado
    • 1
  • Inmaculada F. García
    • 2
  • Yaroslav D. Sergeyev
    • 3
    • 4
  1. 1.Department of Computer Architecture and ElectronicsUniversity ofAlmeríaSpain
  2. 2.Department of Computer Architecture and ElectronicsUniversity ofAlmeríaSpain
  3. 3.ISI-CNR c/o DEISUniversitá della CalabriaRende (CS)Italy
  4. 4.University of Nizhni NovgorodNizhni NovgorodRussia

Personalised recommendations