A-posteriori forward rounding error analyses tend to give sharper error estimates than a-priori ones, as they use actual data quantities. One of such a-posteriori analysis – running error analysis – uses expressions consisting of two parts; one generates the error and the other propagates input errors to the output. This paper suggests replacing the error generating term with an FPU-extracted rounding error estimate, which produces a sharper error bound
We prove sharp, computable error estimates for the propagation of errors in the numerical solution o...
The floating-point numbers used in computer programs are a finite approximation of real numbers. In ...
We present a new tool that generates bounds on the values and the round-off errors of programs using...
A-posteriori forward rounding error analyses tend to give sharper error estimates than a-priori ones...
In this paper we present the theoretical foundation of forward error analysis of numerical algorithm...
An emerging area of research is to automatically compute reasonably accurate upper bounds on numeric...
We present a detailed study of roundoff errors in probabilistic floating-point computations. We deri...
International audienceTraditional rounding error analysis in numerical linear algebra leads to backw...
In this article, we introduce a new static analysis for numerical accuracy. Weaddress the problem of...
Classical residual type error estimators approximate the error flux around the elements and yield up...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
International audienceRounding error analyses of numerical algorithms are most often carried out via...
International audienceWhen a floating-point computation is done, it is most of the time incorrect. T...
International audienceFloating-point arithmetic is a very efficient solution to perform computa-tion...
Les nombres à virgule flottante sont utilisés dans de nombreuses applications pour effectuer des cal...
We prove sharp, computable error estimates for the propagation of errors in the numerical solution o...
The floating-point numbers used in computer programs are a finite approximation of real numbers. In ...
We present a new tool that generates bounds on the values and the round-off errors of programs using...
A-posteriori forward rounding error analyses tend to give sharper error estimates than a-priori ones...
In this paper we present the theoretical foundation of forward error analysis of numerical algorithm...
An emerging area of research is to automatically compute reasonably accurate upper bounds on numeric...
We present a detailed study of roundoff errors in probabilistic floating-point computations. We deri...
International audienceTraditional rounding error analysis in numerical linear algebra leads to backw...
In this article, we introduce a new static analysis for numerical accuracy. Weaddress the problem of...
Classical residual type error estimators approximate the error flux around the elements and yield up...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
International audienceRounding error analyses of numerical algorithms are most often carried out via...
International audienceWhen a floating-point computation is done, it is most of the time incorrect. T...
International audienceFloating-point arithmetic is a very efficient solution to perform computa-tion...
Les nombres à virgule flottante sont utilisés dans de nombreuses applications pour effectuer des cal...
We prove sharp, computable error estimates for the propagation of errors in the numerical solution o...
The floating-point numbers used in computer programs are a finite approximation of real numbers. In ...
We present a new tool that generates bounds on the values and the round-off errors of programs using...