Automatic computation of hierarchical biquadratic smoothing slines with minimum GCV
-
Altmetric Citations
Hancock, P A; Hutchinson, Michael
Description
A computationally efficient numerical strategy for fitting approximate minimum GCV bivariate thin plate smoothing splines to large noisy data sets was developed. The procedure discretises the bivariate thin plate smoothing spline equations using biquadratic B-splines and uses a nested grid SOR iterative strategy to solve the discretised system. For efficient optimisation, the process incorporates a double iteration that simultaneously updates both the discretised solution and the estimate of...[Show more]
dc.contributor.author | Hancock, P A | |
---|---|---|
dc.contributor.author | Hutchinson, Michael | |
dc.date.accessioned | 2015-12-07T22:38:28Z | |
dc.identifier.issn | 0098-3004 | |
dc.identifier.uri | http://hdl.handle.net/1885/23463 | |
dc.description.abstract | A computationally efficient numerical strategy for fitting approximate minimum GCV bivariate thin plate smoothing splines to large noisy data sets was developed. The procedure discretises the bivariate thin plate smoothing spline equations using biquadratic B-splines and uses a nested grid SOR iterative strategy to solve the discretised system. For efficient optimisation, the process incorporates a double iteration that simultaneously updates both the discretised solution and the estimate of the minimum GCV smoothing parameter. The GCV was estimated using a minimum variance stochastic estimator of the trace of the influence matrix associated with the fitted spline surface. A Taylor series expansion was used to estimate the smoothing parameter that minimises the GCV estimate. The computational cost of the procedure is optimal in the sense that it is proportional to the number of grid points supporting the fitted biquadratic spline. Convergence was improved by adding a first order correction to the solution estimate after each smoothing parameter update. The algorithm was tested on several simulated data sets with varying spatial complexity and noise level. An accurate approximation to the analytic minimum GCV thin plate smoothing spline was obtained in all cases. | |
dc.publisher | Pergamon Press | |
dc.source | Computers and Geosciences | |
dc.subject | Keywords: Algorithms; Approximation theory; Convergence of numerical methods; Finite element method; Iterative methods; Matrix algebra; Optimization; Random processes; Generalised cross validation; Multilevel method; Randomized trace; Smoothing spline; Computationa Finite element; Generalised cross validation; Multilevel method; Randomized trace; Smoothing spline | |
dc.title | Automatic computation of hierarchical biquadratic smoothing slines with minimum GCV | |
dc.type | Journal article | |
local.description.notes | Imported from ARIES | |
local.identifier.citationvolume | 32 | |
dc.date.issued | 2006 | |
local.identifier.absfor | 040699 - Physical Geography and Environmental Geoscience not elsewhere classified | |
local.identifier.ariespublication | U3923986xPUB27 | |
local.type.status | Published Version | |
local.contributor.affiliation | Hancock, P A, Imperial College London | |
local.contributor.affiliation | Hutchinson, Michael, College of Medicine, Biology and Environment, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.startpage | 834 | |
local.bibliographicCitation.lastpage | 845 | |
local.identifier.doi | 10.1016/j.cageo.2005.10.010 | |
dc.date.updated | 2015-12-07T10:38:33Z | |
local.identifier.scopusID | 2-s2.0-33744986298 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Hancock_Automatic_computation_of_2006.pdf | 502.58 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator