Square-root RTS smoothing algorithms
From MaRDI portal
Publication:4858852
DOI10.1080/00207179508921582zbMath0839.93075OpenAlexW2010941966MaRDI QIDQ4858852
Thomas Kailath, Poo Gyeon Park
Publication date: 23 June 1996
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179508921582
smoothingKalman filteringparallel implementationinformation updatessquare-root algorithmscovariance updates
Cites Work
- A new forward-pass fixed-interval smoother using the U-D information matrix factorization
- A parallel architecture for Kalman filter measurement update and parameter estimation
- Sequential square root filtering and smoothing of discrete linear systems
- Numerical methods for solving linear least squares problems
- Extension of square-root filtering to include process noise
- A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays
- New computationally efficient formula for backward-pass fixed-interval smoother and its UD factorisation algorithm
- A unified square-root-free approach for QRD-based recursive-least-squares estimation
- Square-root algorithms for least-squares estimation
- Some new algorithms for recursive estimation in constant linear systems
- Some new algorithms for recursive estimation in constant, linear, discrete-time systems
- Least Squares Computations by Givens Transformations Without Square Roots
- New square-root algorithms for Kalman filtering
- Covariance factorization algorithms for fixed-interval smoothing of linear discrete dynamic systems
This page was built for publication: Square-root RTS smoothing algorithms