Rump, Siegfried M.Siegfried M.Rump2023-08-012023-08-012023-09Japan Journal of Industrial and Applied Mathematics 40 (3): 1391-1419 (2023-09)https://hdl.handle.net/11420/42370The numerical computation of the Euclidean norm of a vector is perfectly well conditioned with favorite a priori error estimates. Recently there is interest in computing a faithfully rounded approximation which means that there is no other floating-point number between the computed and the true real result. Hence the result is either the rounded to nearest result or its neighbor. Previous publications guarantee a faithfully rounded result for large dimension, but not the rounded to nearest result. In this note we present several new and fast algorithms producing a faithfully rounded result, as well as the first algorithm to compute the rounded to nearest result. Executable MATLAB codes are included. As a by product, a fast loop-free error-free vector transformation is given. That transforms a vector such that the sum remains unchanged but the condition number of the sum multiplies with the rounding error unit.en0916-70052023313911419Springerhttps://creativecommons.org/licenses/by/4.0/Error-free transformationEuclidean normFaithful roundingRounding errorMathematicsJournal Article10.15480/882.802310.1007/s13160-023-00593-810.15480/882.8023Journal Article