AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of finite series of orthogonal polynomials are presented. The forward error is studied by means of a direct approach that permits to obtain sharp bounds. The bounds are illustrated with several numerical tests
AbstractWe investigate the behaviour of the maximum error in applying Gaussian quadrature to the Che...
International audienceTraditional rounding error analysis in numerical linear algebra leads to backw...
In this paper we present the theoretical foundation of forward error analysis of numerical algorithm...
AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of...
AbstractIn this paper, we present rounding error bounds of recent parallel versions of Forsythe's an...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
This paper presents a generic condition number for polynomials that is useful for polynomial evaluat...
AbstractBy analysing the effects of rounding errors from all sources, it is shown that the coefficie...
This paper presents some numerical simulations of rounding errors produced during evaluation of Cheb...
International audienceLet $u$ denote the relative rounding error of some floating-point format. Rece...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
14 pages, 2 figures, 2 tables. Extension of the work in arXiv:1610.07038International audienceFloati...
International audiencePolynomials are used in many applications and hidden in libraries such as libm...
Some remarks on the numerical evaluation of recurrence relations are presented. Results concerning t...
International audienceIn approximation theory, it is standard to approximate functions by polynomial...
AbstractWe investigate the behaviour of the maximum error in applying Gaussian quadrature to the Che...
International audienceTraditional rounding error analysis in numerical linear algebra leads to backw...
In this paper we present the theoretical foundation of forward error analysis of numerical algorithm...
AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of...
AbstractIn this paper, we present rounding error bounds of recent parallel versions of Forsythe's an...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
This paper presents a generic condition number for polynomials that is useful for polynomial evaluat...
AbstractBy analysing the effects of rounding errors from all sources, it is shown that the coefficie...
This paper presents some numerical simulations of rounding errors produced during evaluation of Cheb...
International audienceLet $u$ denote the relative rounding error of some floating-point format. Rece...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
14 pages, 2 figures, 2 tables. Extension of the work in arXiv:1610.07038International audienceFloati...
International audiencePolynomials are used in many applications and hidden in libraries such as libm...
Some remarks on the numerical evaluation of recurrence relations are presented. Results concerning t...
International audienceIn approximation theory, it is standard to approximate functions by polynomial...
AbstractWe investigate the behaviour of the maximum error in applying Gaussian quadrature to the Che...
International audienceTraditional rounding error analysis in numerical linear algebra leads to backw...
In this paper we present the theoretical foundation of forward error analysis of numerical algorithm...