A dynamical low-rank optimizer for kinetic inverse problems reconstructs the scattering coefficient from angle-averaged measurements at a fraction of the full-solver cost.
A multi-fidelity adaptive dynamical low-rank based optimization algorithm for fission criticality problems
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Computing the dominant eigenvalue is important in nuclear systems as it determines the stability of the system (i.e. whether the system is sub or supercritical). Recently, the work of Kusch, Whewell, McClarren and Frank \cite{KWMF} showed that performing a low-rank approximation can be very effective in reducing the high memory requirement and computational cost of such problems. In this work, we propose a rank adaptive approach that changes the rank during the inverse power iteration. This allows us to progressively increase the rank (i.e. changing the fidelity of the model) as we get closer to convergence, thereby further reducing computational cost. We then exploit this multi-fidelity approach to optimize a simplified nuclear reactor. In this case the system is parameterized and the values of the parameters that give criticality are sought.
citation-role summary
citation-polarity summary
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
An adaptive dynamical low-rank optimizer for solving kinetic parameter identification inverse problems
A dynamical low-rank optimizer for kinetic inverse problems reconstructs the scattering coefficient from angle-averaged measurements at a fraction of the full-solver cost.