Cover Image

Near-optimal hierarchical matrix approximation from matrix-vector products

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Tyler, Keles, Feyza Duman, Halikias, Diana, Musco, Cameron, Musco, Christopher, Persson, David
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fixed-sparsity matrix approximation from matrix-vector products
by: Amsel, Noah, et al.
Published: (2024)

Quasi-optimal hierarchically semi-separable matrix approximation
by: Amsel, Noah, et al.
Published: (2025)

Query Efficient Structured Matrix Learning
by: Amsel, Noah, et al.
Published: (2025)

Stability of the Lanczos Method for Matrix Function Approximation
by: Musco, Cameron, et al.
Published: (2017)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
by: Musco, Cameron, et al.
Published: (2024)

Algorithm-agnostic low-rank approximation of operator monotone matrix functions
by: Persson, David, et al.
Published: (2023)

Sublinear Time Low-Rank Approximation of Hankel Matrices
by: Kapralov, Michael, et al.
Published: (2025)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
by: Doney, Kyle, et al.
Published: (2025)

An Exact Algorithm for the Unanimous Vote Problem
by: Keles, Feyza Duman, et al.
Published: (2025)

The Lanczos algorithm for matrix functions: a handbook for scientists
by: Chen, Tyler
Published: (2024)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
by: Dereziński, Michał, et al.
Published: (2024)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

The matrix-vector complexity of $Ax=b$
by: Dereziński, Michał, et al.
Published: (2026)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
by: Persson, David, et al.
Published: (2025)

Sharper Bounds for Chebyshev Moment Matching, with Applications
by: Musco, Cameron, et al.
Published: (2024)

Does block size matter in randomized block Krylov low-rank approximation?
by: Chen, Tyler, et al.
Published: (2025)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
by: Amsel, Noah, et al.
Published: (2026)

Quantum matrix arithmetics with Hamiltonian evolution
by: Kang, Christopher, et al.
Published: (2025)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
by: Bessa, Aline, et al.
Published: (2023)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
by: Diwan, Haya, et al.
Published: (2024)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
by: Chenakkod, Shabarish, et al.
Published: (2024)

A Monte Carlo algorithm for efficient large matrix inversion
by: Garcia-Cortes, L. A., et al.
Published: (2004)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
by: Cai, Xufeng, et al.
Published: (2025)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
by: Suslo, Tomasz
Published: (2005)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
by: Drineas, Petros, et al.
Published: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
by: Netay, Igor V.
Published: (2024)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
by: Bentert, Matthias, et al.
Published: (2025)

Analysis of Different Algorithmic Design Techniques for Seam Carving
by: Aijaz, Owais, et al.
Published: (2024)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
by: Larsen, Brett W., et al.
Published: (2022)

Fast algorithms for least square problems with Kronecker lower subsets
by: Malik, Osman Asif, et al.
Published: (2022)

Preserving Extreme Singular Values with One Oblivious Sketch
by: Mango, John M., et al.
Published: (2025)

Finer-Grained Hardness of Kernel Density Estimation
by: Alman, Josh, et al.
Published: (2024)

Invariant subspaces and PCA in nearly matrix multiplication time
by: Sobczyk, Aleksandros, et al.
Published: (2023)

Quantum linear system algorithm with optimal queries to initial state preparation
by: Low, Guang Hao, et al.
Published: (2024)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Sampling Methods for Inner Product Sketching
by: Daliri, Majid, et al.
Published: (2023)

Simple Analysis of Priority Sampling
by: Daliri, Majid, et al.
Published: (2023)