Parallel hybrid iteration methods for block bordered linear systems
Parallel iterative methods are discussed to solve large sparse block bordered systems of linear equations. The iterative methods are based on Gauss-Seidel, successive overrelaxation or accelerated overrelaxation iteration. However, for the pivotal diagonal block, the multisplitting technique is employed to enhance parallelism (more precisely processor utilization). Convergence is proved for linear systems the coefficient matrix of which is an \(M\)-matrix, an \(H\)-matrix, or a symmetric positive definite matrix. The parallel methods are compared by means of a 2-processor simulation with the well-known stationary methods by means of the number of iteration steps needed to solve a simplistic system of equations.
- A class of parallel hybrid two-stage iteration methods for block bordered linear systems
- Parallel iterative solvers for boundary value methods
- scientific article; zbMATH DE number 954670
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Convergence of parallel multisplitting USAOR methods for block H-matrices linear systems
- Accelerated Overrelaxation Method
- Convergence of parallel multisplitting iterative methods for M-matrices
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Matrix multi-splitting multi-parameter relaxation methods
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- On the convergence of the parallel multisplitting AOR algorithm
- Topological proofs for certain theorems on matrices with non-negative elements
- A partitioning scheme and iterative solution for sparse bordered systems
- A class of parallel hybrid two-stage iteration methods for block bordered linear systems
- Parallel iterative solvers for boundary value methods
- The block preconditioned \textit{LSQR} and \textit{GL}-\textit{LSQR} algorithms for the block partitioned matrices
- Max norm estimation for the inverse of block matrices
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- Fast Solvers for Systems of Linear Equations with Block-Band Matrices
This page was built for publication: Parallel hybrid iteration methods for block bordered linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126588)