{"id":751,"date":"2021-06-21T23:08:13","date_gmt":"2021-06-21T23:08:13","guid":{"rendered":"http:\/\/www.ethanepperly.com\/?page_id=751"},"modified":"2026-06-08T00:42:04","modified_gmt":"2026-06-08T00:42:04","slug":"publications","status":"publish","type":"page","link":"https:\/\/www.ethanepperly.com\/index.php\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<p>Here are a list of my published articles, technical reports, and preprints in chronological order. <\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Published or accepted<\/h3>\n\n\n\n<ol class=\"wp-block-list\">\n<li>T. Chen, <strong>E. N. Epperly<\/strong>, R. A. Meyer, C. Musco, &amp; A. Rao (2026). <a href=\"https:\/\/doi.org\/10.1137\/1.9781611978971.42\">Does block size matter in randomized block Krylov low-rank approximation?<\/a>. Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 1026\u20131046. (<a href=\"https:\/\/arxiv.org\/abs\/2508.06486\">preprint<\/a>)<\/li>\n\n\n\n<li>C. Cama\u00f1o, <strong>E. N. Epperly<\/strong>, &amp; J. A. Tropp (2026). <a href=\"https:\/\/doi.org\/10.22331\/q-2026-03-10-2022\">Successive Randomized Compression: A Randomized Algorithm for the Compressed MPO-MPS Product<\/a>. Quantum 10, 2022. (<a href=\"https:\/\/arxiv.org\/abs\/2504.06475\">preprint<\/a>)<\/li>\n\n\n\n<li>M. Derezi\u0144ski, <strong>E. N. Epperly<\/strong>, &amp; R. A. Meyer (2026). The Matrix-Vector Complexity of <img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/www.ethanepperly.com\/wp-content\/ql-cache\/quicklatex.com-74cf8e6aba2f68b71c67025a069e8937_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#65;&#120;&#61;&#98;\" title=\"Rendered by QuickLaTeX.com\" height=\"13\" width=\"55\" style=\"vertical-align: 0px;\"\/>. Proceedings of the 2026 Conference on Learning Theory, accepted. (<a href=\"https:\/\/arxiv.org\/abs\/2602.04842\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, A. Greenbaum, &amp; Y. Nakatsukasa (2026). <a href=\"https:\/\/doi.org\/10.1007\/s00211-026-01547-1\">Stable Algorithms for General Linear Systems by Preconditioning the Normal Equations<\/a>. Numerische Mathematik. (<a href=\"https:\/\/arxiv.org\/abs\/2502.17767\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, G. Goldshlager, &amp; R. J. Webber (2026). <a href=\"https:\/\/doi.org\/10.1016\/j.acha.2025.101812\">Randomized Kaczmarz with Tail Averaging<\/a>. Applied and Computational Harmonic Analysis 80, 101812. (<a href=\"https:\/\/arxiv.org\/abs\/2411.19877\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, M. Meier, &amp; Y. Nakatsukasa (2026). <a href=\"https:\/\/doi.org\/10.1002\/cpa.70013\">Fast Randomized Least-Squares Solvers Can Be Just as Accurate and Stable as Classical Direct Solvers<\/a>. Communications on Pure and Applied Mathematics 79, 293\u2013339. (<a href=\"https:\/\/arxiv.org\/abs\/2406.03468\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong> (2026). Adaptive Randomized Pivoting and Volume Sampling. SIAM Journal on Matrix Analysis and Applications, accepted. (<a href=\"https:\/\/arxiv.org\/abs\/2510.02513\">preprint<\/a>)<\/li>\n\n\n\n<li>Y. Chen, <strong>E. N. Epperly<\/strong>, J. A. Tropp, &amp; R. J. Webber (2025). <a href=\"https:\/\/doi.org\/10.1002\/cpa.22234\">Randomly Pivoted Cholesky: Practical Approximation of a Kernel Matrix with Few Entry Evaluations<\/a>. Communications on Pure and Applied Mathematics 78, 995\u20131041. (<a href=\"https:\/\/arxiv.org\/abs\/2207.06503\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, J. A. Tropp, &amp; R. J. Webber (2025). <a href=\"https:\/\/doi.org\/10.1137\/24M1699048\">Embrace Rejection: Kernel Matrix Approximation by Accelerated Randomly Pivoted Cholesky<\/a>. SIAM Journal on Matrix Analysis and Applications, 2527\u20132557. (<a href=\"https:\/\/arxiv.org\/abs\/2410.03969\">preprint<\/a>)<\/li>\n\n\n\n<li>H. Wilber, <strong>E. N. Epperly<\/strong>, &amp; A. H. Barnett (2025). <a href=\"https:\/\/doi.org\/10.1137\/24M1656694\">Superfast Direct Inversion of the Nonuniform Discrete Fourier Transform via Hierarchically Semiseparable Least Squares<\/a>. SIAM Journal on Scientific Computing, A1702-A1732. (<a href=\"https:\/\/arxiv.org\/abs\/2404.13223\">preprint<\/a>)<\/li>\n\n\n\n<li>Z. Ding, <strong>E. N. Epperly<\/strong>, L. Lin, &amp; R. Zhang (2024). <a href=\"https:\/\/doi.org\/10.1109\/FOCS61266.2024.00137\">The ESPRIT Algorithm under High Noise: Optimal Error Scaling and Noisy Super-Resolution<\/a>. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2344\u20132366. (<a href=\"https:\/\/arxiv.org\/abs\/2404.03885\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong> (2024). <a href=\"https:\/\/doi.org\/10.1137\/23M1616790\">Fast and Forward Stable Randomized Algorithms for Linear Least-Squares Problems<\/a>. SIAM Journal on Matrix Analysis and Applications, 1782\u20131804. (<a href=\"https:\/\/arxiv.org\/abs\/2311.04362\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong> &amp; J. A. Tropp (2024). <a href=\"https:\/\/doi.org\/10.1137\/23M1558537\">Efficient Error and Variance Estimation for Randomized Matrix Computations<\/a>. SIAM Journal on Scientific Computing 46, A508-A528. (<a href=\"https:\/\/arxiv.org\/abs\/2207.06342\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, J. A. Tropp, &amp; R. J. Webber (2024). <a href=\"https:\/\/doi.org\/10.1137\/23M1548323\">XTrace: Making the Most of Every Sample in Stochastic Trace Estimation<\/a>. SIAM Journal on Matrix Analysis and Applications, 1\u201323. (<a href=\"https:\/\/arxiv.org\/abs\/2301.07825\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. Epperly<\/strong> &amp; E. Moreno (2023). <a href=\"https:\/\/dl.acm.org\/doi\/10.5555\/3666122.3668997\">Kernel Quadrature with Randomly Pivoted Cholesky<\/a>. Advances in Neural Information Processing Systems 36, 65850\u201365868. (<a href=\"https:\/\/arxiv.org\/abs\/2306.03955\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, L. Lin, &amp; Y. Nakatsukasa (2022). <a href=\"https:\/\/doi.org\/10.1137\/21M145954X\">A Theory of Quantum Subspace Diagonalization<\/a>. SIAM Journal on Matrix Analysis and Applications 43, 1263\u20131290. (<a href=\"https:\/\/arxiv.org\/abs\/2110.07492\">preprint<\/a>)<\/li>\n\n\n\n<li>N. Govindarajan, <strong>E. N. Epperly<\/strong>, &amp; L. D. Lathauwer (2022). <a href=\"https:\/\/doi.org\/10.1137\/21M1426444\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/www.ethanepperly.com\/wp-content\/ql-cache\/quicklatex.com-96483fc41a556978659b4a8d85b24ddb_l3.png\" class=\"ql-img-inline-formula quicklatex-auto-format\" alt=\"&#40;&#76;&#95;&#114;&#44;&#76;&#95;&#114;&#44;&#49;&#41;\" title=\"Rendered by QuickLaTeX.com\" height=\"19\" width=\"76\" style=\"vertical-align: -5px;\"\/>-decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials<\/a>. SIAM Journal on Matrix Analysis and Applications 43, 912\u2013938.<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, N. Govindarajan, &amp; S. Chandrasekaran (2021). <a href=\"https:\/\/doi.org\/10.1016\/j.laa.2021.06.011\">Minimal Rank Completions for Overlapping Blocks<\/a>. Linear Algebra and its Applications 627, 185\u2013198. (<a href=\"https:\/\/arxiv.org\/abs\/2106.11267\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong> &amp; R. B. Sills (2020). <a href=\"https:\/\/doi.org\/10.1016\/j.actamat.2020.03.031\">Transient Solute Drag and Strain Aging of Dislocations<\/a>. Acta Materialia 193, 182\u2013190.<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong> &amp; R. B. Sills (2020). <a href=\"https:\/\/doi.org\/10.1016\/j.jmps.2020.103944\">Comparison of Continuum and Cross-Core Theories of Dynamic Strain Aging<\/a>. Journal of the Mechanics and Physics of Solids 141, 103944.<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\">Under review<\/h3>\n\n\n\n<ol start=\"21\" class=\"wp-block-list\">\n<li><strong>E. N. Epperly<\/strong>, T. Park, &amp; Y. Nakatsukasa (2026). <a href=\"http:\/\/arxiv.org\/abs\/2602.16797v1\">Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices<\/a>. arXiv preprint. (<a href=\"http:\/\/arxiv.org\/abs\/2602.16797v1\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong> &amp; R. J. Webber (2026). <a href=\"http:\/\/arxiv.org\/abs\/2605.19096v1\">Sharp Analysis of Sketched Least Squares and Randomized Low-Rank Approximation<\/a>. arXiv preprint. (<a href=\"http:\/\/arxiv.org\/abs\/2605.19096v1\">preprint<\/a>)<\/li>\n\n\n\n<li>C. Cama\u00f1o, <strong>E. N. Epperly<\/strong>, R. A. Meyer, &amp; J. A. Tropp (2025). <a href=\"http:\/\/arxiv.org\/abs\/2508.21189v1\">Faster Linear Algebra Algorithms with Structured Random Matrices<\/a>. arXiv preprint. (<a href=\"http:\/\/arxiv.org\/abs\/2508.21189v1\">preprint<\/a>)<\/li>\n\n\n\n<li>M. D\u00edaz, <strong>E. N. Epperly<\/strong>, Z. Frangella, J. A. Tropp, &amp; R. J. Webber (2023). <a href=\"http:\/\/arxiv.org\/abs\/2304.12465v5\">Robust, Randomized Preconditioning for Kernel Ridge Regression<\/a>. arXiv preprint. (<a href=\"http:\/\/arxiv.org\/abs\/2304.12465v5\">preprint<\/a>)<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\">Reports and other<\/h3>\n\n\n\n<ol start=\"25\" class=\"wp-block-list\">\n<li>N. Amsel, Y. Baumann, P. Beckman, P. B\u00fcrgisser, C. Cama\u00f1o, T. Chen, E. Chow, A. Damle, M. Derezinski, M. Embree, <strong>E. N. Epperly<\/strong>, R. Falgout, M. Fornace, A. Greenbaum, C. Greif, D. Halikias, Z. Huang, E. Jarlebring, Y. Koutis, D. Kressner, R. Kyng, J. Liesen, J. Lok, R. A. Meyer, Y. Nakatsukasa, K. Pearce, R. Peng, D. Persson, E. Rebrova, R. Schneider, R. Shah, E. Solomonik, N. Srivastava, A. Townsend, R. J. Webber, &amp; J. Williams (2026). <a href=\"http:\/\/arxiv.org\/abs\/2602.05394v2\">Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop<\/a>. arXiv preprint. (<a href=\"http:\/\/arxiv.org\/abs\/2602.05394v2\">preprint<\/a>)<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong> (2025). <a href=\"https:\/\/doi.org\/10.7907\/pef3-mg80\">Make the Most of What You Have: Resource-efficient Randomized Algorithms for Matrix Computations<\/a>. PhD dissertation, California Institute of Technology.<\/li>\n\n\n\n<li><strong>E. N. Epperly<\/strong>, A. T. Barker, &amp; R. D. Falgout (2020). <a href=\"https:\/\/doi.org\/10.2172\/1660522\">Smoothers for Matrix-Free Algebraic Multigrid Preconditioning of High-Order Finite Elements<\/a>. Technical report LLNL-TR-814531, Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States).<\/li>\n\n\n\n<li>S. Chandrasekaran, <strong>E. Epperly<\/strong>, &amp; N. Govindarajan (2019). <a href=\"http:\/\/arxiv.org\/abs\/1911.05858v3\">Graph-Induced Rank Structures and Their Representations<\/a>. arXiv preprint. (<a href=\"http:\/\/arxiv.org\/abs\/1911.05858v3\">preprint<\/a>)<\/li>\n\n\n\n<li>D. K. Ward, X. Zhou, R. A. Karnesky, R. Kolasinski, M. E. Foster, K. Thurmer, P. Chao, <strong>E. N. Epperly<\/strong>, J. A. Zimmerman, B. M. Wong, &amp; R. B. Sills (2015). <a href=\"https:\/\/doi.org\/10.2172\/1222665\">Understanding H Isotope Adsorption and Absorption of Al-alloys Using Modeling and Experiments (LDRD: #165724)<\/a>. Technical report SAND-2015-8388, Sandia National Lab. (SNL-CA), Livermore, CA (United States).<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>Here are a list of my published articles, technical reports, and preprints in chronological order. Published or accepted Under review Reports and other<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-751","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/pages\/751","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/comments?post=751"}],"version-history":[{"count":62,"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/pages\/751\/revisions"}],"predecessor-version":[{"id":2328,"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/pages\/751\/revisions\/2328"}],"wp:attachment":[{"href":"https:\/\/www.ethanepperly.com\/index.php\/wp-json\/wp\/v2\/media?parent=751"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}