The first FFT-based algorithm for numerical homogenization from high-resolution images was proposed by Moulinec and Suquet in 1994 as an alternative to finite elements and twenty years later, it is still widely used in computational micromechanics of materials. The method is based on an iterative solution to an integral equation of the Lippmann-Schwinger type, whose kernel can be explicitly expressed in the Fourier domain. Only recently, it has been recognized that the algorithm has a variational structure arising from a Fourier-Galerkin method. In this talk, I will show how this insight can be used to significantly improve the performance of the original Moulinec-Suquet solver. In particular, I will focus on (i) influence of an iterative solver used to solve the system of linear algebraic equations, (ii) effects of numerical integration of the Galerkin weak form, and (iii) convergence of an a-posteriori bound on the solution during iterations.

Hardy and Littlewood's approximate functional equation for quadratic Weyl sums (theta sums) provides, by iterative application, a powerful tool for the asymptotic analysis of such sums. The classical Jacobi theta function, on the other hand, satisfies an exact functional equation, and extends to an automorphic function on the Jacobi group. In the present study we construct a related, almost everywhere non-differentiable automorphic function, which approximates quadratic Weyl sums up to an error of order one, uniformly in the summation range. This not only implies the approximate functional equation, but allows us to replace Hardy and Littlewood's renormalization approach by the dynamics of a certain homogeneous flow. The great advantage of this construction is that the approximation is global, i.e., there is no need to keep track of the error terms accumulating in an iterative procedure. Our main application is a new functional limit theorem, or invariance principle, for theta sums. The interesting observation here is that the paths of the limiting process share a number of key features with Brownian motion (scale invariance, invariance under time inversion, non-differentiability), although time increments are not independent and the value distribution at each fixed time is distinctly different from a normal distribution. Joint work with Francesco Cellarosi.

In particular, some nice things about branch groups, whose subgroup structure  "sees" all actions on rooted trees.

A year ago I gave a talk raising questions about Faraday shielding which stimulated discussion with John Ockendon and others and led to a collaboration with Jon Chapman and Dave Hewett.  The problem is one of harmonic functions subject to constant-potential boundary conditions.  A year later, we are happy with the solution we have found, and the paper will appear in SIAM Review.  Though many assume as we originally did that Faraday shielding must be exponentially effective, and Feynman even argues this explicitly in his Lectures, we have found that in fact, the shielding is only linear.  Along the way to explaining this we make use of Mikhlin's numerical method of series expansion, homogenization by multiple scales analysis, conformal mapping, a phase transition, Brownian motion, some ideas recollected from high school about electrostatic induction, and a constrained quadratic optimization problem solvable via a block 2x2 KKT matrix.