Iterative methods for solving linear matrix equation and linear matrix system
From MaRDI portal
Publication:3568418
DOI10.1080/00207160802195977zbMath1195.65059OpenAlexW2005314356MaRDI QIDQ3568418
Publication date: 11 June 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802195977
numerical examplesiterative methodlinear operatorlinear matrix equationleast norm solutionlinear matrix system
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A note on Sylvester-type equations ⋮ A modified gradient based algorithm for solving Sylvester equations ⋮ On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\) ⋮ An iterative method for the least squares solutions of the linear matrix equations with some constraint ⋮ On the generalized reflexive and anti-reflexive solutions to a system of matrix equations ⋮ A note on the \(\top\)-Stein matrix equation
Cites Work
- Unnamed Item
- Least-squares solution with the minimum-norm for the matrix equation \((A\times B,G\times H) = (C,D)\)
- Symmetric solutions of linear matrix equations by matrix decompositions
- Global FOM and GMRES algorithms for matrix equations
- A finite iterative method for solving a pair of linear matrix equations \((AXB,CXD)=(E,F)\)
- Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
- An efficient iterative method for solving the matrix equationAXB +CYD =E
- A Hessenberg-Schur method for the problem AX + XB= C
- The Matrix Equation $AXB + CXD = E$
- Best Approximate Solution of Matrix Equation AXB+CYD=E
This page was built for publication: Iterative methods for solving linear matrix equation and linear matrix system
