Accurate floating-point summation part II: Sign. Κ-Fold faithful and rounding to nearest

Siegfried M. Rumpt, Takeshi Ogita, Shi N.Ichi Oishi

研究成果: Article

50 引用 (Scopus)

抜粋

In Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm fo r calculating the rounded-to-nearest result of s := σPi for a given vector of floating-point numbers pi. as well as algorithms for directed rounding. A special algorithm for computing the sign of s is given, also working for huge dimensions. Assume a floating-point working precision with relative round ing error unit eps. We define and investigate a Κ-fold faithful rounding of a real number r. Basically the result is stored in a vector Resv of Κ nonoverlapping floating-point numbers such that σ Resv approximates r with relative accuracy epsΚ, and replacing Resκ by its floating-point neighbors in Y. Resv forms a lower and upper bound for r. For a given vector of floating-point numbers with exact sums, we present an algorithm for calculating a Κ-fold faithful rounding of s using solely the working precision. Furthermore, an algorithm for calculating a faithfully rounded result of the sum of a vector of huge dimension is presented. Our algorithms are fast in terms of measured computing time because they allow good instruction-level parallelism, they neither require special operations such as access to mantissa or exponent. they contain no branch in the inner loop. nor do they require some extra precision. The only operations used are standard floating-point addition, subtraction, and multiplication in one working precision, for example, double precision. Certain c onstants used in the algorithms are proved to be optimal.

元の言語English
ページ(範囲)1269-1302
ページ数34
ジャーナルSIAM Journal on Scientific Computing
31
発行部数2
DOI
出版物ステータスPublished - 2008 12 1

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

フィンガープリント Accurate floating-point summation part II: Sign. Κ-Fold faithful and rounding to nearest' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用