Research Activities > Programs >
Fast Approximate Algorithms > Gregory Beylkin
|
CSIC Building (#406),
Seminar Room 4122.
Directions: home.cscamm.umd.edu/directions
|
Separated Representations and Fast Adaptive Algorithms in Multiple Dimensions
Dr. Gregory Beylkin
University of Colorado at Boulder
|
Abstract:
In the ordinary representation the cost of linear algebra operations,
such as matrix-matrix or matrix-vector multiplications, increases
exponentially with the underlying physical dimension. For any finite but
arbitrary accuracy, we represent operators in a separated form, a
numerical generalization of separation of variables. Our approach is
based on the fact that a wide class of physically significant operators
have a low separation rank. I will present relevant analytic and
numerical results and describe a new method for electron structure
computations based on this approach.
[LECTURE SLIDES]
|
|
|