ADD, MULTIPLY, DIVIDE, AND CONQUER: FACTORIZATION ALGORITHMS FOR LARGE SCALE MANY-BODY PROBLEMS


TITLE:


ADD, MULTIPLY, DIVIDE, AND CONQUER: FACTORIZATION ALGORITHMS FOR LARGE SCALE MANY-BODY PROBLEMS


DATE:


Friday, September 24th, 2010


TIME:


3:30 PM


LOCATION:


GMCS 214


SPEAKER:


Calvin W. Johnson, Department of Physics, San Diego State University


ABSTRACT:


One method of solving the quantum many-body problem involves findings eigenvalues of a huge matrix, with dimensions up to a billion or more. While such matrices are extremely sparse, nonetheless just the non-zero matrix elements can require hundreds of gigabytes or even terabytes of memory. If one has symmetries, and exact additive/mutiplicative quantum numbers, the problem can be exactly factorized, which reduces the memory load by one to two orders of magnitude, allowing one to either tackle the same problem on a much smaller computer, or much larger problems on the same computer.


HOST:


Michael Bromley


DOWNLOAD: