Journal article
Efficient algorithms for robust generalized cross-validation spline smoothing
Journal of Computational and Applied Mathematics, Vol.235(1), pp.102-107
2010
Abstract
Generalized cross-validation (GCV) is a widely used parameter selection criterion for spline smoothing, but it can give poor results if the sample size n is not sufficiently large. An effective way to overcome this is to use the more stable criterion called robust GCV (RGCV). The main computational effort for the evaluation of the GCV score is the trace of the smoothing matrix, tr A, while the RGCV score requires both tr A and tr A(2). Since 1985, there has been an efficient O(n) algorithm to compute tr A. This paper develops two pairs of new O(n) algorithms to compute tr A and tr A(2), which allow the RGCV score to be calculated efficiently. The algorithms involve the differentiation of certain matrix functionals using banded Cholesky decomposition.
Details
- Title
- Efficient algorithms for robust generalized cross-validation spline smoothing
- Authors/Creators
- M.A. Lukas (Author/Creator)F.R. de Hoog (Author/Creator)R.S. Anderssen (Author/Creator)
- Publication Details
- Journal of Computational and Applied Mathematics, Vol.235(1), pp.102-107
- Publisher
- Elsevier BV
- Identifiers
- 991005545094607891
- Copyright
- (C) 2010 Elsevier B.V
- Murdoch Affiliation
- School of Chemical and Mathematical Science
- Language
- English
- Resource Type
- Journal article
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites
Metrics
216 File views/ downloads
132 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- Citation topics
- 9 Mathematics
- 9.92 Statistical Methods
- 9.92.220 Robust Estimation
- Web Of Science research areas
- Mathematics, Applied
- ESI research areas
- Mathematics