Parallel scalability study of hybrid preconditioners in three dimensions

Authors:
L. Giraud;A. Haidar;L. T. Watson
Affiliations:
ENSEEIHT-IRIT, 2 Rue Camichel, 31071 Toulouse Cedex, France;CERFACS, 42 Avenue G. Coriolis, 31057 Toulouse Cedex, France;Departments of Computer Science and Mathematics, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, USA
Venue:
Parallel Computing
Year:
2008

Citing 6
Cited 3

Toward parallel mathematical software for elliptic partial differential equations

ACM Transactions on Mathematical Software (TOMS)
Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
The Multifrontal Solution of Indefinite Sparse Symmetric Linear

ACM Transactions on Mathematical Software (TOMS)
Algebraic Two-Level Preconditioners for the Schur Complement Method

SIAM Journal on Scientific Computing
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling

SIAM Journal on Matrix Analysis and Applications
Hybrid scheduling for the parallel solution of linear systems

Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)

Using multiple levels of parallelism to enhance the performance of domain decomposition solvers

Parallel Computing
On techniques to improve robustness and scalability of a parallel hybrid linear solver

VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
Parallel algebraic domain decomposition solver for the solution of augmented systems

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the parallel scalability of variants of additive Schwarz preconditioners for three dimensional non-overlapping domain decomposition methods. To alleviate the computational cost, both in terms of memory and floating-point complexity, we investigate variants based on a sparse approximation or on mixed 32- and 64-bit calculation. The robustness of the preconditioners is illustrated on a set of linear systems arising from the finite element discretization of elliptic PDEs through extensive parallel experiments on up to 1000 processors. Their efficiency from a numerical and parallel performance view point are studied.