Randomized compression of rank-structured matrices accelerated with graph coloring
fast direct solverhierarchically block separable matrixhierarchically semiseparable matrixHODLR matrixrandomized approximation of matricesrank-structured matrices
Factorization of matrices (15A23) Random matrices (algebraic aspects) (15B52) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical linear algebra (65F99) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Boundary element methods for boundary value problems involving PDEs (65N38) Randomized algorithms (68W20)
- Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices
- Compressing Rank-Structured Matrices via Randomized Sampling
- Randomized recompression of \(\mathcal {H}\)-matrices for BEM
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A direct solver with O(N) complexity for integral equations on one-dimensional domains
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A fast algorithm for particle simulations
- A fast direct solver for a class of elliptic partial differential equations
- A fast direct solver for boundary integral equations in two dimensions
- A fast direct solver for structured linear systems by recursive skeletonization
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A Fast Solver for HSS Representations via Sparse Matrices
- A recursive skeletonization factorization based on strong admissibility
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Algorithm 832
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Compressing Rank-Structured Matrices via Randomized Sampling
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Fast Direct Solvers for Elliptic PDEs
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- New methods to color the vertices of a graph
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Practical sketching algorithms for low-rank matrix approximation
- Randomized numerical linear algebra: Foundations and algorithms
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices
- On the randomized SVD in infinite dimensions
- Fixed-sparsity matrix approximation from matrix-vector products
- Quasi-optimal hierarchically semi-separable matrix approximation
- Randomized block low-rank matrix compression by tagging
- Operator learning for hyperbolic PDEs
- Quasi-Optimal Randomized Recovery of $\mathcal{H}^2$ Matrices
This page was built for publication: Randomized compression of rank-structured matrices accelerated with graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582003)
