Finite difference schemes for linear advection equation solving under generalized approximation condition

Lobanov A.I.
 pdf (444K)  / List of references

A set of implicit difference schemes on the five-pointwise stensil is under construction. The analysis of properties of difference schemes is carried out in a space of undetermined coefficients. The spaces were introduced for the first time by A. S. Kholodov. Usually for properties of difference schemes investigation the problem of the linear programming was constructed. The coefficient at the main term of a discrepancy was considered as the target function. The optimization task with inequalities type restrictions was considered for construction of the monotonic difference schemes. The limitation of such an approach becomes clear taking into account that approximation of the difference scheme is defined only on the classical (smooth) solutions of partial differential equations.

The functional which minimum will be found put in compliance to the difference scheme. The functional must be the linear on the difference schemes coefficients. It is possible that the functional depends on net function – the solution of a difference task or a grid projection of the differential problem solution. If the initial terms of the functional expansion in a Taylor series on grid parameters are equal to conditions of classical approximation, we will call that the functional will be the generalized condition of approximation. It is shown that such functionals exist. For the simple linear partial differential equation with constant coefficients construction of the functional is possible also for the generalized (non-smooth) solution of a differential problem.

Families of functionals both for smooth solutions of an initial differential problem and for the generalized solution are constructed. The new difference schemes based on the analysis of the functionals by linear programming methods are constructed. At the same time the research of couple of self-dual problems of the linear programming is used. The optimum monotonic difference scheme possessing the first order of approximation on the smooth solution of differential problem is found. The possibility of application of the new schemes for creation of hybrid difference methods of the raised approximation order on smooth solutions is discussed.

The example of numerical implementation of the simplest difference scheme with the generalized approximation is given.

Keywords: the difference scheme, the transfer equation, the classical solution, the generalized solution, monotony, problem of the linear programming, the dual task, supplementing slackness
Citation in English: Lobanov A.I. Finite difference schemes for linear advection equation solving under generalized approximation condition // Computer Research and Modeling, 2018, vol. 10, no. 2, pp. 181-193
Citation in English: Lobanov A.I. Finite difference schemes for linear advection equation solving under generalized approximation condition // Computer Research and Modeling, 2018, vol. 10, no. 2, pp. 181-193
DOI: 10.20537/2076-7633-2018-10-2-181-193
URL: http://crm-en.ics.org.ru/journal/article/2675/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.
Views (last year): 27.

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science