Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
DOI10.1137/17M1151158zbMATH Open1453.65061OpenAlexW2903470639WikidataQ114074313 ScholiaQ114074313MaRDI QIDQ4644411FDOQ4644411
Authors: E. Agullo, L. Giraud, Eric Darve, Y. 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
Recommendations
- Divide and conquer low-rank preconditioners for symmetric matrices
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- A sparse decomposition of low rank symmetric positive semidefinite matrices
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- Low rank approximation of the symmetric positive semidefinite matrix
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- Preconditioners for hierarchical matrices based on their extended sparse form
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
- Factorization-based sparse solvers and preconditioners
preconditioningsymmetric positive definite matrixlow-rank factorizationhierarchical algorithmsdata sparseminimal condition number
Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Numerical computation of matrix norms, conditioning, scaling (65F35) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- The University of Florida sparse matrix collection
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- Fast algorithms for hierarchically semiseparable matrices
- Title not available (Why is that?)
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Methods of conjugate gradients for solving linear systems
- Fast monte-carlo algorithms for finding low-rank approximations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction and arithmetics of \(\mathcal H\)-matrices
- Algebraic multilevel preconditioning methods. I
- Algebraic Multilevel Preconditioning Methods, II
- Randomized algorithms for the low-rank approximation of matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- On the spectral equivalence of hierarchical matrix preconditioners for elliptic problems
- A fast randomized algorithm for the approximation of matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Hierarchical matrix approximation with blockwise constraints
- A note on optimal block-scaling of matrices
- Preconditioning
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Strong rank revealing LU factorizations
- A fast block low-rank dense solver with applications to finite-element matrices
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
Cited In (8)
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- Rank-deficient prewhitening with quotient SVD and ULV decompositions
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Preordering saddle‐point systems for sparse LDLT factorization without pivoting
- Robust preconditioners via generalized eigenproblems for hybrid sparse linear solvers
- Title not available (Why is that?)
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Low-rank updates of balanced incomplete factorization preconditioners
Uses Software
This page was built for publication: Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644411)
