Affiliation:
1. CSIRO, Canberra, Australia
Abstract
The procedure CUBGCV is an implementation of a recently developed algorithm for fast
O(n)
calculation of a cubic smoothing spline fitted to
n
noisy data points, with the degree of smoothing chosen to minimize the expected mean square error at the data points when the variance of the error associated with the data is known, or, to minimize the generalized cross validation (GCV) when the variance of the error associated with the data is unknown. The data may be unequally spaced and nonuniformly weighted. The algorithm exploits the banded structure of the matrices associated with the cubic smoothing spline problem. Bayesian point error estimates are also calculated in
O(n)
operations.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference9 articles.
1. Smoothing noisy data with spline functions;CRAVEN;Numer. Math.,1979
2. The hat maLrix for smoothing splines;EUBANK R.L;Star. Probab. Lett.,1984
3. Smoothing noisy data with spline functions;HUTCHINSON M. F.;Numer. Math.,1985
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献