• Corpus ID: 119320049

Floating point numbers are real numbers

  title={Floating point numbers are real numbers},
  author={Walter F. Mascarenhas},
  journal={arXiv: Numerical Analysis},
  • W. Mascarenhas
  • Published 30 May 2016
  • Mathematics
  • arXiv: Numerical Analysis
Floating point arithmetic allows us to use a finite machine, the digital computer, to reach conclusions about models based on continuous mathematics. In this article we work in the other direction, that is, we present examples in which continuous mathematics leads to sharp, simple and new results about the evaluation of sums, square roots and dot products in floating point arithmetic. 
Error Bounds for Computer Arithmetics
  • S. Rump
  • Mathematics, Computer Science
    2019 IEEE 26th Symposium on Computer Arithmetic (ARITH)
  • 2019
This note summarizes recent progress in error bounds for compound operations performed in some computer arithmetic by identifying three types A, B, and C of weak sufficient assumptions implying new results and sharper error estimates.
Sharp estimates for perturbation errors in summations
The main result is sharp for actual realizations of grids floating-point arithmetics are based on, for any feasible problem size, for IEEE 754 binary32 as well as binary64 format, there are examples satisfying the given bound with equality.
Fast and accurate normalization of vectors and quaternions
Fast and accurate ways to normalize two and three-dimensional vectors and quaternions and compute their length are presented.
The relative accuracy of (x+y)*(x-y)
  • C. Jeannerod
  • Computer Science, Mathematics
    J. Comput. Appl. Math.
  • 2020
It is shown that if the tie-breaking rule is "to away" then the bound $3u$ is asymptotically optimal, and that asymptic optimal bounds are now $2.25u $ for base two and $2u$ for larger bases (such as base ten).
Preconditioning techniques for singularly perturbed differential equations
  • T. Nhan
  • Mathematics
    Irish Mathematical Society Bulletin
  • 2015
This is an abstract of the PhD thesis Preconditioning techniques for singularly perturbed differential equations written by Thái Anh Nhan, under the supervision of Dr Niall Madden, at the School of
Evaluation of spectrally efficient indoor optical wireless transmission techniques
This thesis has analysed the potential of spectrally efficient optic al w reless transmission techniques and shown that OWC systems can greatly benefit from the application of MIMO schemes due to little differences between the multiple links.
Computing the exact sign of sums of products with floating point arithmetic
The algorithm is efficient and uses only of floating point arithmetic, which is much faster than exact arithmetic, and it is proved that the algorithm is correct and the efficient and tested C++ code for it is correct.


The Accuracy of Floating Point Summation
  • N. Higham
  • Mathematics, Computer Science
    SIAM J. Sci. Comput.
  • 1993
Five summation methods and their variations are analyzed here and no one method is uniformly more accurate than the others, but some guidelines are given on the choice of method in particular cases.
MPFR: A multiple-precision binary floating-point library with correct rounding
This article presents a multiple-precision binary floating-point library, written in the ISO C language, and based on the GNU MP library. Its particularity is to extend to arbitrary-precision, ideas
Stupid is as Stupid Does: Taking the Square Root of the Square of a Floating-Point Number
  • S. Boldo
  • Mathematics, Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2015
Using radix 2 and an unbounded exponent range, the computation of the square root of thesquare of a floating-point number a is exactly |a|, which removes the need for a test when calling an arccos or an arcsin on this value.
Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq
This paper presents design decisions and examples of theorems from the Flocq system: a library easy to use, suitable for automation yet high-level and generic, and a system meant to encompass the other ones in a unified framework.
Accuracy and stability of numerical algorithms
This book gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic by combining algorithmic derivations, perturbation theory, and rounding error analysis.
Computer Arithmetic and Validity - Theory, Implementation, and Applications
  • U. Kulisch
  • Computer Science
    de Gruyter studies in mathematics
  • 2008
The series is devoted to the publication of monographs and high-level textbooks in mathematics, mathematical methods and their applications, written by scholars with an international reputation presenting current fields of research in pure and applied mathematics.
The effects of rounding errors in the nodes on barycentric interpolation
These errors are particularly relevant for the first barycentric formula with the Chebyshev points of the second kind and a method for reducing them is proposed.
Inner product rounding error analysis in the presence of underflow
Wilkinson's classical error analysis for sums and inner products is extended to the case where underflow may occur. This is relevant for the construction of rigorous error bounds for an inner product
The stability of barycentric interpolation at the Chebyshev points of the second kind
The theory shows that the second formula is more stable than previously thought and experiments confirm its stability in practice, and current understanding regarding the accuracy problems of the first barycentric formula is extended.
The Art of Computer Programming
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.