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

Least squares solution of the quaternion matrix equation with the least norm

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

Book ID
115459730
Publisher
Taylor and Francis Group
Year
2011
Tongue
English
Weight
156 KB
Volume
59
Category
Article
ISSN
0308-1087

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

Least Squares Approximate and Least Norm
Least Squares Approximate and Least Norm Solutions of Paired Singular Equations
โœ Frank-Olme Speck ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 977 KB

Suinmary. Paired operators T = d , P + A 2 & on a HILBERT spzce are studied where P is a projector, P+Q = I , and the coefficients are linear invertible operators. The MOORE-PENXOSE inverse of T can be obtained explicitly from a factorization of the coefficients, which is equivalent to the normal so

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