TALK    A computational spectral graph theory tutorial

Date & Time:

Wednesday, July 13, 2016; 2:30 PM - 3:30

Abstract:

My presentation considers the research question of whether existing algorithms and software for the large-scale sparse eigenvalue problem can be applied to problems in spectral graph theory. I first provide an introduction to several problems involving spectral graph theory. I then provide a review of several different algorithms for the large-scale eigenvalue problem and briefly introduce the Anasazi package of eigensolvers.

Speaker:

Richard Lehoucq
Sandia National Laboratories

Rich Lehoucq has been a member of the technical staff at Sandia National Laboratories since 1997. Please see his web page http://www.sandia.gov/~rblehou for information on his areas of research in applied mathematics.

External Link:

http://www.sandia.gov/~rblehou

Research Areas:

Computer Vision, Digital Video, Machine Learning