Pages that link to "Item:Q5739955"
From MaRDI portal
The following pages link to Compressing Rank-Structured Matrices via Randomized Sampling (Q5739955):
Displaying 16 items.
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity (Q92247) (← links)
- Randomized recompression of \(\mathcal {H}\)-matrices for BEM (Q1734172) (← links)
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems (Q2129320) (← links)
- An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (Q2222486) (← links)
- Learning elliptic partial differential equations with randomized linear algebra (Q2697403) (← links)
- On the Best Approximation of the Hierarchical Matrix Product (Q4615305) (← links)
- Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs (Q5132022) (← links)
- Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations (Q5230631) (← links)
- Compressing Rank-Structured Matrices via Randomized Sampling (Q5739955) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- A hybrid stochastic interpolation and compression method for kernel matrices (Q6087910) (← links)
- Sparse Recovery of Elliptic Solvers from Matrix-Vector Products (Q6154205) (← links)
- PyAlbany: a Python interface to the C++ multiphysics solver Albany (Q6157922) (← links)
- Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization (Q6166000) (← links)
- Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices (Q6177922) (← links)
- Fast macroscopic forcing method (Q6196620) (← links)
