INTERPOLATION AND SMOOTHING L-SPLINES, FAST ALGORITHMS

We study fast algorithms for interpolation and smoothing by means of the one-dimensional L-splines, to which the computation of the polysplines is reduced. For these L-splines, we provide a generalization of the fast Reinsch algorithm which is famous from the computation of smoothing cubic splines,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Comptes rendus de l'Academie bulgare des Sciences Ročník 70; číslo 10; s. 1347
Hlavní autoři: Kounchev, Ognyan, Tsachev, Tsvetomir
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bulgarian Academy of Sciences 01.01.2017
Témata:
Algorithms
Interpolation
Mathematical research
Spline theory
ISSN:1310-1331
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study fast algorithms for interpolation and smoothing by means of the one-dimensional L-splines, to which the computation of the polysplines is reduced. For these L-splines, we provide a generalization of the fast Reinsch algorithm which is famous from the computation of smoothing cubic splines, cf. [2,12]. We emphasize on the explicit expressions for all entries involved which permits a direct numerical implementation.Key words: interpolation, nonparametric regression, splines, L-splines 2010 Mathematics Subject Classification: 65D07, 65D10, 45L05
ISSN:1310-1331