Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
From MaRDI portal
Publication:4644411
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
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A fast block low-rank dense solver with applications to finite-element matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A fast randomized algorithm for the approximation of matrices
- A note on optimal block-scaling of matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Algebraic Multilevel Preconditioning Methods, II
- Algebraic multilevel preconditioning methods. I
- Construction and arithmetics of \(\mathcal H\)-matrices
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast algorithms for hierarchically semiseparable matrices
- Fast monte-carlo algorithms for finding low-rank approximations
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Hierarchical matrix approximation with blockwise constraints
- Methods of conjugate gradients for solving linear systems
- On the spectral equivalence of hierarchical matrix preconditioners for elliptic problems
- Preconditioning
- Randomized algorithms for the low-rank approximation of matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Strong rank revealing LU factorizations
- The University of Florida sparse matrix collection
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
- scientific article; zbMATH DE number 4178733 (Why is no real title available?)
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Low-rank updates of balanced incomplete factorization preconditioners
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)
