### 抜粋

Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e., the result is one of the immediate floating-point neighbors of s. If the sum a is a floating-point number, we prove that this is the result of our algorithm. The algorithm adapts to the condition number of the sum, i.e., it is fast for mildly conditioned sums with slowly increasing computing time proportional to the logarithm of the condition number. All statements are also true in the presence of underflow. The algorithm does not depend on the exponent range. Our algorithm is fast in terms of measured computing time because it allows good instructionlevel parallelism, it neither requires special operations such as access to mantissa or exponent, it contains no branch in the inner loop, nor does it 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 constants used in the algorithm are proved to be optimal.

元の言語 | English |
---|---|

ページ（範囲） | 189-224 |

ページ数 | 36 |

ジャーナル | SIAM Journal on Scientific Computing |

巻 | 31 |

発行部数 | 1 |

DOI | |

出版物ステータス | Published - 2008 11 5 |

### ASJC Scopus subject areas

- Computational Mathematics
- Applied Mathematics

## フィンガープリント Accurate floating-point summation part I: Faithful rounding' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*SIAM Journal on Scientific Computing*,

*31*(1), 189-224. https://doi.org/10.1137/050645671