Ethan Epperly
Orcid: 0000-0003-0712-8296
According to our database1,
Ethan Epperly authored at least 26 papers
between 2019 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2026
CoRR, February, 2026
CoRR, February, 2026
Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product.
Quantum, 2026
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026
2025
Make the most of what you have: Resource-efficient randomized algorithms for matrix computations.
CoRR, December, 2025
Stable algorithms for general linear systems by preconditioning the normal equations.
CoRR, February, 2025
Superfast Direct Inversion of the Nonuniform Discrete Fourier Transform via Hierarchically Semiseparable Least Squares.
SIAM J. Sci. Comput., 2025
Embrace Rejection: Kernel Matrix Approximation by Accelerated Randomly Pivoted Cholesky.
SIAM J. Matrix Anal. Appl., 2025
2024
SIAM J. Matrix Anal. Appl., March, 2024
SIAM J. Sci. Comput., February, 2024
SIAM J. Matrix Anal. Appl., 2024
Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers.
CoRR, 2024
CoRR, 2024
The ESPRIT Algorithm Under High Noise: Optimal Error Scaling and Noisy Super-Resolution.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
2022
SIAM J. Matrix Anal. Appl., September, 2022
$(L_r, L_r, 1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials.
SIAM J. Matrix Anal. Appl., 2022
Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations.
CoRR, 2022
2021
2019