{"title":"基于kronecker积方程的大规模自回归系统辨识","authors":"Martijn Boussé, L. D. Lathauwer","doi":"10.1109/GlobalSIP.2018.8646598","DOIUrl":null,"url":null,"abstract":"By exploiting the intrinsic structure and/or sparsity of the system coefficients in large-scale system identification, one can enable efficient processing. In this paper, we employ this strategy for large-scale single-input multiple-output autoregressive system identification by assuming the coefficients can be well approximated by Kronecker products of smaller vectors. We show that the identification problem can be refor-mulated as the computation of a Kronecker product equation, allowing one to use optimization-based and algebraic solvers.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"LARGE-SCALE AUTOREGRESSIVE SYSTEM IDENTIFICATION USING KRONECKER PRODUCT EQUATIONS\",\"authors\":\"Martijn Boussé, L. D. Lathauwer\",\"doi\":\"10.1109/GlobalSIP.2018.8646598\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By exploiting the intrinsic structure and/or sparsity of the system coefficients in large-scale system identification, one can enable efficient processing. In this paper, we employ this strategy for large-scale single-input multiple-output autoregressive system identification by assuming the coefficients can be well approximated by Kronecker products of smaller vectors. We show that the identification problem can be refor-mulated as the computation of a Kronecker product equation, allowing one to use optimization-based and algebraic solvers.\",\"PeriodicalId\":119131,\"journal\":{\"name\":\"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GlobalSIP.2018.8646598\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP.2018.8646598","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LARGE-SCALE AUTOREGRESSIVE SYSTEM IDENTIFICATION USING KRONECKER PRODUCT EQUATIONS
By exploiting the intrinsic structure and/or sparsity of the system coefficients in large-scale system identification, one can enable efficient processing. In this paper, we employ this strategy for large-scale single-input multiple-output autoregressive system identification by assuming the coefficients can be well approximated by Kronecker products of smaller vectors. We show that the identification problem can be refor-mulated as the computation of a Kronecker product equation, allowing one to use optimization-based and algebraic solvers.