On first zero crossing points

Three algorithms, FZ1, FZ2 and FZ3 for bounding the first zero crossing point of a set of univariate functions on a bounded closed interval are described. Extended interval arithmetic is used in both FZ2 and FZ3. Automatic derivative arithmetic is used in FZ2 and automatic slope arithmetic is used in FZ3. Numerical results are presented.

[1]  M. A. Wolfe.  Interval mathematics, algebraic equations and optimization , 2000 .

[2]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[3]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[4]  R. B. Kearfott.  Rigorous Global Search: Continuous Problems , 1996 .

[5]  Arnold Neumaier,et al.  Introduction to Numerical Analysis , 2001 .

[6]  Ulrich Kulisch,et al.  Numerical Toolbox for Verified Computing I: Basic Numerical Problems Theory, Algorithms, and Pascal-Xsc Programs , 1994 .

[7]  A. Neumaier.  Rigorous sensitivity analysis for parameter-dependent systems of equations , 1989 .

[8]  Inmaculada García,et al.  Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions , 2000, Reliab. Comput..

[9]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[10]  Pasquale Daponte,et al.  An algorithm for finding the zero crossing of time signals with Lipschitzean derivatives , 1995 .

[11]  Pasquale Daponte,et al.  Fast detection of the first zero-crossing in a measurement signal set , 1996 .

[12]  Ulrich W. Kulisch,et al.  Numerical Toolbox for Verified Computing I , 1993 .

[13]  Ole Caprani,et al.  Robust and Efficient Ray Intersection of Implicit Surfaces , 2000, Reliab. Comput..

[14]  Shen Zuhe,et al.  On interval enclosures using slope arithmetic , 1990 .

[15]  D. P. Mitchell.  Robust ray intersection with interval arithmetic , 1990 .