public 02:33:52

Thomas Witelski : Math 551 Review session

  -   Presentations ( 222 Views )

public 01:34:50

James Bremer : Improved methods for discretizing integral operators

  -   Presentations ( 217 Views )

Integral equation methods are frequently used in the numerical solution of elliptic boundary value problems. After giving a brief overview of the advantages and disadvantages of such methods vis-a-vis more direct techniques like finite element methods, I will discuss two problems which arise in integral equation methods. In both cases, I take a contrarian position. The first is the discretization of integral operators on singular domains (e.g., surfaces with edges and curves with corners). The consensus opinion holds that integral equations given on such domains are exceedingly difficult to discretize and that sophisticated analysis, often specific to a particular boundary value problem, is required. I will explain that, in fact, the efficient solution of a broad class of such problems can be effected using an elementary approach. Exterior scattering problems given on planar domains with tens of thousands of corner points can be solved to 12 digit accuracy on my two year old desktop computer in a matter of hours. The second problem I will discuss is the evaluation of the singular integrals which arise form the discretization of weakly singular integral operators given on surfaces. Exponentially convergent algorithms for evaluating these integrals have been described in the literature and it is widely regarded as a "solved" problem. I will explain why this is not so and describe an approach which yields only algebraic convergence, but nonetheless performs better in practice than standard exponentially convergent methods.

public 00:04

M. Lipnowski : M. Lipnowski (Room Reservation)

  -   Presentations ( 215 Views )

public 01:34:51

Thomas Witelski : Grant Writing Workshop

  -   Presentations ( 203 Views )

public 59:53

Jason Ferguson : PRUV Research

  -   Presentations ( 181 Views )

public 05:53

Matthias Heymann : Computing maximum likelihood paths of rare transition events, and applications to synthetic biology

  -   Presentations ( 176 Views )

Dynamical systems with small noise (e.g. SDEs) allow for rare transitions from one stable state into another that would not be possible without the presence of noise. Large deviation theory provides the means to analyze both the frequency of these transitions and the maximum likelihood transition path. The key object for the determination of both is the quasipotential, V(x,y) = inf S_T(phi), where S_T(phi) is the action functional associated to the system, and where the infimum is taken over all T>0 and all paths phi:[0,T]->R^n leading from x to y. The numerical evaluation of V(x,y) however is made difficult by the fact that in most cases of interest no minimizer exists.

In my work I prove an alternative geometric formulation of V(x,y) that resolves this issue by introducing an action on the space of curves ( i.e. this action is independent of the parametrization of phi). In this formulation, a minimizer exists, and we use it to build a flexible algorithm (the geometric minimum action method, gMAM) for finding the maximum likelihood transition curve.

In one application I show how the gMAM can be useful in the newly emerging field of synthetic biology: We propose a method to identify the sources of instabilities in (genetic) networks.

This work was done in collaboration with my adviser Eric Vanden-Eijnden and is the core of my PhD thesis at NYU.

public 01:34:27

Ezra Miller : Metric geometry and unfoldings of polyhedra

  -   Presentations ( 173 Views )

public 01:34:52

Ingrid Daubechies : Wavelets and their Applications

  -   Presentations ( 146 Views )