<p>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.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

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

  • Carmela Scalone,
  • Lukas Einkemmer,
  • Jonas Kusch,
  • Ryan G. McClarren

摘要

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.