Randomized block low-rank matrix compression by tagging

DOI10.1137/25M175857XMaRDI QIDQ7293003zbMATH OpenFDO

Authors Katherine J. Pearce, Anna Yesypenko, James J. Levitt, P. G. Martinsson

Publication date 9 July 2026

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M175857X

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites work

• 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 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 recursive skeletonization factorization based on strong admissibility
• A simplified fast multipole method based on strong recursive skeletonization
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR^2 Format
• Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format
• Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides
• Compressing Rank-Structured Matrices via Randomized Sampling
• DetGB: a software package for computing Gröbner bases of determinantal ideals
• Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
• Extensions of Lipschitz mappings into a Hilbert space
• Fast construction of hierarchical matrix representation from matrix-vector multiplication
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Functions of Matrices
• GRASSMANNIANS AND CLUSTER ALGEBRAS
• Gravitational quantum cohomology.
• Hierarchical matrices: algorithms and analysis
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• scientific article; zbMATH DE number 1069612 (Why is no real title available?)
• scientific article; zbMATH DE number 1531793 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Improving multifrontal methods by means of block low-rank representations
• Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
• Interpolative decomposition via proxy points for kernel matrices
• Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices
• Mirror symmetry and toric degenerations of partial flag manifolds
• Mixed precision low-rank approximations and their application to block low-rank LU factorization
• Moment curves and cyclic symmetry for positive Grassmannians
• Multilevel approximation of boundary integral operators
• Nested Dissection of a Regular Finite Element Mesh
• On the complexity of the block low-rank multifrontal factorization
• On the Compression of Low Rank Matrices
• Parallel QR Factorization of Block Low-rank Matrices
• Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
• Practical sketching algorithms for low-rank matrix approximation
• Randomized compression of rank-structured matrices accelerated with graph coloring
• Randomized numerical linear algebra: Foundations and algorithms
• Randomized strong recursive skeletonization: simultaneous compression and Lu factorization of hierarchical matrices using matrix-vector products
• Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
• SlabLU: a two-level sparse direct solver for elliptic PDEs
• Solving block low-rank linear systems by LU factorization is numerically stable
• Stationary Phase Integrals, Quantum Toda Lattices, Flag Manifolds and the Mirror Conjecture
• Superfast Multifrontal Method for Large Structured Linear Systems of Equations
• Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
• Tau Functions and their Applications
• The \(B\)-model connection and mirror symmetry for Grassmannians
• The analysis of a nested dissection algorithm

This page was built for publication: Randomized block low-rank matrix compression by tagging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293003)