The focus of this seminar is various methods in scientific computing, the analysis of their convergence properties and computational efficiency, and their adaptation to specific applications.

The seminar meets Mondays, 1:25-2:15 pm, in 406 Gates Hall.

Date	Speaker and Title
Jan 29
Feb 05	Alex Barnett (Math, Dartmouth and NA Group, Flatiron Institute) Building a better nonuniform fast Fourier transform
Feb 12	Vanni Noferini (Math, Essex University) Eigenvalue avoidance for structured matrices
Feb 26	Mahdi Esmaily (MAE, Cornell University) An efficient linear solver for incompressible flows
Mar 05	Yang Ning (Statistical Science, Cornell University) Sparse Latent Factor Models with Pure Variables for Overlapping Clustering
Mar 12	Alex Townsend (Mathematics, Cornell University) Algebraic-geometric methods for multidimensional polynomial rootfinding
Mar 19	Dierk Schleicher (Math, Jacobs University, Bremen, Germany) Newton’s method as an interesting dynamical system and as an unexpectedly efficient root finder
Mar 26	Andy Ruina (MAE, Cornell) Passive dynamics is not a good basis for robot design and control. Maybe some kind of global optimization is.
Apr 09	Kristopher Rowe (CEE, Cornell) A Unified View of High-Order Element Schemes
Apr 16	Minghao Rostami (Math, Syracuse University) Robust Linear Stability Analysis
Apr 23	Victor Minden (Computational Neuroscience, Flatiron Institute) A recursive skeletonization factorization based on strong admissibility
Apr 30	Marc Aurele Gilles (CAM, Cornell University) Continuous Analogues of Krylov Subspace Methods for Differential Operators
	Aurya Javeed (CAM, Cornell University) SDEs as ODEs
May 07	Terrance Pendleton (Drake University) On Invariant-Preserving Finite Difference Schemes for the Camassa-Holm Equation and the Two-Component Camassa-Holm System