default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEthan Epperly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j9]Ethan N. Epperly, Anne Greenbaum, Yuji Nakatsukasa:
Stable algorithms for general linear systems by preconditioning the normal equations. Numerische Mathematik 158(4): 1361-1388 (2026)- [j8]Chris Camaño, Ethan N. Epperly
, Joel A. Tropp:
Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product. Quantum 10: 2022 (2026) - [c4]Michal Derezinski, Ethan N. Epperly, Raphael A. Meyer:
The matrix-vector complexity of Ax=b. COLT 2026: 1737-1770 - [c3]Tyler Chen, Ethan N. Epperly, Raphael A. Meyer, Christopher Musco, Akash Rao:
Does block size matter in randomized block Krylov low-rank approximation? SODA 2026: 1026-1046 - [i26]Michal Derezinski, Ethan N. Epperly, Raphael A. Meyer:
The matrix-vector complexity of Ax=b. CoRR abs/2602.04842 (2026) - [i25]Noah Amsel, Yves Baumann, Paul G. Beckman, Peter Bürgisser, Chris Camaño, Tyler Chen, Edmond Chow, Anil Damle, Michal Derezinski, Mark Embree, Ethan N. Epperly, Robert D. Falgout, Mark Fornace, Anne Greenbaum, Chen Greif, Diana Halikias, Zhen Huang, Elias Jarlebring, Yiannis Koutis, Daniel Kressner, Rasmus Kyng, Jörg Liesen, Jackie Lok, Raphael A. Meyer, Yuji Nakatsukasa, Kate Pearce, Richard Peng, David Persson, Elizaveta Rebrova, Ryan Schneider, Rikhav Shah, Edgar Solomonik, Nikhil Srivastava, Alex Townsend, Robert J. Webber, Jess Williams:
Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop. CoRR abs/2602.05394 (2026) - [i24]Ethan N. Epperly, Taejun Park, Yuji Nakatsukasa:
Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices. CoRR abs/2602.16797 (2026) - [i23]Michal Derezinski, Ethan N. Epperly, Deanna Needell, Alexander Xue:
Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement. CoRR abs/2605.17185 (2026) - [i22]Ethan N. Epperly, Robert J. Webber:
Sharp analysis of sketched least squares and randomized low-rank approximation. CoRR abs/2605.19096 (2026) - [i21]Chris Camaño, Ethan N. Epperly, Raphael A. Meyer, Joel A. Tropp:
Linear algebra at exponential scale via tensor network dimension reduction. CoRR abs/2606.15350 (2026) - 2025
- [j7]Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
Embrace Rejection: Kernel Matrix Approximation by Accelerated Randomly Pivoted Cholesky. SIAM J. Matrix Anal. Appl. 46(4): 2527-2557 (2025) - [j6]Heather Wilber, Ethan N. Epperly, Alex H. Barnett:
Superfast Direct Inversion of the Nonuniform Discrete Fourier Transform via Hierarchically Semiseparable Least Squares. SIAM J. Sci. Comput. 47(3): 1702- (2025) - [i20]Ethan N. Epperly, Anne Greenbaum, Yuji Nakatsukasa:
Stable algorithms for general linear systems by preconditioning the normal equations. CoRR abs/2502.17767 (2025) - [i19]Chris Camaño, Ethan N. Epperly, Joel A. Tropp:
Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product. CoRR abs/2504.06475 (2025) - [i18]Tyler Chen, Ethan N. Epperly, Raphael A. Meyer, Christopher Musco, Akash Rao:
Does block size matter in randomized block Krylov low-rank approximation? CoRR abs/2508.06486 (2025) - [i17]Chris Camaño, Ethan N. Epperly, Raphael A. Meyer, Joel A. Tropp:
Faster Linear Algebra Algorithms with Structured Random Matrices. CoRR abs/2508.21189 (2025) - [i16]Ethan N. Epperly:
Adaptive randomized pivoting and volume sampling. CoRR abs/2510.02513 (2025) - [i15]Ethan N. Epperly:
Make the most of what you have: Resource-efficient randomized algorithms for matrix computations. CoRR abs/2512.15929 (2025) - 2024
- [j5]Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
XTrace: Making the Most of Every Sample in Stochastic Trace Estimation. SIAM J. Matrix Anal. Appl. 45(1): 1-23 (2024) - [j4]Ethan N. Epperly:
Fast and Forward Stable Randomized Algorithms for Linear Least-Squares Problems. SIAM J. Matrix Anal. Appl. 45(4): 1782-1804 (2024) - [j3]Ethan N. Epperly, Joel A. Tropp:
Efficient Error and Variance Estimation for Randomized Matrix Computations. SIAM J. Sci. Comput. 46(1): 508- (2024) - [c2]Zhiyan Ding, Ethan N. Epperly, Lin Lin, Ruizhe Zhang:
The ESPRIT Algorithm Under High Noise: Optimal Error Scaling and Noisy Super-Resolution. FOCS 2024: 2344-2366 - [i14]Zhiyan Ding, Ethan N. Epperly, Lin Lin, Ruizhe Zhang:
The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution. CoRR abs/2404.03885 (2024) - [i13]Heather Wilber, Ethan N. Epperly, Alex H. Barnett:
A superfast direct inversion method for the nonuniform discrete Fourier transform. CoRR abs/2404.13223 (2024) - [i12]Ethan N. Epperly, Maike Meier, Yuji Nakatsukasa:
Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers. CoRR abs/2406.03468 (2024) - [i11]Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky. CoRR abs/2410.03969 (2024) - [i10]Ethan N. Epperly, Gil Goldshlager, Robert J. Webber:
Randomized Kaczmarz with tail averaging. CoRR abs/2411.19877 (2024) - 2023
- [c1]Ethan Epperly, Elvira Moreno:
Kernel Quadrature with Randomly Pivoted Cholesky. NeurIPS 2023 - [i9]Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
XTrace: Making the most of every sample in stochastic trace estimation. CoRR abs/2301.07825 (2023) - [i8]Mateo Díaz, Ethan N. Epperly, Zachary Frangella, Joel A. Tropp, Robert J. Webber:
Robust, randomized preconditioning for kernel ridge regression. CoRR abs/2304.12465 (2023) - [i7]Ethan N. Epperly, Elvira Moreno:
Kernel Quadrature with Randomly Pivoted Cholesky. CoRR abs/2306.03955 (2023) - [i6]Ethan N. Epperly:
Fast and forward stable randomized algorithms for linear least-squares problems. CoRR abs/2311.04362 (2023) - 2022
- [j2]Nithin Govindarajan, Ethan N. Epperly, Lieven De Lathauwer:
$(L_r, L_r, 1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials. SIAM J. Matrix Anal. Appl. 43(2): 912-938 (2022) - [j1]Ethan N. Epperly, Lin Lin, Yuji Nakatsukasa:
A Theory of Quantum Subspace Diagonalization. SIAM J. Matrix Anal. Appl. 43(3): 1263-1290 (2022) - [i5]Ethan N. Epperly, Joel A. Tropp:
Jackknife Variability Estimation For Randomized Matrix Computations. CoRR abs/2207.06342 (2022) - [i4]Yifan Chen, Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations. CoRR abs/2207.06503 (2022) - 2021
- [i3]Ethan N. Epperly, Nithin Govindarajan, Shivkumar Chandrasekaran:
Minimal Rank Completions for Overlapping Blocks. CoRR abs/2106.11267 (2021) - [i2]Ethan N. Epperly, Lin Lin, Yuji Nakatsukasa:
A Theory of Quantum Subspace Diagonalization. CoRR abs/2110.07492 (2021)
2010 – 2019
- 2019
- [i1]Shivkumar Chandrasekaran, Ethan Epperly, Nithin Govindarajan:
Graph-Induced Rank Structures and their Representations. CoRR abs/1911.05858 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-08-12 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
