Least-squares solutions of the matrix equations \(A X B + C Y D = H\) and \(A X B + C X D = H\) for symmetric arrowhead matrices and associated approximation problems (Q2336657)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Least-squares solutions of the matrix equations A X B + C Y D = H and A X B + C X D = H for symmetric arrowhead matrices and associated approximation problems |
scientific article; zbMATH DE number 7131812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Least-squares solutions of the matrix equations \(A X B + C Y D = H\) and \(A X B + C X D = H\) for symmetric arrowhead matrices and associated approximation problems |
scientific article; zbMATH DE number 7131812 |
Statements
Least-squares solutions of the matrix equations \(A X B + C Y D = H\) and \(A X B + C X D = H\) for symmetric arrowhead matrices and associated approximation problems (English)
0 references
19 November 2019
0 references
Summary: The least-squares solutions of the matrix equations \(A X B + C Y D = H\) and \(A X B + C X D = H\) for symmetric arrowhead matrices are discussed. By using the Kronecker product and stretching function of matrices, the explicit representations of the general solution are given. Also, it is shown that the best approximation solution is unique and an explicit expression of the solution is derived.
0 references
0 references
0.94098299741745
0 references
0.8652684688568115
0 references
0.8645219802856445
0 references
0.8481529951095581
0 references