TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publication References
  4. Accurate floating-point summation part II: Sign. Κ-Fold faithful and rounding to nearest
 
Options

Accurate floating-point summation part II: Sign. Κ-Fold faithful and rounding to nearest

Publikationstyp
Journal Article
Date Issued
2008-12-31
Sprache
English
Author(s)
Rump, Siegfried M.  orcid-logo
Ogita, Takeshi  
Oishi, Shin’ichi  
Institut
Zuverlässiges Rechnen E-19  
TORE-URI
http://hdl.handle.net/11420/8606
Journal
SIAM journal on scientific computing  
Volume
31
Issue
2
Start Page
1269
End Page
1302
Citation
SIAM Journal on Scientific Computing 2 (31): 1269-1302 (2008)
Publisher DOI
10.1137/07068816X
Scopus ID
2-s2.0-67649610606
Publisher
SIAM
In Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm fo r calculating the rounded-to-nearest result of s := σPi for a given vector of floating-point numbers pi. as well as algorithms for directed rounding. A special algorithm for computing the sign of s is given, also working for huge dimensions. Assume a floating-point working precision with relative round ing error unit eps. We define and investigate a Κ-fold faithful rounding of a real number r. Basically the result is stored in a vector Resv of Κ nonoverlapping floating-point numbers such that σ Resv approximates r with relative accuracy epsΚ, and replacing Resκ by its floating-point neighbors in Y. Resv forms a lower and upper bound for r. For a given vector of floating-point numbers with exact sums, we present an algorithm for calculating a Κ-fold faithful rounding of s using solely the working precision. Furthermore, an algorithm for calculating a faithfully rounded result of the sum of a vector of huge dimension is presented. Our algorithms are fast in terms of measured computing time because they allow good instruction-level parallelism, they neither require special operations such as access to mantissa or exponent. they contain no branch in the inner loop. nor do they require some extra precision. The only operations used are standard floating-point addition, subtraction, and multiplication in one working precision, for example, double precision. Certain c onstants used in the algorithms are proved to be optimal. © 2008 Society for Industrial and Applied Mathematics.
Subjects
Κ-fold accuracy
Directed rounding
Distillation
Error analysis
Error-free transformations
Faithful rounding
High accuracy
Maximally accurate summation
Rounding to nearest
Sign
XBLAS
DDC Class
004: Informatik
510: Mathematik
TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback