The optimal convergence factor of the gradient based iterative algorithm for linear matrix equations
From MaRDI portal
Publication:2856867
DOI10.2298/FIL1203607WzbMath1289.65112OpenAlexW2124459533MaRDI QIDQ2856867
Publication date: 30 October 2013
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1203607w
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
The least squares anti-bisymmetric solution and the optimal approximation solution for Sylvester equation ⋮ Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\) ⋮ Gradient-based iterative algorithms for generalized coupled Sylvester-conjugate matrix equations ⋮ The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation ⋮ Iterative Hermitian R-conjugate solutions to general coupled sylvester matrix equations ⋮ Finite iterative algorithms for the generalized reflexive and anti-reflexive solutions of the linear matrix equation AXB = C ⋮ Commuting solutions of the Yang-Baxter-like matrix equation for a class of rank-two updated matrices ⋮ GRADIENT BASED ITERATIVE ALGORITHM TO SOLVE GENERAL COUPLED DISCRETE-TIME PERIODIC MATRIX EQUATIONS OVER GENERALIZED REFLEXIVE MATRICES ⋮ On the relaxed gradient-based iterative methods for the generalized coupled Sylvester-transpose matrix equations
This page was built for publication: The optimal convergence factor of the gradient based iterative algorithm for linear matrix equations
