Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
471780 | Computers & Mathematics with Applications | 2016 | 13 Pages |
Abstract
We study iterative methods for finding the largest Hermitian positive definite solution of the matrix equation X+∑i=1mAi∗X−1Ai=Q. Convergence rates of the basic fixed point iteration, inversion free variants of the basic fixed point iteration, and Stein iteration are considered. Some numerical examples are presented to illustrate the convergence behaviour of the various algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Vejdi I. Hasanov, Sevdzhan A. Hakkaev,