A sequential smoothing algorithm with linear computational cost.

Fearnhead, Paul and Wyncoll, David and Tawn, Jonathan (2010) A sequential smoothing algorithm with linear computational cost. Biometrika, 97 (2). pp. 447-464. ISSN 1464-3510

[thumbnail of smoothing.pdf]
Preview
PDF (smoothing.pdf)
smoothing.pdf

Download (419kB)

Abstract

In this paper we propose a new particle smoother that has a computational complexity of O(N), where N is the number of particles. This compares favourably with the O(N2) computational cost of most smoothers. The new method also overcomes some degeneracy problems in existing algorithms. Through simulation studies we show that substantial gains in efficiency are obtained for practical amounts of computational cost. It is shown both through these simulation studies, and by the analysis of an athletics dataset, that our new method also substantially outperforms the simple filter-smoother, the only other smoother with computational cost that is O(N).

Item Type:
Journal Article
Journal or Publication Title:
Biometrika
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1100
Subjects:
?? extreme value theory • forward-backward algorithm • particle filtering • particle smoothing • two-filter formulaagricultural and biological sciences(all)applied mathematicsstatistics and probabilitystatistics, probability and uncertaintymathematics(all)ag ??
ID Code:
8844
Deposited By:
Deposited On:
15 May 2008 13:11
Refereed?:
Yes
Published?:
Published
Last Modified:
12 Mar 2024 00:33