Randomized compression of rank-structured matrices accelerated with graph coloring
DOI10.1016/J.CAM.2024.116044zbMATH Open1542.65052MaRDI QIDQ6582003FDOQ6582003
Authors: James J. Levitt, P. G. Martinsson 
Publication date: 1 August 2024
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
- 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
fast direct solverrank-structured matriceshierarchically semiseparable matrixhierarchically block separable matrixHODLR matrixrandomized approximation of matrices
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Random matrices (algebraic aspects) (15B52) Numerical linear algebra (65F99) Randomized algorithms (68W20) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Boundary element methods for boundary value problems involving PDEs (65N38)
Cites Work
- Algorithm 832
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Title not available (Why is that?)
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Compressing Rank-Structured Matrices via Randomized Sampling
- A fast algorithm for particle simulations
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Title not available (Why is that?)
- New methods to color the vertices of a graph
- High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- A fast direct solver for boundary integral equations in two dimensions
- A fast direct solver for structured linear systems by recursive skeletonization
- Fast Direct Solvers for Elliptic PDEs
- A Fast Solver for HSS Representations via Sparse 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
- Randomized numerical linear algebra: Foundations and algorithms
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Practical sketching algorithms for low-rank matrix approximation
- A recursive skeletonization factorization based on strong admissibility
Cited In (1)
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)
