Parallel direct and hybrid methods based on row block partitioning for solving sparse linear systems
Torun, Fahreddin Şükrü
Item Usage Stats
MetadataShow full item record
Solving system of linear equations is a kernel operation in many scienti c and industrial applications. These applications usually give rise to linear systems in which the coe cient matrix is very large and sparse. The need for solving these large and sparse systems within a reasonable time necessitates e cient and e ective parallel solution methods. In this thesis, three novel approaches are proposed for reducing the parallel solution time of linear systems. First, a new parallel algorithm, ParBaMiN, is proposed in order to nd the minimum 2-norm solution of underdetermined linear systems, where the coe cient matrix is in the form of column overlapping block diagonal. The conducted experiments demonstrate the scalability of ParBaMiN on both shared and distributed memory architectures. Secondly, a new graph theoretical partitioning method is introduced in order to reduce the number of iterations in block Cimmino algorithm. Experimental results validate the e ectiveness of the proposed partitioning method in terms of reducing the required number of iterations. Finally, we propose a new parallel hybrid method, BCDcols, which further reduces the number of iterations of block Cimmino algorithm for matrices with dense columns. BCDcols combines the block Cimmino iterative algorithm and a dense direct method for solving the system. Experimental results show that BCDcols signi cantly improves the convergence rate of block Cimmino method and hence reduces the parallel solution time.
Solution of sparse linear systems
Underdetermined linear system