Jump to content

Kahan summation algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Didickman (talk | contribs) at 11:37, 20 November 2003 (initial definition). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Also called compensated summation. An algorithm attributed to William Kahan which minimizes the error when adding a sequence of finite precision floating point numbers on a computer.