A note on ``Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method
From MaRDI portal
Publication:2233263
DOI10.1016/J.AML.2021.107149zbMATH Open1503.65082OpenAlexW3136735407MaRDI QIDQ2233263FDOQ2233263
Publication date: 15 October 2021
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2021.107149
Recommendations
- Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method
- Modification on the convergence results of the Sylvester matrix equation \(AX+XB=C\)
- Factor gradient iterative algorithm for solving a class of discrete periodic Sylvester matrix equations
- Iterative solutions to Sylvester matrix equations
- New proof of the gradient-based iterative algorithm for the Sylvester conjugate matrix equation
Cites Work
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Gradient based iterative algorithms for solving a class of matrix equations
- Gradient-based maximal convergence rate iterative method for solving linear matrix equations
- Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method
- Reduced-rank gradient-based algorithms for generalized coupled Sylvester matrix equations and its applications
Cited In (2)
This page was built for publication: A note on ``Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233263)