A new method for solving matrix equation \(AXB+CX^T D=E\) (Q1649210)
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: A new method for solving matrix equation \(AXB+CX^T D=E\) |
scientific article; zbMATH DE number 6898819
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new method for solving matrix equation \(AXB+CX^T D=E\) |
scientific article; zbMATH DE number 6898819 |
Statements
A new method for solving matrix equation \(AXB+CX^T D=E\) (English)
0 references
5 July 2018
0 references
Summary: In this paper, we propose a new iterative algorithm to solve the matrix equation \(AXB+CX^T D=E\). The algorithm can obtain the minimal Frobenius norm solution or the least-squares solution with minimal Frobenius norm. Our algorithm is better than Algorithm II of the paper [the author et al., Appl. Math. Comput. 187, No. 2, 622--629 (2007; Zbl 1121.65048)].
0 references
iterative algorithm
0 references
Kronecker product
0 references
LSQR
0 references
matrix equation
0 references
least squares
0 references
0.9199119210243224
0 references
0.909637987613678
0 references
0.867912769317627
0 references
0.8500917553901672
0 references
