1 citations · 1 across the 9 of their papers we have counts for
4 papers · 1 filter
The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution
Zhiyan Ding, Ethan N. Epperly, Lin Lin +1
Subspace-based signal processing techniques, such as the Estimation of Signal Parameters via Rotational Invariant Techniques (ESPRIT) algorithm, are popular methods for spectral es…
Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations
Yifan Chen, Ethan N. Epperly, Joel A. Tropp +1
The randomly pivoted partial Cholesky algorithm (RPCholesky) computes a factorized rank-k approximation of an N x N positive-semidefinite (psd) matrix. RPCholesky requires only (k…
Efficient error and variance estimation for randomized matrix computations
Ethan N. Epperly, Joel A. Tropp
Randomized matrix algorithms have become workhorse tools in scientific computing and machine learning. To use these algorithms safely in applications, they should be coupled with p…
Fast and forward stable randomized algorithms for linear least-squares problems
Ethan N. Epperly
Iterative sketching and sketch-and-precondition are randomized algorithms used for solving overdetermined linear least-squares problems. When implemented in exact arithmetic, these…