This paper first exposes some of the defects in the interval arithmetic algorithms of Moore and Krückeberg. Then it identifies classes of problems on which these algorithms compute "optimum bounds".

SIAM Journal on Numerical Analysis, Vol. 27, No. 3 (Jun., 1990), pp. 804-822 (19 pages) Interval Newton methods in conjunction with generalized bisection can form the basis of algorithms that find all ...

In this video, John Gustafson from the National University of Singapore presents: Beyond Floating Point: Next Generation Computer Arithmetic. “A new data type called a “posit” is designed for direct ...

Floating-point arithmetic is a cornerstone of modern computational science, providing an efficient means to approximate real numbers within a finite precision framework. Its ubiquity across scientific ...