Compressing Rank-Structured Matrices via Randomized Sampling
From MaRDI portal
Publication:5739955
DOI10.1137/15M1016679zbMath1342.65211arXiv1503.07152OpenAlexW2963863488MaRDI QIDQ5739955
Publication date: 7 July 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.07152
fast direct solverrank-structured matriceshierarchically semiseparable matrixhierarchically block separable matrixHODLR matrixrandomized approximation of matrices
Factorization of matrices (15A23) Random matrices (algebraic aspects) (15B52) Boundary element methods for boundary value problems involving PDEs (65N38) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Randomized numerical linear algebra: Foundations and algorithms, Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems, A hybrid stochastic interpolation and compression method for kernel matrices, Sparse Recovery of Elliptic Solvers from Matrix-Vector Products, PyAlbany: a Python interface to the C++ multiphysics solver Albany, Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization, Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices, Fast macroscopic forcing method, Learning elliptic partial differential equations with randomized linear algebra, On the Best Approximation of the Hierarchical Matrix Product, Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs, An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries, Randomized recompression of \(\mathcal {H}\)-matrices for BEM, Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity, Compressing Rank-Structured Matrices via Randomized Sampling, Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Rang revealing QR factorizations
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- A randomized algorithm for the decomposition of matrices
- A fast direct solver for a class of elliptic partial differential equations
- A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
- On interpolation and integration in finite-dimensional spaces of bounded functions
- A fast adaptive solver for hierarchically semiseparable representations
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Solving a large dense linear system by adaptive cross approximation
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Approximation of boundary element matrices
- A fast direct solver for boundary integral equations in two dimensions
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Hybrid cross approximation of integral operators
- A Direct Solver with $O(N)$ Complexity for Variable Coefficient Elliptic PDEs Discretized via a High-Order Composite Spectral Collocation Method
- Fast algorithms for hierarchically semiseparable matrices
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Direct Methods for Sparse Linear Systems
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Randomized Sparse Direct Solvers
- On the Compression of Low Rank Matrices
- Algorithm 832
- Nested Dissection of a Regular Finite Element Mesh
- Compressing Rank-Structured Matrices via Randomized Sampling
