.png){kind=icon}
.png){kind=icon}
Return
Computing the least-square solutions for centrohermitian matrix problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.04.104.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose several algorithms for computing the solutions of the following three problems: Problem I: Given X, B is an element of C-n x m(n > m), find a centrohermitian matrix A is an element of C-n x n such that vertical bar vertical bar AX - B vertical bar vertical bar = min. Problem II: Given X, B is an element of C-n x m (n > m). find a centrohermitian matrix A is an element of C-n x n such that AX = B. Problem III: Let 9 be the solution set of Problem I or Problem II. Given (A) over tilde C-n x n, find A* is an element of Y such that vertical bar vertical bar(A) over tilde - (A) over tilde vertical bar vertical bar = inf(A is an element of l) vertical bar vertical bar(A) over tilde - A vertical bar vertical bar, where vertical bar vertical bar center dot vertical bar vertical bar is the Frobenius norm. We show that our algorithms ensure significant savings in computational costs, as compared to the case of an arbitrary matrix A. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
centrohermitian matrix
optimal approximation
least-squares solution
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available