Network & Matrix Computations
David Gleich
Purdue University
Fall 2011
Course number CS 59000-NMC
Tuesdays and Thursday, 10:30am-11:45am
CIVL 2123
References
Background classes
- Gilbert Strang, Introduction to Linear Algebra. MIT OpenCourseWare http://ocw.mit.edu/courses/mathematics/18-06-linear-algebra-spring-2010/
Background tutorials
- Kolter and Do, Linear Algebra Review and References. Stanford University, CS 229 (Machine Learning). http://www.stanford.edu/class/cs229/section/cs229-linalg.pdf
Related tutorials
- Faloutsos, Miller, and Tsourakakis. Large Graph Mining KDD2009 tutorial.
- Mahoney. Geometric Network Analysis Tools SAMSI 2011
Other courses
- Amin Saberi, Information Networks, Stanford http://www.stanford.edu/class/msande337/
- Dan Spielman, Spectral Graph Theory, Yale http://www.cs.yale.edu/homes/spielman/561/
- John Gilbert, Tools for High-Performance Computing with Big Graphs, UCSB http://www.cs.ucsb.edu/~gilbert/cs595Fall2010/index.html
Matrix computations reference books
- Golub and van Loan, Matrix Computations, Princeton.
- Trefethen and Bau, Numerical Linear Algebra, SIAM.
- Demmel, Applied Numerical Linear Algebra, SIAM.
Textbooks
Graphs, Dioids and Semirings: New Models and Algorithms Michel Gondran and Michel Minoux, Springer 2008. http://dx.doi.org/10.1007/978-0-387-75450-5