We consider the computation of the Euclidean (a.k.a. L2) norm of an ndimensional vector in floating-point arithmetic. We review the classical solutions used to avoid spurious overflow or underflow and/or to obtain very accurate results. We modify a recently published algorithm to allow for a very accurate solution, free of spurious overflows and underflows. The returned result will be within very slightly more than 0.5 ulp from the exact result, which means that we will almost always provide correct rounding
International audienceWe analyze several classical basic building blocks of double-word arithmetic (...
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
We propose a set of new Fortran reference implementations, based on an algorithm proposed by Kahan, ...
International audienceWe consider the computation of the Euclidean (or L2) norm of an n-dimensional ...
The need for real-time computation of the Euclidean norm of a vector arises frequently in many signa...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
International audienceSome modern processors include decimal floating-point units, with a conforming...
Abstract. In this Part II of this paper we first refine the analysis of error-free vector transforma...
International audienceDefine an "augmented precision" algorithm as an algorithm that returns, in pre...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
International audienceAssume we use a binary floating-point arithmetic and that RN is the round-to-n...
International audienceWhen a floating-point computation is done, it is most of the time incorrect. T...
International audienceWe analyze several classical basic building blocks of double-word arithmetic (...
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
We propose a set of new Fortran reference implementations, based on an algorithm proposed by Kahan, ...
International audienceWe consider the computation of the Euclidean (or L2) norm of an n-dimensional ...
The need for real-time computation of the Euclidean norm of a vector arises frequently in many signa...
International audienceThe most well-known feature of floating-point arithmetic is the limited precis...
International audienceSome modern processors include decimal floating-point units, with a conforming...
Abstract. In this Part II of this paper we first refine the analysis of error-free vector transforma...
International audienceDefine an "augmented precision" algorithm as an algorithm that returns, in pre...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
International audienceAssume we use a binary floating-point arithmetic and that RN is the round-to-n...
International audienceWhen a floating-point computation is done, it is most of the time incorrect. T...
International audienceWe analyze several classical basic building blocks of double-word arithmetic (...
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
We propose a set of new Fortran reference implementations, based on an algorithm proposed by Kahan, ...