| Autor: |
Aristova, E. N., Karavaeva, N. I. |
| Zdroj: |
Mathematical Models & Computer Simulations; Apr2022, Vol. 14 Issue 2, p187-202, 16p |
| Abstrakt: |
Bicompact schemes for HOLO algorithms for solving the nonstationary linear transport equation are proposed. The schemes are tested on the model problem of neutron transport (nonstationary generalization of the Reed problem). HOLO algorithms are based on the joint solution of the high-order (HO) kinetic equation (in this study, this is the transport equation) and low-order (LO) kinetic equations (the quasi-diffusion system of equations). To construct schemes for the HO and LO parts, the equations are discretized in space with the fourth order of approximation on a two-point stencil. A higher order of the approximation is achieved by expanding the list of unknowns and including not only nodal values but also integral averages over the cell. The obtained semidiscrete schemes are integrated in time by the Runge–Kutta method of the third order of approximation, but they can be integrated by any other method, including a higher order of approximation. The obtained difference scheme for the HOLO algorithm is monotonized. The order of convergence in tests for Reed's problem drops to the first order since the solution is not smooth. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink