.png){kind=icon}
返回
Exponential convergence of the Kalman filter based parameter estimation algorithm
.png){kind=icon}
PRE
AI
DOI：10.1002/acs.774.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we shall present a new method to analyse the convergence property of the Kalman filter based parameter estimation algorithms. This method for convergence analysis is mainly based on some matrix inequalities and is more simple than some of the existing approaches in the literature. This method can simultaneously provide both lower and upper bounds on the exponential convergence rate as the functions of bounds of the related matrices, such as the covariance matrices. A simulation example is provided to illustrate the convergence property of the Kalman filter based algorithms. Copyright (C) 2003 John Wiley Sons, Ltd.
Keyword:
Kalman filter
recursive parameter estimation
exponential convergence
convergence rate
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
2.6K
被引数:
3.6K
机构
暂无机构信息
引用论文
.png){kind=icon}
The extrapolation of the Drucker–Prager/Cap material parameters to low and high relative densities
PREAI
分享收藏
没有更多内容
没有更多内容