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.
Type de document :
Communication dans un congrès
22nd Conference on Structural Mechanics in Reactor Technology, 2013, San Francisco, United States. pp.10, 2013, Nuclear Engineering and Design. <www.iasmirt.org/transactions/22/Pap_819_ver_3.pdf>
Liste complète des métadonnées

https://hal.inria.fr/hal-01060301
Contributeur : Equipe Roma <>
Soumis le : mercredi 3 septembre 2014 - 13:20:56
Dernière modification le : jeudi 18 août 2016 - 09:33:52

Identifiants

  • 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. 22nd Conference on Structural Mechanics in Reactor Technology, 2013, San Francisco, United States. pp.10, 2013, Nuclear Engineering and Design. <www.iasmirt.org/transactions/22/Pap_819_ver_3.pdf>. <hal-01060301>

Partager

Métriques

Consultations de la notice

243