{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:54:48Z","timestamp":1777640088829,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Computing"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1009917222929","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"179-191","source":"Crossref","is-referenced-by-count":11,"title":["Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions"],"prefix":"10.1007","volume":"6","author":[{"given":"Leocadio G.","family":"Casado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inmaculada F.","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaroslav D.","family":"Sergeyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"261621_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0898-1221(90)90140-F","volume":"19","author":"B. Li","year":"1990","unstructured":"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.\n19(4) (1990), pp. 89-94.","journal-title":"Computers Math. Applic."},{"issue":"3","key":"261621_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/81.128014","volume":"CAS-39","author":"D. Bedrosian","year":"1992","unstructured":"Bedrosian, D. and Vlach, J.: Time-Domain Analysis of Networks with Internally Controlled Switches, IEEE Transactions on Circuits Syst.\nCAS-39(3) (1992), pp. 199-212.","journal-title":"IEEE Transactions on Circuits Syst."},{"key":"261621_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/34.23112","volume":"11","author":"J. J. Clark","year":"1989","unstructured":"Clark, J. J.: Authenticathing Edges Produced by Zero-Crossing Algorithms, IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI\n11 (1989), pp. 43-57.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI"},{"key":"261621_CR4","first-page":"37","volume":"16","author":"P. Daponte","year":"1995","unstructured":"Daponte, P., Grimaldi, D., Molinaro, A., and Sergeyev, Ya. D.: An Algorithm for Finding the Zero Crossing of Time Signals with Lipschitzeans Derivatives, Measurements\n16 (1995), pp. 37-49.","journal-title":"Measurements"},{"issue":"1","key":"261621_CR5","first-page":"29","volume":"19","author":"P. Daponte","year":"1996","unstructured":"Daponte, P., Grimaldi, D., Molinaro, A., and Sergeyev, Ya. D.: Fast Detection of the First Zero-Crossing in a Meassurement Signal Set, Measurements\n19(1) (1996), pp. 29-39.","journal-title":"Measurements"},{"key":"261621_CR6","series-title":"Pure and Applied Mathematics","volume-title":"Global Optimization Using Interval Analysis","author":"E. Hansen","year":"1992","unstructured":"Hansen, E.: Global Optimization Using Interval Analysis (Pure and Applied Mathematics\n165), Marcel Dekker, New York, 1992."},{"key":"261621_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00998631","volume":"5","author":"T. Ibaraki","year":"1976","unstructured":"Ibaraki, T.: Theoretical Comparisons of Search Strategies in Branch and Bound Algorithms, Int. J. Comput. Inform. Sci.\n5 (1976), pp. 315-344.","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"261621_CR8","doi-asserted-by":"crossref","unstructured":"Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-1-4757-2495-0"},{"key":"261621_CR9","unstructured":"Kn\u00fcppel, O.: BIAS\u2014Basic Interval Arithmetic Subroutines, Technical Report 93.3, University of Hamburg, 1993."},{"issue":"4","key":"261621_CR10","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1109\/18.86995","volume":"17","author":"S. Mallat","year":"1991","unstructured":"Mallat, S.: Zero Crossing of a Wavelet Transform, IEEE Transactions on Information Theory\n17(4) (1991), pp. 1019-1033.","journal-title":"IEEE Transactions on Information Theory"},{"key":"261621_CR11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.18.1.24","volume":"18","author":"L. G. Mitten","year":"1970","unstructured":"Mitten, L. G.: Branch and Bound Methods: General Formulation and Properties, Operation Reseach\n18 (1970), pp. 24-34.","journal-title":"Operation Reseach"},{"key":"261621_CR12","unstructured":"Moore, R. E.: Interval Analysis, Prentice-Hall, 1966."},{"key":"261621_CR13","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990."},{"key":"261621_CR14","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/S0003-2670(00)82860-3"},{"key":"261621_CR15","unstructured":"Ratschek, H. and Rokne, J.: New Computer Methods for Global Optimization, Ellis Horwood Lmt. (John Willey & Sons), 1988."},{"key":"261621_CR16","unstructured":"Ratz, D.: A Nonsmooth Global Optimization Technique Using Slopes\u2014The One-Dimensional Case, Journal of Global Optimization, accepted for publication."},{"key":"261621_CR17","unstructured":"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."},{"key":"261621_CR18","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/ICASSP.1993.319625","volume":"4","author":"Q. Zhu","year":"1993","unstructured":"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.","journal-title":"IEEE Conference on Acoustic, Speech and Signal Processing"}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009917222929.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009917222929\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009917222929.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:44:14Z","timestamp":1754473454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009917222929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["261621"],"URL":"https:\/\/doi.org\/10.1023\/a:1009917222929","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"value":"1385-3139","type":"print"},{"value":"1573-1340","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}