Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
DOI10.1186/s13662-020-03185-9zbMath1485.65047OpenAlexW3165317919MaRDI QIDQ2668851
Adisorn Kittisopaporn, Pattrawut Chansangiam, Wicharn Lewkeeratiyutkul
Publication date: 7 March 2022
Published in: Advances in Difference Equations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13662-020-03185-9
Banach contraction principlegradientKronecker productmatrix normsgeneralized Sylvester matrix equationlinear difference vector equation
Matrix equations and identities (15A24) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical methods for matrix equations (65F45)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations
- Generalized conjugate direction algorithm for solving the general coupled matrix equations over symmetric matrices
- Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
- A modified gradient based algorithm for solving Sylvester equations
- A new version of successive approximations method for solving Sylvester matrix equations
- Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method
- An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
- Nonexpansive matrices with applications to solutions of linear systems by fixed point iterations
- An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices
- SOR for \(AX-XB=C\)
- Solving stable generalized Lyapunov equations with the matrix sign function
- Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems
- Hierarchical gradient-based identification of multivariable discrete-time systems
- The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
- A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation
- The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation
- The double-step scale splitting method for solving complex Sylvester matrix equation
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Iterative least-squares solutions of coupled sylvester matrix equations
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- Computational Methods for Linear Matrix Equations
- Truncated low‐rank methods for solving general linear matrix equations
- A Hessenberg-Schur method for the problem AX + XB= C
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- An accelerated Jacobi-gradient based iterative algorithm for solving sylvester matrix equations
- Hierarchical least squares identification methods for multivariable systems
- Gradient based iterative algorithms for solving a class of 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 gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
