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

(R,S,μ)对称矩阵逆问题和最佳逼近问题及扰动分析
引用本文:李姣芬,胡锡炎,张磊.(R,S,μ)对称矩阵逆问题和最佳逼近问题及扰动分析[J].计算数学,2012,34(1):25-36.
作者姓名:李姣芬  胡锡炎  张磊
作者单位:1. 桂林电子科技大学数学与计算科学学院, 广西桂林 541004; 2. 湖南大学数学与计量经济学院, 长沙 410082
基金项目:国家自然科学地区基金,国家自然科学青年科学基金
摘    要:称R∈Cm×m为k次轮换矩阵若 R的最小多项式为xk-1(k≥2).令μ∈{0,1,…,k-1}和ζ=e2πi/k.若R∈Cm×m和S∈Cn×n为k次轮换矩阵,则称A∈Cm×m为(R,S,μ)对称矩阵若RAS-1μA.本文研究了(R,S,μ) 对称矩阵的逆问题和最佳逼近问题,得到了解的表达式. 并讨论了最佳逼近解的扰动分析,得到了比较满意的理论结果, 最后通过数值算例验证了该理论结果的正确性.

关 键 词:k次轮换矩阵  逆问题  最佳逼近问题  扰动分析
收稿时间:2010-12-20;

INVERSE PROBLEM AND PERTURBATION ANALYSIS ON THE APPROXIMATION PROBLEM FOR (R, S, μ) SYMMETRY MATRICES
Li Jiaofen , Hu Xiyan , Zhang Lei.INVERSE PROBLEM AND PERTURBATION ANALYSIS ON THE APPROXIMATION PROBLEM FOR (R, S, μ) SYMMETRY MATRICES[J].Mathematica Numerica Sinica,2012,34(1):25-36.
Authors:Li Jiaofen  Hu Xiyan  Zhang Lei
Institution:1. School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin 541004, Guangxi, China; 2. College of Mathematics and Econometrics, Hunan University, Changsha 410082, China
Abstract:A matrix R∈Cn×n is said to be k-involutary if its minimal polynomial is xk-1 forsome k≥2.Letμ∈{0,1,...,k-1} andζ= e2πi/k.If A∈Cm×n,R∈Cm×m,S∈Cn×nand R and S are k-involutory,we say that A is(R,S,μ-symmetric if RAS-1μA.In this paper we discuss the inverse problem and associated approximation problem for(R,S,μ-symmetric matrices.Moreover,we provide a perturbation bound for the solution ofthe approximation problem and present some illustrative experiments to show the correctnessof the perturbation bound.
Keywords:k-involutary  Inverse problem  Optimal approximation problem  Perturbation analysis
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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