New Algorithms for Lattice Simulations of Nuclear Structure and Reactions

This talk covers several new algorithms for computing nuclear structure and reactions using lattice simulations. One is the generalization of Markov chains to Markov trees and Markov products and the mirror approximation. This is used to perform more efficient simulations of the spatial correlations of nucleons using the pinhole algorithm. The second is the persistant state method and calculation of resonance decay widths using Monte Carlo simulations.