Fast and accurate computation of the Euclidean norm of a vector
From MaRDI portal
Publication:6072363
DOI10.1007/s13160-023-00593-8OpenAlexW4379514369MaRDI QIDQ6072363
Publication date: 13 October 2023
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-023-00593-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on Dekker's FastTwoSum algorithm
- Computing predecessor and successor in rounding to nearest
- Error estimates for the summation of real numbers with application to floating-point summation
- A floating-point technique for extending the available precision
- Efficient Calculations of Faithfully Rounded l 2 -Norms of n -Vectors
- Modern Computer Arithmetic
- Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
- Best “ordering” for floating-point addition
- Algorithm 978
- On relative errors of floating-point operations: Optimal bounds and applications
- Handbook of Floating-Point Arithmetic
- Sharp estimates for perturbation errors in summations
- Accuracy and Stability of Numerical Algorithms
- Sharper Probabilistic Backward Error Analysis for Basic Linear Algebra Kernels with Random Data
- Faithfully Rounded Floating-point Computations
- Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen
- Accurate Floating-Point Summation Part I: Faithful Rounding
- A New Approach to Probabilistic Rounding Error Analysis
- Quasi double-precision in floating point addition
- Accurate Sum and Dot Product
This page was built for publication: Fast and accurate computation of the Euclidean norm of a vector