Randomized compression of rank-structured matrices accelerated with graph coloring
DOI10.1016/J.CAM.2024.116044zbMATH Open1542.65052MaRDI QIDQ6582003
P. G. Martinsson, James J. Levitt
Publication date: 1 August 2024
Published in: (Search for Journal in Brave)
fast direct solverrank-structured matriceshierarchically semiseparable matrixhierarchically block separable matrixHODLR matrixrandomized approximation of matrices
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Random matrices (algebraic aspects) (15B52) Direct numerical methods for linear systems and matrix inversion (65F05) Randomized algorithms (68W20) Boundary element methods for boundary value problems involving PDEs (65N38) Numerical linear algebra (65F99) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- 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
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A fast direct solver for boundary integral equations in two dimensions
- 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
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- New methods to color the vertices of a graph
- High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
- Fast Direct Solvers for Elliptic PDEs
- Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A Fast Solver for HSS Representations via Sparse Matrices
- Algorithm 832
- A Recursive Skeletonization Factorization Based on Strong Admissibility
- Compressing Rank-Structured Matrices via Randomized Sampling
- Randomized numerical linear algebra: Foundations and algorithms
- A fast algorithm for particle simulations
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)
