{"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}
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.