A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm

by   F. Sukru Torun, et al.
Bilkent University
Middle East Technical University

We propose a novel block-row partitioning method in order to improve the convergence rate of the block Cimmino algorithm for solving general sparse linear systems of equations. The convergence rate of the block Cimmino algorithm depends on the orthogonality among the block rows obtained by the partitioning method. The proposed method takes numerical orthogonality among block rows into account by proposing a row inner-product graph model of the coefficient matrix. In the graph partitioning formulation defined on this graph model, the partitioning objective of minimizing the cutsize directly corresponds to minimizing the sum of inter-block inner products between block rows thus leading to an improvement in the eigenvalue spectrum of the iteration matrix. This in turn leads to a significant reduction in the number of iterations required for convergence. Extensive experiments conducted on a large set of matrices confirm the validity of the proposed method against a state-of-the-art method.


page 1

page 2

page 3

page 4


On the preconditioning of three-by-three block saddle point problems

We establish a new iterative method for solving a class of large and spa...

Comparison Theorems for Splittings of M-matrices in (block) Hessenberg Form

Some variants of the (block) Gauss-Seidel iteration for the solution of ...

A preconditioned MINRES method for block lower triangular Toeplitz systems

In this study, a novel preconditioner based on the absolute-value block ...

Admissible and attainable convergence behavior of block Arnoldi and GMRES

It is well-established that any non-increasing convergence curve is poss...

On averaging block Kaczmarz methods for solving nonlinear systems of equations

A class of averaging block nonlinear Kaczmarz methods is developed for t...

Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model

We consider nonoverlapping domain decomposition methods for the Rudin--O...

Communication-hiding pipelined BiCGSafe methods for solving large linear systems

Recently, a new variant of the BiCGStab method, known as the pipeline Bi...

Please sign up or login with your details

Forgot password? Click here to reset