Displaying similar documents to “Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations”

New SOR-like methods for solving the Sylvester equation

Jakub Kierzkowski (2015)

Open Mathematics

Similarity:

We present new iterative methods for solving the Sylvester equation belonging to the class of SOR-like methods, based on the SOR (Successive Over-Relaxation) method for solving linear systems. We discuss convergence characteristics of the methods. Numerical experimentation results are included, illustrating the theoretical results and some other noteworthy properties of the Methods.

Influence of preconditioning and blocking on accuracy in solving Markovian models

Beata Bylina, Jarosław Bylina (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The article considers the effectiveness of various methods used to solve systems of linear equations (which emerge while modeling computer networks and systems with Markov chains) and the practical influence of the methods applied on accuracy. The paper considers some hybrids of both direct and iterative methods. Two varieties of the Gauss elimination will be considered as an example of direct methods: the LU factorization method and the WZ factorization method. The Gauss-Seidel iterative...

A convergence analysis of SOR iterative methods for linear systems with weakH-matrices

Cheng-yi Zhang, Zichen Xue, Shuanghua Luo (2016)

Open Mathematics

Similarity:

It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices). However, the same can not be true in case of those iterative methods for linear systems with weak H-matrices (whose comparison matrices are singular M-matrices). This paper proposes some necessary and sufficient conditions such that SOR iterative...