SolverStack

Jan 1, 2026 · 1 min read
projects

SolverStack@Inria Bordeaux

SolverStack aims at providing a coherent, high-performance (HPC) linear algebra solver stack. It provides a comprehensive collection of numerical solvers, partitioning tools, and runtime systems designed for modern supercomputers operating on dense and sparse matrices.

The ecosystem includes direct, iterative (Krylov), and hybrid direct/iterative methods, with advanced preconditioners and low-rank compression techniques, ensuring portability of performance from multicore laptops to petascale and exascale supercomputers.

👉 Official Website: https://solverstack.gitlabpages.inria.fr/

Software Ecosystem

Packaging & Distribution

SolverStack software components are systematically packaged and maintained for high-performance computing environments:

  • Guix-HPC: guix install <package> (guix-hpc)
  • Spack: spack install <package> (spack)
  • Homebrew: brew install <package> (brew-repo)

Partner Teams & Institutions

SolverStack software is developed by researchers and engineers in joint project-teams at Inria Bordeaux Sud-Ouest, Bordeaux University, CNRS (LaBRI UMR 5800), and Bordeaux INP:

Contact: solverstack@inria.fr

HPC Linear Algebra SolverStack Solvers
Pierre Ramet
Authors
Pierre Ramet
Full Professor of Computer Science
Pierre Ramet is a Full Professor of Computer Science at Bordeaux University and a researcher at Inria. His research interests span high-performance computing, focusing on sparse linear algebra and parallel algorithms. He leads the team in charge of developing PaStiX, a high-performance sparse direct solver.