Pierre Ramet
Pierre Ramet
About
Posts
Projects
Publications
HAL
BIB
Contact
CV
Light
Dark
Automatic
Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition
A. Casadei
,
P. Ramet
,
J. Roman
March 2015
Cite
Type
Conference paper
Publication
Mini-Symposium on "Partitioning for Complex Objectives" at SIAM CSE'15 conference
Sparse
Related
A task-based sparse direct solver suited for large scale hierarchical/heterogeneous architectures
Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition
On the design of parallel linear solvers for large scale problems
Optimizations of hybrid sparse linear solvers relying on Schur complement and domain decomposition approaches
Scheduling and memory optimizations for sparse direct solver on multi-core/multi-gpu duster systems
Cite
×