Approximating matrix eigenvalues by randomized subspace iteration.

Samuel M. Greene, Robert J. Webber, Timothy C. Berkelbach, Jonathan Weare

Type: Preprint

Publication Date: 2021-03-22

Citations: 1

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Approximating matrix eigenvalues by subspace iteration with repeated random sparsification	2021	Samuel M. Greene Robert J. Webber Timothy C. Berkelbach Jonathan Weare
+ PDF Chat	Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification	2022	Samuel M. Greene Robert J. Webber Timothy C. Berkelbach Jonathan Weare
+	Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications	2023	Joel A. Tropp Robert J. Webber
+ PDF Chat	Triangularized Orthogonalization-Free Method for Solving Extreme Eigenvalue Problems	2022	Weiguo Gao Yingzhou Li Bichen Lu
+	Triangularized Orthogonalization-free Method for Solving Extreme Eigenvalue Problems	2020	Weiguo Gao Yingzhou Li Bichen Lu
+	Randomized subspace iteration--data from numerical experiments	2021	Samuel M. Greene Robert J. Webber Timothy C. Berkelbach Jonathan Weare
+	Randomized subspace iteration--data from numerical experiments	2021	Samuel M. Greene Robert J. Webber Timothy C. Berkelbach Jonathan Weare
+ PDF Chat	A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems	2022	M. B. Kenmoe Ronald Kriemann Matteo Smerlak Anton S. Zadorin
+	Matrix-free construction of HSS representation using adaptive randomized sampling	2018	Christopher B. Gorman Gustavo Chávez Pieter Ghysels Théo Mary François-Henry Rouet Xiaoye Sherry Li
+	Matrix-free construction of HSS representation using adaptive randomized sampling	2018	Christopher Gorman Gustavo Chávez Pieter Ghysels Théo Mary François-Henry Rouet Xiaoye Sherry Li
+	A theory of quantum subspace diagonalization	2021	Ethan N. Epperly Lin Lin Yuji Nakatsukasa
+	Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction	2019	Christopher Gorman Gustavo Chávez Pieter Ghysels Théo Mary François-Henry Rouet Xiaoye Sherry Li
+ PDF Chat	A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors	2020	Taylor M. Hernandez Roel Van Beeumen M. A. Caprio Chao Yang
+	A fast iterative algorithm for near-diagonal eigenvalue problems	2020	M. B. Kenmoe Ronald Kriemann Matteo Smerlak Anton S. Zadorin
+ PDF Chat	A Theory of Quantum Subspace Diagonalization	2022	Ethan N. Epperly Lin Lin Yuji Nakatsukasa
+ PDF Chat	Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky	2024	Ethan N. Epperly Joel A. Tropp Robert J. Webber
+	A robust, open-source implementation of the locally optimal block preconditioned conjugate gradient for large eigenvalue problems in quantum chemistry	2023	Tommaso Nottoli Ivan Giannì Antoine Levitt Filippo Lipparini
+	Faster randomized partial trace estimation	2023	Tyler Chen Robert S. Chen Kevin Li Skai Nzeuton Yilu Pan Yixin Wang
+ PDF Chat	Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra	2017	Lek-Heng Lim Jonathan Weare
+ PDF Chat	Faster Randomized Partial Trace Estimation	2024	Tyler Chen Robert S. Chen Kevin Li Skai Nzeuton Yilu Pan Yixin Wang

Works That Cite This (1)

Action	Title	Year	Authors
+	Rare Event Sampling Improves Mercury Instability Statistics	2021	Dorian S. Abbot Robert J. Webber Sam Hadden Darryl Z. Seligman Jonathan Weare

Works Cited by This (21)

Action	Title	Year	Authors
+ PDF Chat	Randomized algorithms for the low-rank approximation of matrices	2007	Edo Liberty Franco Woolfe Per‐Gunnar Martinsson Vladimir Rokhlin Mark Tygert
+	Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix	2006	Petros Drineas Ravi Kannan Michael W. Mahoney
+	Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition	2006	Petros Drineas Ravi Kannan Michael W. Mahoney
+	Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix	1969	G. W. Stewart
+	Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication	2006	Petros Drineas Ravi Kannan Michael W. Mahoney
+ PDF Chat	CUR matrix decompositions for improved data analysis	2009	Michael W. Mahoney Petros Drineas
+	A Randomized Algorithm for the Approximation of Matrices	2006	Per‐Gunnar Martinsson Vladimir Rockhlin Mark Tygert
+ PDF Chat	A comparison of pivotal sampling and unequal probability sampling with replacement	2016	Guillaume Chauvet Anne Ruiz‐Gazen
+ PDF Chat	Krylov-Projected Quantum Monte Carlo Method	2015	Nick S. Blunt Ali Alavi George H. Booth
+ PDF Chat	Semistochastic Projector Monte Carlo Method	2012	F. R. Petruzielo Adam Holmes Hitesh J. Changlani M. P. Nightingale C. J. Umrigar