Abstract
For the transport equation in three-dimensional (r, ϑ, z) geometry, a KP1 acceleration scheme for inner iterations that is consistent with the weighted diamond differencing (WDD) scheme is constructed. The P 1 system for accelerating corrections is solved by an algorithm based on the cyclic splitting method (SM) combined with Gaussian elimination as applied to auxiliary systems of two-point equations. No constraints are imposed on the choice of the weights in the WDD scheme, and the algorithm can be used, for example, in combination with an adaptive WDD scheme. For problems with periodic boundary conditions, the two-point systems of equations are solved by the cyclic through-computations method elimination. The influence exerted by the cycle step choice and the convergence criterion for SM iterations on the efficiency of the algorithm is analyzed. The algorithm is modified to threedimensional (x, y, z) geometry. Numerical examples are presented featuring the KP1 scheme as applied to typical radiation transport problems in three-dimensional geometry, including those with an important role of scattering anisotropy. A reduction in the efficiency of the consistent KP1 scheme in highly heterogeneous problems with dominant scattering in non-one-dimensional geometry is discussed. An approach is proposed for coping with this difficulty. It is based on improving the monotonicity of the difference scheme used to approximate the transport equation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.