桂林电子科技大学学报Issue(3)：239-244,6.
求解对称半正定矩阵低秩逼近的乘性迭代算法
Multiplicative iterative algorithm for the low rank approximation of the symmetric positive semi-definite matrix
摘要
Abstract
In order to solve the low rank approximation of the symmetric positive semi-definite matrix,a new multiplicative iterative algorithm is constructed based on the full rank factorization of the matrix and the algorithm for the non-negative matrix factorization,the convergence theorem for the proposed algorithm is given.Numerical experiments show that com-pared with the Cadzow algorithm,the new algorithm is feasible and efficient.关键词
对称半正定矩阵/低秩逼近/乘性迭代算法Key words
symmetric positive semi-definite matrix/low rank approximation/multiplicative iterative algorithm分类
数理科学引用本文复制引用
白建超,段雪峰,张雪伟..求解对称半正定矩阵低秩逼近的乘性迭代算法[J].桂林电子科技大学学报,2014,(3):239-244,6.基金项目
国家自然科学基金(11101100,11226323,11261014) （11101100,11226323,11261014）
广西自然科学基金(2012GXNSFBA053006,2013GXNSFBA019009) （2012GXNSFBA053006,2013GXNSFBA019009）
广西信息科学实验中心项目(20130103) （20130103）
