A multi-fidelity adaptive dynamical low-rank based optimization algorithm for fission criticality problems
<|reference_start|>A multi-fidelity adaptive dynamical low-rank based optimization algorithm for fission criticality problems: 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.<|reference_end|>
@article{scalone2024a,
    title={A multi-fidelity adaptive dynamical low-rank based optimization
  algorithm for fission criticality problems},
    author={C. Scalone, L. Einkemmer, J. Kusch and R. J. McClarren},
    journal={arXiv preprint arXiv:2409.14938},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.14938},
    primaryClass={math.NA cs.NA}
}