Identifiability of system: an algorithm based on the equivalence approach

L. Denis-Vidal, G. Joly-Blanchard, C. Noiret
{"title":"Identifiability of system: an algorithm based on the equivalence approach","authors":"L. Denis-Vidal, G. Joly-Blanchard, C. Noiret","doi":"10.1109/CDC.2001.980294","DOIUrl":null,"url":null,"abstract":"The identifiability of nonlinear uncontrolled dynamical systems is analysed by using the system equivalence based on the straightening out theorem. Previously we (2000) have stated a characterization of the identifiability by considering this approach. The so-obtained identifiability necessary condition leads to the solution of partial differential equations. On the other hand, the identifiability sufficient condition may need an extra elimination. First, we elaborate the corresponding algorithm and in justifying it by some algebraic differential notions. Then its implementation is presented in a symbolic computation language.","PeriodicalId":131411,"journal":{"name":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2001.980294","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The identifiability of nonlinear uncontrolled dynamical systems is analysed by using the system equivalence based on the straightening out theorem. Previously we (2000) have stated a characterization of the identifiability by considering this approach. The so-obtained identifiability necessary condition leads to the solution of partial differential equations. On the other hand, the identifiability sufficient condition may need an extra elimination. First, we elaborate the corresponding algorithm and in justifying it by some algebraic differential notions. Then its implementation is presented in a symbolic computation language.
系统的可辨识性:一种基于等价方法的算法
利用基于拉直定理的系统等价,分析了非线性非受控动力系统的可辨识性。之前我们(2000)通过考虑这种方法陈述了可识别性的特征。由此得到的可辨识性必要条件导致了偏微分方程的解。另一方面,可辨识性充分条件可能需要额外消去。首先,我们详细阐述了相应的算法,并用一些代数微分概念对其进行了证明。然后用一种符号计算语言给出了它的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信