A modified gradient based algorithm for solving matrix equations AXB+CX^T D=F
Summary: In this paper, we develop a modified gradient based algorithm for solving matrix equations \(AXB+CX^T D=F\). Different from the gradient based method introduced by \textit{L. Xie} et al. [Appl. Math. Comput. 217, No. 5, 2191--2199 (2010; Zbl 1210.65097)] the information generated in the first half-iterative step is fully exploited and used to construct the approximate solution. Theoretical analysis shows that the new method converges under certain assumptions. Numerical results are given to verify the efficiency of the new method.
- Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
- The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\)
- Gradient based iterative algorithms for solving a class of matrix equations
- A modified gradient-based algorithm for solving extended sylvester-conjugate matrix equations
- Modified conjugate gradient method for the solution of \(Ax=b\)
- Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
- Modifying a numerical algorithm for solving the matrix equation X + AX T B = C
- scientific article; zbMATH DE number 6718565
- A numerical algorithm for solving the matrix equation AX + X^TB = C
- Gradient based iterative solutions for general linear matrix equations
This page was built for publication: A modified gradient based algorithm for solving matrix equations \(AXB+CX^T D=F\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714819)