Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-09T03:40:22.720Z Has data issue: false hasContentIssue false

On algorithms for generalised smoothing splines

Published online by Cambridge University Press:  17 February 2009

M. R. Osborne
Affiliation:
Department of Statistics, Research School of Social Sciences, Australian National University, G.P.O. Box 4, Canberra, A.C.T. 2601, Australia.
Tania Prvan
Affiliation:
Department of Pure and Applied Mathematics, Washington State University, Pullman, Washington 99164, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Recently, considerable interest has been shown in the connection between smoothing splines and a particular class of stochastic processes. Here the connection with an equivalent class of least squares problems is used to develop algorithms, and properties of the solution are examined. We give an estimate of the condition number of the solution process and compare this with an estimate for the condition number of the Reinsch algorithm in its conventional implementation.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1988