An Overflow/Underflow-Free Floating-Point Representation of Numbers

スポンサーリンク

概要

• 論文の詳細を見る

• A new floating-point representation of numbers is proposed to cope systematically with the troubles in numerical computation due to exponent overflow/underflow in conventional floating-point representations. The proposed representation resolves the phenomena of overflow and underflow and, at the same time, attains higher precision for numbers which are neither too large nor too small, by making mobile the boundary between the field for exponent and that for mantissa in a word. A number system including "non-numbers" is also proposed which is closed with respect to the four arithmetic operations. The effectiveness of the proposed system is shown by numerical examples.

• 一般社団法人情報処理学会の論文
• 1981-11-05

著者

• Iri Masao

  Department Of Mathematical Engineering And Information Physics Faculty Of Engineering University Of

• Iri Masao

  Department Of Mathematical Engineering And Instrumentation Physics Faculty Of Engineering University

• MATSUI SHOUICHI

  Information System Department, Economic Research Center, Central Research Institute of Electric Powe

• Matsui Shouichi

  Information System Department Economic Research Center Central Research Institute Of Electric Power

関連論文

• A Solid Modelling System Free from Topological Inconsistency
• Matroidal Approach to the Structural Solvability of a System of Equations
• On the Decomposition of a Directed Graph with Respect to Arborescences and Related Problems (Graphs and Combinatorics III)
• Parameter Tuning and Repeated Application of the IMT-Type Transformation in Numerical Quadrature (Numerical Integration and Related Topics)
• Estimates of Rounding Errors with Fast Automatic Differentiation and Interval Analysis
• An Overflow/Underflow-Free Floating-Point Representation of Numbers
• Fast Automatic Differentiation and Interval Estimates of rounding errors
• Theory and Applications of Principal Partitions of Matroids (Graphs and Combinatorics III)
• An Optimal Algorithm for Approximating a Piecewise Linear Function
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"

スポンサーリンク