mlsanityData to 7 Oct 2026

Solving the Discretised Boltzmann Transport Equations using Neural Networks: Applications in Neutron Transport

arXiv 2301.09991 ↗First posted 24 Jan 2023cs.CE cs.LG physics.comp-phcited by 4

Not on the map. Why?

Abstract (arXiv)

In this paper we solve the Boltzmann transport equation using AI libraries. The reason why this is attractive is because it enables one to use the highly optimised software within AI libraries, enabling one to run on different computer architectures and enables one to tap into the vast quantity of community based software that has been developed for AI and ML applications e.g. mixed arithmetic precision or model parallelism. Here we take the first steps towards developing this approach for the Boltzmann transport equation and develop the necessary methods in order to do that effectively. This includes: 1) A space-angle multigrid solution method that can extract the level of parallelism necessary to run efficiently on GPUs or new AI computers. 2) A new Convolutional Finite Element Method (ConvFEM) that greatly simplifies the implementation of high order finite elements (quadratic to quintic, say). 3) A new non-linear Petrov-Galerkin method that introduces dissipation anisotropically.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 5 of its 36 references that are in the map. First posted on arXiv 24 Jan 2023.

Builds on

5 of 36 references.

References · 5

  1. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  2. 2021Machine learning accelerated computational fluid dynamicscited by 461
  3. 2019MultiResUNet : Rethinking the U-Net Architecture for Multimodal Biomedical Image Segmentationcited by 195
  4. 2018Recurrent Residual Convolutional Neural Network based on U-Net (R2U-Net) for Medical Image Segmentationcited by 180
  5. 2020An autoencoder-based reduced-order model for eigenvalue problems with application to neutron diffusioncited by 19

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 1.

4 papers.