A Parallel Preconditioned Modified Conjugate Gradient Method for Large Sylvester Matrix Equation

Computational effort of solving large-scale Sylvester equations AX+XB+F=O is frequently hindered in dealing with many complex control problems. In this work, a parallel preconditioned algorithm for solving it is proposed based on combination of a parameter iterative preconditioned method and modifie...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical problems in engineering 2014-01, Vol.2014 (2014), p.1-7
Hauptverfasser: Hou, Junxia, Lv, Quanyi, Xiao, Manyu
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Computational effort of solving large-scale Sylvester equations AX+XB+F=O is frequently hindered in dealing with many complex control problems. In this work, a parallel preconditioned algorithm for solving it is proposed based on combination of a parameter iterative preconditioned method and modified form of conjugate gradient (MCG) method. Furthermore, Schur’s inequality and modified conjugate gradient method are employed to overcome the involved difficulties such as determination of parameter and calculation of inverse matrix. Several numerical results finally show that high performance of proposed parallel algorithm is obtained both in convergent rate and in parallel efficiency.
ISSN:1024-123X
1563-5147
DOI:10.1155/2014/598716