Universal matrix sparsifiers and fast deterministic algorithms for linear algebra
From MaRDI portal
Cites work
- A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
- A Fast Random Sampling Algorithm for Sparsifying Matrices
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
- An information statistics approach to data stream and communication complexity
- An introduction to the \textit{Lie} theory of one-parameter groups, with applications to the solution of differential equations.
- An optimal lower bound on the communication complexity of gap-Hamming-distance
- Approximating spectral densities of large matrices
- Communication complexity (for algorithm designers)
- Eigenvalues and expanders
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Explicit expanders of every degree and size
- Fast computation of low-rank matrix approximations
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 5903238 (Why is no real title available?)
- scientific article; zbMATH DE number 5485569 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Hutch++: Optimal Stochastic Trace Estimation
- Information Lower Bounds via Self-reducibility
- Low-Rank PSD Approximation in Input-Sparsity Time
- Memory bounds for the experts problem
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Numerical methods for large eigenvalue problems
- On sketching quadratic forms
- Optimal eigenvalue approximation via sketching
- Ramanujan graphs
- Ramanujan graphs in polynomial time
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Sparse Cholesky Factorization by Kullback--Leibler Minimization
- SPSD matrix approximation vis column selection: theories, algorithms, and extensions
- Sublinear time eigenvalue approximation via random sampling
- Sublinear time low-rank approximation of positive semidefinite matrices
- Sublinear time spectral density estimation
- Subsampling algorithms for semidefinite programming
- Testing positive semi-definiteness via random submatrices
- Testing positive semidefiniteness using linear measurements
- The kernel polynomial method
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication: Universal matrix sparsifiers and fast deterministic algorithms for linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906427)
