An implicit iterative algorithm with a tuning parameter for Itô Lyapunov matrix equations

In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning parameter is introduced in this algorithm, and thus the convergence rate of the algorithm can be changed. Some conditions are presented such...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of systems science Jg. 49; H. 2; S. 425 - 434
Hauptverfasser: Zhang, Ying, Wu, Ai-Guo, Sun, Hui-Jie
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 25.01.2018
Taylor & Francis Ltd
Schlagworte:
Algorithms
Convergence
convergence rate
discrete Lyapunov matrix equations
Iterative algorithms
Iterative methods
Linear systems
Matrix methods
Queuing theory
Smith iteration
Tuning
ISSN:0020-7721, 1464-5319
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning parameter is introduced in this algorithm, and thus the convergence rate of the algorithm can be changed. Some conditions are presented such that the developed algorithm is convergent. In addition, an explicit expression is also derived for the optimal tuning parameter, which guarantees that the obtained algorithm achieves its fastest convergence rate. Finally, numerical examples are employed to illustrate the effectiveness of the given algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7721
1464-5319
DOI:10.1080/00207721.2017.1407009