E-mail
     axel.modave [at] ensta-paris.fr
Phone
     +33 (0)1 81 87 20 82
Address
     UMA – ENSTA Paris
     828, Boulevard des Maréchaux
     91120 Palaiseau (France)
     Office 22.29

I am a CNRS researcher (chargé de recherche) in the POEMS team (CNRS-ENSTA-INRIA, UMR 7231) at ENSTA Paris (Palaiseau, France). Before, I have been a Postdoctoral Researcher at the Université catholique de Louvain (Belgium), Rice University (Houston, TX, USA) and VirginiaTech (Blacksburg, VA, USA), where I worked with Jean-Francois Remacle and Tim Warburton. I obtained my PhD at the Université de Liège in 2013, under the supervision of Christophe Geuzaine and Eric Delhez.

News: Open position for a master internship on Domain Decomposition Methods for Time-Harmonic Wave Propagation at ENSTA Paris and Univ. of Liège  [Description in french] (posted on 2020/10, english version on request)

Research interests:

  • Numerical simulation of wave propagation (acoustic, electromagnetic and elastic waves)
  • Absorbing boundary conditions and perfectly matched layers
  • High-order methods, discontinuous finite element methods and domain decomposition methods
  • High performance scientific computing and modern architectures

Recent papers:

  • A. M., X. Geuzaine, X. Antoine (accepted for publication). Corner treatments for high-order absorbing boundary conditions in high-frequency acoustic scattering problems. [preprint]
  • A. M., X. Antoine, C. Geuzaine (2018). An efficient domain decomposition method with cross-point treatment for Helmholtz problems. Proceedings of CILAMCE 2018, 4 pages. [short paper]
  • A. M., A. Atle, J. Chan, T. Warburton (2017). A GPU-accelerated nodal discontinuous Galerkin method with high-order absorbing boundary conditions and corner/edge compatibility. International Journal for Numerical Methods in Engineering, 112 (11), 1659-1686, 28 pages. [link] [preprint]
  • A. M., J. Lambrechts, C. Geuzaine (2017). Perfectly Matched Layers for Convex Truncated Domains with Discontinuous Galerkin Time Domain Simulations. Computers & Mathematics with Applications, 73 (4), 684-700, 17 pages. [link] [preprint]