Unum (number format)
 | This article needs additional citations for verification. (May 2016) |
The unum (universal number) format 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 book The End of Error.[1]
The two defining features of the unum format (while unum 2.0 is different) 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.[2][3][4][5] including unum 2.0 (or at least a modified version of his new proposal).[6] Recently, unum has been explored in MATLAB.[7][8]
William Kahan and John Gustafson discussed unums at the Arith23 conference[9][10][11][12] on 12 July 2016.
Critique
 | This section possibly contains unsourced predictions, speculative material, or accounts of events that might not occur. Information must be verifiable and based on reliable published sources. |
William Kahan cites the following issues with unums:[11][13]
- Unum computing will not end computational errors.
- Unum computation does not always deliver correct results.
- The description of unums sidesteps using unum for solving calculus problems.
- Unums are expensive in terms of time and power consumption.
Each computation in unum space is likely to produce a new data type. Even when the storage space is the same, the structure of the data value may differ.[1] This requires data allocation, deallocation, and garbage collection during unum operations. The unum data structure does not explicitly indicate the type of data within that structure requiring pointers with associated type parameters to access.
- Unums do not provide exception information (x/0, sqrt(-1), etc.)
- Unum computation may deliver incorrect results from the selection of an algebraically correct but numerically unstable algorithm.
- The costs and benefits of unum over short precision floating point for problems requiring low precision are not obvious.
- Solving differential equations and evaluating integrals with unums are not economical for useful accuracy.
See also
References
- ^ a b Gustafson, John L. (2016-02-04) [2015-02-05]. The End of Error: Unum Computing. Chapman & Hall / CRC Computational Science. Vol. 24 (2nd corrected printing, 1st ed.). CRC Press. ISBN 978-1-4822-3986-7. Retrieved 2016-05-30. [1] [2]
- ^ 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.
- ^ https://github.com/jwmerrill/Pnums.jl
- ^ Ingole, Deepak; Kvasnica, Michal; De Silva, Himeshi; Gustafson, John L. "Reducing Memory Footprints in Explicit Model Predictive Control using Universal Numbers. Submitted to the IFAC World Congress 2017". Retrieved 2016-11-15.
- ^ Ingole, Deepak; Kvasnica, Michal; De Silva, Himeshi; Gustafson, John L. "MATLAB Prototype of unum (munum)". Retrieved 2016-11-15.
- ^ "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) - ^ Gustafson, John L.; Kahan, William M. (2016-07-12). The Great Debate @ARITH23: John Gustafson and William Kahan (1:34:41) (video). Retrieved 2016-07-20.
- ^ a b Kahan, William M. (2016-07-16) [2016-07-12]. "A Critique of John L. Gustafson's THE END of ERROR — Unum Computation and his A Radical Approach to Computation with Real Numbers" (PDF). Santa Clara, CA, USA: IEEE Symposium on Computer Arithmetic, ARITH 23. Archived from the original (PDF) on 2016-07-25. Retrieved 2016-07-25.
{{cite web}}: Unknown parameter|dead-url=ignored (|url-status=suggested) (help) [3] - ^ Gustafson, John L. (2016-07-12). ""The Great Debate": Unum arithmetic position paper" (PDF). Santa Clara, CA, USA: IEEE Symposium on Computer Arithmetic, ARITH 23. Retrieved 2016-07-20. [4]
- ^ Kahan, William M. (2016-07-15). "Prof. W. Kahan's Commentary on "THE END of ERROR — Unum Computing" by John L. Gustafson, (2015) CRC Press" (PDF). Archived from the original (PDF) on 2016-08-01. Retrieved 2016-08-01.
{{cite web}}: Unknown parameter|dead-url=ignored (|url-status=suggested) (help)
Further reading
- 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) - Brueckner, Rich (2015-03-02). "Slidecast: John Gustafson Explains Energy Efficient Unum Computing". The Rich Report. Inside HPC. Archived from the original on 2016-07-10. Retrieved 2016-06-10.
{{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) - Tichy, Walter F. (April 2016). "The End of (Numeric) Error: An interview with John L. Gustafson". Ubiquity - Information everywhere. 2016 (April). Association for Computing Machinery (ACM): 1–14. doi:10.1145/2913029. Archived from the original on 2016-07-10. Retrieved 2016-07-10.
{{cite journal}}: Unknown parameter|dead-url=ignored (|url-status=suggested) (help) - Gustafson, John L. (2016-06-03) [2016-02-22]. "A Radical Approach to Computation with Real Numbers - Unums version 2.0" (PPT). Archived from the original on 2016-07-10. Retrieved 2016-07-10.
{{cite web}}: Unknown parameter|dead-url=ignored (|url-status=suggested) (help) (NB. PDFs come without notes: [5] [6]) - Gustafson, John L. (2016-06-06). "An Energy-Efficient and massively parallel approach to valid numerics" (PPT). OCRAR Seminar. Archived from the original on 2016-07-10. Retrieved 2016-07-10.
{{cite web}}: Unknown parameter|dead-url=ignored (|url-status=suggested) (help) [7] [8] - Gustafson, John L. (2016). "A Radical Approach to Computation with Real Numbers" (PDF). SuperFri.org. Archived from the original (PDF) on 2016-07-10. Retrieved 2016-07-10.
{{cite web}}: Unknown parameter|dead-url=ignored (|url-status=suggested) (help) - Kulisch, Ulrich W. [in German] (2015). "Up-to-date Interval Arithmetic from closed intervals to connected sets of real numbers" (PDF) (preprint). Institut für Angewandte und Numerische Mathematik - Karlsruhe Institute of Technology (KIT), Germany. ID 15/02. Archived from the original (PDF) on 2016-07-12. Retrieved 2016-07-12.
{{cite journal}}: Cite journal requires|journal=(help); Unknown parameter|dead-url=ignored (|url-status=suggested) (help) - Risse, Thomas (2016-03-10). "Unum – an expedient extension of IEEE 754" (PDF) (presentation). London South Bank University (LSBU), UK: Institute of Informatics & Automation (IIA), Faculty EEE & CS, Bremen University of Applied Sciences, Germany. Archived from the original (PDF) on 2016-07-12. Retrieved 2016-07-12.
{{cite journal}}: Cite journal requires|journal=(help); Unknown parameter|dead-url=ignored (|url-status=suggested) (help) - Kahan, William M. (2016-07-15). "Prof. W. Kahan's Comments on SORN Arithmetic" (PDF). Archived from the original (PDF) on 2016-08-01. Retrieved 2016-08-01.
{{cite web}}: Unknown parameter|dead-url=ignored (|url-status=suggested) (help) - Sterbenz, Pat H. (1974-05-01). Floating-Point Computation. Prentice-Hall Series in Automatic Computation (1st ed.). Englewood Cliffs, New Jersey, USA: Prentice Hall. ISBN 0-13-322495-3.