Zusammenfassung
Computing numerical solutions of household’s optimization, one often faces the problem of interpolating functions. As linear interpolation is not very good in fitting functions, various alternatives like polynomial interpolation, Chebyshev polynomials or splines were introduced. Cubic splines are much more flexible than polynomials, since the former are only twice continuously differentiable on ...
Zusammenfassung
Computing numerical solutions of household’s optimization, one often faces the problem of interpolating functions. As linear interpolation is not very good in fitting functions, various alternatives like polynomial interpolation, Chebyshev polynomials or splines were introduced. Cubic splines are much more flexible than polynomials, since the former are only twice continuously differentiable on the interpolation interval. In this paper, we present a fast algorithm for cubic spline interpolation, which is based on the precondition of equidistant interpolation nodes. Our approach is faster and easier to implement than the often applied B-Spline approach. Furthermore, we will show how to loosen the precondition of equidistant points with strictly monotone, continuous one-to-one mappings. Finally, we present a straightforward generalization to multidimensional cubic spline interpolation.
Altmetric