Abstract
This is a slightly expanded form of the author’s talk of the same title at SCAN 2014, Würzburg. Angled towards people who use interval numerical methods little or not at all, it briefly describes how interval arithmetic works, the mindset required to use it effectively, why an interval arithmetic standard was needed, the setting up of IEEE Working Group P1788 for the purpose, the structure of the standard it has produced, some difficulties we encountered, and the current state of the P1788 project. During production of these Proceedings the 1788 standard has been published, but the talk’s original title has been kept.
This is a preview of subscription content, log in via an institution.
Notes
- 1.
dy is just a mnemonic, “decoration for \({\varvec{y}}\)”. It has nothing to do with differentials.
- 2.
com means “common”, see Sect. 6, but also that code can verify it is common.
- 3.
This has been called the “Thou Shalt Not Lie” principle.
References
Gustafson, J.L.: The End of Error: Unum Computing. Chapman and Hall/CRC. Taylor & Francis, Upper Saddle (2015)
Hansen, E.R., Greenberg, R.I.: An interval Newton method. J. Appl. Math. Comput. 12, 89–98 (1983)
Heath, T.L.: A History of Greek Mathematics. Number v. 1 in A History of Greek Mathematics. Clarendon Press, Oxford (1921)
Kantorovich, L.V.: On some new approaches to computational methods and to processing of observations. Siberian Math. J. 3(5), 701–709 (1962). In Russian
Kaucher, E.W.: Interval analysis in the extended interval space IR. Comput. Suppl. 2, 33–49 (1980)
Baker Kearfott, R.: A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization. ACM TOMS 21(1), 63–78 (1995)
Knüppel, O.: PROFIL/BIAS – a fast interval library. Computing 53(3–4), 277–287 (1994)
Kreinovich, V.: Interval computations web site. http://cs.utep.edu/interval-comp, August 28, 2014
Lerch, M., Tischler, G., von Gudenberg, J.W., Hofschuster, W., Krämer, W.: FILIB++, a fast interval library supporting containment computations. ACM Trans. Math. Softw. 32(2), 299–324 (2006)
Mayer, G.: Epsilon-inflation in verification algorithms. J. Comput. Appl. Math. 60, 147–169 (1995)
Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs, N.J. (1966)
Neumaier, A.: Vienna proposal for interval standardization. August 28, 2014. December 2008. http://www.mat.univie.ac.at/~neum/ms/1788.pdf
Rump, S.M.: INTLAB - INTerval LABoratory. In: Csendes, T. (ed.), Developments in Reliable Computing, pp. 77–104. Kluwer Academic Publishers, Dordrecht (1999). http://www.ti3.tuhh.de/rump/
Rump, S.M.: Verification methods: Rigorous results using floating-point arithmetic. Acta Numer. 19, 287–449 (2010). Cambridge University Press
Rump, S.M.: Interval arithmetic over finitely many endpoints. BIT Numer. Math. 52(4), 1059–1075 (2012)
Sunaga, T.: Theory of an interval algebra and its application to numerical analysis. Res. Assoc. Appl. Geom. Memoirs 2, 29–46 (1958)
Tucker, W.: Validated Numerics: A Short Introduction to Rigorous Computations. Princeton University Press, Princeton (2011)
van Hentenryck, P., Macallester, D., Kapur, D.: Solving polynomial systems using a branch and prune approach. SIAM J. Numer. Anal. 34(2), 797–827 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Proof of Interval Newton Properties
A Proof of Interval Newton Properties
This appendix proves the properties stated in Sect. 2.2. It may be of interest because item (iv) of the Theorem does not seem to have appeared in the literature before. An interval extension of a real function f of real variables means an interval function \({\varvec{f}}\) of corresponding interval variables such that \(y = f(x_1,\ldots ,x_n)\) is in \({\varvec{y}} = {\varvec{f}}({\varvec{x}}_1,\ldots ,{\varvec{x}}_n)\) whenever \(x_i\) is in \({\varvec{x}}_i\) for each \(i=1,\ldots ,n\).
Theorem 2
Let \(f:\mathbb {R}\rightarrow \mathbb {R}\) be \(C^1\) on an interval \({\varvec{x}}\), which may be unbounded. Let \({\varvec{f}}\) and \({\varvec{f}}\,'\) be interval extensions of f and its derivative \(f'\), and let x be any point of \({\varvec{x}}\). Define the set
where \(\mathop {/\!\!/}\) denotes division in the sense of reverse multiplication. (Thus Y may be empty, an interval, or the union of two disjoint unbounded intervals.)
Then
-
(i)
Y contains all zeros of f in \({\varvec{x}}\).
-
(ii)
If \(Y\cap {\varvec{x}}=\emptyset \), there are no zeros of f in \({\varvec{x}}\).
-
(iii)
If \(0\notin {\varvec{f}}\,'({\varvec{x}})\), there is at most one zero of f in \({\varvec{x}}\).
-
(iv)
If Y is nonempty, bounded and \(\subseteq {\varvec{x}}\), there is exactly one zero of f in \({\varvec{x}}\).
Proof
(i) Let \(z\in {\varvec{x}}\) with \(f(z)=0\). By the Mean Value Theorem
for some \(\xi \in {\varvec{x}}\). By definition of interval extension, \(f'(\xi )\in {\varvec{f}}'({\varvec{x}})\) and \(f(x)\in {\varvec{f}}([x])\). Hence by the definition of reverse multiplication
that is
as required.
(ii) This is immediate from (i).
(iii) In (5) let both z and x be roots in \({\varvec{x}}\). Then we have \(0=f(x)-f(z) = (x-z)f'(\xi )\). By hypothesis \(0\notin {\varvec{f}}'({\varvec{x}})\) which implies \(f'(\xi )\ne 0\). Hence \(x-z=0\), \(x=z\), so there is at most one root.
(iv) Write \({\varvec{b}}={\varvec{f}}'({\varvec{x}})\), \({\varvec{c}}={\varvec{f}}([x])\), both being nonempty by the definition of interval extension. By hypothesis \(Y=x-{\varvec{c}}\mathop {/\!\!/}{\varvec{b}}\) is nonempty and bounded, so \(Z={\varvec{c}}\mathop {/\!\!/}{\varvec{b}}\) is nonempty and bounded.
I claim \(0\notin {\varvec{b}}\). For suppose \(0\in {\varvec{b}}\). Then \(0\notin {\varvec{c}}\), for if \(0\in {\varvec{c}}\) then Z is the unbounded set \(\mathbb {R}\), contrary to hypothesis. Now two subcases arise.
– Either \({\varvec{b}}\) is singleton [0], making Z empty, contrary to hypothesis.
– Or, \({\varvec{b}}\) contains 0 and another point, in which case it contains points arbitrarily close to 0. Since \(0\notin {\varvec{c}}\ne \emptyset \), \({\varvec{c}}\) contains a nonzero point. Together these imply \({\varvec{c}}\mathop {/\!\!/}{\varvec{b}}\) is unbounded, again contrary to hypothesis.
Thus all the cases of \(0\in {\varvec{b}}\) give a contradiction, proving \(0\notin {\varvec{b}}\). Hence by part (iii) there is at most one root in \({\varvec{x}}\) and we must show there is at least one. If \(f(x)=0\) there is nothing more to prove, so assume \(f(x)\ne 0\).
Let \(b^*\) be the bound of \({\varvec{b}}\) nearest 0, so it is finite, \(\ne 0\) and in \({\varvec{b}}\). Let \(z^*\) be the intercept on the x-axis of the line through (x, f(x)) with slope \(b^*\), so
equivalently
Since \(f(x)\in {\varvec{c}}\) and \(b^*\in {\varvec{b}}\), (6) shows \(z^*\in Y\subseteq {\varvec{x}}\). Also \(x\in {\varvec{x}}\) so by the Mean Value Theorem there is \(\xi \in {\varvec{x}}\) with
Subtracting this from (7) gives
Now \(f'(\xi )\) is in \({\varvec{b}}\) by the latter’s definition, so by the definition of \(b^*\) it has the same sign as \(b^*\) and at least as large absolute value, i.e. \(f'(\xi )/b^* \ge 1\). Dividing (9) by (7) (recalling \(f(x)\ne 0\)) now gives
so \(f(z^*)\) has opposite (in the weak sense) sign to f(x). By the Intermediate Value Theorem f has a zero z between x and \(z^*\). Since both the latter are in \({\varvec{x}}\) we have \(z\in {\varvec{x}}\), and the result is proved. \(\square \)
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Pryce, J. (2016). The Forthcoming IEEE Standard 1788 for Interval Arithmetic. In: Nehmeier, M., Wolff von Gudenberg, J., Tucker, W. (eds) Scientific Computing, Computer Arithmetic, and Validated Numerics. SCAN 2015. Lecture Notes in Computer Science(), vol 9553. Springer, Cham. https://doi.org/10.1007/978-3-319-31769-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-31769-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31768-7
Online ISBN: 978-3-319-31769-4
eBook Packages: Computer ScienceComputer Science (R0)