Recent advances in sparse direct solvers

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01060301
Contributor : Equipe Roma <>
Submitted on : Wednesday, September 3, 2014 - 1:20:56 PM
Last modification on : Tuesday, November 19, 2019 - 2:39:15 AM

Identifiers

  • HAL Id : hal-01060301, version 1

Citation

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

Share

Metrics

Record views

398