Comparison theorems for splittings of matrices (Q1849664)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Comparison theorems for splittings of matrices |
scientific article |
Statements
Comparison theorems for splittings of matrices (English)
0 references
1 December 2002
0 references
Let \(A\in \mathbb{C}^{n\times n}\) and \(x,b\in \mathbb{C}^n\) with \(x\) unknown. In order to solve a linear system of the form \(Ax=b\) with iterative methods, the author splits the matrix \(A\) into \(A=M-N\) (or \(A=M_{k}-N_{k}\), \(k=1,2,\dots ,m\) ``parallel multisplitting method'') with \(M\) nonsingular (\(M_{k}\) nonsingular) and then uses iterative formulas for solving the system. The transition matrices used in these iterative formula are functions of the matrices \(M,N\) (or \(M_{k},N_{k}\)). This paper suggests two different nonnegative splitting methods (nonnegative parallel multisplitting methods) and then, based on the nonnegative matrix theory, compares the asymptotic rates of convergence of its iteration matrices. The above comparisons are also applied for the special case where \(A\) is a Hermitian positive (semi)definite matrix.
0 references
comparison of methods
0 references
parallel computation
0 references
iterative methods
0 references
multisplitting method
0 references
nonnegative splitting methods
0 references
convergence
0 references
Hermitian positive semidefinite matrix
0 references