Improving multifrontal methods by means of block low-rank representations

Abstract : Matrices coming from elliptic Partial Differential Equations (PDEs) have been shown to have a low-rank property: well defined off-diagonal blocks of their Schur complements can be approximated by low-rank products. Given a suitable ordering of the matrix which gives to the blocks a geometrical meaning, such approximations can be computed using an SVD or a rank-revealing QR factorization. The resulting representation offers a substantial reduction of the memory requirement and gives efficient ways to perform many of the basic dense algebra operations. Several strategies have been proposed to exploit this property. We propose a low-rank format called Block Low-Rank (BLR), and explain how it can be used to reduce the memory footprint and the complexity of direct solvers for sparse matrices based on the multifrontal method. We present experimental results that show how the BLR format delivers gains that are comparable to those obtained with hierarchical formats such as Hierarchical matrices (H matrices) and Hierarchically Semi-Separable (HSS matrices) but provides much greater flexibility and ease of use which are essential in the context of a general purpose, algebraic solver.
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger
Contributeur : Jean-Yves L'Excellent <>
Soumis le : jeudi 31 janvier 2013 - 07:00:09
Dernière modification le : mardi 6 mars 2018 - 15:57:58
Document(s) archivé(s) le : samedi 1 avril 2017 - 05:59:00


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00776859, version 1


Patrick R. Amestoy, Cleve Ashcraft, Olivier Boiteau, Alfredo Buttari, Jean-Yves L'Excellent, et al.. Improving multifrontal methods by means of block low-rank representations. [Research Report] RR-8199, INRIA. 2013. 〈hal-00776859〉



Consultations de la notice


Téléchargements de fichiers