Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Fast and reliable solutions for numerical linear algebra solvers in high-performance computing.

Marc Baboulin 1, 2
1 GRAND-LARGE - Global parallel and distributed computing
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LIFL - Laboratoire d'Informatique Fondamentale de Lille, LRI - Laboratoire de Recherche en Informatique
2 ParSys - LRI - Systèmes parallèles (LRI)
LRI - Laboratoire de Recherche en Informatique
Abstract : In this "Habilitation à Diriger des Recherches" (HDR), we present our research in high-performance scientific computing over the recent years. Our work has been mainly related to parallel algorithms for numerical linear algebra solvers and their parallel implementation in public domain software libraries. We illustrate in this manuscript how these calculations can be accelerated using innovative algorithms and be made reliable using specific quantities in error analysis. First we explain how numerical linear algebra solvers can be designed to exploit the capabilities of current heterogeneous multicore+GPU systems. We consider dense factorization algorithms for which we describe the work splitting between the architectural components and its influence in terms of communication cost. These computations can also be significantly enhanced thanks to mixed precision algorithms that use lower precision for the most expensive tasks while achieving higher precision accuracy for the results. Then we present our research in developing fast linear algebra solvers using randomized algorithms. Randomization represents a very promising approach to accelerate linear algebra computations and the class of algorithms that we developed has the advantage of reducing the amount of communication in dense factorizations by removing completely the pivoting phase in linear system solutions. The resulting software has been developed for multicore machines possibly accelerated by GPUs. Finally we propose numerical tools that enable us to assess the quality of the computed solution of overdetermined linear least squares, including the total least squares approach. Our method is based on deriving exact values or estimates for the condition number of these problems. We describe algorithms and software to compute these quantities using standard parallel libraries. Research tracks for the coming years are given in a concluding chapter.
Complete list of metadatas

Cited literature [89 references]  Display  Hide  Download
Contributor : Marc Baboulin <>
Submitted on : Friday, March 28, 2014 - 7:11:51 PM
Last modification on : Wednesday, October 14, 2020 - 3:41:31 AM
Long-term archiving on: : Saturday, June 28, 2014 - 12:30:11 PM


  • HAL Id : tel-00967523, version 1



Marc Baboulin. Fast and reliable solutions for numerical linear algebra solvers in high-performance computing.. Distributed, Parallel, and Cluster Computing [cs.DC]. Université Paris Sud - Paris XI, 2012. ⟨tel-00967523⟩



Record views


Files downloads