.png){kind=icon}
返回
Robustness in H∞ identification
.png){kind=icon}
PRE
AI
DOI：10.1016/S0005-1098(00)00074-1.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider identification (in both the time domain, for suitable choices of inputs, and the frequency domain) using a deterministic formulation that is less conservative than the usual worst-case approach, in that it allows for a certain number of outliers. Two new identification methods, the Orlicz and The Top K method, respectively, are proposed and analysed. Theoretical H-infinity error bounds for the identified models are provided, and the proposed methods are illustrated by a numerical example. (C) 2000 Elsevier Science Ltd. All rights reserved.
Keyword:
system identification
worst-case identification
noise models
H-infinity
robustness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
暂无机构信息
引用论文
分享收藏分享收藏The Effect of Iloprost in the Healing of Colonic Anastomosis in Rats under Chemotherapy with Irinotecan.png)
Chirurgia
OAAI
ChirurgiaIF0
OAAI分享收藏 没有更多内容
没有更多内容