A Multi-fidelity Adaptive Dynamical Low-Rank Based Optimization Algorithm for Fission Criticality Problems

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 et al. (J Comput Phys 470:111587, 2022) 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.

Authors

Institutions

Publication Details

Journal
Journal of Scientific Computing
Published
2025-05-30
DOI
https://doi.org/10.1007/s10915-025-02907-z
Citations
3
Primary Topic
Nuclear reactor physics and engineering
Type
article
Field-Weighted Citation Impact
14.98

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Multi-fidelity Adaptive Dynamical Low-Rank Based Optimization Algorithm for Fission Criticality Problems

Jonas Kusch, Carmela Scalone, Lukas Einkemmer, Ryan G. McClarren
3 citations
Journal of Scientific Computing
Nuclear reactor physics and engineering
14.98
article

A Multi-fidelity Adaptive Dynamical Low-Rank Based Optimization Algorithm for Fission Criticality Problems

Jonas Kusch, Carmela Scalone, Lukas Einkemmer, Ryan G. McClarren
article en
3 citations

Abstract

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 et al. (J Comput Phys 470:111587, 2022) 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.

Journal of Scientific ComputingVol. 104(1)
University of Notre Dame (US), Universität Innsbruck (AT), University of L'Aquila (IT), Norwegian University of Life Sciences (NO)
Istituto Nazionale di Alta Matematica "Francesco Severi", European Commission, Ministero dell’Istruzione, dell’Università e della Ricerca, Università degli Studi dell'Aquila, Universität Innsbruck, Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 2%
Nuclear reactor physics and engineering
14.98
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.