Convergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices

Open Access

1 January 1998

journal article
Published by American Mathematical Society (AMS) in Mathematics of Computation

Vol. 67 (221) , 209-220
https://doi.org/10.1090/s0025-5718-98-00893-x

Abstract

Non-stationary multisplitting algorithms for the solution of linear systems are studied. Convergence of these algorithms is analyzed when the coefficient matrix of the linear system is hermitian positive definite. Asynchronous versions of these algorithms are considered and their convergence investigated.

Keywords

This publication has 26 references indexed in Scilit:

Nonstationary parallel relaxed multisplitting methods
Linear Algebra and its Applications, 1996
A note on comparison theorems for splittings and multisplittings of Hermitian positive definite matrices
Linear Algebra and its Applications, 1996
Chaotic methods for the papallel solution of linear systems
Computing Systems in Engineering, 1995
On asynchronous iterations in partially ordered spaces
Numerical Functional Analysis and Optimization, 1991
Convergence of nested classical iterative methods for linear systems
Numerische Mathematik, 1990
On the convergence of asynchronous paracontractions with application to tomographic reconstruction from incomplete data
Linear Algebra and its Applications, 1990
Splitting and alternating direction methods
Published by Elsevier ,1990
Multisplittings and parallel iterative methods
Computer Methods in Applied Mechanics and Engineering, 1987
A Simple Approach to the Perron-Frobenius Theory for Positive Operators on General Partially-Ordered Finite-Dimensional Linear Spaces
Mathematics of Computation, 1973
The Theory of Matrices in Numerical Analysis.
The American Mathematical Monthly, 1966