Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \(A_1XB_1 + C_1X^TD_1 = M_1, A_2XB_2 + C_2 X^TD_2 = M_2\) (Q426323): 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.2011.08.052 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025277247 / rank | |||
Normal rank | |||
Revision as of 22:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \(A_1XB_1 + C_1X^TD_1 = M_1, A_2XB_2 + C_2 X^TD_2 = M_2\) |
scientific article |
Statements
Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \(A_1XB_1 + C_1X^TD_1 = M_1, A_2XB_2 + C_2 X^TD_2 = M_2\) (English)
0 references
11 June 2012
0 references
The authors focus on the solution of the generalized Sylvester matrix equations. A conjugate gradient algorithm (CG) is proposed. When the matrix equations are consistent, by the CG algorithm, a solution can be obtained within finite steps in the absence of rounding-errors for any initial point. When the matrix equations are inconsistent, applying the CG algorithm to the normal equation, a least squares solution with minimum norm can be obtained.
0 references
generalized Sylvester matrix equations
0 references
least squares solution
0 references
conjugate gradient algorithm
0 references
normal equation
0 references
