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,...

Full description

Saved in:
Bibliographic Details
Published in:Comptes rendus de l'Academie bulgare des Sciences Vol. 70; no. 10; p. 1347
Main Authors: Kounchev, Ognyan, Tsachev, Tsvetomir
Format: Journal Article
Language:English
Published: Bulgarian Academy of Sciences 01.01.2017
Subjects:
Algorithms
Interpolation
Mathematical research
Spline theory
ISSN:1310-1331
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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