𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The parallel multisplitting TOR (MTOR) method for linear systems

✍ Scribed by Da-Wei Chang

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
716 KB
Volume
41
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, the parallel multisplitting TOR (MTOR) method ie proposed by Chang [l], for solving a large nonsingular system of linear equations AZ = b. The convergence theorem of the MTOR method is established under the condition that the coefficient matrix A is an H-matrix; our theorems improve and extend some known results. Finally, the numerical examples are given; they show that our algorithm is feasible and efficient.

πŸ“œ SIMILAR VOLUMES

Non-stationary parallel multisplitting a
Non-stationary parallel multisplitting algorithms for almost linear systems
✍ Josep Arnal; Violeta MigallΓ³n; JosΓ© PenadΓ©s πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 100 KB

Non-stationary parallel multisplitting iterative methods are introduced for the solution of almost linear systems. A non-stationary parallel algorithm based on the AOR-type methods and its extension to asynchronous models are considered. Convergence properties of the synchronous and asynchronous ver

A multiplicative multisplitting method f
A multiplicative multisplitting method for solving the linear complementarity problem
✍ Haijian Yang; Qingguo Li πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 589 KB

The convergence of the multiplicative multisplitting-type method for solving the linear complementarity problem with an H-matrix is discussed using classical and new results from the theory of splitting. This directly results in a sufficient condition for guaranteeing the convergence of the multipli