Search

In this article, we present Kinetic Transport Solver for Radiation Therapy (KiT-RT), an open source C++-based framework for solving kinetic equations in therapy applications available at https://github.com/CSMMLab/KiT-RT. This software framework aims to provide a collection of classical deterministic solvers for unstructured meshes that allow for easy extendability. Therefore, KiT-RT is a convenient base to test new numerical methods in various applications and compare them against conventional solvers. The implementation includes spherical harmonics, minimal entropy, neural minimal entropy, and discrete ordinates methods. Solution characteristics and efficiency are presented through several test cases ranging from radiation transport to electron radiation therapy. Due to the variety of included numerical methods and easy extendability, the presented open source code is attractive for both developers, who want a basis to build their numerical solvers, and users or application engineers, who want to gain experimental insights without directly interfering with the codebase. [ABSTRACT FROM AUTHOR]

Unsteady aerodynamic shape optimization presents new challenges in terms of sensitivity analysis of time-dependent objective functions. In this work, we consider periodic unsteady flows governed by the unsteady Reynolds-averaged Navier-Stokes (URANS) equations. Hence, the resulting output functions acting as objective or constraint functions of the optimization are themselves periodic with unknown period length, which may depend on the design parameter of said optimization. Sensitivity analysis on the time average of a function with these properties turns out to be difficult. Therefore, we explore methods to regularize the time average of such a function with the so-called windowing approach. Furthermore, we embed these regularizers into the discrete adjoint solver for the URANS equations of the multiphysics and optimization software SU2. Finally, we exhibit a comparison study between the classical nonregularized optimization procedure and the ones enhanced with regularizers of different smoothness, and we show that the latter result in a more robust optimization. [ABSTRACT FROM AUTHOR]

We compare a first‐order stochastic swarm intelligence model called consensus‐based optimization (CBO), which may be used for the global optimization of a function in multiple dimensions, to other particle swarm algorithms for global optimization. CBO allows for passage to the mean‐field limit resulting in a nonlocal, degenerate, parabolic PDE. Exploiting tools from PDE analysis, it is possible to rigorously prove convergence results for the algorithm (see [3]). In the present article we discuss numerical results obtained with the Particle Swarm Optimization (PSO) [4], Wind‐Driven Optimization (WDO) [6] and CBO and show that CBO leads to very competitive results. [ABSTRACT FROM AUTHOR]