首页 | 本学科首页   官方微博 | 高级检索  
     

子矩阵约束下对称正交对称矩阵反问题及其最佳逼近
引用本文:熊培银.子矩阵约束下对称正交对称矩阵反问题及其最佳逼近[J].延边大学理工学报,2008,34(3).
作者姓名:熊培银
作者单位:仰恩大学数学系
摘    要:利用矩阵的奇异值分解和矩阵对的商奇异值分解,讨论子矩阵约束下对称正交对称矩阵反问题,给出了其有解的充分必要条件及在有解条件下的通解表达式,并得到了此问题的最佳逼近解,给出了求解最佳逼近解的数值算法及数值算例.

关 键 词:对称矩阵  对称正交对称矩阵  商奇异值分解  最佳逼近

The Inverse Problem of Bisymmetric Orth-symmetric Matrices with a Submatrix Constraint
XIONG Pei-yin.The Inverse Problem of Bisymmetric Orth-symmetric Matrices with a Submatrix Constraint[J].Journal of Yanbian University (Natural Science),2008,34(3).
Authors:XIONG Pei-yin
Abstract:By applying the singular-value decomposition(SVD) and the quotient singular-value decomposition (QSVD),the inverse problem of symmetric orth-symmetric matrices with a submatrix constraint is studied.In addition,the sufficient and necessary conditions and the general solutions of the problem are given,and the op- timal approximate solution is obtained.Numeral example is given to show the effectiveness of the proposed method.
Keywords:symmetric matrices  symmetric orth-bisymmetric matrices  quotient singular-value decomposition  optimal approximation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号