Pierre Ramet
Pierre Ramet
About
Posts
Projects
Publications
HAL
BIB
Contact
CV
Light
Dark
Automatic
An improved recursive graph bipartitioning algorithm for well balanced domain decomposition
A. Casadei
,
P. Ramet
,
J. Roman
August 2014
Cite
URL
Type
Report
Sparse
Related
Toward parallel scalable linear solvers suited for large scale hierarchical parallel platforms
An improved recursive graph bipartitioning algorithm for well balanced domain decomposition
Nested Dissection with Balanced Halo
Fast Algorithms for Dense Linear Algebra
Fast direct linear solvers for the boundary element method
Cite
×