A fast memory efficient construction algorithm for hierarchically semi-separable representations
From MaRDI portal
Recommendations
- Fast algorithms for hierarchically semiseparable matrices
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A fast adaptive solver for hierarchically semiseparable representations
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Construction of data-sparse \(\mathcal{H}^2\)-matrices by hierarchical compression
Cites work
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- A fast algorithm for particle simulations
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient structured multifrontal factorization for general large sparse matrices
- Fast algorithms for hierarchically semiseparable matrices
- Graph theory: modeling, applications, and algorithms
- On Rank-Revealing Factorisations
- On the existence and computation of rank-revealing LU factorizations
- Randomized algorithms for the low-rank approximation of matrices
- Randomized sparse direct solvers
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Strong rank revealing LU factorizations
This page was built for publication: A fast memory efficient construction algorithm for hierarchically semi-separable representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797105)
