Misplaced Pages

Unum (number format): Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 15:49, 13 May 2016 editLoVVgE (talk | contribs)57 editsNo edit summary← Previous edit Revision as of 19:17, 13 May 2016 edit undoSwisterTwister (talk | contribs)187,094 edits Added tags to the page using Page Curation (refimprove)Next edit →
Line 1: Line 1:
{{refimprove|date=May 2016}}

The unum is a floating point format proposed by ], proposed as an alternative to the now ubiquitous ]. The proposal and justification are explained in his somewhat ambitiously-titled book The end of error. The unum is a floating point format proposed by ], proposed as an alternative to the now ubiquitous ]. The proposal and justification are explained in his somewhat ambitiously-titled book The end of error.



Revision as of 19:17, 13 May 2016

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Unum" number format – news · newspapers · books · scholar · JSTOR (May 2016) (Learn how and when to remove this message)

The unum is a floating point format proposed by John Gustafson, proposed as an alternative to the now ubiquitous IEEE 754 formats. The proposal and justification are explained in his somewhat ambitiously-titled book The end of error.

The two defining features of the unum format are:

  • a variable-width storage format for both the significand and exponent, and
  • an “u-bit”, which determines whether the unum corresponds to an exact number (u=0), or an interval between consecutive exact unums (u=1). In this way, the unums cover the entire extended real number line .

For performing computation with the format, Gustafson proposes using interval arithmetic with a pair of unums, what he calls an ubound, providing the guarantee that the resulting interval contains the exact solution.

Unum implementations have been explored in Julia.

A "Great Debate" between William Kahan and John Gustafson is planned for the Arith23 conference on July 12, 2016.

References

  1. http://juliacomputing.com/blog/2016/03/29/unums.html
  2. https://github.com/JuliaComputing/Unums.jl
  3. https://github.com/REX-Computing/unumjl
  4. https://github.com/tbreloff/Unums.jl
  5. http://arith23.gforge.inria.fr/program.html