Parallel, synchronous and asynchronous two-stage multisplitting methods
From MaRDI portal
(Redirected from Publication:1920170)
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 studied. Computational experiments on a shared memory multiprocessor vector computer are presented.
Recommendations
Cited in
(38)- Convergence behaviors of multisplitting methods with \(K+1\) relaxed parameters
- Convergence of two-stage multisplitting method using AOR or SSOR multisplittings
- Nonstationary two-stage multisplitting methods with overlapping blocks
- Asynchronous two-stage iterative methods
- Convergence of two-stage iterative methods for Hermitian positive definite matrices
- Nonstationary multisplittings with general weighting matrices for non-Hermitian positive definite systems
- On asynchronous iterations
- Asynchronous iterations with flexible communication: contracting operators
- Convergence of parallel multisplitting methods using ILU factorizations.
- Nonstationary parallel relaxed multisplitting methods
- A note on the inner-outer iterative method for solving the linear equation Ax = b
- Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
- Inexact multisplitting methods for linear complementarity problems
- Convergence of two-stage and multisplitting methods using various types of splittings
- Modified quasi-Chebyshev acceleration to nonoverlapping parallel multisplitting method
- Convergence of SSOR multisplitting method for an \(M\)-matrix
- Parallel relaxed multisplitting methods for a symmetric positive definite matrix
- A note on the parallel GSAOR method for block diagonally dominant matrices
- Non-stationary parallel multisplitting methods
- Non-stationary parallel multisplitting algorithms for almost linear systems
- Semiconvergence of parallel multisplitting methods for symmetric positive semidefinite linear systems.
- Convergence improvement of relaxed multisplitting USAOR methods for H-matrices linear systems
- Two-Stage and Multisplitting Methods for the Parallel Solution of Linear Systems
- scientific article; zbMATH DE number 1217724 (Why is no real title available?)
- scientific article; zbMATH DE number 1282020 (Why is no real title available?)
- scientific article; zbMATH DE number 741112 (Why is no real title available?)
- Convergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices
- Relaxed parallel two-stage multisplitting methods II: Asynchronous version
- Relaxed parallel two-stage multisplitting methods∗
- scientific article; zbMATH DE number 817442 (Why is no real title available?)
- Asynchronous multisplitting methods for linear and nonlinear systems
- Convergence of nonstationary multisplitting methods using ILU factorizations
- Nonstationary two-stage multisplitting methods for symmetric positive definite matrices
- Asynchronous multisplitting-based primal Schur method
- A two-stage parallel iteration method for nonlinear complementarity problems
- Multisplitting iteration schemes for solving a class of nonlinear complementarity problems
- Convergence of SSOR multisplitting method for an \(H\)-matrix
- Asynchronous multisplitting GAOR method and asynchronous multisplitting SSOR method for systems of weakly nonlinear equations
This page was built for publication: Parallel, synchronous and asynchronous two-stage multisplitting methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920170)
