arXiv subjects

François Madiot

Publications and source records attributed to François Madiot.

8 recordsLinked to original sources

arXiv2026

On Physics-Based Loss Scaling for MF-PINNs applied to the neutron diffusion equation

Physics-Based Loss Scaling (PBLS) is introduced for Mixed-Formulation PINNs (MF-PINNs) applied to the neutron diffusion equation. In particular, we propose a new \textit{scaled} loss function based on the material cross sections, which is equivalent to the classical MF-PINN loss, but accelerates the convergence and improves accuracy of MF-PINNs. Several numerical experiments on both the fixed source and the k-eigenvalue problem, from one-group to multigroup cases and from two-dimensional (2D) to three-dimensional (3D) configurations, illustrate the efficiency of the proposed scaling method.

math.NA↗

arXiv2026

Diffusion Synthetic Acceleration for polytopic discretisations of Boltzmann transport

We present a computational study of diffusion synthetic acceleration (DSA) for the monoenergetic, isotropically scattering $S_N$ transport equations, discretised in space by a polytopic discontinuous Galerkin method. Using a discrete ordinates angular discretisation, we construct the DSA correction with an interior-penalty diffusion operator and compare a classical symmetric interior penalty (SIP) formulation with a modified interior penalty (MIP) variant, together with homogeneous Dirichlet and Marshak (Robin) diffusion boundary conditions imposed weakly in the DG framework. We quantify the observed convergence behaviour of the resulting source iteration across variations in optical thickness, scattering ratio, angular quadrature, mesh refinement, polynomial degree and mesh anisotropy on families of bounded Voronoi meshes. The results show that MIP-based DSA remains robust across the parameter ranges tested, whereas SIP-based DSA can lose robustness in the intermediate regime. In challenging optically thick, highly scattering settings, the observed convergence factors for the MIP-based schemes are typically below $0.6$.

math.NA↗

arXiv2026

A posteriori error estimates for mixed finite element discretization of the multigroup Neutron Simplified Transport equations with Robin boundary condition

We analyse a posteriori error estimates for the discretization with mixed finite elements on simplicial or Cartesian meshes of the multigroup neutron simplified transport (SPN ) equations, in the case where a Robin (or Fourier type) boundary condition is imposed on the boundary. This boundary condition is of particular importance in neutronics, since it corresponds to the well-known vacuum boundary condition. We provide guaranteed and locally efficient estimators. In particular, a specific estimator is designed to handle the Robin boundary condition. We also develop the theory in the case of mixed imposed boundary conditions, of Dirichlet, Neumann or Fourier type. The approach is further extended to a Domain Decomposition Method, the so-called DD+L 2 jumps method. In this framework, the adaptive mesh refinement strategy is implemented for a discretization using Cartesian meshes on each subdomain. Numerical experiments illustrate the theory.

math.NA↗

arXiv2025

Adaptive mesh refinement on Cartesian meshes applied to the mixed finite element discretization of the multigroup neutron diffusion equations

The multigroup neutron diffusion equations are often used to model the neutron density at the nuclear reactor core scale. Classically, these equations can be recast in a mixed variational form. This chapter presents an adaptive mesh refinement approach based on a posteriori estimators. We focus on refinement strategies on Cartesian meshes, since such structures are common for nuclear reactor core applications.

math.NA↗

arXiv2024

Cycle-Free Polytopal Mesh Sweeping for Boltzmann Transport

We introduce a novel property of bounded Voronoi tessellations that enables cycle-free mesh sweeping algorithms. We prove that a topological sort of the dual graph of any Voronoi tessellation is feasible in any flow direction and dimension, allowing straightforward application to discontinuous Galerkin (DG) discretisations of first-order hyperbolic partial differential equations and the Boltzmann Transport Equation (BTE) without requiring flux-cycle corrections. We also present an efficient algorithm to perform the topological sort on the dual mesh nodes, ensuring a valid sweep ordering. This result expands the applicability of DG methods for transport problems on polytopal meshes by providing a robust framework for scalable, parallelised solutions. To illustrate its effectiveness, we conduct a series of computational experiments showcasing a DG scheme for BTE, demonstrating both computational efficiency and adaptability to complex geometries.

math.NA↗

arXiv2023

An Application of Reduced Basis Methods to Core Computation in APOLLO3

In the aim of reducing the computational cost of the resolution of parameter-dependent eigenvalue problems, a model order reduction (MOR) procedure is proposed. We focus on the case of non-self-adjoint generalized eigenvalue problems, such as the stationary multigroup neutron diffusion equations. The method lies in an approximation of the manifold of solutions using a Proper Orthogonal Decomposition approach. The numerical method is composed of two stages. In the offline stage, we build a reduced space which approximates the manifold. In the online stage, for any given new set of parameters, we solve a reduced problem on the reduced space within a much smaller computational time than the required time to solve the high-fidelity problem. This method is applied to core computations in the APOLLO3 code.

math.NA↗

arXiv2023

Reduced basis method for non-symmetric eigenvalue problems: application to the multigroup neutron diffusion equations

In this article, we propose a reduced basis method for parametrized non-symmetric eigenvalue problems arising in the loading pattern optimization of a nuclear core in neutronics. To this end, we derive a posteriori error estimates for the eigenvalue and left and right eigenvectors. The practical computation of these estimators requires the estimation of a constant called prefactor, which we can express as the spectral norm of some operator. We provide some elements of theoretical analysis which illustrate the link between the expression of the prefactor we obtain here and its well-known expression in the case of symmetric eigenvalue problems, either using the notion of numerical range of the operator, or via a perturbative analysis. Lastly, we propose a practical method in order to estimate this prefactor which yields interesting numerical results on actual test cases. We provide detailed numerical simulations on two-dimensional examples including a multigroup neutron diffusion equation.

math.NA↗

arXiv2015

A numerical comparison of some Multiscale Finite Element approaches for convection-dominated problems in heterogeneous media

The purpose of this work is to investigate the behavior of Multiscale Finite Element type methods for advection-diffusion problems in the advection-dominated regime. We present, study and compare various options to address the issue of the simultaneous presence of both heterogeneity of scales and strong advection. Classical MsFEM methods are compared with adjusted MsFEM methods, stabilized versions of the methods, and a splitting method that treats the multiscale diffusion and the strong advection separately.

math.NA↗