activity
20062026
most citedBeyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals

1.1k citations · 3.9k across the 74 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

math.NA2021★ 4 cited

Fast & Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems

Yuji Nakatsukasa, Joel A. Tropp

This paper develops a new class of algorithms for general linear systems and eigenvalue problems. These algorithms apply fast randomized sketching to accelerate subspace projection…

math.NA2021

Randomized Nyström Preconditioning

Zachary Frangella, Joel A. Tropp, Madeleine Udell

This paper introduces the Nyström PCG algorithm for solving a symmetric positive-definite linear system. The algorithm applies the randomized Nyström method to form a low-rank appr…

math.NA2021

Randomized block Krylov methods for approximating extreme eigenvalues

Joel A. Tropp

Randomized block Krylov subspace methods form a powerful class of algorithms for computing the extreme eigenvalues of a symmetric matrix or the extreme singular values of a general…

math.DS2021★ 1 cited

Learning to Forecast Dynamical Systems from Streaming Data

Dimitris Giannakis, Amelia Henriksen, Joel A. Tropp +1

Kernel analog forecasting (KAF) is a powerful methodology for data-driven, non-parametric forecasting of dynamically generated time series data. This approach has a rigorous founda…

math.NA2021★ 17 cited

Tensor Random Projection for Low Memory Dimension Reduction

Yiming Sun, Yang Guo, Joel A. Tropp +1

Random projections reduce the dimension of a set of vectors while preserving structural information, such as distances between vectors in the set. This paper proposes a novel use o…