Ranks of least squares solutions of the matrix equation
โ Scribed by Yong Hui Liu
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 224 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
For a complex matrix equation AX B = C, we solve the following two problems: (1) the maximal and minimal ranks of least square solution X to AX B = C, and (2) the maximal and minimal ranks of two real matrices X 0 and X 1 in least square solution X = X 0 + iX 1 to AX B = C. We also give a necessary and sufficient condition for matrix equations A i X i B i = C i (i = 1, 2) to have a common least square solution.
๐ SIMILAR VOLUMES
In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X 0 , a solution X \* can be obtained in finite iteration steps in the absence of roundoff errors, and the
We in this paper first establish a new expression of the general solution to the consistent system of linear quaternion matrix equations A
In this paper we consider the solution of linear least squares problems min x Ax -b 2 2 where the matrix A โ R mรn is rank deficient. Put p = min{m, n}, let ฯ i , i = 1, 2, . . . , p, denote the singular values of A, and let u i and v i denote the corresponding left and right singular vectors. Then