.png){kind=icon}
返回
Improved parameter bounds for set-membership EIV problems
.png){kind=icon}
PRE
AI
DOI：10.1002/acs.1218.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the set-membership error-in-variables identification problem, that is the identification of linear dynamic systems when output and input measurements are corrupted by bounded noise. A new approach for the computation of parameters uncertainty intervals is presented. First, the problem is formulated in terms of nonconvex optimization. Then, a relaxation procedure is proposed to compute parameter bounds by means of semidefinite programming techniques. Finally, accuracy of the estimate and computational complexity of the proposed algorithm are discussed. Advantages of the proposed technique with respect to previously published ones are discussed both theoretically and by means of a simulated example. Copyright (C) 2010 John Wiley & Sons, Ltd.
Keyword:
set-membership identification
errors-in-variables
LMI relaxation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
2.6K
被引数:
3.6K
机构
引用论文
Randomized Double-Blind, Multicenter Study of Prostaglandin E1 in Patients with the Adult Respiratory Distress Syndrome.png)
Chest
ChestIF0
PREAI
分享收藏
查看更多内容