arrow
返回

New square-root smoothing algorithms

delete1996-05-01
delete18
PRE
AI
P
Park, PG
T
T. Kailath
DOI:10.1109/9.489212delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper presents new square-root smoothing algorithms for the three best-known smoothing formulas: 1) Rauch-Tung-Striebel (RTS) formulas, 2) Desai-Weinert-Yusypchuk (DWY) formulas, called backward RTS formulas, and 3) Mayne-Fraser (MF) formulas, called two-filter formulas. The main feature of the new algorithms is that they use unitary rotations to replace all matrix inversion and backsubstitution steps common in earlier algorithms with unitary operations; this feature enables more efficient systolic array and parallel implementations and leads to algorithms with better numerical stability and conditioning properties.
Keyword:
FIXED-INTERVAL SMOOTHER
FACTORIZATION
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Automatic Control 封面图
IEEE Transactions on Automatic Control
IF:
7
论文数:
1.3W
被引数:
6.7W

机构

暂无机构信息