{"title":"快速子空间跟踪的近似功率迭代","authors":"R. Badeau, G. Richard, B. David, K. Abed-Meraim","doi":"10.1109/ISSPA.2003.1224944","DOIUrl":null,"url":null,"abstract":"This paper introduces a fast implementation of the power iterations method for subspace tracking, based on an approximation less restrictive than the well-known projection approximation. This algorithm guarantees the orthonormality of the estimated subspace-weighting matrix at each iteration, and satisfies a global and exponential convergence property. Moreover, it outperforms many subspace trackers related to the power method, such as PAST. NIC, NP3 and OPAST, while keeping the same computational complexity.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Approximated power iterations for fast subspace tracking\",\"authors\":\"R. Badeau, G. Richard, B. David, K. Abed-Meraim\",\"doi\":\"10.1109/ISSPA.2003.1224944\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a fast implementation of the power iterations method for subspace tracking, based on an approximation less restrictive than the well-known projection approximation. This algorithm guarantees the orthonormality of the estimated subspace-weighting matrix at each iteration, and satisfies a global and exponential convergence property. Moreover, it outperforms many subspace trackers related to the power method, such as PAST. NIC, NP3 and OPAST, while keeping the same computational complexity.\",\"PeriodicalId\":264814,\"journal\":{\"name\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPA.2003.1224944\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2003.1224944","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approximated power iterations for fast subspace tracking
This paper introduces a fast implementation of the power iterations method for subspace tracking, based on an approximation less restrictive than the well-known projection approximation. This algorithm guarantees the orthonormality of the estimated subspace-weighting matrix at each iteration, and satisfies a global and exponential convergence property. Moreover, it outperforms many subspace trackers related to the power method, such as PAST. NIC, NP3 and OPAST, while keeping the same computational complexity.