Abstract

Particle transport calculations are inherently expensive because of the large variable space that must be discretized, and usually the fully implicit schemes in time discretization are used. There exist some bottleneck problems in implementing the Sn transport method on massively parallel computers, such as strong correlation of data and algorithmic consecutiveness. In this paper the spatial domain decomposition procedures are studied for numerically solving the discrete ordinates Sn transport equations. We introduce a parallel solution strategy for transport calculations,which combines the source iterative methods with a technique based on the prediction-correction on the interface of sub-domains. Moreover the two choices of initial values of the source iterative methods are proposed and compared. Numerical experiments show the parallel iterative schemes with interface prediction-correction are unconditionally stable, and have the same accuracy as the original implicit schemes. Moreover, they have fairly high parallelism, and high efficiency due to the construction of our parallel scheme and the good choice of the initial guess of source iteration.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.