A note on ``A new iteration method for the matrix equation AX=B

DOI10.1016/J.AMC.2012.04.025zbMATH Open1261.65045OpenAlexW2028722675MaRDI QIDQ450291FDOQ450291

Authors: Weijun Zhou 

Publication date: 13 September 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.04.025

Recommendations

• A new iteration method for the matrix equation \(AX = B\)
• Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
• Comments on ‘An efficient iterative method for solving the matrix equation AXB +CYD =E ’
• A class of iteration methods for the matrix equation A×B = C
• Two-step AOR iteration method for the linear matrix equation \(AXB=C\)

zbMATH Keywords

matrix equationsteepest descent methodexact line search

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Matrix equations and identities (15A24)

Cites Work

• Optimization theory and methods. Nonlinear programming
• A new iteration method for the matrix equation \(AX = B\)

Cited In (3)

• A class of iteration methods for the matrix equation A×B = C
• Comments on ‘An efficient iterative method for solving the matrix equation AXB +CYD =E ’
• Some remarks on Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(A X B = C\)

This page was built for publication: A note on ``A new iteration method for the matrix equation \(AX=B\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450291)