Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) (Q883858): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.08.169 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084239806 / rank | |||
Normal rank | |||
Revision as of 01:12, 20 March 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
