This is the authors' abstract. We don't add key points for this paper.
A parallel three-dimensional Sn algorithm is described for performing eigenvalue calculations on rectangular meshes using the Thinking Machines Connection Machine model CM-200 computer. By using a two-dimensional spatial decomposition, we retain the ability to invert the source iteration equation in a single “sweep.” Thus, this scheme gives essentially problem-independent performance in the sense that it represents an intrinsic decomposition.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Baker et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: