Papers › Fast Cubic Spline Interpolation
Fast Cubic Spline Interpolation
Haysn Hornbeck
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Numerical Recipes series of books are a useful resource, but all the algorithms they contain cannot be used within open-source projects. In this paper we develop drop-in alternatives to the two algorithms they present for cubic spline interpolation, showing as much of our work as possible to allow for replication or criticsm. The output of the new algorithms is compared to the old, and found to be no different within the limits imposed by floating-point precision. Benchmarks of all these algorithms, plus variations which may run faster in certain instances, are performed. In general, all these algorithms have approximately the same execution time when interpolating curves with few control points on feature-rich Intel processors; as the number of control points increases or processor features are removed, the new algorithms become consistently faster than the old. Exceptions to that generalization are explored to create implementation guidelines, such as when to expect division to be faster than multiplication.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections