A Computational Spectral Graph Theory TutorialRich Lehoucq
Sandia National Laboratories
Wednesday, September 17, 2014 15:00-16:00,
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 Bio: Rich Lehoucq is a member of the technical staff at Sandia National Labs, where he has resided for the last 17 years. He graduated with a Ph.D from Rice university in 1995, where he had the singular honor of meeting Dr. Tony Kearsley, a fellow graduate student. Rich has undertaken research in large-scale linear algebra, finite elements methods, mechanics, diffusion process and spectral graph theory. Please visit his web page at http://www.sandia.gov/~rblehou/ for further information.
Contact: A. J. Kearsley
Note: Visitors from outside NIST must contact Cathy Graham; (301) 975-3800; at least 24 hours in advance.