Recursive Schur Decomposition

2012/10/23 by Rahul S. Sampath, Bobby Philip, Sampath, Rahul S. +5
Computer Science · Mathematics · #65F08 #65F10 #65N55 #65Y05 #68W10 #68W15 #Distributed #FOS: Computer and information sciences #FOS: Mathematics #Numerical Analysis (math.NA) #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.NA #math.NA #msc:65F08 #msc:65F10 #msc:65N55 #msc:65Y05 #msc:68W10 #msc:68W15

paper · pdf · doi:10.48550/arxiv.1210.6266

arxiv created 2012/10/23 · arxiv updated 2012/10/24

Abstract

In this article, we present a parallel recursive algorithm based on multi-level domain decomposition that can be used as a precondtioner to a Krylov subspace method to solve sparse linear systems of equations arising from the discretization of partial differential equations (PDEs). We tested the effectiveness of the algorithm on several PDEs using different number of sub-domains (ranging from 8 to 32768) and various problem sizes (ranging from about 2000 to over a billion degrees of freedom). We report the results from these tests; the results show that the algorithm scales very well with the number of sub-domains.

Related

• Recursive sparse LU decomposition based on nested dissection and low rank approximations
• parGeMSLR: A Parallel Multilevel Schur Complement Low-Rank Preconditioning and Solution Package for General Sparse Matrices
• Sparse Grid Discretizations based on a Discontinuous Galerkin Method
• A Non-Recursive, Dimension-Independent Schur-Decomposition Algorithm for N-Dimensional Sylvester Tensor Equations
• A Non-Krylov subspace Method for Solving Large and Sparse Linear System of Equations