Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\) (Q883858): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The symmetric solution of the matrix equations \(AX+YA=C, AXA^ t+BYB^ t=C\), and \((A^ tXA, B^ tXB)=(C,D)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091368 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040931 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation \(AXB\)=\(C\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On solutions of matrix equation \(AXB+CYD=F\) / rank | |||
Normal rank |
Revision as of 20:02, 25 June 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