On the stability and performance of the solution of sparse linear systems by partitioned procedures

by   Abal-Kassim Cheik Ahamed, et al.

In this paper, we present, evaluate and analyse the performance of parallel synchronous Jacobi algorithms by different partitioned procedures including band-row splitting, band-row sparsity pattern splitting and substructuring splitting, when solving sparse large linear systems. Numerical experiments performed on a set of academic 3D Laplace equation and on a real gravity matrices arising from the Chicxulub crater are exhibited, and show the impact of splitting on parallel synchronous iterations when solving sparse large linear systems. The numerical results clearly show the interest of substructuring methods compared to band-row splitting strategies.


The operator-splitting method for Cahn-Hilliard is stable

We prove energy stability of a standard operator-splitting method for th...

A class of multiplicative splitting iterations for solving the continuous Sylvester equation

For solving the continuous Sylvester equation, a class of the multiplica...

A class of GADI methods for time-dependent linear systems with multitask kernel-learning parameter prediction

This paper develops a class of general alternating-direction implicit (G...

Parallel and Communication Avoiding Least Angle Regression

We are interested in parallelizing the Least Angle Regression (LARS) alg...

RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems

We introduce a randomized algorithm, namely RCHOL, to construct an appro...

A shift-splitting preconditioner for asymmetric saddle point problems

In this paper, we execute the shift-splitting preconditioner for asymmet...

Please sign up or login with your details

Forgot password? Click here to reset