Nicolas Champagnat

2papers

2 Papers

NAJan 26, 2015
Monte Carlo methods for linear and non-linear Poisson-Boltzmann equation

Mireille Bossy, Nicolas Champagnat, Helene Leman et al.

The electrostatic potential in the neighborhood of a biomolecule can be computed thanks to the non-linear divergence-form elliptic Poisson-Boltzmann PDE. Dedicated Monte-Carlo methods have been developed to solve its linearized version (see e.g.Bossy et al 2009, Mascagni & Simonov 2004}). These algorithms combine walk on spheres techniques and appropriate replacements at the boundary of the molecule. In the first part of this article we compare recent replacement methods for this linearized equation on real size biomolecules, that also require efficient computational geometry algorithms. We compare our results with the deterministic solver APBS. In the second part, we prove a new probabilistic interpretation of the nonlinear Poisson-Boltzmann PDE. A Monte Carlo algorithm is also derived and tested on a simple test case.

NAJun 25, 2010
Reconciling alternate methods for the determination of charge distributions: A probabilistic approach to high-dimensional least-squares approximations

Nicolas Champagnat, Christophe Chipot, Erwan Faou

We propose extensions and improvements of the statistical analysis of distributed multipoles (SADM) algorithm put forth by Chipot et al. in [6] for the derivation of distributed atomic multipoles from the quantum-mechanical electrostatic potential. The method is mathematically extended to general least-squares problems and provides an alternative approximation method in cases where the original least-squares problem is computationally not tractable, either because of its ill-posedness or its high-dimensionality. The solution is approximated employing a Monte Carlo method that takes the average of a random variable defined as the solutions of random small least-squares problems drawn as subsystems of the original problem. The conditions that ensure convergence and consistency of the method are discussed, along with an analysis of the computational cost in specific instances.