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

DOI10.1016/j.parco.2009.12.006zbMath1204.68262OpenAlexW2044876722MaRDI QIDQ991110

A. Haidar, S. Pralet, Luc Giraud

Publication date: 2 September 2010

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.parco.2009.12.006

zbMATH Keywords

domain decompositionhigh performance computinglarge scale linear systemshybrid iterative/direct linear solvermultilevel of parallel implementation

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Parallel algorithms in computer science (68W10) Numerical linear algebra (65F99)

Related Items

A SBS-BD based solver for domain decomposition in BE methods

Uses Software

• GMRES
• ScaLAPACK
• MUMPS
• FGMRES
• MPI/MPICH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• A high-performance, portable implementation of the MPI message passing interface standard
• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
• Numerical stability of GMRES
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Solution of Sparse Indefinite Systems of Linear Equations
• ScaLAPACK Users' Guide
• The Construction of Preconditioners for Elliptic Problems by Substructuring. I
• Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into Substructures
• Local preconditioners for two‐level non‐overlapping domain decomposition methods
• Algorithm 842
• Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES