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

Least squares Hermitian solution of the matrix equation with the least norm over the skew field of quaternions

โœ Scribed by Shifang Yuan; Anping Liao; Yuan Lei

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
249 KB
Volume
48
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Least-squares solution with the minimum-
Least-squares solution with the minimum-norm for the matrix equation (AXB, GXH) = (C, D)
โœ An-Ping Liao; Yuan Lei ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 607 KB

Based on the projection theorem m Hfibert space, by making use of the generahzed singular value decompomtion and the canomcal correlation decomposition, an analytical expression of the least-squares solutmn for the matrix equatmn (AXB, GXH) = (C, D) with the minimum-norm is derived An algorithm for

Ranks of least squares solutions of the
Ranks of least squares solutions of the matrix equation
โœ Yong Hui Liu ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

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

An iterative algorithm for the least squ
An iterative algorithm for the least squares bisymmetric solutions of the matrix equations
โœ 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