Algorithms for computational precision
From MaRDI portal
Publication:4697011
DOI10.1080/0020739920230511zbMATH Open0774.65026OpenAlexW2065291777MaRDI QIDQ4697011FDOQ4697011
Authors: Roger H. Marty, Sherwood D. Silliman, Elyahu Katz
Publication date: 29 June 1993
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020739920230511
Recommendations
productquotientdifferencesumefficient algorithmscomputational precisionreal numberexact calculation of \(n\) digits
Cites Work
Cited In (10)
- Useful computations need useful numbers
- Variable-precision arithmetic considered perilous - a detective story
- Accurate arithmetic results for decimal data on non-decimal computers
- Title not available (Why is that?)
- Ten digit problems
- Towards optimal use of multi-precision arithmetic: a remark
- Extended concept of significant digits and lower precision computations
- A poor person's approximation to \(\pi\)
- Efficient implementation of algorithms for approximate exponentiation
- Title not available (Why is that?)
This page was built for publication: Algorithms for computational precision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697011)