activity
20192022
most citedApproximating matrix eigenvalues by subspace iteration with repeated random sparsification

5 citations · 9 across the 2 of their papers we have counts for

collaborators

5 papers

physics.comp-ph2022★ 4 cited

Full Configuration Interaction Excited-State Energies in Large Active Spaces from Subspace Iteration with Repeated Random Sparsification

Samuel M. Greene, Robert J. Webber, James E. T. Smith +2

We present a stable and systematically improvable quantum Monte Carlo (QMC) approach to calculating excited-state energies, which we implement using our fast randomized iteration m…

math.NA2021★ 5 cited

Approximating matrix eigenvalues by subspace iteration with repeated random sparsification

Samuel M. Greene, Robert J. Webber, Timothy C. Berkelbach +1

Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the es…

cond-mat.mtrl-sci2020

Simulations of Trions and Biexcitons in Layered Hybrid Organic-Inorganic Lead Halide Perovskites

Yeongsu Cho, Samuel M. Greene, Timothy C. Berkelbach

Behaving like atomically-precise two-dimensional quantum wells with non-negligible dielectric contrast, the layered HOIPs have strong electronic interactions leading to tightly bou…

physics.comp-ph2020

Improved Fast Randomized Iteration Approach to Full Configuration Interaction

Samuel M. Greene, Robert J. Webber, Jonathan Weare +1

We present three modifications to our recently introduced fast randomized iteration method for full configuration interaction (FCI-FRI) and investigate their effects on the method'…

physics.chem-ph2019

Beyond Walkers in Stochastic Quantum Chemistry: Reducing Error using Fast Randomized Iteration

Samuel M. Greene, Robert J. Webber, Jonathan Weare +1

We introduce a family of methods for the full configuration interaction problem in quantum chemistry, based on the fast randomized iteration (FRI) framework [L.-H. Lim and J. Weare…