![](/images/graphics-bg.png)
A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem
Joint Authors
Source
ISRN Computational Mathematics
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-12-08
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Duan, Xue-Feng& Li, Chunmei. 2011. A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem. ISRN Computational Mathematics،Vol. 2012, no. 2012, pp.1-6.
https://search.emarefa.net/detail/BIM-447741
Modern Language Association (MLA)
Duan, Xue-Feng& Li, Chunmei. A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem. ISRN Computational Mathematics No. 2012 (2012), pp.1-6.
https://search.emarefa.net/detail/BIM-447741
American Medical Association (AMA)
Duan, Xue-Feng& Li, Chunmei. A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem. ISRN Computational Mathematics. 2011. Vol. 2012, no. 2012, pp.1-6.
https://search.emarefa.net/detail/BIM-447741
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-447741