By Topic

A concurrent, multigroup, discrete ordinates model of neutron transport

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. R. Dorr ; Numerical Math. Group, Lawrence Livermore Nat. Lab., CA, USA ; C. H. Still

We present an algorithm for the concurrent solution of the linear system arising from a multigroup, discrete ordinates model of neutron transport. The target architectures consist of distributed memory computers ranging from workstation clusters to massively parallel computers. Based on an analysis of the memory requirement and floating point complexity of matrix-vector multiplication in the iterative solution of the linear system, we propose a data layout and communication strategy designed to achieve scalability with respect to all phase space variables. Numerical results are presented to demonstrate the performance of the algorithm on the nCUBE/2

Published in:

Scalable Parallel Libraries Conference, 1993., Proceedings of the

Date of Conference:

6-8 Oct 1993