Bicompact monotonic schemes for a multidimensional linear transport equation

Bicompact difference schemes, previously proposed by the authors for linear one-dimensional transport equations are generalized to the multidimensional case by using a coordinate-wise splitting of the multidimensional problem. The scheme stencil for each of the spatial directions is minimal and consists of two points. The schemes are efficient and can be solved by the running calculation method. The proposed difference schemes have the fourth-order approximation in space variables and first- or third-order time approximation for smooth solutions. The schemes for solving multidimensional problems have inherited the monotonicity property of one-dimensional bicompact schemes. Numerical examples are given illustrating the actual accuracy order of bicompact schemes for smooth solutions and the scheme monotonicity for discontinuous solutions.