| dc.creator | Assimakis N., Adam M. | en |
| dc.date.accessioned | 2023-01-31T07:33:43Z | |
| dc.date.available | 2023-01-31T07:33:43Z | |
| dc.date.issued | 2022 | |
| dc.identifier | 10.1515/math-2022-0546 | |
| dc.identifier.issn | 23915455 | |
| dc.identifier.uri | http://hdl.handle.net/11615/70885 | |
| dc.description.abstract | In this article, new iterative algorithms for solving the discrete Riccati and Lyapunov equations are derived in the case where the transition matrix is diagonalizable with real eigenvalues. It is shown that the proposed iterative algorithms are faster than the classical ones, even for a small number of iterations. © 2022 the author(s), published by De Gruyter. | en |
| dc.language.iso | en | en |
| dc.source | Open Mathematics | en |
| dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85146281458&doi=10.1515%2fmath-2022-0546&partnerID=40&md5=029dbd973e6aef2c94ffb52d70200cbb | |
| dc.subject | De Gruyter Open Ltd | en |
| dc.title | Fast iterative solutions of Riccati and Lyapunov equations | en |
| dc.type | journalArticle | en |
