Lancaster EPrints

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

This is the latest version of this item.

PDF (smoothing.pdf)
Download (410Kb) | Preview


    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: Extreme value theory • Forward-backward algorithm • Particle filtering • Particle smoothing • Two-filter formula
    Subjects: ?? qa ??
    Departments: Faculty of Science and Technology > Mathematics and Statistics
    Faculty of Science and Technology > School of Computing & Communications
    ID Code: 8844
    Deposited By: Prof Paul Fearnhead
    Deposited On: 15 May 2008 14:11
    Refereed?: Yes
    Published?: Published
    Last Modified: 13 Nov 2018 00:12
    Identification Number:

    Available Versions of this Item

    Actions (login required)

    View Item