Fast and accurate computation of the Euclidean norm of a vector
From MaRDI portal
Publication:6072363
Recommendations
Cites work
- A floating-point technique for extending the available precision
- A New Approach to Probabilistic Rounding Error Analysis
- A note on Dekker's FastTwoSum algorithm
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate floating-point summation. II: Sign, K-fold faithful and rounding to nearest
- Accurate Sum and Dot Product
- Algorithm 978: Safe scaling in the level 1 BLAS
- Best “ordering” for floating-point addition
- Computing predecessor and successor in rounding to nearest
- Efficient calculations of faithfully rounded l₂-norms of n-vectors
- Error estimates for the summation of real numbers with application to floating-point summation
- Faithfully rounded floating-point computations
- Handbook of floating-point arithmetic
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- scientific article; zbMATH DE number 5056125 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Modern computer arithmetic
- On relative errors of floating-point operations: optimal bounds and applications
- Quasi double-precision in floating point addition
- Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen
- Sharp estimates for perturbation errors in summations
- Sharper probabilistic backward error analysis for basic linear algebra kernels with random data
Cited in
(3)
This page was built for publication: Fast and accurate computation of the Euclidean norm of a vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072363)