首页> 外文期刊>IEE Proceedings. Part D >New computationally efficient formula for backward-pass fixed-interval smoother and its UD factorisation algorithm
【24h】

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

机译:计算有效的反向传递固定间隔平滑器公式及其UD分解算法

获取原文
获取原文并翻译 | 示例
       

摘要

A UD factorisation-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 backward-pass smoother is first obtained, so that the smoother can exclude the well-known shortcomings of the classic version and utilise 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 (1977, 1983), the UD smoother presented 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.
机译:针对线性随机离散时间系统,推导了一种基于UD分解的后向固定间隔平滑器,其数值可靠且稳定。首先获得经典后向平滑器的计算有效递归,以便平滑器可以排除经典版本的众所周知的缺点,并利用前向信息滤波器的输出。然后,使用三个基本UD算法将此递归公式应用于构建UD平滑器。结果表明,与Bierman的后向UD平滑器(1977,1983)相比,所提出的UD平滑器可以改善时不变系统的计算速度和计算机存储,以及前向UD平滑器。时变系统不可避免地要计算状态转换矩阵的求逆。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号