Some convergence conditions for a class of parallel decomposition-type linear relaxation methods
type: Item
instance of: scholarly article
title: Some convergence conditions for a class of parallel decomposition-type linear relaxation methods
zbMATH Open document ID: 0996.65035
DOI: 10.1016/S0168-9274(01)00111-8
author: Ljiljana Cvetković
published in: Applied Numerical Mathematics
publication date: 2002-05-21T00:00:00Z
review text: 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.
reviewed by: Constantin Popa
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1743059
zbMATH Keywords: parallel decomposition methods
zbMATH Keywords: block H-matrices
zbMATH Keywords: SIMD multiprocessor systems
zbMATH Keywords: parallel computation
zbMATH Keywords: accelerated overrelaxation algorithms
zbMATH Keywords: large sparse linear systems
zbMATH Keywords: convergence
zbMATH Keywords: diagonally dominant matrices
MaRDI profile type: Publication
cites work: A class of parallel decomposition-type relaxation methods for large sparse systems of linear equations
cites work: On the convergence of a class of parallel decomposition-type relaxation methods
cites work: Some convergence results of PD relaxation methods
cites work: Accelerated Overrelaxation Method
cites work: Q5342712
cites work: Q5604166
full work available at URL: s0168-9274(01)00111-8
OpenAlex ID: W2068945607
description: scientific article; zbMATH DE number 1743059