Nonstationary parallel relaxed multisplitting methods
نویسندگان
چکیده
منابع مشابه
Nonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H−matrices
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.
متن کاملNon - Stationary Parallel Multisplitting Aor Methods ∗
Non-stationary parallel multisplitting iterative methods based on the AOR method are studied for the solution of nonsingular linear systems. Convergence of the synchronous and asyn-chronous versions of these methods is studied for H–matrices. Furthermore, computational results about these methods on both shared and distributed memory multiprocessors are discussed. The numerical examples present...
متن کاملParallel multisplitting methods for singular linear systems
In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with the coefficient matrices are singular H-matrices. And we present the sufficient and necessary conditions for convergence of the extrapolated iterative methods. Moreover, we apply the results to the GMAOR methods. Finally, we give one numerical example. Keywords—singular H-matrix, linear systems, ...
متن کاملParallel , Synchronous and Asynchronous Two - Stage Multisplitting
Different types of synchronous and asynchronous two-stage multisplitting algorithms for the solution of linear systems are analyzed. The different algorithms which appeared in the literature are reviewed, and new ones are presented. Convergence properties of these algorithms are studied when the matrix in question is either monotone or an H-matrix. Relaxed versions of these algorithms are also ...
متن کاملConvergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices
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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(95)00583-8