New computationally efficient formula for backward-pass fixed-interval smoother and its UD factorisation algorithm

Keigo Watanabe, S. G. Tzafestas

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

A new UD factorization-based backward-pass fixed-interval smoother that is numerically reliable and stable is derived for linear stochastic discrete-time systems. A computationally efficient recursion of a classic backforward-pass smoother is first obtained, so that the smoother can exclude the well known shortcomings of the classic version and utilize the outputs of a forward-pass information filter. This recursion formula is then applied to construct the UD smoother using three fundamental UD algorithms. It is shown that, compared with Bierman's backward-pass UD smoother, the present UD smoother can provide an improvement in computation speed and computer storage for time-invariant systems, as well as the forward-pass UD smoother, but cannot avoid the computation of an inversion of the state-transition matrix for time-varying systems.

Original languageEnglish
Pages (from-to)73-78
Number of pages6
JournalIEE Proceedings D: Control Theory and Applications
Volume136
Issue number2
Publication statusPublished - Mar 1989
Externally publishedYes

Fingerprint

Factorization
Time varying systems

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{48d1ad92a67441838fca37e9611fd3d7,
title = "New computationally efficient formula for backward-pass fixed-interval smoother and its UD factorisation algorithm",
abstract = "A new UD factorization-based backward-pass fixed-interval smoother that is numerically reliable and stable is derived for linear stochastic discrete-time systems. A computationally efficient recursion of a classic backforward-pass smoother is first obtained, so that the smoother can exclude the well known shortcomings of the classic version and utilize the outputs of a forward-pass information filter. This recursion formula is then applied to construct the UD smoother using three fundamental UD algorithms. It is shown that, compared with Bierman's backward-pass UD smoother, the present UD smoother can provide an improvement in computation speed and computer storage for time-invariant systems, as well as the forward-pass UD smoother, but cannot avoid the computation of an inversion of the state-transition matrix for time-varying systems.",
author = "Keigo Watanabe and Tzafestas, {S. G.}",
year = "1989",
month = "3",
language = "English",
volume = "136",
pages = "73--78",
journal = "IEE Proceedings D: Control Theory and Applications",
issn = "0143-7054",
publisher = "Institution of Electrical Engineers (IEE)",
number = "2",

}

TY - JOUR

T1 - New computationally efficient formula for backward-pass fixed-interval smoother and its UD factorisation algorithm

AU - Watanabe, Keigo

AU - Tzafestas, S. G.

PY - 1989/3

Y1 - 1989/3

N2 - A new UD factorization-based backward-pass fixed-interval smoother that is numerically reliable and stable is derived for linear stochastic discrete-time systems. A computationally efficient recursion of a classic backforward-pass smoother is first obtained, so that the smoother can exclude the well known shortcomings of the classic version and utilize the outputs of a forward-pass information filter. This recursion formula is then applied to construct the UD smoother using three fundamental UD algorithms. It is shown that, compared with Bierman's backward-pass UD smoother, the present UD smoother can provide an improvement in computation speed and computer storage for time-invariant systems, as well as the forward-pass UD smoother, but cannot avoid the computation of an inversion of the state-transition matrix for time-varying systems.

AB - A new UD factorization-based backward-pass fixed-interval smoother that is numerically reliable and stable is derived for linear stochastic discrete-time systems. A computationally efficient recursion of a classic backforward-pass smoother is first obtained, so that the smoother can exclude the well known shortcomings of the classic version and utilize the outputs of a forward-pass information filter. This recursion formula is then applied to construct the UD smoother using three fundamental UD algorithms. It is shown that, compared with Bierman's backward-pass UD smoother, the present UD smoother can provide an improvement in computation speed and computer storage for time-invariant systems, as well as the forward-pass UD smoother, but cannot avoid the computation of an inversion of the state-transition matrix for time-varying systems.

UR - http://www.scopus.com/inward/record.url?scp=0024622708&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024622708&partnerID=8YFLogxK

M3 - Article

VL - 136

SP - 73

EP - 78

JO - IEE Proceedings D: Control Theory and Applications

JF - IEE Proceedings D: Control Theory and Applications

SN - 0143-7054

IS - 2

ER -