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

DOI10.1137/17M1151158zbMath1453.65061OpenAlexW2903470639WikidataQ114074313 ScholiaQ114074313MaRDI QIDQ4644411

Emmanuel Agullo, Luc Giraud, Eric Darve, Yuval Harness

Publication date: 7 January 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1151158

zbMATH Keywords

preconditioningsymmetric positive definite matrixlow-rank factorizationhierarchical algorithmsdata sparseminimal condition number

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Positive matrices and their generalizations; cones of matrices (15B48) Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)

Related Items (2)

Robust Preconditioners via Generalized Eigenproblems for Hybrid Sparse Linear Solvers ⋮ Robust and Effective eSIF Preconditioning for General Dense SPD Matrices

Uses Software

• SparseMatrix
• PT-Scotch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on optimal block-scaling of matrices
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• A fast randomized algorithm for the approximation of matrices
• Algebraic multilevel preconditioning methods. I
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Construction and arithmetics of \(\mathcal H\)-matrices
• Strong rank revealing LU factorizations
• A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
• A fast block low-rank dense solver with applications to finite-element matrices
• Hierarchical matrix approximation with blockwise constraints
• The university of Florida sparse matrix collection
• Randomized algorithms for the low-rank approximation of matrices
• Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
• Fast algorithms for hierarchically semiseparable matrices
• Algebraic Multilevel Preconditioning Methods, II
• A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
• Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Preconditioning
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• Fast monte-carlo algorithms for finding low-rank approximations
• On the spectral equivalence of hierarchical matrix preconditioners for elliptic problems
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices