Skip to content
Tech News
← Back to articles

Why Bessel function recurrence relations become numerically unstable

read original get Accuracy and Stability of Numerical Algorithms by Nicholas Higham → more articles
GoKawiil Brief

A technical blog post explains why three-term recurrence relations used to compute Bessel functions can fail depending on direction and function type. Forward recurrence works for second-kind Bessel functions but not first-kind, while reverse recurrence works for first-kind but not second-kind functions.

Why It Matters

GoKawiil's interpretation of the reporting above, not reported fact.

The explanation traces the instability to how the two independent solutions of the underlying difference equation grow or decay differently as the index n increases, causing rounding errors to amplify the wrong component. This matters for anyone writing numerical software that relies on such recurrences, since naive implementations can silently produce garbage results.

Key Takeaways
Worth a Look

Accuracy and Stability of Numerical Algorithms by Nicholas Higham — If this post's dive into why Bessel recurrences blow up in one direction but not the other hooked you, Higham's classic is the deep-dive companion. It covers rounding error, error propagation, and the stability analysis behind exactly these kinds of numerical algorithms, making it a staple reference for anyone writing serious floating-point code.

See Accuracy and Stability of Numerical Algorithms by Nicholas Higham on Amazon → Affiliate link — we may earn a commission on purchases, at no extra cost to you. Product picked by AI based on this article; it is not a tested recommendation.

Source: johndcook.com, 2026-08-27

Published there as: “Numerical (In)Stability of Recurrence Relations”

Read the original report → The summary and analysis above are GoKawiil's own, written from reporting by the source above. Facts and quotes belong to the original publisher.