Efficient recursive algorithms in the invariant imbedding T-Matrix Method for computation of light scattering

用于计算光散射的不变嵌入 T 矩阵方法中的高效递归算法

• 批准号: 327332384
• 负责人: Dr.-Ing. Thomas Wriedt
• 金额: --
• 依托单位: Fachgebiet Mechanische Verfahrenstechnik
• 依托单位国家: 德国
• 项目类别: Research Grants
• 财政年份: 2016
• 资助国家: 德国
• 起止时间: 2015-12-31 至 2019-12-31
• 项目状态: 已结题
• 来源: https://gepris.dfg.de/gepris/projekt/327332384?language=en
• 关键词: Efficient; recursive; algorithms; invariant; imbedding

Efficient numerical simulation tools can help to understand light scattering interactions in optical particle characterization and to design new characterization methods. The objective of this project is to develop and test new efficient recursive algorithms in the invariant imbedding method to compute the T-matrix for large highly nonspherical and inhomogeneous particles and in this way to simulate light scattering by such particles. By considering the invariant imbedding T-Matrix Method in a systematic way starting from theory, followed by algorithm towards implementation we will look for recursive algorithms, which will make the method more effective. We will implement a full 3D variant of the method, which is not yet available and which will be progressing beyond the current state of the art. The new developed method will be included into the current integrated theoretical and computational framework of the (Null-Field Method with Discrete Sources) NFM-DS.

有效的数值模拟工具可以帮助理解光学颗粒表征中的光散射相互作用，并设计新的表征方法。这个项目的目的是开发和测试新的高效递归算法的不变嵌入方法来计算大的高度非球形和不均匀的粒子的T矩阵，并以这种方式来模拟光散射的粒子。通过系统地考虑不变嵌入T-矩阵方法，从理论开始，然后是算法实现，我们将寻找递归算法，这将使该方法更有效。我们将实现一个完整的3D变形的方法，这是还没有，这将是超越目前的最先进的。新开发的方法将被纳入当前的综合理论和计算框架（零场方法与离散源）NFM-DS。

项目成果

An overview of the methods for deriving recurrence relations for T-matrix calculation

• DOI: 10.1016/j.jqsrt.2018.11.029
• 发表时间: 2019-02
• 期刊: Journal of Quantitative Spectroscopy and Radiative Transfer
• 影响因子: 2.3
• 作者: A. Doicu;T. Wriedt;N. Khebbache

The Invariant Imbedding T Matrix Approach

• DOI: 10.1007/978-3-319-74890-0_2
• 发表时间: 2018
• 作者: A. Doicu;T. Wriedt