论文信息 - An Interval Algorithm for Bounding the Ranges of Real-Valued Functions of One Real Variable

An Interval Algorithm for Bounding the Ranges of Real-Valued Functions of One Real Variable

An interval algorithm FRANGE which determines computationally rigorous bounds on the ranges of functions f : R1 → R1 [a, b] c R1 with prescribed over-estimation is described. It is assumed that f ∈ C2(D) where D c R1 is an open interval containing [a, b]. The algorithm FRANGE is based on an algorithm due to Rall and offers a choice of four selections of function, derivative and slope evaluations. Numerical results from a Fortran 90 implementation of FRANGE are presented.

Michael A. Wolfe

[1] A. Griewank,et al. Automatic differentiation of algorithms : theory, implementation, and application , 1994 .

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

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

[4] Richard J. Fateman,et al. Automatic Differentiation of Algorithms: Theory, Implementation, and Application (Andreas Griewank and George F. Corliss, eds.) , 1993, SIAM Rev..

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

[6] M. A. Wolfe. On global optimization in R using interval arithmetic , 1994 .

[7] Jon G. Rokne,et al. Computer Methods for the Range of Functions , 1984 .

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

[9] A. Neumaier,et al. Interval Slopes for Rational Functions and Associated Centered Forms , 1985 .

[10] Ulrich W. Kulisch,et al. PASCAL-XSC , 1992, Springer Berlin Heidelberg.

[11] Louis B. Rall,et al. Improved Interval Bounds for Ranges of Functions , 1985, Interval Mathematics.