On a Hierarchical Parallel Algebraic Domain Decomposition Linear Solver - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

On a Hierarchical Parallel Algebraic Domain Decomposition Linear Solver

(1, 2) , (1) , (2) , (1, 2) , (1, 2)
1
2

Abstract

The solution of linear systems is often the most computational consuming kernel in large complex numerical simulations. In this talk, we will describe a parallel algebraic hierarchical linear solver for sparse linear systems. The numerical scheme based on a partition of the adjacency graph of a sparse matrix, that leads to the solution of a Schur complement system, will be presented as well as the related preconditioning technique. Parallel numerical experiments of the hybrid direct/iterative technique will be described on 3D examples from both academic and industrial relevance. Prospective for implementations on many- cores heterogeneous systems on runtime systems will be discussed.
Not file

Dates and versions

hal-00726630 , version 1 (30-08-2012)

Identifiers

  • HAL Id : hal-00726630 , version 1

Cite

Emmanuel Agullo, Luc Giraud, Abdou Guermouche, Stojce Nakov, Jean Roman. On a Hierarchical Parallel Algebraic Domain Decomposition Linear Solver. Scalable Hierarchical Algorithms for eXtreme Computing (SHAX-C) Workshop, Apr 2012, Kaust, Saudi Arabia. ⟨hal-00726630⟩

Collections

CNRS INRIA INRIA2
143 View
1 Download

Share

Gmail Facebook Twitter LinkedIn More