Torun, Fahreddin Şükrü2017-08-292017-08-292017-082017-082017-08-18http://hdl.handle.net/11693/33568Cataloged from PDF version of article.Thesis (Ph.D.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2017.Includes bibliographical references (leaves 103-113).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.xiii, 119 leaves : charts ; 30 cmEnglishinfo:eu-repo/semantics/openAccessSparse matrixSolution of sparse linear systemsParallel algorithmsDirect methodsLiterative methodsHybrid methodsUnderdetermined linear systemGraphGraph partitioningSchur complementParallel direct and hybrid methods based on row block partitioning for solving sparse linear systemsSeyrek doğrusal sistemleri çözmek için satır blok bölümlemeye dayalı paralel direkt ve hibrit metotlarThesisB156108