Jump to content

Binary splitting

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fredrik (talk | contribs) at 20:26, 11 August 2006 (fast multiplication does not move the bulk of the computation into the domain of multiplication; the binary splitting algorithm does, fast multiplication ensures that this is an advantage). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, binary splitting is a technique for speeding up numerical evaluation of series with rational terms.

The advantage of binary splitting comes from moving the bulk of the computation into the domain of multiplication and using fast algorithms like Schönhage-Strassen. If a slower multiplication algorithm is used, binary splitting does not provide the same benefit.

Binary splitting is used by the fastest existing software for computing constants such as π and e to high accuracy.

References

Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Binary_splitting&oldid=69082806"