Convergence analysis of a gradient iterative algorithm with optimal convergence factor for a generalized Sylvester-transpose matrix equation
DOI10.3934/math.2021492zbMath1485.65045OpenAlexW3170785686MaRDI QIDQ2130876
Nunthakarn Boonruangkan, Pattrawut Chansangiam
Publication date: 25 April 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2021492
gradientKronecker productBanach fixed-point theoremmatrix normgeneralized Sylvester-transpose matrix equation
Matrix equations and identities (15A24) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Equations involving linear operators, with operator unknowns (47A62) Numerical methods for matrix equations (65F45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A property of the eigenvalues of the symmetric positive definite matrix and the iterative algorithm for coupled Sylvester matrix equations
- A modified gradient based algorithm for solving Sylvester equations
- On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
- Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
- The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation
- Reduced order observers: A new algorithm and proof
- Nonexpansive matrices with applications to solutions of linear systems by fixed point iterations
- On robust observer compensator design
- Solving stable generalized Lyapunov equations with the matrix sign function
- Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Iterative least-squares solutions of coupled sylvester matrix equations
- Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
- On Hermitian and Skew-Hermitian Splitting Ietration Methods for the Continuous Sylvester Equations
- Consistency of a pair of generalized Sylvester equations
- Solution to Generalized Sylvester Matrix Equations
- Gradient based iterative algorithms for solving a class of matrix equations
- Kronecker Maps and Sylvester-Polynomial Matrix Equations
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Recursive blocked algorithms for solving triangular systems—Part I
- Recursive blocked algorithms for solving triangular systems—Part II
- Observer-based Adaptive fuzzy control of time-delay uncertain nonlinear systems
This page was built for publication: Convergence analysis of a gradient iterative algorithm with optimal convergence factor for a generalized Sylvester-transpose matrix equation
