Floating-point arithmetic is a cornerstone of numerical computation, enabling the approximate representation of real numbers in a format that balances range and precision. Its widespread applicability ...

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".

Many people experience mathematics negatively. Many more students have difficulty in performing basic arithmetic operations that may ultimately exclude them from full participation in society (Moses, ...

FCPS recently sent home math brochures describing what students in each grade will be learning this year. Unfortunately, these documents give the inaccurate impression that FCPS is committed to ...

Many communication and graphics applications are computation-intensive, yet no one has paid much attention to optimizing the hardware that implements mathematical functions. Traditional implementation ...

The University of Wisconsin Department of Mathematics and UW-iSchool partnered with the University Lectures Committee to host mathematician Cathy O’Neil Tuesday evening at the Fluno Center. O’Neil is ...

A C implementation of Niederreiter's algorithm for factoring polynomials over F 2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain ...

Floating-point arithmetic can be expensive if you're using an integer-only processor. But floating-point values can be manipulated as integers, asa less expensive alternative. One advantage of using a ...