Effect of sampling rates on computational complexity of spline interpolation

DOI10.1080/00207728608926817zbMath0606.65005OpenAlexW2135960733MaRDI QIDQ3745153

Ryoichi Mori, Kazuo Toraichi

Publication date: 1986

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728608926817

zbMATH Keywords

computational complexityspline interpolationB-splinesampling ratesnumber of computations

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Analysis of algorithms and problem complexity (68Q25) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Spline approximation (41A15)

Cites Work

• Unnamed Item
• On Polya frequency functions. IV: The fundamental spline functions and their limits
• On calculating with B-splines
• Chebyshev approximation algorithm for linear inequalities and its applications to pattern classification
• A sequential method for spline approximation with variable knots†
• Computation of optimal controls for non-linear distributed-parameter systems using multivariate spline functions†
• The Numerical Evaluation of B-Splines

This page was built for publication: Effect of sampling rates on computational complexity of spline interpolation