Abstract
Abstract Parallelization of standard multigroup methods used to solve the linear (Boltzmann) tranaport equation in the discrete ordinates (Sn) representation and coupled chaotic iteration schemes are the focus of this analyais. On the Denelcor HEP, we extend two serial iteration schemea, categorize speedup, and contrast ordered and chaotic methods. Ordered and chaotic iteration atrategies, with arid without acceleration, support relatively unreatricted paralleliam and appear to be robust parallel techniques. Parallel modifications and recoding efforts to seriol iteration algorithms are straightforward, actual speedup and efficiency are high, and payoff appears substantial, largely due to the coarse computational granularity of the multigroup technique. Chaotic schemes also converge faster than ordered strategies.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
