Effect of sampling rates on computational complexity of spline interpolation

DOI10.1080/00207728608926817MaRDI QIDQ3745153zbMATH OpenOpenAlexFDO

Authors Kazuo Toraichi, Ryoichi Mori

Publication date 1986

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

B-splinecomputational complexitynumber of computationssampling ratesspline interpolation

Mathematics Subject Classification ID

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

Recommendations

• Computational complexity of spline interpolation
• Interpolation using a fast spline transform (FST)
• scientific article; zbMATH DE number 4074304
• Simple algorithms and architectures for B-spline interpolation
• Natural interpolation by B-splines.

Cites work

• A sequential method for spline approximation with variable knots†
• Chebyshev approximation algorithm for linear inequalities and its applications to pattern classification
• Computation of optimal controls for non-linear distributed-parameter systems using multivariate spline functions†
• scientific article; zbMATH DE number 3254460 (Why is no real title available?)
• On calculating with B-splines
• On Polya frequency functions. IV: The fundamental spline functions and their limits
• The Numerical Evaluation of B-Splines

Cited in

(2)

• On the relationship between spline interpolation, sampling zeros and numerical integration in sampled-data models
• Computational complexity of spline interpolation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745153)