Abstract
Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Several numerical examples are presented to demonstrate their accuracy and efficiency.
Original language | English (US) |
---|---|
Article number | 110404 |
Journal | Journal of Computational Physics |
Volume | 439 |
DOIs | |
State | Published - Aug 15 2021 |
Keywords
- Adjoint-state method
- Boltzmann equation
- DSMC
- Direct simulation Monte Carlo methods
- Linear Boltzmann equation
- Optimization
ASJC Scopus subject areas
- Numerical Analysis
- Modeling and Simulation
- Physics and Astronomy (miscellaneous)
- Physics and Astronomy(all)
- Computer Science Applications
- Computational Mathematics
- Applied Mathematics