Recursive Schur Decomposition
From MaRDI portal
Publication:6236591
arXiv1210.6266MaRDI QIDQ6236591FDOQ6236591
Authors: Rahul S. Sampath, B. Philip, Srikanth Allu, Srdjan Simunovic 
Publication date: 23 October 2012
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.
Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
This page was built for publication: Recursive Schur Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236591)
