Matematicheskoe modelirovanie
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Matem. Mod.: Year: Volume: Issue: Page: Find

 Matem. Mod., 2019, Volume 31, Number 9, Pages 3–20 (Mi mm4107)

The boundary conditions in the bicompact schemes for HOLO algorithms for solving the transport equation

E. N. Aristovaa, N. I. Karavaevaba

a Keldysh Institute of Applied Mathematics RAS
b Moscow Institute of Physics and Technology

Abstract: The paper considers bicompact schemes for HOLO algorithms for solving the transport equation. To accelerate the convergence of scattering iterations, not only the solution of the transfer equation with respect to the distribution function of high order (HO) is used, but also the quasidiffusion equation of low order (LO) is used. For both systems of kinet-ic equations semi-discrete bicompact schemes with the fourth order of approximation in space are constructed. Integration over time can be carried out with any order of approx-imation. The diagonal-implicit third order approximation method is used in the work, its each stage can be reduced to the implicit Euler method. The discretization of quasi-diffusion equations is described in detail. Two variants for the boundary conditions for the LO part are considered: the classical one using fractional-linear functionals for the flux and radiation density ratio, and also by the radiation density value from the HO part of the system. It is shown that the classical boundary conditions for the LO system of equations of quasi-diffusion reduces the order of convergence of the scheme in time to the second. Setting the boundary conditions under the solution of the transport equation preserves the third order of convergence in time, but worsens the efficiency of iteration acceleration in HOLO algorithm.

Keywords: transport equation, quasi-diffusion method, bicompact scheme, HOLO algorithms for transport equation solving, sweep method, diagonally implicit Runge-Kutta method.

DOI: https://doi.org/10.1134/S0234087919090016

Full text: PDF file (425 kB)
References: PDF file   HTML file

Revised: 11.03.2019
Accepted:08.04.2019

Citation: E. N. Aristova, N. I. Karavaeva, “The boundary conditions in the bicompact schemes for HOLO algorithms for solving the transport equation”, Matem. Mod., 31:9 (2019), 3–20

Citation in format AMSBIB
\Bibitem{AriKar19} \by E.~N.~Aristova, N.~I.~Karavaeva \paper The boundary conditions in the bicompact schemes for HOLO algorithms for solving the transport equation \jour Matem. Mod. \yr 2019 \vol 31 \issue 9 \pages 3--20 \mathnet{http://mi.mathnet.ru/mm4107} \crossref{https://doi.org/10.1134/S0234087919090016} \elib{https://elibrary.ru/item.asp?id=38590304} 

• http://mi.mathnet.ru/eng/mm4107
• http://mi.mathnet.ru/eng/mm/v31/i9/p3

 SHARE:

Citing articles on Google Scholar: Russian citations, English citations
Related articles on Google Scholar: Russian articles, English articles
•  Number of views: This page: 170 Full text: 16 References: 17 First page: 15