Bessel's labyrinth -- rounding errors are not necessarily small

MaRDI QIDQ998616zbMATH OpenFDO

Authors Peter Deuflhard, B. Lutz-Westphal, Ulrich Nowak

Publication date 9 February 2009

Published in Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

zbMATH Keywords

Bessel functionsrounding errors

Mathematics Subject Classification ID

Methodology of mathematics (00A35) Computation of special functions and constants, construction of tables (65D20) Roundoff error (65G50)

Review text

In this paper and school-project, it is demonstrated that rounding errors can accumulate quickly so as to lead to meaningless results in an apparently harmless case. The chosen case for this example is the recursion which computes Bessel functions of the first kind. An algorithm is demonstrated which enables the stable computation of the values of the Bessel function in spite of the problem of the original recursion.

Recommendations

• scientific article; zbMATH DE number 3894363
• scientific article; zbMATH DE number 3972057
• scientific article; zbMATH DE number 4045022
• Rounding error analysis of linear recurrences using generating series
• scientific article; zbMATH DE number 4013850

This page was built for publication: Bessel's labyrinth -- rounding errors are not necessarily small

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998616)