Quasi-optimal hierarchically semi-separable matrix approximation
From MaRDI portal
Cites work
- A DEIM induced CUR factorization
- A direct solver with O(N) complexity for integral equations on one-dimensional domains
- A fast algorithm for particle simulations
- A fast direct solver for boundary integral equations in two dimensions
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A probing method for computing the diagonal of a matrix inverse.
- A Tight Analysis of Hutchinson's Diagonal Estimator
- An estimator for the diagonal of a matrix
- Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR^2 Format
- Butterfly factorization via randomized matrix-vector multiplications
- Compressing Rank-Structured Matrices via Randomized Sampling
- Computing functions of symmetric hierarchically semiseparable matrices
- Construction of hierarchically semiseparable matrix representation using adaptive Johnson-Lindenstrauss sketching
- Data-driven Construction of Hierarchical Matrices with Nested Bases
- Dimensionality reduction for k-means clustering and low rank approximation
- Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Elliptic PDE learning is provably data-efficient
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L^-coefficients
- Fast algorithms for hierarchically semiseparable matrices
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Fast Direct Solvers for Elliptic PDEs
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- Fast solvers for two-dimensional fractional diffusion equations using rank structured matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices: algorithms and analysis
- Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs
- Hierarchical matrix operations on GPUs. Matrix-vector multiplication and compression
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1955860 (Why is no real title available?)
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- Improved approximation algorithms for large matrices via random projections
- Interpolative butterfly factorization
- Krylov methods are (nearly) optimal for low-rank approximation
- Learning elliptic partial differential equations with randomized linear algebra
- Likelihood approximation with hierarchical matrices for large spatial datasets
- Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices
- Low-rank approximation with 1/đ 1/3 matrix-vector products
- Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations
- Matrices with hierarchical low-rank structures
- Practical sketching algorithms for low-rank matrix approximation
- Randomized compression of rank-structured matrices accelerated with graph coloring
- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- Scalable Gaussian Process Computations Using Hierarchical Matrices
- Sketching Sparse Matrices, Covariances, and Graphs via Tensor Products
- Sparse Cholesky Factorization by Kullback--Leibler Minimization
- Structured matrix recovery from matrixâvector products
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Tight query complexity lower bounds for PCA via finite sample deformed Wigner law
- Toeplitz Low-Rank Approximation with Sublinear Query Complexity
This page was built for publication: Quasi-optimal hierarchically semi-separable matrix approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263261)
