A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations
From MaRDI portal
Publication:2797105
DOI10.1137/15M1028467zbMath1376.65031MaRDI QIDQ2797105
No author found.
Publication date: 4 April 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
fast algorithmsfast multipole methodorthogonal factorizationsmemory efficientlow-rank structureshierarchically semi-separable representations
Uses Software
Cites Work
- Unnamed Item
- On the existence and computation of rank-revealing LU factorizations
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Strong rank revealing LU factorizations
- Randomized algorithms for the low-rank approximation of matrices
- Fast algorithms for hierarchically semiseparable matrices
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- On Rank-Revealing Factorisations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- Randomized Sparse Direct Solvers
- A fast algorithm for particle simulations
