Recent advances in sparse direct solvers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Recent advances in sparse direct solvers

Patrick Amestoy
  • Function : Author
  • PersonId : 1090241
Clément Weisbecker
  • Function : Author
  • PersonId : 897557


Direct methods for the solution of sparse systems of linear equations of the form A x = b are used in a wide range of numerical simulation applications. Such methods are based on the decomposition of the matrix into a product of triangular factors (e.g., A = L U ), followed by triangular solves. They are known for their numerical accuracy and robustness but are also characterized by a high memory consumption and a large amount of computations. Here we survey some research directions that are being investigated by the sparse direct solver community to alleviate these issues: memory-aware scheduling techniques, low-rank approximations, and distributed/shared memory hybrid programming.
Fichier principal
Vignette du fichier
paper3.pdf (243.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01060301 , version 1 (11-07-2022)


  • HAL Id : hal-01060301 , version 1
  • OATAO : 15162


Emmanuel Agullo, Patrick Amestoy, Alfredo Buttari, Abdou Guermouche, Guillaume Joslin, et al.. Recent advances in sparse direct solvers. 22nd International Conference on Structural Mechanics in Reactor Technology (SMiRT 2013), Aug 2013, San Francisco, United States. pp.1-10. ⟨hal-01060301⟩
221 View
29 Download


Gmail Facebook X LinkedIn More