离散广义系统的最优递归估计

J. Ishihara, M. Terra, José C. T. Campos
{"title":"离散广义系统的最优递归估计","authors":"J. Ishihara, M. Terra, José C. T. Campos","doi":"10.1080/00207720500219302","DOIUrl":null,"url":null,"abstract":"The optimal recursive estimation problem for general time-variant descriptor systems is considered in this paper. We show that the filter recursion can be obtained as solution of appropriate data fitting problems. We can consider the fitting evolving the entire trajectory at once or consider a one step correction.","PeriodicalId":153850,"journal":{"name":"Proceedings of the 2004 American Control Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Optimal recursive estimation for discrete-time descriptor systems\",\"authors\":\"J. Ishihara, M. Terra, José C. T. Campos\",\"doi\":\"10.1080/00207720500219302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimal recursive estimation problem for general time-variant descriptor systems is considered in this paper. We show that the filter recursion can be obtained as solution of appropriate data fitting problems. We can consider the fitting evolving the entire trajectory at once or consider a one step correction.\",\"PeriodicalId\":153850,\"journal\":{\"name\":\"Proceedings of the 2004 American Control Conference\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/00207720500219302\",\"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 2004 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/00207720500219302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60

摘要

研究了一般时变广义系统的最优递归估计问题。我们证明了滤波器递归可以作为适当的数据拟合问题的解。我们可以考虑一次对整个轨迹进行拟合,也可以考虑一步修正。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal recursive estimation for discrete-time descriptor systems
The optimal recursive estimation problem for general time-variant descriptor systems is considered in this paper. We show that the filter recursion can be obtained as solution of appropriate data fitting problems. We can consider the fitting evolving the entire trajectory at once or consider a one step correction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信