摘要
The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.
讨论可交换单纯矩阵族A的联合特征值估计问题.为了克服基于同时Schur分解和酉变换算法的收敛和性能分析缺陷,提出了一种基于同时相似对角化的联合特征结构估计算法.该算法通过对A交替进行同时Schur分解和范数平衡来实现矩阵族的对角化.该算法的有效性在于:每个子过程在优化自身代价函数的同时,还对另一子过程的收敛起到加速作用.在适当的假设条件下,可以证明该算法交替优化的2个代价函数(矩阵族范数和矩阵族下三角元素范数)的收敛性.基于多维谐波提取的数值仿真显示该算法在矩阵族偏离正规阵时收敛速度显著快于基于同时Schur分解和酉变换算法,并且联合特征值的估计性能可以进行简洁的闭式分析.
基金
The National Natural Science Foundation of China(No.60572072,60496311),the National High Technology Researchand Development Program of China (863Program ) ( No.2003AA123310),the International Cooperation Project on Beyond 3G Mobile of China (No.2005DFA10360).
