arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.07035math.NAcs.NA
收藏

辐射传输方程的自适应嵌套源项迭代

An Adaptive Nested Source Term Iteration for Radiative Transfer Equations

Wolfgang Dahmen, Felix Gruber, Olga Mula

摘要:

提出了一种新的辐射传输方程的数值解方法,并给出了后验误差界。稳定的彼得罗夫-Galerkin型变分公式的参数传输方程和相应的辐射传输方程发挥了关键作用。这使我们能够制定一个合适的,无限维函数空间,保证收敛与固定的误差减少每一步迭代。然后,数值方案基于在动态更新的精度容限内近似地实现该迭代,该精度容限仍然确保收敛到精确解。为了推进该迭代,需要在适当收紧的精度公差内执行两个操作。首先,需要在与当前精度水平相当的容差内将全局散射算子近似地应用于当前的反射率。第二,需要求解参数相关的线性输运方程,再次以迭代所需的精度。为了确保阶段相关的误差容限得到满足,人们必须采用严格的后验误差界,在我们的情况下,休息的不连续彼得罗夫-Galerkin(DPG)计划。这些后验界不仅对保证扰动迭代的收敛性至关重要,而且还用于生成适应参数依赖的空间网格。这证明显著降低了整体计算复杂性。由于只应用全局算子,我们避免了求解具有密集矩阵的线性系的需要。此外,通过低秩近似和矩阵压缩技术,加速了全局散射体的近似应用。理论研究结果的说明和补充的数值实验与非平凡的散射内核。

英文摘要:

We propose a new approach to the numerical solution of radiative transfer equations with certified a posteriori error bounds. A key role is played by stable Petrov--Galerkin type variational formulations of parametric transport equations and corresponding radiative transfer equations. This allows us to formulate an iteration in a suitable, infinite dimensional function space that is guaranteed to converge with a fixed error reduction per step. The numerical scheme is then based on approximately realizing this iteration within dynamically updated accuracy tolerances that still ensure convergence to the exact solution. To advance this iteration two operations need to be performed within suitably tightened accuracy tolerances. First, the global scattering operator needs to be approximately applied to the current iterate within a tolerance comparable to the current accuracy level. Second, parameter dependent linear transport equations need to be solved, again at the required accuracy of the iteration. To ensure that the stage dependent error tolerances are met, one has to employ rigorous a posteriori error bounds which, in our case, rest on a Discontinuous Petrov--Galerkin (DPG) scheme. These a posteriori bounds are not only crucial for guaranteeing the convergence of the perturbed iteration but are also used to generate adapted parameter dependent spatial meshes. This turns out to significantly reduce overall computational complexity. Since the global operator is only applied, we avoid the need to solve linear systems with densely populated matrices. Moreover, the approximate application of the global scatterer accelerated through low-rank approximation and matrix compression techniques. The theoretical findings are illustrated and complemented by numerical experiments with non-trivial scattering kernels.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑