A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formulae are linear combinations of basis functions, which can be computed with high relative accuracy. We have taken into account that all steps but the last one can be computed to high relative accuracy. The exactness of the initial data is crucial for obtaining low error bounds. The Lagrange interpolation formula and related formulae are considered and numerical experiments are provided.</p
The goal of this paper is to analyze two polynomial evaluation schemes for mul-tiple precision float...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
A roundoff error analysis of the Lagrange interpolation formula for evaluating polynomials is perfor...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
Floating point error is an inevitable drawback of embedded systems implementation. Computing rigorou...
AbstractThis paper will write equations of the round-off errors for a new direct solver of a system ...
AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of...
A longstanding problem related to floating-point implementation of numerical programs is to provide ...
18 pages, 2 tables, 1 figureInternational audienceA longstanding problem related to floating-point i...
AbstractThis is a sequel to my previous paper concerning the determination of the coefficients in th...
AbstractThree methods of terminating polynomial root-finding iterations are compared, one based on e...
Abstract: We show how to derive error estimates between a function and its inter-polating polynomial...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
The goal of this paper is to analyze two polynomial evaluation schemes for mul-tiple precision float...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
A roundoff error analysis of the Lagrange interpolation formula for evaluating polynomials is perfor...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
Floating point error is an inevitable drawback of embedded systems implementation. Computing rigorou...
AbstractThis paper will write equations of the round-off errors for a new direct solver of a system ...
AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of...
A longstanding problem related to floating-point implementation of numerical programs is to provide ...
18 pages, 2 tables, 1 figureInternational audienceA longstanding problem related to floating-point i...
AbstractThis is a sequel to my previous paper concerning the determination of the coefficients in th...
AbstractThree methods of terminating polynomial root-finding iterations are compared, one based on e...
Abstract: We show how to derive error estimates between a function and its inter-polating polynomial...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
The goal of this paper is to analyze two polynomial evaluation schemes for mul-tiple precision float...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ab...