一组特征矩阵的联合对角化  

Jointly Approximate Diagonalization for a set of eigen-matrices

作　　者：张海琴[1] 

机构地区：[1]西安电子科技大学理学院,陕西西安710071

出　　处：《西安电子科技大学学报》2001年第3期343-347,共5页Journal of Xidian University

基　　金：国家自然科学基金资助项目!( 69972 0 3 7)

摘　　要：发展了一组特征矩阵联合对角化的新算法 ,这个算法利用了左右特征矢量之间的双正交性 .定义了用于追踪单个特征分量的代价函数 ,找到了快速求解代价函数全局最优解的迭代算法 .通过系统化的多阶段分解和多阶段重构 ,可以得到全部特征矢量 .In recent years, the jointly approximate diagonalization problem is proposed in blind source separation. This paper gives a new algorithm for jointly approximate diagonalization of a set of eigen matrices on the basis of the biorthogonality between left and right eigen vectors. We propose that the new cost functions are used to find the single eigen component. An efficient iterative algorithm is introduced and used to find the global optimal solution of the cost functions. By the systematic multistage decomposition and multistage reconstruction, we have obtained all the eigen components.

关 键 词：特征矩阵 联合对角化 双正交性 代价函数 多阶段分解 

分 类 号：O211.2[理学—概率论与数理统计]