| 连续求解样本协方差矩阵迹的快速递推算法 |
| |
| 引用本文： | 黄晓斌,万建伟,王展,欧建平.连续求解样本协方差矩阵迹的快速递推算法[J].国防科技大学学报,2004,26(2):62-65. |
| |
| 作者姓名： | 黄晓斌 万建伟 王展 欧建平 |
| |
| 作者单位： | 国防科技大学电子科学与工程学院,湖南,长沙410073;国防科技大学电子科学与工程学院,湖南,长沙410073;国防科技大学电子科学与工程学院,湖南,长沙410073;国防科技大学电子科学与工程学院,湖南,长沙410073 |
| |
| 摘 要： | 为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。
|
| 关 键 词： | 协方差矩阵 时间复杂度 算法 |
| 文章编号： | 1001-2486(2004)02-0062-04 |
| 收稿时间： | 2003/9/30 0:00:00 |
| 修稿时间： | 2003年9月30日 |
A Fast Recursive Algorithm for Continuously Computing the Trace of the Sample Covariance Matrix |
| |
| HUANG Xiaobin,WAN Jianwei,WANG Zhan and OU Jianping.A Fast Recursive Algorithm for Continuously Computing the Trace of the Sample Covariance Matrix[J].Journal of National University of Defense Technology,2004,26(2):62-65. |
| |
| Authors: | HUANG Xiaobin WAN Jianwei WANG Zhan and OU Jianping |
| |
| Institution: | College of Electronic Science and Engineering, National Univ. of Defense Technology, Changsha 410073, China;College of Electronic Science and Engineering, National Univ. of Defense Technology, Changsha 410073, China;College of Electronic Science and Engineering, National Univ. of Defense Technology, Changsha 410073, China;College of Electronic Science and Engineering, National Univ. of Defense Technology, Changsha 410073, China |
| |
| Abstract: | In order to resolve the disadvantage that much time is consumed for computing the trace of the sample covariance matrix with the traditional method when the samples continuously increase, a fast recursive algorithm is presented. The theoretical analysis and the simulation results all show that compared with the traditional method, the consuming time with our method is decreased by one order of magnitude, so it can reduce a great deal of computing time. |
| |
| Keywords: | covariance matrix time complexity algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
|
