๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Roundoff errors in floating-point summation

โœ Scribed by Ole Caprani

Publisher
Springer Netherlands
Year
1975
Tongue
English
Weight
250 KB
Volume
15
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on geometric ergodicity and float
A note on geometric ergodicity and floating-point roundoff error
โœ Laird Breyer; Gareth O. Roberts; Jeffrey S. Rosenthal ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 86 KB

We consider the extent to which Markov chain convergence properties are a ected by the presence of computer oating-point roundo error. Both geometric ergodicity and polynomial ergodicity are considered. This paper extends previous work of Roberts et al. (J. Appl. Probab. 35 (1998) 1) to the case of

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

All possible computed results in correct
All possible computed results in correct floating-point summation
โœ M. Pichat ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 770 KB

On a computer, any entry or elementary operation has two legitimate results, one by default and one by excess. Thus, a given algebraic algorithm with a single result is able, when processed on a computer, to generate a large set of floating-point results, all representative of the exact algebraic re