✦ LIBER ✦

Relative error in floating-point multiplication

✍ Scribed by R. H. Goodman; A. Feldstein; J. Bustoz

Publisher: Springer Vienna
Year: 1985
Tongue: English
Weight: 674 KB
Volume: 35
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02260500

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some models of error in floating point m

Some models of error in floating point multiplication

✍ R. Goodman 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 481 KB

Roundoff error distribution in fixed poi

Roundoff error distribution in fixed point multiplication

✍ E. H. Bareiss; J. L. Barlow 📂 Article 📅 1980 🏛 Springer Netherlands 🌐 English ⚖ 171 KB

Roundoff errors in floating-point summat

Roundoff errors in floating-point summation

✍ Ole Caprani 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 250 KB

Floating-point error propagation in iter

Floating-point error propagation in iterative methods

✍ René Alt 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 923 KB

In this paper, a formal space for the modelization of computer arithmetic and a pseudo-distance defined on this space to study computer iterative sequences is proposed. Some properties if this pseudo-distance are examined and a termination criterion for iterative sequences in this space is given. T

On round-off error in fixed-point multip

On round-off error in fixed-point multiplication

✍ Richard Goodman 📂 Article 📅 1976 🏛 Springer Netherlands 🌐 English ⚖ 669 KB

A new error-free floating-point summatio

A new error-free floating-point summation algorithm

✍ V.Y. Pan; B. Murphy; G. Qian; R.E. Rosholt 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Summation is a basic operation in scientific computing; furthermore division-free arithmetic computations can be boiled down to summation. We propose a new summation algorithm, which consists of double-precision floating-point operations and outputs the error-free sums. The computational time is pro