Particle Tracing Algorithms for 3D Curvilinear Grids

摘要

This paper presents a comparison of several particle tracing algorithms oncurvilinear grids. The fundamentals of particle tracing algorithms are described and used to split tracing algorithms into basic components. Based on this decomposition, two different strategies for particle tracing are described in greater detail: tracing in computational space and tracing in physical space. Accuracy and speed tests are performed for both types of algorithms. From these tests it is concluded that particle tracing algorithms in physical space generally perform better than algorithms in computational space.