Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) (Q883858): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2006.08.169 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2006.08.169 / rank | |||
Normal rank | |||
Latest revision as of 06:53, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) |
scientific article |
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
