Recursive Approximation Algorithm

Motivation

aka Fast Multipole Method, is used to speed up an N-body problem. We are primarily interested in FFM since it can be used in the following areas:

  • The T-matrix method solves electromagnetic scattering at spherical and non-spherical particles. Due to large matrix-vector multiplications, the toll on hardware is significant, so a speed-up is always appreciated!

  • 2D ray tracing on fractal surfaces for self-healing. On airless bodies, mutually visible surfaces can heat up each other through the reflected light. This is a significant effect when looking at surfaces in the thermal infrared region since the temperature depends on the body and its roughness.

Multiple FMM algorithms can be used, and this thesis can be tailored to your degree of interest in a certain topic.

  • There is a lack of GPU-accelerated implementations, so one could look into implementing a rudimentary algorithm in Python using JAX so it can be tested on CPU and GPU and maybe even extended to TPUs in the future.

  • The already present implementations can be used and applied to one of the two topics above, but mainly to the T-Matrix method since I am more familiar with it. Our light scattering framework YASF can incorporate one implemented algorithm, and it can be further tested and validated with this approach.

Literature