Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) (Q883858)
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: Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) |
scientific article; zbMATH DE number 5163739
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) |
scientific article; zbMATH DE number 5163739 |
Statements
Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) (English)
0 references
12 June 2007
0 references
The authors propose a new iterative method for approximating the minimal norm solution of the matrix equation \(AXB + CX^TD=E\), for both consistent and inconsistent case. They prove the convergence of the new method and present numerical experiments on some model problems.
0 references
iterative algorithm
0 references
Kronecker product
0 references
conjugate gradient method
0 references
matrix equation
0 references
minimal norm solution
0 references
numerical experiments
0 references
0 references
0 references
0.94010484
0 references
0.9383462
0 references
0.9310474
0 references
0.9291277
0 references
