Hierarchical low-rank arithmetic with floating point compression
From MaRDI portal
Cites work
- H-LU factorization on many-core systems
- 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
- Algorithm 1036: ATC, an advanced Tucker compression library for multidimensional data
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Approximation of boundary element matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices based on a weak admissibility criterion
- Hierarchical matrix arithmetic with accumulated updates
- Introduction to hierarchical matrices with applications.
- LAPACK Users' Guide
- Mixed precision HODLR matrices
- Mixed precision low-rank approximations and their application to block low-rank LU factorization
- Multilevel techniques for compression and reduction of scientific data -- the univariate case
- Semiautomatic task graph construction for \(\mathcal{H}\)-matrix arithmetic
- Some Fast Algorithms for Sequentially Semiseparable Representations
- TuckerMPI: a parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition
Cited in
(1)
This page was built for publication: Hierarchical low-rank arithmetic with floating point compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6959701)
