Asynchronous multisplitting iteration with different weighting schemes
type: Item
instance of: scholarly article
title: Asynchronous multisplitting iteration with different weighting schemes
zbMATH Open document ID: 1195.65036
author: Fang Chen
published in: Applied Mathematics and Computation
publication date: 2010-06-25T00:00:00Z
review text: The multisplitting iteration method was presented by O'Leary and White for solving large sparse linear systems on parallel multiprocessor system. In this paper, an asynchronous variant for the multisplitting iteration method with different weighting schemes studied by White is set up. Moreover, a general convergence criterion for asynchronous iteration framework is established, and then the convergence of the new asynchronous multisplitting iteration method with different weighting schemes is proven by making use of this general criterion.
reviewed by: Juri M. Rappoport
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 5726744
zbMATH Keywords: asynchronous multisplitting iteration
zbMATH Keywords: convergence
zbMATH Keywords: weighting matrix
MaRDI profile type: Publication
full work available at URL: j.amc.2009.12.027
OpenAlex ID: W2065714202
cites work: Q4719166
cites work: A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
cites work: On the theory and practice of multisplitting methods in parallel computation
cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems
cites work: A CLASS OF ASYNCHRONOUS PARALLEL MATRIX MULTISPLITTING RELAXATION METHODS
cites work: A CLASS OF ASYNCHRONOUS PARALLEL NONLINEAR MULTISPLITTING RELAXATION METHODS
cites work: Multisplitting with Different Weighting Schemes
DOI: 10.1016/J.AMC.2009.12.027
description: scientific article; zbMATH DE number 5726744