On the quality of algorithms based on spline interpolation

DOI10.1007/BF02207693MaRDI QIDQ676927zbMATH OpenFDO

Authors Helmut Brass

Publication date 19 October 1997

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02207693

zbMATH Keywords

continuous linear functionalinformation based complexityoptimal algorithmperiodic spline interpolation

Mathematics Subject Classification ID

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

Review text

Let \(C^*\) denote the space of real valued \(n\)-periodic continuous functions endowed with the sup-norm, and let \(I\) be a continuous linear functional on \(C^*\). The paper is devoted to the approximate computation of \(I[f]\) using as input only the function values \(f(j)\), \(j=1, \dots,n\), and the supplementary information \(|f^{(r)}|\leq 1\), where \(r\) is fixed. The quality \(q\) of a numerical algorithm for the computation of \(I[f]\) is defined as the ratio of its error to the smallest possible error of an algorithm based on the same information. It is shown that \(q\) is rather small if the algorithm is based on periodic spline interpolation.

Recommendations

• scientific article; zbMATH DE number 1372029
• On the convergence of periodic splines of arbitrary degree
• The Smolyak algorithm based on cardinal spline interpolation
• scientific article; zbMATH DE number 177347

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)

• Comparison of spline and Lagrangian interpolation
• Parametric adjustment of some spline interpolation algorithms to multiprocessor computer architecture
• scientific article; zbMATH DE number 1372029 (Why is no real title available?)

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)