On the quality of algorithms based on spline interpolation
From MaRDI portal
Recommendations
Cites work
- An elementary algebraic representation of polynomial spline interpolants for equidistant lattices and its condition
- Eulerian Numbers and Polynomials
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3459301 (Why is no real title available?)
- scientific article; zbMATH DE number 3618422 (Why is no real title available?)
- scientific article; zbMATH DE number 3416378 (Why is no real title available?)
- On the zeros of Lerch's transcendental function with real parameters
- Optimal Estimation Rules for Functions of High Smoothness
- Practical Fourier Analysis — Error Bounds and Complexity
- The main roots of the Euler-Frobenius polynomials
- Über die Bernoullischen Zahlen und die Eulerschen Polynome
- Über die Norm des Operators der kardinalen Spline-Interpolation
Cited in
(3)
This page was built for publication: On the quality of algorithms based on spline interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676927)