A multi-fidelity adaptive dynamical low-rank based optimization algorithm for fission criticality problems

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Scalone, C., Einkemmer, L., Kusch, J., McClarren, R. J.
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910617460277248
author Scalone, C.
Einkemmer, L.
Kusch, J.
McClarren, R. J.
author_facet Scalone, C.
Einkemmer, L.
Kusch, J.
McClarren, R. J.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2409_14938
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A multi-fidelity adaptive dynamical low-rank based optimization algorithm for fission criticality problems
Scalone, C.
Einkemmer, L.
Kusch, J.
McClarren, R. J.
Numerical Analysis
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.
title A multi-fidelity adaptive dynamical low-rank based optimization algorithm for fission criticality problems
topic Numerical Analysis
url https://arxiv.org/abs/2409.14938