Randomized recompression of \(\mathcal {H}\)-matrices for BEM
From MaRDI portal
Publication:1734172
DOI10.1007/s41980-018-0111-0zbMath1409.65025OpenAlexW2816907517MaRDI QIDQ1734172
Publication date: 22 March 2019
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-018-0111-0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Survey on the technique of hierarchical matrices
- Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems
- Rapid solution of integral equations of classical potential theory
- On the fast matrix multiplication in the boundary element method by panel clustering
- Mosaic-skeleton approximations
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Approximation of boundary element matrices
- Parallel \(\mathcal {H}\)-matrix arithmetic on distributed-memory systems
- Low-rank approximation of integral operators by interpolation
- Wavelet approximation methods for pseudodifferential equations. II: Matrix compression and fast solution
- Hybrid cross approximation of integral operators
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Literature survey on low rank approximation of matrices
- Compressing Rank-Structured Matrices via Randomized Sampling
This page was built for publication: Randomized recompression of \(\mathcal {H}\)-matrices for BEM
