On the quality of algorithms based on spline interpolation

DOI10.1007/BF02207693zbMath0872.65006MaRDI QIDQ676927

Helmut Brass

Publication date: 19 October 1997

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

optimal algorithmcontinuous linear functionalinformation based complexityperiodic spline interpolation

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Algorithms for approximation of functions (65D15) Numerical quadrature and cubature formulas (65D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the zeros of Lerch's transcendental function with real parameters
• The main roots of the Euler-Frobenius polynomials
• An elementary algebraic representation of polynomial spline interpolants for equidistant lattices and its condition
• Über die Norm des Operators der kardinalen Spline-Interpolation
• Optimal Estimation Rules for Functions of High Smoothness
• Eulerian Numbers and Polynomials
• Practical Fourier Analysis — Error Bounds and Complexity

This page was built for publication: On the quality of algorithms based on spline interpolation