- 5
- 1
Pierre Ramet
Pierre RAMET - Responsable du département SATANAS (Supports et Algorithms pour les Applications Numériques Hautes Performances)
6
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
- 5
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 6
- 6
- 1
- 1
- 1
- 2
- 3
- 6
- 3
- 6
|
|
Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete FactorizationHiPC 2021 - 28th IEEE International Conference on High Performance Computing, Data, and Analytics, Dec 2021, Bangalore, India. pp.1-10, ⟨10.1109/HiPC53243.2021.00024⟩
Communication dans un congrès
hal-03361299v1
|
Rank Revealing QR Methods for Sparse Block Low Rank SolversCOMPAS 2019 - Conférence d'informatique en Parallélisme, Architecture et Système, Jun 2019, Anglet, France
Communication dans un congrès
hal-02326084v1
|
|
Rank Revealing QR Methods for Sparse Block Low Rank SolversSparse Days 2019, Jul 2019, Toulouse, France
Communication dans un congrès
hal-02326070v1
|
|
|
Sparse supernodal solver using block low-rank compression: Design, performance and analysisJOREK development meeting, Nov 2019, Cadarache, France
Document associé à des manifestations scientifiques
hal-02326407v1
|
|
|
Reaching the Quality of SVD for Low-Rank Compression Through QR Variants[Research Report] RR-9476, Inria Bordeaux - Sud Ouest. 2022, pp.43
Rapport
hal-03718312v4
|
|
|
Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization[Research Report] RR-9396, Inria Bordeaux - Sud Ouest. 2021, pp.16
Rapport
hal-03152932v2
|