Remi Lehe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Remi Lehe has a total of 126 co-authors. Here are the top co-authors by number of shared publications:
- Jean- Luc Vay
Lawrence Berkeley National Laboratory
18 shared publications - Axel Huebl
Lawrence Berkeley National Laboratory, Berkeley, USA
12 shared publications - Andrew Myers
Lawrence Berkeley National Laboratory
8 shared publications Jean-Luc Vay
Lawrence Berkeley National Laboratory, Berkeley, California 94720, USA
7 shared publications- Maxence Thevenet
Deutsches Elektronen-Synchrotron DESY
7 shared publications - David P. Grote
Lawrence Livermore National Laboratory
6 shared publications
Latest Publications
- Open Access
- 16 October 2026
- Published by Elsevier in SSRN Electronic Journal
Charge- and Energy-Conserving Particle Boundary Conditions for Particle-in-Cell Simulations
Particle boundary conditions at material surfaces require special treatment in particle-in-cell (PIC) simulations to preserve charge and energy conservation. We present a general approach for particle absorption, injection, and reflection at planar insulating and perfectly electrically conducting boundaries. In the procedure presented here, charge conservation is maintained by truncating particle orbits at the material boundary and redistributing current deposited in the ghost region back into the simulation domain. This redistribution effectively reduces the particle shape in the direction normal to the boundary, so that particles of arbitrary shape order $m$ approach an $m=1$ shape as they approach the surface, with the entire particle weight residing on the boundary when the surface is reached. For energy-conserving PIC methods, we derive a corresponding electric-field gather that preserves the discrete particle-field energy balance. We also show that conventional symmetry-based particle reflection combined with perfectly conducting field boundary conditions is not energy conserving and can produce numerical heating, and present an alternative reflection treatment based on absorption at and reinjection from the material surface. The resulting framework provides a consistent treatment of material boundaries for charge- and energy-conserving PIC simulations.- 16 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCharge- and Energy-Conserving Particle Boundary Conditions for Particle-in-Cell Simulations
Particle boundary conditions at material surfaces require special treatment in particle-in-cell (PIC) simulations to preserve charge and energy conservation. We present a general approach for particle absorption, injection, and reflection at planar insulating and perfectly electrically conducting boundaries. In the procedure presented here, charge conservation is maintained by truncating particle orbits at the material boundary and redistributing current deposited in the ghost region back into the simulation domain. This redistribution effectively reduces the particle shape in the direction normal to the boundary, so that particles of arbitrary shape order $m$ approach an $m=1$ shape as they approach the surface, with the entire particle weight residing on the boundary when the surface is reached. For energy-conserving PIC methods, we derive a corresponding electric-field gather that preserves the discrete particle-field energy balance. We also show that conventional symmetry-based particle reflection combined with perfectly conducting field boundary conditions is not energy conserving and can produce numerical heating, and present an alternative reflection treatment based on absorption at and reinjection from the material surface. The resulting framework provides a consistent treatment of material boundaries for charge- and energy-conserving PIC simulations. - Open Access
- 28 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
The Memory Scaling of Reverse-Mode Differentiation in Particle Accelerator Simulations with Space Charge
- 28 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessThe Memory Scaling of Reverse-Mode Differentiation in Particle Accelerator Simulations with Space Charge
- Open Access
- 1 June 2026
- Published by AIP Publishing in Physics of Plasmas
- Vol. 33 (6)
Bayesian optimization of laser wakefield acceleration via spectral pulse shaping
In this paper, we investigate the effect of spectral pulse shaping of the laser driver on the performance of channel-guided, laser–plasma accelerators. The study was carried out with the assistance of Bayesian optimization using particle-in-cell simulations. We used a realistic plasma profile based on a novel optical-field-ionized channel technique with ionization injection and low, on-axis plasma densities to maximize the energy gain of the electron bunch trailing the laser. Spectral shaping allows us to modify the temporal profile of the laser driver while keeping the laser energy constant, affecting the acceleration and injection processes. In addition, we consider how modifying the plasma channel parameters may affect the target outputs. Given the complexity and breadth of the parameter space in question, we used numerical optimization to identify high-performing configurations. In particular, we found laser profiles with additional spectral content that, when used with optimal plasma channel parameters, result in charge content an order of magnitude higher than the baseline Gaussian case while also increasing the mean energy of the electron bunch.
- 1 June 2026
- Published by AIP Publishing in Physics of Plasmas
- Vol. 33 (6)
Open AccessBayesian optimization of laser wakefield acceleration via spectral pulse shaping
In this paper, we investigate the effect of spectral pulse shaping of the laser driver on the performance of channel-guided, laser–plasma accelerators. The study was carried out with the assistance of Bayesian optimization using particle-in-cell simulations. We used a realistic plasma profile based on a novel optical-field-ionized channel technique with ionization injection and low, on-axis plasma densities to maximize the energy gain of the electron bunch trailing the laser. Spectral shaping allows us to modify the temporal profile of the laser driver while keeping the laser energy constant, affecting the acceleration and injection processes. In addition, we consider how modifying the plasma channel parameters may affect the target outputs. Given the complexity and breadth of the parameter space in question, we used numerical optimization to identify high-performing configurations. In particular, we found laser profiles with additional spectral content that, when used with optimal plasma channel parameters, result in charge content an order of magnitude higher than the baseline Gaussian case while also increasing the mean energy of the electron bunch.
- Open Access
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-8
An Efficient GPU Parallelization Strategy for Binary Collisions in Particle-In-Cell Plasma Simulations
- 16 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessAn Efficient GPU Parallelization Strategy for Binary Collisions in Particle-In-Cell Plasma Simulations
- Open Access
- 19 February 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (2) , 025306
Energy-preserving coupling of explicit particle-in-cell with Monte Carlo collisions
The particle-in-cell (PIC) and Monte Carlo collisions (MCC) methods are workhorses of many numerical simulations of physical systems. Recently, it was pointed out that, while the two methods can be exactly—or nearly—energy-conserving independently, combining the two leads to anomalous numerical heating. This paper reviews the standard explicit PIC-MCC algorithm, elucidates the origins of the anomalous numerical heating, and explains how to couple the two methods such that the anomalous numerical heating is avoided. Published by the American Physical Society 2025
- 19 February 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (2) , 025306
Open AccessEnergy-preserving coupling of explicit particle-in-cell with Monte Carlo collisions
The particle-in-cell (PIC) and Monte Carlo collisions (MCC) methods are workhorses of many numerical simulations of physical systems. Recently, it was pointed out that, while the two methods can be exactly—or nearly—energy-conserving independently, combining the two leads to anomalous numerical heating. This paper reviews the standard explicit PIC-MCC algorithm, elucidates the origins of the anomalous numerical heating, and explains how to couple the two methods such that the anomalous numerical heating is avoided. Published by the American Physical Society 2025
- Top Cited PapersOpen Access
- 6 August 2024
- Published by American Physical Society (APS) in Physical Review Accelerators and Beams
- Vol. 27 (8) , 084801
Bayesian optimization algorithms for accelerator physics
Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024
- 6 August 2024
- Published by American Physical Society (APS) in Physical Review Accelerators and Beams
- Vol. 27 (8) , 084801
Top Cited PapersOpen AccessBayesian optimization algorithms for accelerator physics
Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024
- Open Access
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Synthesizing Particle-In-Cell Simulations through Learning and GPU Computing for Hybrid Particle Accelerator Beamlines
Particle accelerator modeling is an important field of research and development, essential to investigating, designing and operating some of the most complex scientific devices ever built. Kinetic simulations of relativistic, charged particle beams and advanced plasma accelerator elements are often performed with high-fidelity particle-in-cell simulations, some of which fill the largest GPU supercomputers. Start-to-end modeling of a particle accelerator includes many elements and it is desirable to integrate and model advanced accelerator elements fast, in effective models. Traditionally, analytical and reduced-physics models fill this role. The vast data from high-fidelity simulations and power of GPU-accelerated computation open a new opportunity to complement traditional modeling without approximations: surrogate modeling through machine learning. In this paper, we implement, present and benchmark such a data-driven workflow, synthesising a fully GPU-accelerated, conventional-surrogate simulation for hybrid particle accelerator beamlines.
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessSynthesizing Particle-In-Cell Simulations through Learning and GPU Computing for Hybrid Particle Accelerator Beamlines
Particle accelerator modeling is an important field of research and development, essential to investigating, designing and operating some of the most complex scientific devices ever built. Kinetic simulations of relativistic, charged particle beams and advanced plasma accelerator elements are often performed with high-fidelity particle-in-cell simulations, some of which fill the largest GPU supercomputers. Start-to-end modeling of a particle accelerator includes many elements and it is desirable to integrate and model advanced accelerator elements fast, in effective models. Traditionally, analytical and reduced-physics models fill this role. The vast data from high-fidelity simulations and power of GPU-accelerated computation open a new opportunity to complement traditional modeling without approximations: surrogate modeling through machine learning. In this paper, we implement, present and benchmark such a data-driven workflow, synthesising a fully GPU-accelerated, conventional-surrogate simulation for hybrid particle accelerator beamlines.
- Open Access
- 15 August 2023
- Published by American Physical Society (APS) in Physical Review Accelerators and Beams
- Vol. 26 (8) , 084601
Bayesian optimization of laser-plasma accelerators assisted by reduced physical models
Particle-in-cell simulations are among the most essential tools for the modeling and optimization of laser-plasma accelerators, since they reproduce the physics from first principles. However, the high computational cost associated with them can severely limit the scope of parameter and design optimization studies. Here, we show that a multitask Bayesian optimization algorithm can be used to mitigate the need for such high-fidelity simulations by incorporating information from inexpensive evaluations of reduced physical models. In a proof-of-principle study, where a high-fidelity optimization with fbpic is assisted by reduced-model simulations with wake-t, the algorithm demonstrates an order-of-magnitude speedup. This opens a path for the cost-effective optimization of laser-plasma accelerators in large parameter spaces, an important step toward fulfilling the high beam quality requirements of future applications.
- 15 August 2023
- Published by American Physical Society (APS) in Physical Review Accelerators and Beams
- Vol. 26 (8) , 084601
Open AccessBayesian optimization of laser-plasma accelerators assisted by reduced physical models
Particle-in-cell simulations are among the most essential tools for the modeling and optimization of laser-plasma accelerators, since they reproduce the physics from first principles. However, the high computational cost associated with them can severely limit the scope of parameter and design optimization studies. Here, we show that a multitask Bayesian optimization algorithm can be used to mitigate the need for such high-fidelity simulations by incorporating information from inexpensive evaluations of reduced physical models. In a proof-of-principle study, where a high-fidelity optimization with fbpic is assisted by reduced-model simulations with wake-t, the algorithm demonstrates an order-of-magnitude speedup. This opens a path for the cost-effective optimization of laser-plasma accelerators in large parameter spaces, an important step toward fulfilling the high beam quality requirements of future applications.
- Open Access
- 1 July 2023
- Published by American Astronomical Society in The Astrophysical Journal
- Vol. 952 (1)
Particle-in-cell Simulations of Relativistic Magnetic Reconnection with Advanced Maxwell Solver Algorithms
Relativistic magnetic reconnection is a nonideal plasma process that is a source of nonthermal particle acceleration in many high-energy astrophysical systems. Particle-in-cell (PIC) methods are commonly used for simulating reconnection from first principles. While much progress has been made in understanding the physics of reconnection, especially in 2D, the adoption of advanced algorithms and numerical techniques for efficiently modeling such systems has been limited. With the GPU-accelerated PIC code WarpX, we explore the accuracy and potential performance benefits of two advanced Maxwell solver algorithms: a nonstandard finite-difference scheme (CKC) and an ultrahigh-order pseudo-spectral method (PSATD). We find that, for the relativistic reconnection problem, CKC and PSATD qualitatively and quantitatively match the standard Yee-grid finite-difference method. CKC and PSATD both admit a time step that is 40% longer than that of Yee, resulting in a ∼40% faster time to solution for CKC, but no performance benefit for PSATD when using a current deposition scheme that satisfies Gauss’s law. Relaxing this constraint maintains accuracy and yields a 30% speedup. Unlike Yee and CKC, PSATD is numerically stable at any time step, allowing for a larger time step than with the finite-difference methods. We found that increasing the time step 2.4–3 times over the standard Yee step still yields accurate results, but it only translates to modest performance improvements over CKC, due to the current deposition scheme used with PSATD. Further optimization of this scheme will likely improve the effective performance of PSATD.
- 1 July 2023
- Published by American Astronomical Society in The Astrophysical Journal
- Vol. 952 (1)
Open AccessParticle-in-cell Simulations of Relativistic Magnetic Reconnection with Advanced Maxwell Solver Algorithms
Relativistic magnetic reconnection is a nonideal plasma process that is a source of nonthermal particle acceleration in many high-energy astrophysical systems. Particle-in-cell (PIC) methods are commonly used for simulating reconnection from first principles. While much progress has been made in understanding the physics of reconnection, especially in 2D, the adoption of advanced algorithms and numerical techniques for efficiently modeling such systems has been limited. With the GPU-accelerated PIC code WarpX, we explore the accuracy and potential performance benefits of two advanced Maxwell solver algorithms: a nonstandard finite-difference scheme (CKC) and an ultrahigh-order pseudo-spectral method (PSATD). We find that, for the relativistic reconnection problem, CKC and PSATD qualitatively and quantitatively match the standard Yee-grid finite-difference method. CKC and PSATD both admit a time step that is 40% longer than that of Yee, resulting in a ∼40% faster time to solution for CKC, but no performance benefit for PSATD when using a current deposition scheme that satisfies Gauss’s law. Relaxing this constraint maintains accuracy and yields a 30% speedup. Unlike Yee and CKC, PSATD is numerically stable at any time step, allowing for a larger time step than with the finite-difference methods. We found that increasing the time step 2.4–3 times over the standard Yee step still yields accurate results, but it only translates to modest performance improvements over CKC, due to the current deposition scheme used with PSATD. Further optimization of this scheme will likely improve the effective performance of PSATD.