论文信息 - Parallel S /sub n/ iteration schemes

Parallel S /sub n/ iteration schemes

The iterative, multigroup, discrete ordinates S /sub n/ representation for the linear transport equation enjoys widespread computational use and popularity. Serial iteration schemes and numerical algorithms developed over the years provide a timely framework for parallel extension. On the Denelcor heterogeneous element processor, three parallel iteration schemes (two chaotic, one ordered) are investigated for solving the one-dimensional S /sub n/ transport equation.

B. R. Wienke | R. E. Hiromoto

[1] W. H. Reed. The Effectiveness of Acceleration Techniques for Iterative Methods in Transport Theory , 1971 .

[2] R. E. Alcouffe,et al. Diffusion synthetic acceleration methods for the diamond-differenced discrete-ordinates equations , 1977 .

[3] B. Carlson,et al. A Method of Characteristics and Other Improvements in Solution Methods for the Transport Equation , 1976 .

[4] T. Hill. ONETRAN: a discrete ordinates finite element code for the solution of the one-dimensional multigroup transport equation , 1975 .

[5] K. D. Lathrop. Spatial differencing of the transport equation: Positivity vs. accuracy , 1969 .

[6] Shoichiro Nakamura. A Variational Rebalancing Method for Linear Iterative Convergence Schemes of Neutron Diffusion and Transport Equations , 1970 .

[7] Edward W. Larsen,et al. Computational Efficiency of Numerical Methods for the Multigroup, Discrete-Ordinates Neutron Transport Equations: The Slab Geometry Case , 1979 .

[8] L. L. Carter,et al. Particle Transport Simulation with the Monte Carlo Method; Prepared for the Division of Military Application, U.S. Energy Research and Development Administration , 1975 .