Accurate Summation: Towards a Simpler and Formal Proof

Laurent Fousse 1 Paul Zimmermann 1
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper provides a simpler proof of the "accurate summation" algorithm proposed by Demmel and Hida. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computer-checked proof of Demmel-Hida's algorithm.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00099686
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:40:19 AM
Last modification on : Thursday, January 11, 2018 - 6:20:00 AM

Identifiers

  • HAL Id : inria-00099686, version 1

Collections

Citation

Laurent Fousse, Paul Zimmermann. Accurate Summation: Towards a Simpler and Formal Proof. 5th Conference on Real Numbers and Computers 2003 - RNC5, 2003, Lyon, France, 11 p. ⟨inria-00099686⟩

Share

Metrics

Record views

262