Non‐stationary parallel multisplitting algorithms for almost linear systems * | Zendy

Arnal Josep | Zendy; Migallón Violeta | Zendy; Penadés José | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Non‐stationary parallel multisplitting algorithms for almost linear systems *

Author(s) -

Arnal Josep,

Migallón Violeta,

Penadés José

Publication year - 1999

Publication title -

numerical linear algebra with applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.02

H-Index - 53

eISSN - 1099-1506

pISSN - 1070-5325

DOI - 10.1002/(sici)1099-1506(199903)6:2<79::aid-nla148>3.0.co;2-w

Subject(s) - asynchronous communication , linear system , convergence (economics) , multiprocessing , mathematics , parallel algorithm , algorithm , extension (predicate logic) , parallel computing , computer science , mathematical analysis , computer network , economics , programming language , economic growth

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 versions of these methods are studied for M ‐matrices and H ‐matrices. Furthermore, computational results about these methods on a distributed memory multiprocessor, which illustrate the performance of the algorithms studied, are discussed. Copyright © 1999 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research