Some convergence conditions for a class of parallel decomposition-type linear relaxation methods (Q1349133): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0168-9274(01)00111-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2068945607 / rank | |||
Normal rank |
Latest revision as of 09:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some convergence conditions for a class of parallel decomposition-type linear relaxation methods |
scientific article |
Statements
Some convergence conditions for a class of parallel decomposition-type linear relaxation methods (English)
0 references
21 May 2002
0 references
The author describes a four-parameter parallel decomposition-type accelerated overrelaxation algorithm for numerical solution of large sparse systems of linear equations on SIMD multiprocessor systems. Convergence is firstly proved for the class of block strictly diagonally dominant matrices and then extended to the whole class of block H-matrices, under appropriate and easy to verify assumptions involving the four relaxation parameters.
0 references
parallel decomposition methods
0 references
block H-matrices
0 references
SIMD multiprocessor systems
0 references
parallel computation
0 references
accelerated overrelaxation algorithms
0 references
large sparse linear systems
0 references
convergence
0 references
diagonally dominant matrices
0 references
0 references