Computational complexity of spline interpolation
From MaRDI portal
Publication:3795135
DOI10.1080/00207728708964021zbMath0649.65011OpenAlexW2074474529MaRDI QIDQ3795135
Kazuki Katagishi, Ryoichi Mori, Kazuo Toraichi, Iwao Sekita
Publication date: 1987
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207728708964021
Numerical computation using splines (65D07) Analysis of algorithms and problem complexity (68Q25) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Spline approximation (41A15)
Related Items (3)
Numerical methods for the hyperbolic Monge-Ampère equation based on the method of characteristics ⋮ A series of discrete-time models of a continuous-time system based on fluency signal approximation ⋮ Flexible specification testing in quantile regression models
Cites Work
This page was built for publication: Computational complexity of spline interpolation