Difference Schemes in the Undetermined Coefficient Space and Dual Problems of Linear Programming

详细

Using properties of the difference schemes approximating a one-dimensional transport equation as an example, it is shown that optimization of the properties of difference schemes based on the analysis in the space of undetermined coefficients and optimization of these properties based on the method of parametric correction are dual problems. Hybrid difference schemes for the linear transport equation are built as solutions to dual linear programming problems. It is shown that Godunov’s theorem follows from the linear program optimality criterion as one of the complementary slackness conditions. A family of hybrid difference schemes is considered. It is shown that Fedorenko’s hybrid difference scheme is obtained by solving the dual linear programming problem.