A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem
In: ISRN Computational Mathematics, Jg. 2012 (2012-12-08), S. 1-6
Online
unknown
Zugriff:
Based on the alternating projection algorithm, which was proposed by Von Neumann to treat the problem of finding the projection of a given point onto the intersection of two closed subspaces, we propose a new iterative algorithm to solve the matrix nearness problem associated with the matrix equations AXB=E, CXD=F, which arises frequently in experimental design. If we choose the initial iterative matrix X0=0, the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective.
Titel: |
A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem
|
---|---|
Autor/in / Beteiligte Person: | Li, Chunmei ; Duan, Xuefeng |
Link: | |
Zeitschrift: | ISRN Computational Mathematics, Jg. 2012 (2012-12-08), S. 1-6 |
Veröffentlichung: | Hindawi Limited, 2012 |
Medientyp: | unknown |
ISSN: | 2090-7842 (print) |
DOI: | 10.5402/2012/126908 |
Schlagwort: |
|
Sonstiges: |
|