A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem
Xuefeng Duan, Chunmei Li
Source abstract
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 A X B = E , C X D = F , which arises frequently in experimental design. If we choose the initial iterative matrix X 0 = 0 , the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.