Practical convergent splittings and acceleration methods for non-Hermitian positive definite linear systems (Q360463): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10444-012-9278-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2087573007 / rank | |||
Normal rank |
Revision as of 00:59, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Practical convergent splittings and acceleration methods for non-Hermitian positive definite linear systems |
scientific article |
Statements
Practical convergent splittings and acceleration methods for non-Hermitian positive definite linear systems (English)
0 references
27 August 2013
0 references
Let \(A\) be a (large and sparse) non-Hermitian matrix, then for solving the linear system \(Ax=b\) by a Chebyshev semi-iterative scheme, this matrix is split as \(A=M-N\) with \(M\) or \(N\) (positive definite) Hermitian. This leads to iterations of the form \(x_{k+1}=H(x_k;\alpha_k)\) with \(H(x,\alpha)=\alpha(M^{-1}Nx+M^{-1}b-x)+x\). In this paper, the analysis is performed for three such splittings. Necessary and sufficient conditions for convergence are given depending on the properties of the matrices \(M\) and \(N\) as well as lower bounds for the rate of convergence under some additional conditions involving also the choice of the scalar parameters \(\alpha_k\). This \(\alpha_k\) controls the stepsize by minimizing some weighted residual norm.
0 references
positive definite linear systems
0 references
non-Hermitian matrix
0 references
convergent splitting
0 references
acceleration methods
0 references
sparse matrix
0 references