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

Loop invariants in floating point algorithms

โœ Scribed by K. -U. Jahn

Publisher
Springer Vienna
Year
1993
Tongue
English
Weight
416 KB
Volume
50
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Floating-point versus Symbolic Computati
Floating-point versus Symbolic Computations in theQD-algorithm
โœ ANNIE CUYT ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

The convergence of columns in the univariate qd-algorithm to reciprocals of polar singularities of meromorphic functions has often proved to be very useful. Any q-column corresponding to a "simple pole of isolated modulus" converges to the reciprocal of the corresponding pole. By performing an equiv

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