Revision as of 20:33, 6 June 2016 editMatthiaspaul (talk | contribs)Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors137,492 edits →References: Added two presentations← Previous edit | Revision as of 21:20, 6 June 2016 edit undoVincent Lefèvre (talk | contribs)Extended confirmed users4,854 editsm minus signNext edit → | ||
Line 5: | Line 5: | ||
The two defining features of the unum format are: | The two defining features of the unum format are: | ||
* a ] storage format for both the ] and ], and | * a ] storage format for both the ] and ], and | ||
* an ''u-bit'', which determines whether the unum corresponds to an exact number (u=0), or an ] between consecutive exact unums (u=1). In this way, the unums cover the entire extended real number line . | * an ''u-bit'', which determines whether the unum corresponds to an exact number (u=0), or an ] 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 ] with a pair of unums, what he calls an ''ubound'', providing the guarantee that the resulting interval contains the exact solution. | For performing computation with the format, Gustafson proposes using ] with a pair of unums, what he calls an ''ubound'', providing the guarantee that the resulting interval contains the exact solution. |
Revision as of 21:20, 6 June 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 as an alternative to the now ubiquitous IEEE 754 format. 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.
See also
References
- Gustafson, John L. (2015). The End of Error: Unum Computing. CRC Press. ISBN 978-1-4822-3986-7. Retrieved 2016-05-30.
- Byrne, Simon (2016-03-29). "Implementing Unums in Julia". Retrieved 2016-05-30.
- "Unum arithmetic in Julia: Unums.jl". Retrieved 2016-05-30.
- "Julia Implementation of Unums: README". Retrieved 2016-05-30.
- "Unum (Universal Number) types and operations: Unums". Retrieved 2016-05-30.
- "Program: Special Session: The Great Debate: John Gustafson and William Kahan". Arith23: 23rd IEEE Symposium on Computer Arithmetic. Silicon Valley, USA. 2016-07-12. Archived from the original on 2016-05-30. Retrieved 2016-05-30.
{{cite web}}
: Unknown parameter|dead-url=
ignored (|url-status=
suggested) (help)
Further readings
- Gustafson, John L. (March 2013). "Right-Sizing Precision: Unleashed Computing: The need to right-size precision to save energy, bandwidth, storage, and electrical power" (PDF). Archived from the original (PDF) on 2016-06-06. Retrieved 2016-06-06.
{{cite web}}
: Unknown parameter|dead-url=
ignored (|url-status=
suggested) (help)
- Gustafson, John L. (2015). "The end of numerical error" (PDF). Archived from the original (PDF) on 2016-06-06. Retrieved 2016-06-06.
{{cite web}}
: Unknown parameter|dead-url=
ignored (|url-status=
suggested) (help)