Mathieu FAVERGE
Mathieu Faverge Maître de Conférences (Université Bordeaux)

Équipe LaBRI : Supports et Algorithmes pour les Applications Numériques hAutes performanceS
Fonction administrative : Responsable des Projets à finalité entreprise du département informatique de l'ENSEIRB-MATMECA
Courrier électronique : mathieu.favergearobaselabri.fr
Bureau : INRIA
Tél : +33 (0)5 40 00


Extrait de publications


Salli Moustafa, François Févotte, Mathieu Faverge, Laurent Plagne, Pierre Ramet. Efficient Parallel Solution of the 3D Stationary Boltzmann Transport Equation for Diffusive Problems. Journal of Computational Physics, Elsevier, 2019, ⟨10.1016/j.jcp.2019.03.019⟩. ⟨hal-02080624⟩

Grégoire Pichon, Eric Darve, Mathieu Faverge, Pierre Ramet, Jean Roman. Block Low-rank Algebraic Clustering for Sparse Direct Solvers. SIAM Conference on Computational Science and Engineering (CSE19), Feb 2019, Spokane, United States. ⟨hal-01956962⟩

Mathieu Faverge, Grégoire Pichon, Pierre Ramet. Exploiting Parameterized Task-graph in Sparse Direct Solvers. SIAM Conference on Computational Science and Engineering (CSE19), Feb 2019, Spokane, United States. ⟨hal-01956963⟩

Heike Jagode, Anthony Danalis, Reazul Hoque, Mathieu Faverge, Jack Dongarra. Evaluation of Dataflow Programming Models for Electronic Structure Theory. Concurrency and Computation: Practice and Experience, Wiley, In press, pp.23. ⟨hal-01725804⟩

Grégoire Pichon, Eric Darve, Mathieu Faverge, Pierre Ramet, Jean Roman. Supernodes ordering to enhance Block Low-Rank compression in sparse direct solvers. [Research Report] RR-9238, Inria Bordeaux Sud-Ouest. 2018, pp.1-31. ⟨hal-01961675⟩


Page mise à jour le 13/08/2010 à 10:56