- 7
- 1
Pierre Ramet
Pierre RAMET - Responsable du département SATANAS (Supports et Algorithms pour les Applications Numériques Hautes Performances)
8
Documents
Affiliations actuelles
- 259761
- 104751
- 3102
- 440172
- 1124391
Identifiants chercheurs
pierre-ramet- IdRef : 189029668
-
0000-0002-6179-9819
Présentation
Ma problématique de recherche concerne les problèmes du calcul haute performance, en particulier l'algèbre linéaire creuse. Je développe la bibliothèque PaStiX ([https://solverstack.gitlabpages.inria.fr/pastix](https://solverstack.gitlabpages.inria.fr/pastix "PaStiX")) qui implémente un solveur direct creux haute performance.
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
My interests span high-performance computing, focusing on sparse linear algebra. I am the developer of PaStiX ([https://solverstack.gitlabpages.inria.fr/pastix](https://solverstack.gitlabpages.inria.fr/pastix "PaStiX")), a high-performance sparse direct solver.
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Domaines de recherche
Informatique [cs]
Analyse numérique [math.NA]
Compétences
Sparse Linear Algebra
Parallel Algorithms
Scientific Computing
Publications
- 4
- 4
- 1
- 1
- 1
- 1
- 8
- 5
- 1
- 1
- 2
- 3
- 1
- 2
- 8
- 7
- 1
Towards a recursive graph bipartitioning algorithm for well balanced domain decompositionMini-Symposium on "Combinatorial Issues in Sparse Matrix Computation" at ICIAM'15 conference, Aug 2015, Beijing, China
Communication dans un congrès
hal-01100990v1
|
|
Towards a recursive graph bipartitioning algorithm for well balanced domain decompositionSIAM Conference on Computational Science and Engineering (SIAM CSE 2015), Mar 2015, Salt Lake City, United States
Communication dans un congrès
hal-01100985v1
|
|
|
|
An improved recursive graph bipartitioning algorithm for well balanced domain decompositionIEEE International Conference on High Performance Computing (HiPC 2014), Dec 2014, Goa, India. pp.1-10, ⟨10.1109/HiPC.2014.7116878⟩
Communication dans un congrès
hal-01100962v1
|
|
|
Nested dissection with balanced haloSixth SIAM Workshop on Combinatorial Scientific Computing, Jul 2014, Lyon, France
Communication dans un congrès
hal-00987099v1
|
|
|
Towards Domain Decomposition with Balanced HaloWorkshop Celebrating 40 Years of Nested Dissection, Jul 2013, Waterloo, Canada
Communication dans un congrès
hal-00924977v1
|
Memory Optimization to Build a Schur ComplementSIAM Conference on Applied Linear Algebra (SIAM LA 2012), Jun 2012, Valence, Spain
Communication dans un congrès
hal-00769029v1
|
|
|
An improved recursive graph bipartitioning algorithm for well balanced domain decomposition[Research Report] RR-8582, INRIA. 2014, pp.29
Rapport
hal-01056749v1
|
|
|
Memory Optimization to Build a Schur Complement in an Hybrid Solver[Research Report] RR-7971, INRIA. 2012, pp.11
Rapport
hal-00700053v2
|