๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


An iterative algorithm for the least squ
โœ Jing Cai; Guoliang Chen ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 555 KB

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

Approximating minimum norm solutions of
โœ Achiya Dax; Lars Eldรฉn ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 133 KB ๐Ÿ‘ 2 views

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