Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on Dekker's FastTwoSum algorithm

From MaRDI portal
Publication:777498
Jump to:navigation, search

DOI10.1007/s00211-020-01114-2zbMath1453.65006OpenAlexW3019955577MaRDI QIDQ777498

Marko Lange, Shin'ichi Oishi

Publication date: 7 July 2020

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11420/6403



Mathematics Subject Classification ID

Roundoff error (65G50) Numerical summation of series (65B10) Numerical algorithms for computer arithmetic, etc. (65Y04)


Related Items (2)

Floating-point arithmetic ⋮ Fast and accurate computation of the Euclidean norm of a vector


Uses Software

  • QD
  • Algorithm 908
  • doubledouble


Cites Work

  • Unnamed Item
  • Adaptive precision floating-point arithmetic and fast robust geometric predicates
  • Fast and accurate floating point summation with application to computational geometry
  • A floating-point technique for extending the available precision
  • Algorithm 908
  • Ultimately Fast Accurate Summation
  • Accurate Floating-Point Summation Part I: Faithful Rounding
  • Pseudo-Convex Functions
  • Accurate Sum and Dot Product
  • Reducing truncation errors by programming


This page was built for publication: A note on Dekker's FastTwoSum algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:777498&oldid=12703028"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki