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

The least-squares solutions of inconsistent matrix equation over symmetric and antipersymmetric matrices

โœ Scribed by Dongxiu Xie; Yanping Sheng; Xiyan Hu

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
491 KB
Volume
16
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The generalized centro-symmetric and lea
The generalized centro-symmetric and least squares generalized centro-symmetric solutions of the matrix equation AYB + CYTD = E
โœ Masoud Hajarian; Mehdi Dehghan ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 270 KB

## Communicated by Y. Xu An nร—n real matrix P is said to be a symmetric orthogonal matrix if P = P -1 = P T . An nร—n real matrix Y is called a generalized centro-symmetric with respect to P, if Y = PYP. It is obvious that every matrix is also a generalized centrosymmetric matrix with respect to I.

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