``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
From MaRDI portal
Publication:4568105
DOI10.1137/16M1068487zbMath1391.65052arXiv1603.09133OpenAlexW2963080259MaRDI QIDQ4568105
Daria A. Sushnikova, Ivan V. Oseledets
Publication date: 15 June 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.09133
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)
Related Items (7)
On the Complexity of the Block Low-Rank Multifrontal Factorization ⋮ FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions ⋮ Simple non-extensive sparsification of the hierarchical matrices ⋮ Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems ⋮ An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations ⋮ Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors ⋮ A Recursive Skeletonization Factorization Based on Strong Admissibility
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hierarchical LU decomposition-based preconditioners for BEM
- A fast direct solver for a class of elliptic partial differential equations
- An adaptive fast direct solver for boundary integral equations in two dimensions
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- A fast direct solver for boundary integral equations in two dimensions
- A fast block low-rank dense solver with applications to finite-element matrices
- Distributed-memory hierarchical interpolative factorization
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
- Performance Of H-Lu Preconditioning For Sparse Matrices
- ILUT: A dual threshold incomplete LU factorization
- A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A Fast Solver for HSS Representations via Sparse Matrices
- Algorithm 832
- Nested Dissection of a Regular Finite Element Mesh
- The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
This page was built for publication: ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
