A new forward-pass fixed-interval smoother using the U-D information matrix factorization

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

A new U-D factorized smoothing algorithm that is numerically stable and reliable is developed by using a forward-pass fixed-interval smoother recursion. Introducing a gain for a backward-pass information filter and the notion of an input to the smoother and decomposing the system noises into each element, it is shown that three famous U-D algorithms can be naturally applied to construct such a smoother. The new result does not necessitate two burdensome matrix inversions, or any algebraic computations equivalent to them, for the transition matrix and the predicted error covariance, which are at present necessary for the Bierman's U-D smoother. Consequently, compared with the result of Bierman, the present algorithm can deal with a broader system, which may cover a time-delay system, and provide an improvement in computation speed and computer storage.

Original languageEnglish
Pages (from-to)465-475
Number of pages11
JournalAutomatica
Volume22
Issue number4
DOIs
Publication statusPublished - 1986
Externally publishedYes

Fingerprint

Factorization
Time delay

Keywords

  • aerospace trajectories
  • computational methods
  • Kalman filters
  • numerical methods
  • optimal filtering
  • Smoothing

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

A new forward-pass fixed-interval smoother using the U-D information matrix factorization. / Watanabe, Keigo.

In: Automatica, Vol. 22, No. 4, 1986, p. 465-475.

Research output: Contribution to journalArticle

@article{78089153de154b09bbc0b6ca24ce81c6,
title = "A new forward-pass fixed-interval smoother using the U-D information matrix factorization",
abstract = "A new U-D factorized smoothing algorithm that is numerically stable and reliable is developed by using a forward-pass fixed-interval smoother recursion. Introducing a gain for a backward-pass information filter and the notion of an input to the smoother and decomposing the system noises into each element, it is shown that three famous U-D algorithms can be naturally applied to construct such a smoother. The new result does not necessitate two burdensome matrix inversions, or any algebraic computations equivalent to them, for the transition matrix and the predicted error covariance, which are at present necessary for the Bierman's U-D smoother. Consequently, compared with the result of Bierman, the present algorithm can deal with a broader system, which may cover a time-delay system, and provide an improvement in computation speed and computer storage.",
keywords = "aerospace trajectories, computational methods, Kalman filters, numerical methods, optimal filtering, Smoothing",
author = "Keigo Watanabe",
year = "1986",
doi = "10.1016/0005-1098(86)90051-8",
language = "English",
volume = "22",
pages = "465--475",
journal = "Automatica",
issn = "0005-1098",
publisher = "Elsevier Limited",
number = "4",

}

TY - JOUR

T1 - A new forward-pass fixed-interval smoother using the U-D information matrix factorization

AU - Watanabe, Keigo

PY - 1986

Y1 - 1986

N2 - A new U-D factorized smoothing algorithm that is numerically stable and reliable is developed by using a forward-pass fixed-interval smoother recursion. Introducing a gain for a backward-pass information filter and the notion of an input to the smoother and decomposing the system noises into each element, it is shown that three famous U-D algorithms can be naturally applied to construct such a smoother. The new result does not necessitate two burdensome matrix inversions, or any algebraic computations equivalent to them, for the transition matrix and the predicted error covariance, which are at present necessary for the Bierman's U-D smoother. Consequently, compared with the result of Bierman, the present algorithm can deal with a broader system, which may cover a time-delay system, and provide an improvement in computation speed and computer storage.

AB - A new U-D factorized smoothing algorithm that is numerically stable and reliable is developed by using a forward-pass fixed-interval smoother recursion. Introducing a gain for a backward-pass information filter and the notion of an input to the smoother and decomposing the system noises into each element, it is shown that three famous U-D algorithms can be naturally applied to construct such a smoother. The new result does not necessitate two burdensome matrix inversions, or any algebraic computations equivalent to them, for the transition matrix and the predicted error covariance, which are at present necessary for the Bierman's U-D smoother. Consequently, compared with the result of Bierman, the present algorithm can deal with a broader system, which may cover a time-delay system, and provide an improvement in computation speed and computer storage.

KW - aerospace trajectories

KW - computational methods

KW - Kalman filters

KW - numerical methods

KW - optimal filtering

KW - Smoothing

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

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

U2 - 10.1016/0005-1098(86)90051-8

DO - 10.1016/0005-1098(86)90051-8

M3 - Article

AN - SCOPUS:0022756582

VL - 22

SP - 465

EP - 475

JO - Automatica

JF - Automatica

SN - 0005-1098

IS - 4

ER -