Simple non-extensive sparsification of the hierarchical matrices
From MaRDI portal
(Redirected from Publication:2190667)
Abstract: In this paper, we consider the matrices approximated in H2 format. The direct solution, as well as the preconditioning, of systems with such matrices is a challenging problem. We propose a non-extensive sparse factorization of the H2 matrix that allows to substitute the direct H2 solution with the solution of the system with an equivalent sparse matrix of the same size. The sparse factorization is constructed out of parameters of the H2 matrix. In the numerical experiments, we show the consistency of this approach in comparison to the other approximate block low-rank hierarchical solvers, such as HODLR, H2Lib and IFMM.
Recommendations
- Construction of data-sparse \(\mathcal{H}^2\)-matrices by hierarchical compression
- Introduction to hierarchical matrices with applications.
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
Cites work
- scientific article; zbMATH DE number 4080996 (Why is no real title available?)
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- A Fast Solver for HSS Representations via Sparse Matrices
- A fast algorithm for particle simulations
- A fast direct solver for boundary integral equations in two dimensions
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A recursive skeletonization factorization based on strong admissibility
- 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
- Algorithms to solve hierarchically semi-separable systems
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Hierarchical LU decomposition-based preconditioners for BEM
- Hierarchical matrices based on a weak admissibility criterion
- Introduction to hierarchical matrices with applications.
- Iterative representing set selection for nested cross approximation.
- Mosaic-skeleton approximations
- Multifrontal Hierarchically Solver for 3D Discretized Elliptic Equations
- Preconditioners for hierarchical matrices based on their extended sparse form
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The inverse fast multipole method: using a fast approximate direct dolver as a preconditioner for dense linear systems
- \(\mathcal{H}^2\)-matrix compression
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
Cited in
(3)
This page was built for publication: Simple non-extensive sparsification of the hierarchical matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190667)
