David Bindel
Assistant Professor of Computer Science
Computer scientist,
applied mathematician, and
computational
engineer.
Confusing rabbits since 2003.
Office: 5137 Upson Hall
Hours: W 1:30-2:30, Th 3-4, F 10-11
bindel@cs.cornell.edu /
607-255-5395
Department of Computer Science
Cornell University
Ithaca, NY 14853
News!
2012-08-28: First day of instruction for F13. Come see me for CS 6210!
2012-08-01: Fast Iterative Graph Computation with Block Updates by Xie, Wang, Bindel, Demers, and Gehrke accepted for VLDB
2012-07-20: Talk on rank-structured Cholesky at ND 40 workshop
2013-07-16: First revamp of this page in a year!
Research highlights
Rank-structured PDE solvers
Moving toward pain-free fast direct sparse solvers for 3D PDEs.
- Slides from a workshop at Waterloo Celebrating 40 Years of Nested Dissection (with Jeff Chadwick).
Nonlinear eigenvalue bounds
Generalizing classic eigenvalue localization results (e.g. Gershgorin).
- Localization results for nonlinear eigenvalue problems (with Amanda Hood, submitted to SIMAX)
- Nonlinear Gershgorin talk at SIAM AN 13
Solid-wave MEMS gyroscopes
Building simulation tools to understand the challenges in miniaturizing the current gyro-of-choice for space applications. Success means MEMS IN SPACE!
- Imperfections in Solid-Wave Gyroscope Dynamics (with Erdal Yilmaz, IEEE SENSORS 2013, to appear)
- Gyros in a CAD for MEMS talk at FIST 2012.
Opinions as game theory
In the game of expressing our opinions, we all want to both follow our beliefs and agree with our friends. Analyzing Nash equilibria yields interesting insights. Eigenvalues are involved!
- How bad is choosing your own opinion? (with Sigal Oren and Jon Kleinberg, FOCS 2011)
- ArXiV paper (submitted to GEB)
Currently teaching
Matrix Computations (CS 6210)
Fall 2013. MWF, 11:15-12:05, Upson 211.
Numerical linear algebra. Basic theory, efficient algorithms, and enough error analysis to avoid numerical embarrassment (we hope)! Direct and iterative methods for linear systems, least squares, and eigenvalues.
SCAN Seminar (CS/MATH 7290)
Ongoing. MWF, 1:25-2:15, Upson 315.
Numerical linear algebra. Basic theory, efficient algorithms, and enough error analysis to avoid numerical embarrassment (we hope)! Direct and iterative methods for linear systems, least squares, and eigenvalues.
Projects (CS [45]999)
See my list of projects!
If nothing on the list appeals but you think you'd like to work with me on something, come knock on my door. I don't bite.