子矩阵束约束下中心对称矩阵束的最佳逼近  

Optimal Approximation of Centrosymmetric Matrix Pencil with a Submatrix Pencil Constraint

作　　者：鲍丽娟[1] 戴华[1] 

机构地区：[1]南京航空航天大学理学院,南京210016

出　　处：《工程数学学报》2013年第2期205-216,共12页Chinese Journal of Engineering Mathematics

基　　金：国家自然科学基金(11071118);江苏省自然科学基金(BK2009364)~~

摘　　要：本文讨论广义特征值反问题在子矩阵束约束下的中心对称解及其最佳逼近问题.应用矩阵束的广义奇异值分解,导出了该问题有中心对称解的充要条件及有解情况下的通解表达式,证明了最佳逼近问题解的存在性与唯一性,并得到了最佳逼近解的表达式.最后给出了求解最佳逼近问题的数值算法及数值例子.This paper deals with the centrosymmetric solution of a generalized inverse eigen- value problem with a submatrix pencil constraint. By using the generalized singular value decomposition（GSVD） of matrix pencils, the sufficient and necessary conditions for the prob- lem having a centrosymmetric solution are obtained, and the general solution is presented. The best approximation for a given matrix pencil under a given spectral constraint and a submatrix pencil constraint is also considered. The existence and the uniqueness of the optimal approx- imation are proved, and the expression of the best approximation are derived. A numerical algorithm for solving the problems is prensented.

关 键 词：中心对称矩阵 矩阵束 反问题 最佳逼近 

分 类 号：O241.6[理学—计算数学]