Some studies on finding the nearest volume-preserving matrix  

求解最近保体矩阵问题的若干研究(英文)

作　　者：沐建飞[1] 黄建国[1] 

机构地区：[1]上海交通大学数学系,上海200240

出　　处：《Journal of Southeast University(English Edition)》2005年第1期119-122,共4页东南大学学报（英文版）

摘　　要：Finding the nearest volume-preserving matrix for a given matrix is studied. Amatrix equation is first obtained, which is a necessary condition for the solution to the problem.Then the equation is solved by the singular value decomposition method. Some additional results arealso provided to further characterize the solution. Using these results, a numerical algorithm isintroduced and a numerical test is given to illustrate the effectiveness of the algorithm.研究了求解给定矩阵的最近保体矩阵问题.首先导出该问题解所必须满足的一个矩阵方程,然后用奇异值分解方法求解该矩阵方程;并获得了该问题解的其他更进一步的刻画条件.利用这些结果建立了一个求解算法,并通过数值算例说明了该算法的有效性.

关 键 词：volume-preserving matrix matrix nearness problem singular valuedecomposition 

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