
Short Bio.:  I am a research scientist in the Scalable Solvers Group in the Computational Research Division at the Lawrence Berkeley National Laboratory since November 2015. My current research interest are highly scalable algorithms for solving large sparse symmetric linear systems.
I obtained a Master’s Degree in Computer Science from INSA of Lyon, France (National Institute of Applied Sciences). I went on to the Ecole Normale Superieure of Lyon, to complete my Ph.D. in Computer Science, focusing on algorithms and scheduling, and how hierarchical memory architectures should be handled. I then joined Laura Grigori's team at INRIA of Saclay, France, for 18 months, working on communication avoiding algorithms for dense linear algebra. I joined LBNL in 2013 as a postdoctoral fellow in the Scietific Computing Group and then the Scalable Solvers Group, focusing on various sparse linear algebra computations.

Occupation:  Research Scientist at Lawrence Berkeley National Laboratory in the Scientific Computing Group of the Computational Research Division, on extreme scale sparse linear solvers and inversion algorithms.
Developer of the symPACK solver
Involved in the development of the PEXSI library (Pole EXpansion and Selected Inversion for sparse matrices). 

PhD.:  PhD. in Computer Science from the École Normale Supérieure de Lyon, France in the LIP (Parallel Computing Laboratory) 
PhD. advisors:  Yves Robert and Loris Marchal 
PhD. thesis: 
Memoryaware algorithms: from multicores to large scale platforms




@phdthesis{jacquelin:tel00662525,
hal_id = {tel00662525},
url = {http://tel.archivesouvertes.fr/tel00662525},
title = {{Memoryaware algorithms : from multicores to large scale platforms}},
author = {Jacquelin, Mathias},
affiliation = {Laboratoire de l'Informatique du Parall{\'e}lisme  LIP},
school = {Ecole normale sup{\'e}rieure de lyon  ENS LYON},
type = {THESE},
year = {2011},
month = Jul,
}

