Parallel complexity computation based on dynamical systems

This paper describes a parallel approach for computing an air traffic complexity metric that is based on dynamical systems. It is important in order to quantify the complexity and geometric features of traffic. Lyapunov exponents are used for understanding the geometry of current air traffic in the airspace. It is computed at different points on a spatial grid. Those values can indicate areas where air traffic controllers must pay more attention because the complexity is higher at those points. A parallel implementation of the air traffic complexity metric computation is introduced in this paper. Serial implementation of this problem is too slow for real world problems. This process is parallelizable because Lyapunov exponent values can be computed simultaneously for each grid point in the airspace.