系统的可辨识性:一种基于等价方法的算法

Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228) Pub Date : 2001-12-04 DOI:10.1109/CDC.2001.980294

L. Denis-Vidal, G. Joly-Blanchard, C. Noiret

{"title":"系统的可辨识性:一种基于等价方法的算法","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":"{\"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}","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

摘要

利用基于拉直定理的系统等价，分析了非线性非受控动力系统的可辨识性。之前我们(2000)通过考虑这种方法陈述了可识别性的特征。由此得到的可辨识性必要条件导致了偏微分方程的解。另一方面，可辨识性充分条件可能需要额外消去。首先，我们详细阐述了相应的算法，并用一些代数微分概念对其进行了证明。然后用一种符号计算语言给出了它的实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Identifiability of system: an algorithm based on the equivalence approach

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)

自引率

0.00%

发文量