Numerical analysis of methods and algorithms used in electronic structure calculations

In the past decades, more and more applied mathematiciens got interested into analyzing the numerical methods used by chemists and physicists in electronic structure calculations. Indeed, most of the problems arising in these fields can be reformulated as nonlinear eigenproblems: applied mathematics can thus bring new insights on the convergence of numerical methods, or even improve the existing ones, and there is still a lot to do and understand!

In my first work on such algorithms, we analyzed, in a common mathematical framework, two classes of methods that are a priori different: direct minimization and self-consistent field (SCF) algorithms. This enables for instance to understand, from a mathematical point of view, the influence of small spectral gaps on the convergence of SCF algorithms. The analysis is based on a linearization of the problem that can also be used to understand the relation between residuals (that we can compute) and discretization errors (that we want but cannot be computed).

More recently, I also worked on the convergence of the discretized solutions to linear and nonlinear periodic Schrödinger equations for a specific class of analytic potentials. By introducing Hardy-like spaces, we are able to show the exponential convergence with respect to the discretization parameters.

Related works:

Convergence of a damped SCF algorithm for smaller and smaller spectral gaps.

CC BY-SA 4.0 Gaspard Kemlin. Last modified: March 19, 2026.

Website built with Franklin.jl, the Hyde theme and the Julia programming language.