Сells' bypassing algorithm for characteristic methods of transport equation solving

When solving the transport equation by the interpolation-characteristic method on an unstructured grid, the problem of an economical algorithm for queuing solvable cells arises. This paper describes the implementation of this algorithm based on the topological sorting of the oriented graph. Therefore, the proposed algorithm is the most economical of all possible ones. A parallel implementation of the bypass algorithm is presented in the case when the computational grid is divided into separate areas stored on different nodes of the computational cluster. There are grids for which the interpolation-characteristic method leads to an unsolvable problem. Proposed method makes it possible to diagnose such grids.