More accuracy at fixed precision.
From MaRDI portal
Publication:1421217
DOI10.1016/j.cam.2003.08.017zbMath1037.65046OpenAlexW1994310219MaRDI QIDQ1421217
Publication date: 26 January 2004
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2003.08.017
Related Items (2)
Algorithms for accurate, validated and fast polynomial evaluation ⋮ On the ill-conditioned nature of \(C^\infty\) RBF strong collocation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error linearization as an effective tool for experimental analysis of the numerical stability of algorithms
- Additive symmetries: The non-negative case.
- Convergence of the Newton process to multiple solutions
- A floating-point technique for extending the available precision
- Correction d'une somme en arithmétique à virgule flottante
- The Accuracy of Floating Point Summation
- Best “ordering” for floating-point addition
- Floating-Point Computation of Functions with Maximum Accuracy
- Réduction et majoration de l'erreur d'arrondi en arithmétique à virgule flottante
- When automatic linear correction of rounding errors is exact
- Accurate and Efficient Floating Point Summation
- An updated set of basic linear algebra subprograms (BLAS)
- Design, implementation and testing of extended and mixed precision BLAS
- Automatic linear correction of rounding errors
This page was built for publication: More accuracy at fixed precision.