Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computational complexity of spline interpolation

From MaRDI portal
Publication:3795135
Jump to:navigation, search

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


zbMATH Keywords

computational complexityspline interpolationB-splinespline function


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)


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

  • On Polya frequency functions. IV: The fundamental spline functions and their limits
  • On calculating with B-splines
  • The Numerical Evaluation of B-Splines


This page was built for publication: Computational complexity of spline interpolation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3795135&oldid=17353718"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 13:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki