Speaker: Divakar Viswanath (University of Michigan)
Date: 24 November 2014
Time: 2:00 pm
Venue: LH-1, Department of Mathematics, IISc
Finite difference formulas approximate the derivatives of a function given its values at a discrete set of grid points. Much of the theory for choosing grid points is concerned with discretization errors and rounding errors are ignored completely. However, when the grids become fine the rounding errors dominate. Finding finite difference formulas which optimize the total error leads to a combinatorial optimization problem with a large search space. In this talk, we will describe a random walk based strategy for tackling the combinatorial optimization problem.