Randomized compression of rank-structured matrices accelerated with graph coloring
type: Item
instance of: scholarly article
title: Randomized compression of rank-structured matrices accelerated with graph coloring
zbMATH Open document ID: 1542.65052
author: James J. Levitt
author: P. G. Martinsson
published in: Journal of Computational and Applied Mathematics
publication date: 2024-08-01T00:00:00Z
Mathematics Subject Classification ID: 65F99
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 15A23
Mathematics Subject Classification ID: 15B52
Mathematics Subject Classification ID: 65N22
Mathematics Subject Classification ID: 65N38
zbMATH DE Number: 7890885
zbMATH Keywords: randomized approximation of matrices
zbMATH Keywords: rank-structured matrices
zbMATH Keywords: HODLR matrix
zbMATH Keywords: hierarchically block separable matrix
zbMATH Keywords: hierarchically semiseparable matrix
zbMATH Keywords: fast direct solver
MaRDI profile type: MaRDI publication profile
cites work: A fast algorithm for particle simulations
cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
cites work: Q4513819
cites work: Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
cites work: Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
cites work: An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
cites work: A fast direct solver for a class of elliptic partial differential equations
cites work: A Fast Solver for HSS Representations via Sparse Matrices
cites work: A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
cites work: A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
cites work: Superfast Multifrontal Method for Large Structured Linear Systems of Equations
cites work: A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
cites work: A fast direct solver for boundary integral equations in two dimensions
cites work: A Recursive Skeletonization Factorization Based on Strong Admissibility
cites work: A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
cites work: Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures
cites work: An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
cites work: Fast Direct Solvers for Elliptic PDEs
cites work: Fast construction of hierarchical matrix representation from matrix-vector multiplication
cites work: A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
cites work: Compressing Rank-Structured Matrices via Randomized Sampling
cites work: Q4917542
cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
cites work: Practical Sketching Algorithms for Low-Rank Matrix Approximation
cites work: Randomized numerical linear algebra: Foundations and algorithms
cites work: New methods to color the vertices of a graph
cites work: High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
cites work: Algorithm 832
DOI: 10.1016/J.CAM.2024.116044
description: scientific article; zbMATH DE number 7890885