Skip to Main content Skip to Navigation
New interface
Journal articles

Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices

Emmanuel Agullo 1 Eric Darve 2 Luc Giraud 1 Yuval Harness 1 
1 HiePACS - High-End Parallel Algorithms for Challenging Numerical Simulations
LaBRI - Laboratoire Bordelais de Recherche en Informatique, Inria Bordeaux - Sud-Ouest
Abstract : We consider the problem of choosing low-rank factorizations in data sparse matrix approximations for preconditioning large-scale symmetric positive definite (SPD) matrices. These approximations are memory-efficient schemes that rely on hierarchical matrix partitioning and compression of certain sub-blocks of the matrix. Typically, these matrix approximations can be constructed very fast, and their matrix product can be applied rapidly as well. The common practice is to express the compressed sub-blocks by low-rank factorizations, and the main contribution of this work is the numerical and spectral analysis of SPD preconditioning schemes represented by $2\times2$ block matrices, whose off-diagonal sub-blocks are low-rank approximations of the original matrix off-diagonal sub-blocks. We propose an optimal choice of low-rank approximations which minimizes the condition number of the preconditioned system, and demonstrate that the analysis can be applied to the class of hierarchically off-diagonal low-rank matrix approximations. Spectral estimates that take into account the error propagation through levels of the hierarchy which quantify the impact of the choice of low-rank compression on the global condition number are provided. The numerical results indicate that the properties of the preconditioning scheme using proper low-rank compression are superior to employing standard choices for low-rank compression. A major goal of this work is to provide an insight into how proper reweighted prior to low-rank compression influences the condition number for a simple case, which would lead to an extended analysis for more general and more efficient hierarchical matrix approximation techniques.
Complete list of metadata
Contributor : Luc Giraud Connect in order to contact the contributor
Submitted on : Monday, December 3, 2018 - 9:01:05 PM
Last modification on : Saturday, November 19, 2022 - 3:59:00 AM
Long-term archiving on: : Monday, March 4, 2019 - 3:26:13 PM


Files produced by the author(s)


  • HAL Id : hal-01940053, version 1


Emmanuel Agullo, Eric Darve, Luc Giraud, Yuval Harness. Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices. SIAM Journal on Matrix Analysis and Applications, 2018, 39 (4), pp.1701-1725. ⟨hal-01940053⟩



Record views


Files downloads