A class of iteration methods for the matrix equation A×B = C
From MaRDI portal
Publication:3442325
DOI10.1017/S0004972700039216zbMath1121.65042OpenAlexW2097290633MaRDI QIDQ3442325
Konghua Guo, Xi-Yan Hu, Lei Zhang
Publication date: 18 May 2007
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700039216
algorithmconvergencepreconditioningiterative methodsmatrix equationleast squares solutionminimal norm solution
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- On the symmetric solutions of linear matrix equations
- On the symmetric solutions of a linear matrix equation
- Symmetric solutions of linear matrix equations by matrix decompositions
- An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation \(AXB\)=\(C\)
- L-structured matrices and linear matrix equations∗
- Common Solutions for n Matrix Equations With Applications
This page was built for publication: A class of iteration methods for the matrix equation A×B = C
