Square-root RTS smoothing algorithms
From MaRDI portal
Publication:4858852
Recommendations
Cites work
- A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays
- 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
- A unified square-root-free approach for QRD-based recursive-least-squares estimation
- Covariance factorization algorithms for fixed-interval smoothing of linear discrete dynamic systems
- Extension of square-root filtering to include process noise
- Least Squares Computations by Givens Transformations Without Square Roots
- New computationally efficient formula for backward-pass fixed-interval smoother and its UD factorisation algorithm
- New square-root algorithms for Kalman filtering
- Numerical methods for solving linear least squares problems
- Sequential square root filtering and smoothing of discrete linear systems
- Some new algorithms for recursive estimation in constant linear systems
- Some new algorithms for recursive estimation in constant, linear, discrete-time systems
- Square-root algorithms for least-squares estimation
Cited in
(6)- Fast algorithms for linear least squares smoothing problems in one and two dimensions using generalized discrete Bellman-Siegert-Krein resolvent identities
- New square-root algorithms for Kalman filtering
- The square-root overdetermined recursive instrumental variable algorithm
- Square-root Bryson-Frazier smoothing algorithms
- scientific article; zbMATH DE number 4184815 (Why is no real title available?)
- What is the Covariance Analog of the Paige and Saunders Information Filter?
This page was built for publication: Square-root RTS smoothing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858852)