Nuclear Computational Science
Yousry Azmy
•
Enrico Sartori
Nuclear Computational Science A Century in Review
123
Prof. Yousry Azmy North Carolina State University Department of Nuclear Engineering Raleigh, NC 27695 1110 Burlington Engineering Labs USA
[email protected]
Enrico Sartori Organisation for Economic Co-operation and Development (OECD) 12 bd. des Iles 92130 Issy-les-Moulineaux France
[email protected]
ISBN 978-90-481-3410-6 e-ISBN 978-90-481-3411-3 DOI 10.1007/978-90-481-3411-3 Springer Dordrecht Heidelberg London New York Library of Congress Control Number: 2009944067 Mathematics Subject Classification (2010): 82D75, 65C05 c Springer Science+Business Media B.V. 2010 No part of this work may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, microfilming, recording or otherwise, without written permission from the Publisher, with the exception of any material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Cover design: deblik Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Ely Gelbard November 6, 1924–April 18, 2002
Preface
Scheduled on the heels of the atomic century, the American Nuclear Society’s international topical meeting on Mathematics and Computation seemed like an opportune moment in time to capture accomplishments in this area during the first half-century of nuclear engineering. Held in a semi-secluded part of the city of Gatlinburg, Tennessee, April 6–10, 2003, this gathering of prominent experts in the field and young professionals embarking on exciting careers in what promises to develop into a nuclear renaissance turned out to be the perfect venue for such a review. The conference was co-sponsored by three divisions of the American Nuclear Society, namely the Mathematics and Computation Division, the Reactor Physics Division, and the Radiation Protection and Shielding Division. The Technical Program of the conference revolved around the theme of its title, Nuclear Mathematical & Computational Sciences: A Century in Review, A Century Anew. The Anew component comprised contributed papers organized in 25 regular and special sessions on a broad variety of topics, plus a poster session and a panel session. The Review component of the conference comprised the lecture series that grew into this book. As Technical Program Chair (YYA) and Assistant General Chair (ES) of the conference, we decided to break with the traditional format of plenary sessions standard in technical meetings and organize a lecture series that takes stock of the state of the art in nuclear computational science at the turn of a new century. Thus the concept of the lecture series that led to the chapters of this book was born. One of the first experts we solicited to present a lecture in the series was the late Dr. Ely Gelbard of Argonne National Laboratory at the time. In his gentle, but firm and persuasive manner, he declined preferring instead to participate as co-organizer of the lecture series. We jumped on the opportunity recognizing his long-standing, distinguished, and generous contributions to many subareas in nuclear computational science, and his many years of service in the field positioned him well to know the major areas to cover in the lectures and to nominate world-renowned lecturers. In short order the three of us came up with a slate of topics and a corresponding list of lecturers. The response of the nominated lecturers was supportive and enthusiastic, and by mid Fall 2001 what has later become known as the Gelbard Lecture Series was fully conceived, and a tentative idea of ultimately documenting the lecture contents in book chapters was initiated. Our charge to the invited lecturers was to provide an overview of the assigned topic aiming primarily at breadth of coverage,
vii
viii
Preface
with a sharp focus on its mathematical and computational aspects. Specifically we requested that each author provide a historical perspective of the conception of their topic as a major area of research in nuclear computational science, and to identify landmarks for the evolution of the topic through the end of the twentieth century. We further requested that the lecturers delineate the current state of the art in their assigned topic and to project into the future by exposing perceived challenges and opportunities for advancing the frontier of knowledge. Our renowned lecturers did not disappoint and the lecture series was a smashing success, thanks to their dedicated effort and professionalism. The lectures, scheduled to open each half-day of the conference, were well attended, with conference participants packing the lecture hall on a consistent basis. Perhaps the only sour note that tainted the lecture series was the passing on April 18, 2002, of Dr. Ely Gelbard whose contributions to the success of the lecture series, and ultimately to the publication of this book, cannot be overstated. This great loss to the field of nuclear computational science overshadowed the conference leading to various observances of this sad event. The conference banquet included a memorial celebrating Dr. Gelbard’s life and his significant contributions to nuclear computational science, and the lecture series was named after him in recognition of his involvement that propelled the series to success. Later, the contributing authors to this book agreed to dedicate it to the memory of Dr. Ely Gelbard. Unfortunately death struck again with the passing of Dr. Richard Hwang on December 20, 2007, shortly after he completed the final revisions to his chapter appearing in this book. We are grateful for Richard’s contribution to the success of the lecture series, for the chapter he composed in this book, and for his dedication to his research over the past 5 decades. While the original list of topics envisioned in our early planning of the lecture series has not changed, the reader will notice a few differences between the lectures lineup and the chapters herein. First, Dr. Dan Cacuci who, for unforeseen circumstances, was unable to deliver his lecture on Sensitivity and Uncertainty Analysis at the conference has graciously composed the corresponding chapter for this book. Second, Dr. Kord Smith who presented the lecture on Reactor Physics at the conference apologized from composing the corresponding book chapter due to increased job-related responsibilities. We are grateful to Dr. Robert Roy for accepting to undertake such burden and for the excellent job he did in composing his chapter on Reactor Core Methods. Lastly, in composing Chapter 7, Elliott Whitesides recruited Mike Westfall and Calvin Hopper to help with the composition. This book would not have been possible without the support and active involvement of many people over the span of 6 years. Most of all we wish to thank the authors who willingly and cheerfully accepted this additional burden to their normally hectic schedules. We are confident that the benefit to the field of nuclear computational science and the gratitude of its practitioners, especially the young scientists who will carry the torch into the future, will reward the authors’ perseverance and patience during this long an arduous journey. We are grateful to Argonne National Laboratory’s Dr. Roger Blomquist for composing the memorials to Ely Gelbard and Richard Hwang, and for reviewing the final version of Richard’s
Preface
ix
Chapter 5. The support and encouragement of Bernadette Kirk, Director of Oak Ridge National Laboratory’s Radiation Safety Information Computational Center (RSICC) and General Chair of the Gatlinburg conference, was invaluable to the completion of this project. The technical help by Alice Rice of RSICC with bringing together the pieces of this book into a single volume is greatly appreciated. In addition, we wish to acknowledge the tacit approval and support of our respective institutions, The Pennsylvania State University and North Carolina State University (YYA), and the Nuclear Energy Agency of the Organisation for Economic Cooperation and Development (ES). June 2009
Yousry Y. Azmy Enrico Sartori
Obituary Composed by Dr. Roger Blomquist for Dr. Ely Meyer Gelbard
Ely Gelbard was born in New York City on November 6, 1924. He was the son of immigrants. His undergraduate work was at the City Colleges of New York and after World War II he earned his Ph.D. in physics from the University of Chicago. During the war, he served in the US Army Air Corps as a radar technician. He was a Senior Scientist at Argonne National Laboratory and a Fellow of the American Nuclear Society. Ely started his postgraduate career when the use of digital computers to solve the neutron balance equations for fission reactor core design and analysis was just starting to receive wide application. At Bettis (1954–1972), he participated in the efforts that put the numerical methods for the solution of the finite difference form of the neutron transport equation on a firm mathematical basis, and he devised several approximation schemes that were suitable for numerical methods and also developed efficient algorithms for their solution. While at Bettis, he earned international stature in the field, authoring important papers in many variants of the solution procedures (spherical harmonics, Sn , synthetic methods, and Monte Carlo), including the book, Monte Carlo Principles and Neutron Transport Problems, with J. Spanier. He was the first physicist at Bettis to attain the rank of Consulting Scientist, and earned the Atomic Energy Commission’s prestigious E. O. Lawrence Award. Since 1972, when Dr. Gelbard joined Argonne National Laboratory, fast reactors have been the focus of ANL’s reactor program, with its emphasis on more accurate computation of the neutron spectrum. His work in this area produced fundamental advances in the analysis of neutron streaming, collision probabilities, improvements in Monte Carlo methods, and neutron diffusion and transport within the nodal approximation. He also brought improved iterative solution strategies to bear on the equations of single-phase computational thermal-hydraulics analysis of passively safe metal-cooled reactor systems. He was consulted by many at ANL, at other labs, and at universities on a wide variety of technical issues, and invariably provided important insights. Ely’s sustained record of high productivity of the highest-quality technical work attracted a series of bright and vigorous visiting scholars and students whose participation magnified his work. He excelled at distilling complex technical issues to their essence, then performing the relevant mathematical analysis and, finally, computationally confirming the analysis. He was always careful, honest, and thoroughly
xi
xii
Obituary Composed by Dr. Roger Blomquist for Dr. Ely Meyer Gelbard
scrupulous in his work. He earned the ANS Special Award for Computer Methods for the Solution of Problems in Reactor Technology, the ANS Mathematics and Computations Division Distinguished Service Award, the ANS Reactor Physics Division Eugene Wigner Award, and the University of Chicago Distinguished Performance Award. In spite of his great stature and many accomplishments, Ely was a mild and modest gentleman who always gave full credit to others’ work, and was very approachable and an excellent listener. His technical questions at meetings were insightful, probing, and gentle. He also pursued the understanding of others’ points of view in personal and political matters with both intellect and sensitivity. His restaurant adventures at meetings and other venues have provided a rich array of gastronomic experiences and many fond memories to his many friends in our profession.
The Gelbard Review Lecture Series Conducted during the American Nuclear Society’s Conference Nuclear Mathematical and Computational Sciences: A Century in Review, A Century Anew Gatlinburg, Tennessee, April 6–10, 2003
Back row: Richard Hwang, Elmer Lewis, Kord Smith, Enrico Sartori Front row: Yousry Azmy, Elliott Whitesides, Jerry Spanier, Jack Dorning, Ed Larsen
Contents
Preface .. . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . vii Obituary Composed by Dr. Roger Blomquist for Dr. Ely Meyer Gelbard .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . xi 1
Advances in Discrete-Ordinates Methodology .. . . . . . . . . . . . . . . . . .. . . . . . . . . . . Edward W. Larsen and Jim E. Morel
1
2
Second-Order Neutron Transport Methods . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . 85 E.E. Lewis
3
Monte Carlo Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . .117 Jerome Spanier
4
Reactor Core Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . .167 Robert Roy
5
Resonance Theory in Reactor Applications . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . .217 R.N. Hwang
6
Sensitivity and Uncertainty Analysis of Models and Data.. . . . .. . . . . . . . . . .291 Dan Gabriel Cacuci
7
Criticality Safety Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . .355 G.E. Whitesides, R.M. Westfall, and C.M. Hopper
8
Nuclear Reactor Kinetics: 1934–1999 and Beyond . . . . . . . . . . . . . .. . . . . . . . . . .375 Jack Dorning
Index . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . .459
xv
Chapter 1
Advances in Discrete-Ordinates Methodology Edward W. Larsen and Jim E. Morel
1.1 Introduction In 1968, Bengt Carlson and Kaye Lathrop published a comprehensive review on the state of the art in discrete-ordinates .SN / calculations [10]. At that time, SN methodology existed primarily for reactor physics simulations. By today’s standards, those capabilities were limited, due to the less-developed theoretical state of SN methods and the slower and smaller computers that were then available. In this chapter, we review some of the major advances in SN methodology that have occurred since 1968. These advances, combined with the faster speeds and larger memories of today’s computers, enable today’s SN codes to simulate problems of much greater complexity, realism, and physical variety. Since 1968, several books and reviews on general numerical methods for SN simulations have been published [32, 46, 71], but none of these covers the advanced work done during the past 20 years. The specific purpose of this chapter is to describe how the field of SN calculations has matured through the lens of three important physical problems that can be simulated today but could not be realistically simulated in 1968. By discussing these problems and the methods developed to overcome their calculational difficulties, we hope to (i) show how dramatically the field of SN simulations of the transport equation has advanced and (ii) provide an introduction to the new algorithmic techniques that have enabled these advances. An outline of the remainder of this review follows. In Section 1.2, we briefly introduce the transport equation and discuss its basic temporal (implicit), energy (multigroup), directional .SN /, and spatial (finite-difference) discretizations, together with iterative solution procedures – as of 1968. The purpose of this section is to establish notation and set the stage for the later sections, which describe more recent developments. E.W. Larsen () Department of Nuclear Engineering and Radiological Sciences, University of Michigan, Ann Arbor, 48109-2104 Michigan, USA e-mail:
[email protected] J.E. Morel Department of Nuclear Engineering, Texas A&M University, College Station, Texas, USA e-mail:
[email protected] Y. Azmy and E. Sartori, Nuclear Computational Science: A Century in Review, c Springer Science+Business Media B.V. 2010 DOI 10.1007/978-90-481-3411-3 1,
1
2
E.W. Larsen and J.E. Morel
Section 1.3 discusses three important physical problems that could not be simulated in 1968 but can be realistically simulated today: thermal radiation transport, charged-particle transport, and oil-well logging tool design. In Section 1.4, we discuss advanced spatial discretizations (characteristic methods, discontinuous finite-element methods [DFEMs], and nodal methods) and the asymptotic thick diffusion limit (a technique to predict the validity of SN spatial discretizations for diffusive systems with optically thick spatial cells). Section 1.5 describes advances in discretizations of the angular derivatives associated with curvilinear geometries and treatments of anisotropic scattering. Section 1.6 covers advances in angular and energy discretizations for charged particles; Section 1.7 describes advances in time discretizations. In Section 1.8, we discuss major advances in iteration acceleration: diffusionsynthetic acceleration (DSA), linear multifrequency-grey acceleration for thermal radiation transport, fission source acceleration for time-dependent calculations, and upscatter acceleration. Section 1.9 outlines the recent application of preconditioned Krylov methods. Section 1.10 concludes with a brief discussion of challenges for the future: robust finite-element methods on nonorthogonal grids, positive and monotone methods, efficient parallel sweep algorithms for unstructured grids, further development of Krylov methods for solving the SN equations, methods for charged-particle calculations with pencil-beam sources, Galerkin quadrature with positive generalized weights, and ray-effect mitigation.
1.2 Basic Concepts The physical process discussed in this chapter is the interaction of radiation with matter (radiation transport, or particle transport). The archetypical equation that describes these interactions is the linear Boltzmann equation (LBE) [2, 3, 7, 13]: 1 @ .r; ; E; t / C r .r; ; E; t / C †t .r ; E/ .r ; ; E; t / v @t Z 1Z †s r; 0 ; E 0 ! E .r; 0 ; E 0 ; t / d0 dE 0 D 4 0 Z Z .r; E/ 1 Q .r; E; t/ r; 0 ; E 0 ; t d0 dE 0 C C †f r; E 0 : (1.1) 4 4 4 0
In full generality, this equation has seven independent variables: three spatial variables .r/, two direction-of-flight (or angular) variables , energy .E/, and time .t/. Particle transport problems are difficult and costly to simulate because, in part, of the high dimensionality of phase space. In this section, we discuss the basic numerical methods used to solve Eq. (1.1) in the principal large computer codes of the 1960s [4, 5, 10, 14]. We assume that the reader understands the physical meaning and basic mathematical properties of each of the terms in Eq. (1.1), and we have used notation that is broadly standard. The discussion in this section is terse; we refer the reader to standard texts [13, 71] for details.
1
Advances in Discrete-Ordinates Methodology
3
The LBE given in Eq. (1.1) describes neutron transport with scattering and fission interactions. Variations of this equation primarily involve the types of interactions that are included. For instance, a gamma-ray transport equation would not have a fission term. Systems of coupled transport equations, each similar to Eq. (1.1), are required to describe the coupled transport of multiple types of particles, e.g., coupled neutron gamma-ray transport in which neutrons interact with nuclei to create gamma-rays and gamma-rays interact with nuclei to create neutrons. The principal computational difficulties associated with Eq. (1.1) are common to essentially all variations of this equation that are associated with different physical applications. In this chapter, we describe numerical methods in terms of Eq. (1.1), or simpler versions of that equation whenever possible. We consider variations of Eq. (1.1) that correspond to different physical applications only when necessary. To begin, we mention a few technical details. First, the differential scattering cross section is commonly written as a Legendre polynomial expansion: 1 X 2m C 1 †s r; ; E ! E D Pm 0 †s;m r; E 0 ! E : 4 mD0
0
0
(1.2)
The Legendre moments †s;m are typically calculated and stored for each material region. Also, initial and boundary conditions must be specified for Eq. (1.1). If V denotes the physical system and t D 0 is the initial time, then Eq. (1.1) holds for all r 2 V; 2 4; 0 < E < 1, and t > 0. At t D 0, must be fully specified in V : .r ; ; E; 0/ D
i
.r; ; E/; r 2 V; 2 4 ; 0 < E < 1:
(1.3)
Also, must be specified on the boundary @V for directions of flight pointing into V : .r ; ; E; t/ D
b
.r; ; E; t/; r 2 @V; n < 0; 0 < E < 1; 0 < t: (1.4)
Here, n is the unit outer normal vector at the boundary point r 2 @V . Many important algorithmic concepts can be explained most easily for problems with planar-geometry symmetry, in which the geometry and solution depend on only one spatial variable x and one angular variable D i . (The unit vector i points in the positive x-direction.) For a planar-geometry system 0 x X; Eq. (1.1) simplifies to 1 @ .x; ; E; t/ @ .x; ; E; t/ C C †t .x; E/ .x; ; E; t/ v @t @x Z 1Z 1 †s x; 0 ; ; E 0 ! E x; 0 ; E 0 ; t d0 dE 0 D 0
1
.x; E/ C 2
Z 0
1Z 1 1
†f x; E 0
Q.x; E; t/ x; 0 ; E 0 ; t d0 dE 0 C ; (1.5) 2
4
E.W. Larsen and J.E. Morel
where 1 X 2m C 1 Pm ./Pm 0 †s;m x; E 0 ! E : (1.6) †s x; 0 ; ; E 0 ! E D 2 mD0
The initial condition for Eq. (1.5) is .x; ; E; 0/ D
i
.x; ; E/; 0 < x < X; 1 1; 0 < E < 1;
(1.7)
and the boundary conditions are .0; ; E; t/ D
l
.X; ; E; t/ D
.; E; t/; 0 < 1; 0 < E < 1; 0 < t; r
(1.8a)
.; E; t/; 1 < 0; 0 < E < 1; 0 t: (1.8b)
Because D vN , where v is the particle speed and N is the particle density, physically must be non-negative. If the cross sections, inhomogeneous source, initial conditions, and boundary conditions in Eqs. (1.5) through (1.8) are all non-negative (as they must be physically), then it can be shown that the solution of these equations is non-negative. However, the positivity of does not necessarily hold when approximations (discretizations) of the LBE are imposed. A desirable feature of a discretization for the LBE is that the resulting approximate solution should be positive – or nearly so. We now sketch the basic discretization and solution methods for Eqs. (1.5) through (1.8), which existed in computer codes in the late 1960s. We begin with the discretization of time. The most widely used time-discretization technique for transport problems, even today, is implicit time differencing. For a time interval tk1=2
kC1=2
0
1
Z Z kC1=2 .x; E/ 1 1 x; 0 ; E 0 d0 dE 0 C †f x; E 0 2 0 1 kC1=2 k1=2 Q .x; E/ .x; ; E/ C C : (1.9) 2 vt k This equation can be obtained by integrating Eq. (1.5) over tk1=2
Z
tkC1=2 tk1=2
.x; ; E; t/dt
kC1=2
.x; ; E/:
(1.10)
1
Advances in Discrete-Ordinates Methodology
5
The definition of QkC1=2 in Eq. (1.9) follows Eq. (1.10). The boundary conditions kC1=2
.0; ; E/ D
l;kC1=2
kC1=2
.X; ; E/ D
.; E/; 0 < 1; 0 < E < 1;
(1.11a)
.; E/; 1 < 0; 0 < E < 1;
(1.11b)
r;kC1=2
for kC1=2 are obtained similarly. Implicit time discretization yields a steady-state LBE to be solved within each time step. The angular flux at the end of the previous time step appears as a source in the right side of the (steady-state) LBE. Since the solution of the LBE with a positive source is guaranteed to be positive, it follows that implicit time differencing – in the absence of other truncation errors – is guaranteed to yield a positive solution. (This is not the case for other time discretizations.) However, all discretization methods contain truncation errors that degrade the solution. For implicit time differencing, these errors are first-order:
x; ; E; t kC1=2 D
kC1=2
.x; ; E/ C O.t/:
(1.12)
Because Eq. (1.9) is equivalent to a steady-state equation, the same solution techniques can be used for both time-dependent and steady-state calculations. This is generally true even for time discretizations that are more advanced than the fully implicit discretization. Thus, we shall, henceforth, only discuss steady-state problems. Next, we consider the multigroup discretization of the energy variable. This approximation begins with the specification of an energy grid Emin D EG < EG1 < < Eg < Eg1 < E1 < E0 D Emax , which defines the boundaries of energy groups (or, more simply, groups), the gth group being the interval Eg < E < Eg1 . On each group, the cross sections are represented as constants: †t;g .x/, †s;g 0 !g .x; 0 ; /, †f;g .x/, and g .x/. (In effect, the continuous-energy cross sections are approximated as histograms in E.) Doing this, integrating the (steady-state) Eq. (1.5) over the gth group, and defining the gth group flux as Z g .x; /
Eg1=2
D
.x; ; E/dE;
(1.13)
EgC1=2
we obtain the coupled system of multigroup transport equations:
@
g .x; /
@x
C †t;g .x/
g .x; /
C
D
G Z X
1
g 0 D1 1
†s;g 0 !g .x; 0 ; /
G Z g .x/ X 1 †f;g 0 .x/ 2 1 0 g D1
g0
g0
x; 0 d0
Qg .x/ ; x; 0 d0 C 2
0 < x < X; 1 1; 1 g G:
(1.14)
6
E.W. Larsen and J.E. Morel
The multigroup boundary conditions are likewise obtained by integrating Eq. (1.8) over the gth group: D
g .0; / g .X; /
D
l g ./;
0 < 1; 1 g G;
(1.15a)
1 < 0; 1 g G:
(1.15b)
r g ./;
This simplified derivation of the multigroup equations does not specify the multigroup cross sections, e.g., †s;g 0 !g . This topic is routinely covered in nuclear engineering textbooks and will not be discussed here. However, the above derivation shows that if the physical cross sections are histograms in E, then the multigroup transport equations are exact. The multigroup technique is one of the most successful approximations in computational transport theory. In practice, much effort goes into the definition of the energy groups and multigroup cross sections: the more carefully these are chosen, the fewer the number of groups required, and the less costly is the calculation. The optimal number of groups and choice of the group structure depend on the specific application. For some light water reactor calculations, only two energy groups are required to achieve sufficient accuracy. However, other problems – such as neutron and gamma-ray transport in shields, or charged-particle transport – can require well over 100 energy groups. Equation (1.14) can also be written as Z 1 @ g .x; / C †t;g .x/ g .x; / D †s;g x; 0 ; g x; 0 d0 @x 1 Qg .x/ ; (1.16) C Sg .x; / C 2 where †s;g D †s;g!g is the within-group scattering cross section for group g, and XZ 1 †s;g 0!g x; 0 ; g 0 x; 0 d0 Sg .x; / D g 0 ¤g
C
1
G Z g .x/ X 1 †f;g 0 .x/ 2 1 0
g0
x; 0 d0
(1.17)
g D1
is the scattering plus fission source to group g. Thus, the multigroup equations can be viewed as a system of one-group equations that are coupled through the scattering and fission sources. Like the implicit time discretization of the transport equation, the multigroup approximation is inherently positive: for any number of groups G, if the multigroup cross sections, source Qg , and boundary conditions gl and gr are non-negative, the solution g of the multigroup Eqs. (1.14) and (1.15) is non-negative. Next, we discuss the discrete-ordinates .SN / discretization of the angular variable. This begins with the specification of N discrete angles nC1=2 , satisfying
1
Advances in Discrete-Ordinates Methodology
7
1 D 1=2 < 3=2 < < N C1=2 D 1, which define the boundaries of angular bins, the nth angular bin being the interval n1=2 < < nC1=2 . The width of this bin is wn D nC1=2 n1=2 . At a point within each nth angular bin, a discrete ordinate n is specified. The set f.n ; wn / j1 n N g is an angular quadrature set of order N. In practice, one-dimensional (1-D) quadrature sets for Eq. (1.16) have an even number N of discrete-ordinates and angular bins, which are symmetric about D 0: N D 1 , wN D w1 , etc. (The direction D 0 is always chosen as the edge of an angular bin, never as a discrete ordinate.) [15]. Many numerical methods can be described in terms of a simplified one-group version of Eq. (1.16). This simplified equation is obtained from Eq. (1.16) by absorbing Sg into Qg , assuming Qg to be a known source, and dropping the group subscript g. The SN approximation to this equation is n
@
n .x/
@x
C †t .x/
n .x/
N X
D
†s .x; n ; n0 /
n0 D1
n0 .x/wn0
0 < x < X; 1 n N
C
Q.x/ ; 2 (1.18)
with boundary conditions: n .0/
D
l n;
0 < n 1;
(1.19a)
n .X /
D
r n;
1 n < 0:
(1.19b)
This approximation can be obtained by integrating the one-group version of Eq. (1.16) over the nth angular bin, dividing by the width of the bin, and making simple approximations. The above SN equations are a coupled system of first-order differential equations in x. The unknowns in this system are the angular fluxes n .x/ for the nth angular bin. In the absence of scattering .†s D 0/, the SN equations become uncoupled; particles cannot “jump” from one angular bin to another. (However, in curvilinear-geometry transport equations, angular “jumping” does occur, even in the absence of scattering.) In two-dimensional (2-D) and three-dimensional (3-D) problems, two angular variables are needed to define the direction-of-flight variable on the unit sphere. In this case, a multidimensional angular quadrature set consists of a set of discrete directions (discrete ordinates) n ; one for each angular bin, and a corresponding set of angular weights wn that define the area (on the unit sphere) of each bin. Like implicit time differencing and the multigroup approximation, the SN approximation – applied to a Cartesian-geometry equation such as Eq. (1.16) – is inherently positive: if the cross sections and sources in Eqs. (1.18) through (1.19) are non-negative, then the SN angular fluxes are non-negative. The positivity of the SN approximation for 1-D planar and other Cartesian geometries does not automatically apply in curvilinear geometries. For example, let us consider 1-D spherical geometry problems, in which the cross sections depend only on the radial variable r D jrj D .x 2 C y 2 C z2 /1=2 and the sources depend spatially on r and angularly on D
r : r
(1.20)
8
E.W. Larsen and J.E. Morel
In such problems, the angular flux depends spatially only on r and angularly only on , and the appropriate (one-group) 1-D spherical geometry transport equation is
@ .r; / 1 2 @ C .r; / C †t .r/ .r; / @r r @ Z 1 Q.r/ : †s .r; ; 0 / r; 0 d0 C D 2 1
(1.21)
Now, an angular derivative term occurs on the left side of the LBE. This term is present because, by Eq. (1.20), the spherical geometry variable is spacedependent; as a particle streams through the system, its angular variable changes continuously. The new complication is that a successful -discretization must accurately treat the integral scattering term on the right side of the equation and the angular derivative term on the left side. We now describe the original SN approximation to Eq. (1.21). First, we multiply by r 2 and rearrange to obtain the conservative form of the LBE:
@ @ 2 r .r; / C r .1 2 / .r; / C †t .r/r 2 .r; / @r @ Z 1 r 2 Q.r/ : †s r; ; 0 r 2 r; 0 d0 C D 2 1
(1.22)
(Note that by integrating this equation over 1 1, the angular derivative term automatically vanishes. This fact implies that the angular redistribution of particles as the particles freely stream is conservative – it neither adds nor subtracts particles from the system.) We integrate Eq. (1.22) over the nth angular bin n1=2 < < nC1=2 and divide by the bin width wn . After making simple approximations, we obtain r @ 2 r n .r/ C ˇnC1=2 nC1=2 .r/ ˇn1=2 @r wn N X r 2 Q.r/ ; †s .r; n ; n0 /r 2 n0 .r/ wn0 C D 2 0
n
n1=2 .r/
C †t .r/r 2
n .r/
(1.23a)
n D1
where ˇnC1=2 D 2
n X
n0 wn0
(1.23b)
n0 D1
is defined so that Eq. (1.23a) admits a constant solution for the infinite medium configuration in the presence of a constant source. In Eq. (1.23a), extra unknowns arise – the angular fluxes n˙1=2 at the edges of the angular bins. Originally, these unknowns were treated by solving Eq. (1.23) in combination with the DiamondDifference (DD) approximation in angle n .r/
D
1 2
n1=2 .r/
C
nC1=2 .r/
;
(1.24)
1
Advances in Discrete-Ordinates Methodology
9
and the starting-direction calculation for 1=2 , which is obtained directly from Eq. (1.21) by setting D 1 and assuming that @ =@ at D 1 is bounded,
@
1=2 .r/
@r
C †t .r/
1=2 .r/
D
N X
†s .r; 1; n0 /
n0 .r/wn0
n0 D1
C
Q.r/ : 2
(1.25)
Equations (1.23) through (1.25) hold in (e.g.) a finite sphere 0 < r < R, with boundary conditions n .R/
b n
D
1=2 .R/
D
; n < 0;
(1.26a)
b 1=2 ;
(1.26b)
which specify the fluxes entering the sphere through its outer boundary r D R. It is apparent that for curvilinear geometries, in which angular derivatives occur, the SN approximation is more complicated than in Cartesian geometries. As a result, there are issues of accuracy in curvilinear geometries that do not occur in Cartesian geometries. We will discuss some of these issues later. Although the 1-D spherical geometry SN equations do not automatically yield positive angular fluxes, it is rare that these equations yield negative solutions given positive sources and cross sections, provided that the variation of the solution is resolved by the computational mesh. Because the cost of a calculation increases with the quadrature order N , there is an incentive to use angular quadrature sets with the fewest number of angles that yield the desired accuracy. It has long been known that, for most 1-D problems, the even-order Gauss–Legendre quadrature sets are optimal (or nearly so). However, for multidimensional problems, the choice of angular quadrature sets is more ambiguous. Next, we discuss spatial discretizations for the one-group SN Eqs. (1.18) and (1.19). As with the previously discussed variables, we must specify points f0 D x1=2 < x3=2 < < xj C1=2 < < xJ C1=2 D X g that define the edges of spatial cells, the j th spatial cell being the interval xj 1=2 < x < xj C1=2 . The cell width is xj D xj C1=2 xj 1=2 . Within each (j th) spatial cell, the cross sections are constant: †t .x/ D †t;j , etc. The cell-edge angular fluxes are defined as n;j ˙1=2 D n .xj ˙1=2 /, and the cell-average angular fluxes are defined as n;j
D
1 xj
Z
xj C1=2 n .x/dx:
(1.27)
xj 1=2
Integrating Eq. (1.18) over the j th spatial cell and dividing by xj , we obtain exactly the balance equation: n . xj
n;j C1=2
n;j 1=2 /
C †t;j
n;j
D
N X n0 D1
†s;j .n ; n0 /
n0 ;j
wn0 C
Qj ; 2 (1.28)
10
E.W. Larsen and J.E. Morel
which relates the cell-edge and cell-average angular fluxes, and holds for each spatial cell 1 j J and each direction 1 n N: These equations and the boundary conditions n;1=2
D
n;J C1=2
l n;
D
0 < n < 1; r n;
(1.29a)
1 < n < 0;
(1.29b)
yield a system of N.J C 1/ equations for the N.2J C 1/ cell-average and cell-edge unknown fluxes. To obtain a discrete system with the same number of equations as unknowns, NJ extra equations must be formulated. One way to formulate the extra equations is to specify finite difference relationships between the cell-edge and cell-average fluxes within each cell. If these relationships only directly couple fluxes traveling in the same direction, and if the infinite-medium spatially constant solutions are to be preserved, then one is led to algebraic relationships of the form n;j
D
1 C ˛n;j 1 ˛n;j n;j C1=2 C 2 2 n N; 1 j J;
n;j 1=2 ;
(1.30)
where the constants ˛n;i are constrained by the goals of accuracy, stability, and symmetry about D 0. The simplest choice, ˛n;j D 0, yields the diamonddifference scheme. The discrete system (1.28) through (1.30) is the basis for the earliest planargeometry SN codes. For the diamond-difference scheme, the numerical solution is strictly positive if the widths of the spatial cells are sufficiently small. Unfortunately, as the cell widths increase, diamond-difference solutions can become negative, and unphysical oscillatory behavior can occur. In multidimensional problems, positive diamond-difference solutions are never guaranteed; oscillatory behavior is always possible, for any spatial grid. These issues led to other choices of the constants ˛n;j , and nonlinear (negative flux fixup) modifications to Eq. (1.30). In practice, the diamond-difference scheme (sometimes with negative flux fixup) was found to generally work well for relatively “diffusive” and weakly absorbing reactor cores, while Weighted-Diamond (WD) techniques .˛n;j ¤ 0/ generally worked well in more strongly absorbing reactor shields. All of the independent variables in the LBE – time, energy, angle, and space – have now been discretized. Typically, a very large system of linear algebraic equations has been generated. How does one solve this system? In principle, one can write the entire discrete system as a single matrix equation A D q and invert the matrix A. However, A is usually so large that this is impractical; thus, iterative techniques that avoid the explicit construction and direct inversion of A must be used.
1
Advances in Discrete-Ordinates Methodology
11
The most fundamental iterative approach, called Source Iteration (SI), is based on a simple concept. Let us suppose that the entire right side of Eq. (1.28) is known. Then for n > 0, it is easy to show that by starting at the leftmost .j D 1/ spatial cell and recursively marching from left to right (in the direction of particle flow) across the system to the rightmost cell, one can explicitly solve Eqs. (1.28) through (1.30) for all cell-edge and cell-average unknowns that correspond to n > 0. Likewise, by marching across the system from right to left, one can solve Eqs. (1.28) through (1.30) for all cell-edge and cell-average unknowns that correspond to n < 0. In the absence of scattering, this marching (or transport sweep) procedure yields an explicit noniterative solution of the transport problem. If the physical problem includes scattering, then the SI scheme can be implemented. SI begins with an estimate (typically, zero) for the scattering source on the right side of Eq. (1.28). Using this estimated source, Eqs. (1.28) through (1.30) are solved by a transport sweep. The resulting estimates of the cell-average angular fluxes are introduced into the scattering source, and the next iteration is ready to commence. These “source iterations” are repeated until the scalar fluxes converge. Mathematically, the SI scheme for Eqs. (1.28) through (1.30) is defined by n xj
.`1=2/ n;j C1=2
N X
.`1=2/ n;j 1=2
C †t;j
.`1=2/ n;j
Qj ; 2 n0 D1 1 C ˛n;j 1 ˛n;j .`1=2/ .`1=2/ D C n;j n;j C1=2 2 2 D
.`1=2/ n;1=2 .`1=2/ n;J C1=2
†s;j .n ; n0 /
D D
l n; r n;
.`1/ 0 n0 ;j wn
C
0 < n < 1;
(1.31a) .`1=2/ n;j 1=2 ;
(1.31b) (1.31c)
1 < n < 0;
(1.31d)
with the update equation .`/ n;j
D
.`1=2/ : n;j
(1.32)
Here, ` is the iteration index. The `th iteration begins with cell-average angular flux .`1/ estimates n;j , which are introduced into the scattering source. Equations (1.31) are then solved by a transport sweep, and Eq. (1.32) defines the new cell-average angular flux estimates to be those that were just calculated in the sweep. .0/ If the initial scattering source is taken to be zero . n;j D 0/, the SI angular flux estimate after ` sweeps is, physically, the angular flux due to particles that have experienced at most ` 1 scattering events. If the physical system has significant absorption or is optically thin (leaky), particles will generally have short histories, and the SI scheme will converge rapidly. However, if the physical system is optically thick with weak absorption (i.e., diffusive), then most particles will experience long histories, and the SI scheme will converge slowly.
12
E.W. Larsen and J.E. Morel
For iteratively solving multigroup problems, the single-group SI scheme is the main building-block. If no upscattering is present, the equations for the highest .g D 1/ group are iterated to sufficient precision; then the equations for the next .g D 2/ group are iterated to sufficient precision; this process continues to the lowest-energy .g D G/ group, and the problem is then considered fully solved. If upscattering is present, it is necessary to iterate on the upscattering sources: in the first outer iteration, the upscattering sources are estimated (typically set to zero) and the resulting downscattering problem is solved as described in the previous paragraph. The second outer iteration begins by updating the upscattering sources and continues with a second downward “sweep” through the groups. In this process, it is typical not to fully converge the scattering source within each group; instead, a user-specified number of transport sweeps is performed for each group. If the upscattering probability is small, this upscattering or outer iteration strategy will converge rapidly; if the upscattering probability is high, it will generally converge slowly. A widely used parameter for assessing the efficiency of an iterative scheme is the spectral radius of the iteration operator, defined as the asymptotic (for large `) ratio of the error in the `th iteration to the error in the (`–1)st iteration:
D lim
`!1
.`/
:
(1.33a)
.`1/
An equivalent definition, which allows to be estimated without knowing the limit of the sequence of iterates, , is given as follows:
.`/
D lim .`1/
`!1
.`1/
:
.`2/
(1.33b)
A rapidly converging scheme will have 1; a slowly converging scheme will have < 1 and 1; and a nonconverging scheme will have 1. A Fourier analysis, to be discussed later, shows that the SI scheme applied to a one-group transport equation in an infinite homogeneous medium has the spectral radius D
†s D c scattering ratio: †t
(1.34)
Therefore, the SI scheme applied to one-group problems always converges; but if c is arbitrarily close to unity (the probability of absorption is arbitrarily small) and the system becomes increasingly thick, SI will converge arbitrarily slowly. (As c ! 1, increasingly many particles will undergo increasingly many scattering events during their histories.) Similarly, it can be shown that the SI scheme applied to multigroup problems, as described above, always converges; but if the probability of upscattering is high, then the spectral radius will again be close to unity.
1
Advances in Discrete-Ordinates Methodology
13
The SI scheme is the most fundamental iteration scheme for solving discretized particle transport problems. All practical iterative schemes today use SI as a principal ingredient in the iteration procedure. The SI method is guaranteed to converge, but for many important problems it converges slowly. Improvements to SI involve modifications to Eq. (1.32) that are intended to improve the efficiency of the SI scheme (reducing the spectral radius) for diffusive problems, or for problems with significant upscatter. The first widely used improvement to SI was the rebalance scheme. In fine-mesh rebalance, Eq. (1.32) is replaced by .`/ n;j
D
.`1=2/ .`/ Fj ; n;j
(1.35)
where the rebalance factors Fj.`/ are determined by requiring that .`/ n;j C1=2
D
8 < :
.`1=2/ F .`/ ; n;j C1=2 j .`1=2/ .`/ n;j C1=2 Fj C1 ;
.`/ n;j
and
n > 0 (1.36) n < 0
satisfy Eq. (1.28), integrated over n . [Equations (1.35) and (1.36) show that the rebalance factor for the j th cell applies to all the cell-average fluxes within this cell and all the cell-edge fluxes that correspond to exiting directions from the cell.] .`/ This procedure yields a tridiagonal system of equations for Fj ; the updated fluxes satisfy the correct angle-integrated balance equation on each spatial cell. Coarse-mesh rebalance operates by the same principle, except that now the J fine-mesh cells are clustered into a smaller number of coarse-mesh cells. (e.g., two adjacent fine-mesh cells could be clustered into one coarse-mesh cell, yielding J /2 coarse-mesh cells.) Coarse-mesh rebalance factors are defined on the coarse-mesh spatial cells; any cell-average angular flux within a given coarse-mesh cell is updated multiplicatively by the same coarse-mesh rebalance factor. The same concept can be applied to multigroup problems. Here, fine-mesh rebalance factors have one rebalance factor for each spatial cell and energy group. Coarse-mesh rebalance factors correspond to multiple adjacent fine-mesh spatial cells and/or multiple energy groups. In practice, rebalance is often inefficient, even when it is implemented optimally. For most problems, fine-mesh rebalance is unstable (divergence occurs), while coarse-mesh rebalance with a sufficiently coarse grid is stable and provides acceleration. However, if the coarse grid is too coarse, then coarse-mesh rebalance becomes ineffective [56]. Thus, the application of rebalance can be time-consuming, in terms of both the cost of setting up the problem (determining the optimal coarse mesh) and the resulting inefficiency (poor iterative performance after the coarse mesh is chosen). In spite of these deficiencies, rebalance was used widely for many years because it was still more efficient than Source Iteration. To summarize, the discretization methods described above are finite-difference in nature, and the resulting truncation errors are guaranteed to be small only when the discretization grid is “fine.” The implicit time discretization is accurate when
14
E.W. Larsen and J.E. Morel
a time step is small compared to a mean free time (t .v†t /1 , where v D neutron speed). We have already discussed the accuracy of the multigroup approximation in energy; depending on the problem, as few as two groups, or as many as over 100 can be required. Angular discretizations can also be difficult; if the solution of a specified problem has a weak angle-dependence, then a low-order quadrature set may be sufficient. However, if strong angular effects are present, due to strongly absorbing regions or voids with streaming, then high-order angular quadrature sets are required. Finally, the finite-difference spatial differencing schemes discussed above require, for reliable accuracy, that spatial cells be optically thin (in 1-D,†t x 1). Thus, the state of the art in production particle transport codes in the late 1960s consisted of the following: implicit differencing in time, the multigroup approximation in energy, the SN approximation in angle, and finite-difference discretizations in space requiring optically thin and rectangular (orthogonal) spatial grids. The iteration methods that existed to solve these discrete problems were often inefficient. The production codes in which these methods were implemented were 1-D or 2-D; no major 3-D codes existed.
1.3 Three Challenging Physical Problems Next, we discuss three important physical problems that could not be simulated realistically by the numerical techniques described in Section 1.2, but that can be meaningfully simulated using the larger and faster computers and the more sophisticated SN algorithms that are available today. These problems are: Thermal radiation transport. This problem requires accuracy in strongly absorb-
ing media, accuracy in the optically thick diffusion limit with both resolved and unresolved boundary layers, and robust iteration acceleration. Charged-particle transport. This problem requires accurate treatment of highly forward-peaked scattering, accurate treatment of scattering with extremely small energy losses, and robust iteration acceleration. Oil-well logging tool design. This problem requires efficient treatment of extremely complex 3-D geometries with vastly different scale lengths in a single problem.
1.3.1 Thermal Radiation Transport in the Stellar Regime Thermal radiation transport in the stellar regime is important in astrophysical applications. Hence, some of the most significant early contributions to transport theory came from astrophysicists, e.g., Eddington [1] and Chandrasekhar [2]. For stellar modeling applications, the thermal radiation transport equation is usually coupled to hydrodynamic equations [17, 39], but in this exposition we ignore hydrodynamic
1
Advances in Discrete-Ordinates Methodology
15
coupling. We caution the reader not to confuse infrared transport with thermal radiation transport in the stellar regime. Although both constitute thermal (photon) radiation transport, the stellar regime corresponds to high stellar temperatures and photon energies characteristic of X-rays, while the infrared regime corresponds to low terrestrial temperatures and infrared photon energies. From a numerical viewpoint, infrared calculations are much more benign. In thermal radiation transport, high-energy photons transport through and nonlinearly interact with a host medium (a plasma). The photons can scatter, or they can be absorbed in the medium. If they are absorbed, their energy goes into the medium, increasing its temperature. The medium also emits photons (via a temperaturedependent Planck function), causing its temperature to decrease. The equations of thermal radiation transport consist of a transport equation for the angular intensity of photons I.r; ; E; t/, 1 @I 1 C rI C †t I D †s C †a B; c @t 4
(1.37)
and an energy-balance equation for the material temperature T .r; t/, Cv
@T D @t
Z
1
†a Œ 4 B dE:
(1.38)
0
Here, c is the speed of light, †s .r; E; T / is the macroscopic Thompson scattering cross section, †a .r; E; T / is the macroscopic absorption cross section, †t .r; E; T / D †a C †s is the macroscopic total cross section, .r; E; t/ is angular intensity integrated over all directions, Cv .r; T / is the material heat capacity, and B.E; T / is the Planck function: B.E; T / D
1 2E 3 E 1 exp ; h3 c 2 kT
(1.39)
where h is Planck’s constant and k is Boltzmann’s constant. The primary unknowns are the angular intensity I.r; ; E; t/, which is a photon energy flux rather than a number flux, and the material temperature T .r; t/. Because Eqs. (1.37) and (1.38) are nonlinear in T , they are generally solved in each time step via Newton’s method. To illustrate this technique, we implicitly difference the equations in time: 1 kC1=2 kC1=2 kC1=2 k1=2 I C rI kC1=2 C †t I I k ct 1 kC1=2 kC1=2 † D
C †a B kC1=2 ; 4 s
(1.40)
Z 1 CvkC1=2 kC1=2 k1=2 kC1=2 kC1=2 kC1=2 T D
dE: T † 4 B a t k 0 (1.41)
16
E.W. Larsen and J.E. Morel
We let T denote the latest Newton iterate for the temperature. Then the linearized equations for the next Newton iteration are obtained by evaluating the material properties at T and linearly expanding the temperature-dependent Planck function about T : @B kC1=2 T (1.42) T ; B kC1=2 D B C @T where a superscript “ ” denotes a quantity evaluated at T . With the above expansion, the material temperature can be eliminated from the transport equation. Suppressing the temporal superscript “k C 1=2”, we express the linearized temporally differenced transport equation as follows: Z 1 1 1 rI C † I D †s C †a .E 0 / .E 0 / dE 0 C ; (1.43) 4 4 0 where † D †t C ;
D
(1.44a)
1 ; ct k
(1.44b) R1
@B .E/ dE @T ; D R1 @B .E/ Cv .E/ dE C 4 † a 0 @T t k 4
0
†a .E/
@B .E/ @T .E/ D ; R1 @B .E 0 / .E 0 / 0 dE † a 0 @T
(1.44c)
†a .E/
(1.44d)
D †a B C I k1=2 Z 1 C †a .E 0 /4 B .E 0 / dE 0 C vk T k1=2 T ; (1.44e) 4 0 t and the material temperature is given by R1 T kC1=2 D T C
0
Cv k1=2 T T k t : R1 @B Cv .E/ .E/4 dE C † a 0 @T t k (1.45)
†a .E/ Œ .E/ 4 B .E/ dE C
Equation (1.45) is used to calculate the temperatures after the linearized transport Eq. (1.43) has been solved. Equation (1.43) has the form of the steady-state neutron transport equation, with †a acting as the fission cross section, acting as the number of neutrons per fission, acting as the fission spectrum, and acting as the inhomogeneous source. Also, we note that the scattering process is monochromatic,
1
Advances in Discrete-Ordinates Methodology
17
i.e., photons do not change energy when they scatter. The spectral radius for the inner iteration process (the iteration on a within-group scattering source) is the usual scattering ratio, c D †s=†t , and the spectral radius for the outer iteration process (the iteration on the absorption or effective “fission” rate) is given by Z 1 †a 0 D dE: (1.46) †a C 0 The spectral radii observed in a practical problem are the maximum values of c and 0 , respectively, evaluated over the problem domain. Any region in which 0 is close to unity will be diffusive. The diffusion limit for thermal radiation transport is characterized by I D B.T /;
(1.47)
@T 4acT 3 r rT D 0; (1.48) @t 3†r where a D 8 5 k 4 =15h3c 3 , and †r is the Rosseland-averaged total cross section: Z 1 Z 1 @B.E/ 1 @B.E/ dE dE : (1.49) †r D @T †t .E/ @T 0 0 .Cv C 4aT 3 /
The linearized thermal radiation transport equation is analogous to a particular form of the neutron transport equation, but it is generally much more difficult to accurately and efficiently simulate than the neutron transport equation for the following reasons: Within a specific material region, the cross sections †a and †s can vary with energy by six or more orders of magnitude. †a and †s can change in space by six or more orders of magnitude across a material interface. Problems often contain both optically thin regions and optically thick regions. Optically thick regions can be strongly absorbing or highly diffusive. In diffusive regions, the spatial scale length of the solution can have a thickness of many mean free paths (e.g., thousands or more). The spectral radius of the outer iteration process can be very close to unity, e.g., 0 0:9999. For these reasons, the numerical requirements for thermal radiation transport are severe. In particular, spatial differencing schemes must be highly damped in strongly absorbing media, accurate in optically thin regions, have the thick diffusion limit (produce the correct diffusion solution in diffusive regions where the spatial grid is optically thick), and behave well with unresolved spatial boundary layers. A special diffusion-synthetic acceleration-like scheme, known as the linear multifrequencygrey method [42, 50, 77], is used to accelerate the outer iterations. The numerical implementation of this scheme must be very robust because there are often huge spatial discontinuities in the cross sections. In multidimensional calculations, the linear multifrequency-grey method must be recast as a preconditioner and used in conjunction with a Krylov solution technique.
18
E.W. Larsen and J.E. Morel
New algorithmic technologies that have made accurate and efficient thermal radiation transport calculations possible include lumped discontinuous finiteelement temporal and spatial discretizations, diffusion-synthetic acceleration of the inner iterations, and linear multifrequency-grey acceleration of the outer iterations. Fourier analysis has played a major role in determining the effectiveness of acceleration schemes, and asymptotic analysis has played a major role in determining the behavior of finite-element spatial differencing schemes in the thick diffusion limit. While 1-D methods are fairly mature [77], multidimensional methods are still a topic of research. Currently, preconditioned Krylov methods are having a major impact on the efficiency of multidimensional calculations. In subsequent sections, we discuss all of these new techniques. The numerical technology of 1968 was completely inadequate for thermal radiation transport calculations in the stellar regime. The spatial differencing schemes of that time were not accurate in optically thick, diffusive problems, and the iterative acceleration techniques available then were not sufficiently efficient and robust.
1.3.2 Charged-Particle Transport Charged-particle transport problems are described by Eq. (1.1) with †f D 0 (charged particles do not yield fission). However, charged particles can generate secondary particles of various sorts, which, for simplicity and without loss of generality, we neglect in our equations. Charged-particle problems are challenging because the mean free path, the average scattering angle, and the associated average energy loss are generally very small. To deal with this, the nearly singular components of the differential scattering cross section are often split off from the nonsingular (“smooth”) components and approximated by Fokker–Planck operators, yielding the approximate Boltzmann–Fokker–Planck (BFP) equation [37]: Z
r
C †t;sm
D
1
Z
†s;sm.0 ; E 0 ! E/ .0 ; E 0 /d0 dE 0 1 †r;tr @ @2 2 @ .1 / C C 2 @ @ 1 2 @! 2 @ˇr C C Q: (1.50) @E 0
4
Here, the direction vector is defined in terms of the cosine of the polar angle and the azimuthal angle !. Also, †t;sm is the “smooth” total cross section, †s;sm is the “smooth” differential scattering cross section, †r;tr is the restricted transportcorrected scattering cross section (also called the restricted momentum transfer), and ˇr is the restricted stopping power. The differential (in , !, and E) operators on the right side of Eq. (1.50) are Fokker–Planck operators in the angular and energy variables. As described above, the complete scattering cross section in Eq. (1.50) has been decomposed into
1
Advances in Discrete-Ordinates Methodology
19
“singular” and “smooth” components. The singular (differential) terms represent the part of the scattering cross section associated with highly forward-peaked scattering and small energy losses, while the smooth (integral) term represents the part of the scattering that is not singular. The cross sections and Fokker–Planck coefficients in Eq. (1.50) are said to be “restricted” because each is restricted to one component of the scattering. The angular Fokker–Planck operator on the right side of Eq. (1.50) is called the continuous-scattering operator. It represents an asymptotic limit of the Boltzmann scattering operator in which the scattering cross section †s becomes unbounded and the average cosine of the scattering angle N 0 limits to unity in such a manner that the momentum transfer, ˛ D †s .1 N 0 /, remains constant. Thus, particles scatter more often per unit pathlength but undergo a smaller average change in direction, in such a way that the mean change in direction cosine per unit pathlength remains constant. This limit results in a continuous-scattering process. In fact, it rigorously represents diffusion on the unit sphere. The continuous-scattering operator in Eq. (1.50) is the Laplacian operator on the unit sphere multiplied by the effective diffusion coefficient †r;tr =2. The energy Fokker–Planck operator on the right side of Eq. (1.50) is called the continuous-slowing-down operator. It represents an asymptotic limit of the Boltzmann scattering operator in which the scattering cross section †s becomes unbounded and the average energy loss per scatter E goes to zero in such a manner that the stopping power, ˇ D †s E, remains constant. Thus, particles scatter more often per unit pathlength but undergo a smaller average energy loss per scatter, such that the average energy loss per unit pathlength remains constant. This limit yields a process in which particles continuously lose energy per unit pathlength at a rate given by the stopping power. It is not always necessary to split the singular components off the scattering operator and approximate them by Fokker–Planck operators. In 1-D slab geometry and spherical geometries, one can obtain extremely accurate discrete approximations for the full scattering source (singular C smooth), even when the Legendre expansion for the scattering cross section is highly truncated; one need simply use a PN1 cross-section expansion, together with a Gauss SN quadrature set [54]. However, in 2-D and 3-D calculations, special techniques must be used to achieve the accuracy associated with 1-D Gauss quadratures. Special discretizations of the continuous-scattering operator can be very useful for obtaining a positive scattering source representation [40, 55, 120]. It is difficult to simultaneously maintain accuracy and scattering source positivity with highly truncated Legendre cross-section expansions. Charged-particle calculations are numerically difficult for the following reasons: If the LBE is not approximated by the BFP equation, Legendre expansions
for charged-particle scattering cross sections can require thousands of terms to converge. The scattering ratio can be very close to unity, resulting in very slow convergence of the source iteration process.
20
E.W. Larsen and J.E. Morel
Diffusion-synthetic acceleration improves convergence, but because of the highly
forward-peaked scattering, it does not necessarily bound the spectral radius away from unity. Some higher-order Legendre moments of the angular flux must also be accelerated to bound the spectral radius away from unity. Multigroup-like methods for treating the continuous-slowing-down term generally result in a great deal of numerical diffusion in energy. This loss of accuracy can make it difficult to calculate energy spectra. Higher-order (in energy) methods are more accurate than multigroup-like methods, but the energy spectra can still be difficult to converge. (This is a greater difficulty for [heavy] ions than for [light] electrons.) Strong boundary layers can exist at material interfaces if secondary particle generation occurs. For instance, near interfaces between low-Z and high-Z materials, X-ray photons can create low energy electrons with strong boundary layers. Different particle species in a coupled calculation may have vastly different scale lengths for their solutions. For instance, photons can generate electrons that have much smaller mean free paths than the photons.
Although it was adequate for simple demonstration calculations, the numerical transport technology of 1968 was not adequate for realistic charged-particle calculations. Some of the new technologies that have strongly impacted charged-particle transport are discontinuous finite-element methods (DFEMs) in both space and energy. DFEM discretizations are essential for robustness. For instance, if one is interested in bulk energy deposition rather than the anomalous deposition that occurs very near high-Z/low-Z interfaces, DFEM space-energy methods can yield accurate bulk energy deposition, even with completely unresolved boundary layers. Furthermore, DFEM energy discretizations are much more accurate than multigroup-like methods when energy spectra are of interest, or when energy and charge deposition are of interest in deep penetration problems [47]. Diffusion-synthetic acceleration can significantly reduce running times, and methods that accelerate higher-order moments can have an even greater impact [36, 62]. The Galerkin quadrature method, which is compatible with standard Legendre cross-section expansions, has made it possible to accurately treat highly anisotropic scattering in 2-D and 3-D calculations [54]. One-dimensional methods for coupled electron–photon transport are quite mature [58], but 2-D and 3-D methods remain a research topic for charged-particle transport calculations of all types. A difficult problem of great interest is that of pencil-beam sources in 2-D cylindrical and 3-D geometries. Acceleration of the high-order scattering source moments can be efficiently done in 1-D [62], but this task has proven to be very difficult in 2-D and 3-D [93]. The application of the SN method to multidimensional charged-particle transport calculations is just beginning to occur [101]. This technology will probably be slow to gain widespread use in production settings because of the high level of expertise required to apply the SN method to charged-particle transport problems, and because of the historical preference of Monte Carlo rather than deterministic methods within the chargedparticle transport community. Nonetheless, the SN method has the potential to be
1
Advances in Discrete-Ordinates Methodology
21
much more efficient than Monte Carlo for a wide variety of applications, including space shielding, accelerator shielding, radiation effects on electronics, and radiation cancer therapy.
1.3.3 Oil-Well Logging Tool Design Oil-well logging describes the measuring of physical characteristics of rock formations surrounding a borehole using various types of instruments [48]. Data acquired by an instrument is recorded as a function of its depth in the borehole, resulting in a scroll-like plot called a log. Several types of logging tools based on electromagnetic, acoustical, mechanical, and nuclear radiation physics exist. Each tool type measures specific properties of rock formations, which provide information on the oil content of the formations. For instance, a nuclear neutron–neutron tool (a neutron source with a neutron detector) measures the porosity of the rock, while a gamma–gamma tool (a gamma-ray source with a gamma-ray detector) measures the density of the rock. Nuclear tools are generally operated with the tool pressed against the side of the borehole, rather than being centered in the borehole; this makes design calculations inherently three-dimensional. Nuclear tools function by emitting radiation from the source in the tool into the rock formation. The source particles, or secondary particles generated by the source particles, are then detected within the tool. (Each nuclear tool has two detectors: one “close” to the source, and one “far” from the source.) Finally, the intensity and energy spectra of the detected radiation are interpreted to yield information about the rock formation surrounding the borehole [48]. Monte Carlo methods have traditionally been used to perform logging tool design calculations because of the inherent 3-D nature of these calculations. Extensive variance reduction techniques must generally be employed because the probability of a source particle reaching a detector can be very small. For instance, the probability that a source particle will reach the far detector in a gamma–gamma tool is roughly 108 . This extremely small value is the consequence of a highly collimated source and a highly collimated detector. Furthermore, statistical errors in design calculations must generally be reduced to a standard relative deviation of one percent or less. The need for extensive variance reduction and very low statistical errors can lead to extremely high CPU times for nuclear tool design calculations. Thus, there is much room for improvement in methods for performing these calculations. There are two roles for SN methods to play in tool design calculations. The first is to use deterministic methods to directly perform design calculations; the second is to use deterministic methods to provide adjoint calculations for automatic variance reduction in Monte Carlo calculations [118]. The properties of nuclear logging tool design calculations that present the most difficulties for SN methods are 3-D geometric complexity and the need for accuracy to within 1%. The inherent 3-D nature of logging tool design calculations put them far beyond the reach of the 1-D and 2-D computational transport technology of 1968. Much of
22
E.W. Larsen and J.E. Morel
the work on nodal spatial discretization schemes in the 1980s was motivated by the high accuracy required for logging tool design calculations. However, most of these nodal methods were developed for rectangular meshes, and the geometric complexity of logging tools can cause the use of such meshes to be highly inefficient. In the late 1980s it became clear that rectangular meshes were inadequate for logging tool design calculation, regardless of the accuracy of the discretization schemes developed for such meshes. Since all of the first production 3-D SN codes were limited to rectangular meshes, and since it was not clear that sufficiently accurate unstructuredmesh SN methods could be developed, most of the research on SN methods for logging tool design ended without success in the early 1990s. This situation changed in the late 1990s with the advent of 3-D unstructured-mesh SN methods. It has recently been demonstrated that 3-D unstructured-mesh SN methods can in fact be successfully applied to oil-well logging tool design calculations. In particular, a special version of the ATTILA code [78] was used to perform calculations for both a neutron–neutron tool and a gamma–gamma tool [89]. No special techniques were required for the neutron–neutron tool, but the highly collimated source and detectors associated with the gamma–gamma tool required the use of a firstcollided source technique (to get the source gamma-rays into the rock formation) and a last-collided source technique (to get the scattered gamma-rays into the highly collimated near and far detectors) in conjunction with the SN method. Monte Carlo calculations for both tools were performed with the MCNP code [72] to provide benchmark results. Each tool required two MCNP calculations: one calculation for the response of the near detector, and one calculation for the response of the far detector. The ATTILA code was also used to generate two adjoint solutions for the gamma–gamma tool (one for the response of each detector). These adjoint solutions were used to generate weight windows for the MCNP calculations. All calculations were performed on an SGI Octane workstation with a 250 MHz R10000 processor. The ATTILA results were excellent for the neutron–neutron tool (errors less than 1%) and very good for the gamma–gamma tool (errors less than 2%). Completely converged solutions could not be obtained for the gamma–gamma tool calculations because of memory limitations. The CPU time for the SN neutron–neutron tool calculation was about 7 h versus about 10 h for the Monte Carlo calculation (which used the best variance reduction techniques available). A general conclusion from these results is that SN methods can now accurately and efficiently perform neutron–neutron tool calculations, but Monte Carlo methods will compete with SN methods for such calculations. This conclusion is not necessarily true for gamma–gamma tool calculations. The CPU time for the SN gamma–gamma tool calculation was about 12 h, while the CPU time for the Monte Carlo calculation would have been about 100 h if the statistical errors had been reduced to the requisite 1%. Furthermore, the adjoint SN solution used to generate weight windows for the Monte Carlo calculation of the far detector response resulted in a factor of 1,000 speedup. It is doubtful that the Monte Carlo calculations could have been performed on a single workstation without the SN adjoint solutions. A general conclusion is that 3-D unstructured-mesh SN methods have the potential to dramatically improve capabilities for gamma–gamma
1
Advances in Discrete-Ordinates Methodology
23
tool calculations [89]. However, to achieve 1% accuracy, the direct use of SN methods will require a large number of energy groups, and hence a large amount of storage. In the near future, this will likely necessitate a parallel 3-D unstructuredmesh capability, because huge memories are only available on massively parallel computers. However, the indirect use of SN methods (to provide weight windows for Monte Carlo) is feasible with workstations, because adjoint solutions do not need to be highly accurate to be effective for variance reduction. Also, highly accurate adjoint solutions may not be cost-effective because the automatic variance reduction techniques available in production Monte Carlo codes do not give a zerovariance solution when the adjoint solution is exact [118]. Monte Carlo methods will not be able to fully utilize SN adjoint solutions until zero-variance (or nearly zero-variance) biasing algorithms are developed.
1.4 Advances in Spatial Discretizations As discussed in Section 1.2, the state of the art in spatial discretizations of the transport equation prior to the 1970s consisted of finite-difference approximations involving the particle balance equation (Eq. (1.28)) and associated weighted-diamond auxiliary equations (Eq. (1.30). These methods were accurate for optically thin cells .†t x 1/, but they generally became inaccurate for problems with spatial cells that were not optically thin. This deficiency led to the consideration of more sophisticated spatial discretization schemes with multiple unknowns per cell. In the most successful of these new methods, the solutions’ increased accuracy and robustness more than compensated for the greater computer arithmetic and storage requirements. In this section, we discuss some of these new methods. To keep our discussion simple, we consider the SN Eq. (1.18) with isotropic scattering and an isotropic inhomogeneous source, n
d
n .x/
dx
.x/ D
C †t
N X
n .x/
D
n0 .x/wn0 ;
1 Πs .x/ C Q.x/ ; 2
(1.51a) (1.51b)
n0 D1
together with a spatial grid fxj C1=2 j 0 j J g and related notation, as described in Section 1.2.
1.4.1 Characteristic Methods Characteristic methods are some of the most successful of the new classes of spatial discretization methods that have been developed since the early 1970s
24
E.W. Larsen and J.E. Morel
[12, 65, 88, 102, 106]. The methods discussed below are often referred to as short characteristics to distinguish them from long characteristic methods typically employed in assembly calculations in core physics applications; see Chapter 4. Long characteristics are based on an integral form of the transport equation, and their solution algorithm usually utilizes a ray-tracing scheme of particle paths throughout the problem geometry. Short characteristic methods have the following features: On each spatial cell, .x/ and Q.x/ are approximated by a low-order polynomial
(usually constant or linear). The leakage-plus-collision operator m d=dx C †t is mathematically inverted.
(In multidimensional problems, this inversion requires integration along a characteristic line of the transport equation; this property gives its name to the method.) The resulting analytic expression for n .x/ is manipulated to yield a polynomial representation, which, when combined with similar results for other directions of flight, yields a new polynomial expression for .x/. The resulting discrete equations are considered to be solved when, for each cell, the original polynomial expression for .x/ in the right side of Eq. (1.51a) equals the polynomial expression described in the previous bullet. For example, if .x/ is represented in the j th cell as a spatial constant – expressed in terms of the cell-average angular fluxes – then Eq. (1.51a) becomes (assuming for simplicity Q D 0) n
d
n .x/
dx
C †t
n .x/
D
†s
j ; xj 1=2 < x < xj C1=2 : 2
For n > 0 (flow from left to right), Eq. (1.52) can be analytically solved for †t .xxj 1=2 /=n .x/ D e n
(1.52) n .x/:
† s †t .xxj 1=2 /=n C 1 e
j : n;j 1=2 2†t (1.53)
Using this expression, the flux exiting the j th cell is n;j C1=2
D e †t xj =n
n;j 1=2
† s C 1 e †t xj =n
j ; 2†t
(1.54)
and the cell-average flux is n;j
D
n 1 e †t xj =n n;j 1=2 †t xj † n s †t xj =n 1e C 1
j : †t xj 2†t
(1.55)
The exiting flux (Eq. (1.54)) is used as the incident flux for the next, i.e., .j C 1/, cell, and the cell-average flux (Eq. (1.55)) is folded into an array that, on completion of the transport sweep in all discrete directions, yields a new estimate for j .
1
Advances in Discrete-Ordinates Methodology
25
The solution is considered to be converged when the new value of j differs from the old value by less than a prespecified convergence criterion for all j . This algorithm, with .x/ represented as a constant in each cell, is the StepCharacteristic (SC) method [12, 25]. For 1-D problems, the SC method can be formulated as a weighted-diamond scheme, i.e., of the form described by Eqs. (1.28) and (1.30). The SC method readily generalizes to multidimensional problems on irregular grids, but in these circumstances it cannot be formulated as a weighteddiamond scheme. The SC method is currently used in several multidimensional production neutron transport codes. In applications of these codes, the spatial grid is optically thin, and accurate solutions are obtained. However, the SC method is not accurate for problems demanding optically thick meshes, e.g., of the type described in Section 1.3. Thus, more complicated characteristic methods have been proposed and implemented, in which the scattering source is represented within each spatial cell as a linear, or even quadratic function of the spatial variables [25]. As can be expected, with each increase in the polynomial order of the representation of .x/: The accuracy of the resulting solution increases. The computational effort required to process the extra algebraic complexity
increases. The computer memory needed to store the extra problem unknowns increases.
1.4.2 Linear Discontinuous Method Among the most flexible and successful of the noncharacteristic methods are the discontinuous finite-element (DFE) methods [18, 70, 98, 105, 109, 116]. The linear discontinuous (LD) method is perhaps the archetypical method in this class. This method is based on representations of n .x/ and .x/ that are linear within each cell, but discontinuous at cell edges. In the LD method, Eq. (1.52) is approximated by n
d
n .x/
dx
C†t
n .x/ D
†s 2 .0/ .1/
j C .x xj / j ; xj 1=2 < x < xj C1=2 ; 2 xj (1.56)
where xj is the center of the j th cell; now the representation of .x/ requires two unknowns per cell, j.0/ and j.1/ . If the operator on the left side of Eq. (1.56) were inverted exactly, as described previously, we would obtain a (linear) characteristic method. However, discontinuous finite-element methods are based on an approximate, rather than an exact, inversion of this operator.
26
E.W. Larsen and J.E. Morel
The LD method employs the following linear-discontinuous representation of n .x/:
n .x/
D
8 ˆ ˆ ˆ <
nj
C
2 xj
ˆ ˆ ˆ :
nj
C
2 xj
.x xj /
n;j C1=2
nj
;
n > 0; xj 1=2 < x xj C1=2 ; .x xj / nj n;j 1=2 ;
(1.57)
n < 0; xj 1=2 x < xj C1=2 :
Equation (1.57) is consistent with the notation that nj is the cell-average flux and .xj C1=2 ; n / is the cell-edge angular flux. We note that at the cell n;j C1=2 D edges, n .x/ is continuous from the left for n > 0 and from the right for n < 0, but is discontinuous otherwise. The unknowns nj and n;j ˙1=2 in Eq. (1.57) and .0/ .1/
j and j in Eq. (1.56) are related by
j.0/ D
N X
nj wn ;
(1.58a)
nD1 .1/
j
D
X
n;j C1=2
nj
wn C
n >0
To obtain equations for
X nj
n;j 1=2
wn : (1.58b)
n <0 nj
and Z
`C1 xj`C1
n;j ˙1=2 ,
xj C1=2
we operate on Eq. (1.56) by
.x xj /` ./dx; ` D 0; 1;
xj 1=2
to obtain, for ` D 0, the conventional balance equation: n xj
n;j C1=2
n;j 1=2
C †t
nj
D
†s .0/
; 2 j
(1.59)
and for ` D 1: n xj
n;j C1=2
C
n;j 1=2
2
nj
2†t C xj2
Z
xj C1=2
.x xj /
n .x/dx
xj 1=2
D
†s .1/
: 6 j
(1.60)
(Here, we have used the previously adopted notation for the cell-edge and cellaverage angular fluxes.) To close these equations, the integral term in Eq. (1.60) must be expressed in terms of nj and n;j ˙1=2 . To do this, we introduce Eq. (1.57) into the integral term and for n > 0 obtain n xj
n;j C1=2
C
n;j 1=2
2
nj
C
†t 3
n;j C1=2
nj
D
†s .1/
: (1.61) 6 j
1
Advances in Discrete-Ordinates Methodology
27
Equations ( 1.59) and ( 1.61) are two linear algebraic equations for nj and n;j ˙1=2 . [For n < 0, the term . n;j C1=2 nj / in Eq. (1.61) is replaced by . n;j n;j 1=2 /.] The resulting LD method can be generalized to multidimensional problems on structured (rectangular or orthogonal) and unstructured (nonorthogonal) spatial grids [97]. Variants of the LD method have also been developed, such as the lumped LD method, which is more robust for optically thick spatial cells but less accurate for optically thin cells, and various corner balance methods [76, 83, 90, 96]. In general, LD-like methods are much more accurate and robust for the difficult physical problems described in Section 1.3 than finite-difference methods. LD methods require greater computer arithmetic and storage than finite-difference methods, but their increased accuracy and robustness usually more than compensates for these disadvantages.
1.4.3 Nodal Methods Another class of spatial differencing techniques that have been developed and widely used in the nuclear reactor community are nodal methods [28–30, 43–45]. In essence, a nodal method approximates a multidimensional transport equation by a coupled system of 1-D transport equations. Discretization techniques that are highly accurate for 1-D can then be utilized. To illustrate, let us consider an .x; y/-geometry version of Eq. (1.51a) on a spatial cell (assuming for simplicity Q D 0): n
@
n .x; y/
C n
@
n .x; y/
C †t
n .x; y/
D
@x @y xi 1=2 < x < xi C1=2 ; yj 1=2 < y < yj C1=2 :
†s
.x; y/; 4 (1.62)
Transversely integrating this equation by the operator < >y;j D
1 yj
Z
yj C1=2
./ dy;
(1.63a)
>y;j ;
(1.63b)
yj 1=2
and defining n;y;j .x/
D<
n .x; y/
we obtain (after moving the transverse derivative to the right side of the equation) †s d
y;j .x/ n;y;j .x/ C †t n;y;j .x/ D dx 4 n n x; yj C1=2 n x; yj 1=2 : yj
n
(1.64)
28
E.W. Larsen and J.E. Morel
Similarly, transverse-integrating Eq. (1.62) by the operator < >x;i D
1 xi
Z
xi C1=2
./dx;
(1.65a)
>x;i ;
(1.65b)
xi 1=2
and defining n;x;i .y/
D<
n .x; y/
we obtain (after moving the transverse derivative to the right side of the equation) n
d dy D
n;x;i
.y/ C †t
n;x;i
†s n
x;i .y/ 4 xi
.y/ n .xi C1=2; y/
n .xi 1=2; y/
:
(1.66)
In the context of the SN equations, Eqs. (1.64) and (1.66) are exact. These are two 1-D first-order transport equations containing the transversely integrated angular fluxes defined in Eqs.( 1.63b) and( 1.65b). Equations (1.64) and (1.66) can be closed by taking n .x; yj ˙1=2 /
D
n;x;i .yj ˙1=2 /;
xi 1=2 < x < xi C1=2 ;
(1.67a)
n .xi ˙1=2 ; y/
D
n;y;j .xi ˙1=2 /;
yj 1=2 < y < yj C1=2 ;
(1.67b)
which yield †s d
y;j .x/ n;y;j .x/ C †t n;y;j .x/ D dx 4 n n;x;i .yj C1=2 / n;x;i .yj 1=2 / ; yj
n
(1.68)
and n
d dy
†s
x;i .y/ 4 n;y;j .xi C1=2 / n;y;j .xi 1=2 / :
n;x;i
n xi
.y/ C †t
n;x;i .y/
D
(1.69)
More accurate approximations can be obtained by calculating higher-order transverse spatial moments of Eq. (1.62) and using these to obtain more accurate closure relations than defined in Eqs. (1.67a) and (1.67b). Nodal methods always consist of coupled 1-D transport equations for each multidimensional spatial cell. These equations can be fully discretized by applying a standard 1-D discretization to each transverse-integrated equation. For example, one can obtain a pseudo-characteristic method by replacing the analytic functions on the right side of each transverse-integrated equation by moment-preserving polynomial fits to those functions, and then inverting the 1-D
1
Advances in Discrete-Ordinates Methodology
29
transport operator on the left side of each transverse-integrated equation. The result is a transport solution for a polynomial source that depends on the solution itself. For instance, assuming a constant spatial dependence for the scattering source on the right side of Eq. (1.68), and inverting the 1-D transport operator on the left side of Eq. (1.68), we obtain the following solution for > 0 and > 0 : n;y;j .x/
D
†t .x xi 1=2 / n †t .x xi 1=2 / 1 exp ; n
n;y;j .xi 1=2 / exp
C
qn;y;j;i †t
(1.70)
where qn;y;j;i D
†s 4 xi
Z
xi C1=2
y;j .x/dx xi 1=2
n yj
n;x;i .yj C1=2 /
n;x;i .yj 1=2 /
:
(1.71)
Following the same procedure for Eq. (1.69), we obtain †t .y yj 1=2 / n;x;i .y/ D n;x;i .yj 1=2 / exp n †t .y yj 1=2 / qn;x;i;j 1 exp ; C †t n
(1.72)
where qn;x;i;j D
†s 4 yj
Z
yj C1=2
x;i .y/ d y yj 1=2
n xi
n;y;j .xi C1=2 /
n;y;j .xi 1=2 /
:
(1.73)
Equation (1.70) is now evaluated at x D xi C1=2 , Eq. (1.72) is evaluated at y D yj C1=2 , and the resulting two equations [together with Eqs. (1.71) and (1.73)] are solved for the outgoing edge fluxes n;x;i .yj C1=2 / and n;y;j .xi C1=2 /. This procedure constitutes the 2-D Constant-Constant Nodal (CCN) method. This method is so-named because the transverse derivative term and the scattering source are approximated as constants in each transverse-integrated equation. The more accurate (but more expensive) 2-D Linear-Linear Nodal (LLN) method has four transverse-integrated equations with linear transverse derivatives and linear scattering sources in each equation. Extending these methods to 3-D is straightforward. Nodal transport (and diffusion) methods have played an extremely important role in the nuclear engineering community during the past 20 years. As discussed in Section 1.3.3 nodal methods (on rectangular cells) were applied to oil-well logging problems in the 1980s but were abandoned for that application because of their lack of suitability to nonorthogonal grids. The applicability of nodal methods to nonorthogonal grids remains a research topic.
30
E.W. Larsen and J.E. Morel
1.4.4 Solution Accuracy in the Thick Diffusion Limit The last topic in this section is not a discretization scheme, but rather a theoretical technique, which, in the past 20 years, has become essential in predicting the accuracy of discretization schemes for diffusive problems with optically thick spatial cells .†t x 1/. Early (finite difference) spatial differencing schemes for the transport equation were experimentally and theoretically understood to be accurate only when spatial cells were optically thin .†t x 1/, and the accuracy of these schemes was generally measured by the order of their truncation error [25]. For example, an nth-order scheme would satisfy k
exact
x k
D O. n /; 1;
where jj jj is a suitable error norm and D †t x. In slab geometry, the DD and SC schemes are second-order, while the LD method is third-order. Analyses to mathematically prove the order of convergence were always carried out in slab geometry; in multidimensional geometries the SN solutions have singular characteristics, across which the solution is not smooth [20], so the truncation error analyses that can be carried out in slab geometry are not applicable. In fact, computer experiments have shown [33] that because of the singular characteristics, the order of convergence of the DD scheme in x,y-geometry depends on the definition of the error norm. Worse yet, the difficult thermal radiation and charged-particle transport problems described in Section 1.3 are so optically thick that it is impossible, because of limits in computer memory, to assign spatial grids for them that are optically thin. However, such calculations are associated with the diffusion and Fokker–Planck limits, respectively, and the spatial scale lengths for the solution associated with these limits are much larger than a mean free path. It is not unreasonable to expect a transport spatial discretization scheme to yield accurate results with optically thick cells if the scale length of the solution is well-resolved by the mesh. Indeed, one would intuitively expect to get accurate results with such mesh resolution. The difficulty is that a truncation error analysis does not provide useful information for these types of problems. Such an analysis tells us only that accurate results will be obtained by using optically thin cells. To determine if accurate results can be obtained with a mesh that is optically thick but resolves the spatial scale length of the solution, it is necessary to perform a discrete asymptotic analysis [49, 113]. Although the system is optically thick in both the diffusion and Fokker–Planck limits, the requirements associated with each limit for spatial differencing schemes are quite different. Accurate and robust spatial discretization schemes are generally required for charged-particle transport, but the highly anisotropic scattering treatment is of primary importance in the Fokker–Planck limit rather than the spatial differencing scheme [113]. In contrast, the spatial discretization is of primary importance in the diffusion limit. We focus on the diffusion limit here.
1
Advances in Discrete-Ordinates Methodology
31
A diffusive problem is optically thick with weak absorption; it is a problem for which the transport solution is well-approximated by the diffusion solution. A spatial discretization of the SN equations is of practical use for diffusive problems if it possesses the optically thick diffusion limit [49, 52, 66, 86, 88, 105]. Such a discretization scheme will yield accurate results for diffusive problems if the spatial mesh cells are thin with respect to a diffusion length (the spatial scale length for the diffusion solution), even if these cells are thick with respect to a mean free path. To describe the diffusion limit, let us consider the monoenergetic planargeometry SN equations n
d
n .x/
dx
C †t
n .x/
D
N †s X 2 0
n0 .x/wn0 C
n D1
Q.x/ ; 1 n N; 2
(1.74)
and their diffusion approximation
d 1 d
.x/ C †a .x/ D Q.x/: dx 3†t dx
(1.75)
Here, we have used the standard notation †a D †t †s D absorption cross section; and
.x/ D
N X
n .x/wn
D scalar flux:
(1.76a)
(1.76b)
nD1
To motivate the subsequent analysis, we multiply the diffusion Eq. (1.75) by a positive constant ": d " d
.x/ C "†a .x/ D "Q.x/: (1.77) dx 3†t dx Clearly, the solution of the diffusion equation is unchanged. This shows that if we define the following scaled cross sections and source, †t ; " †a ! "†a ;
(1.78b)
Q.x/ ! "Q.x/;
(1.78c)
†t !
(1.78a)
which implies † s D † t †a !
†t "†a ; "
(1.78d)
32
E.W. Larsen and J.E. Morel
then the diffusion equation is invariant under this scaling, for any choice of ". However, the SN equations are not invariant; they become n
d
n .x/
dx
C
†t "
1 2
n .x/ D
†t "†a "
Q.x/ ; 2
C"
X N
n0 .x/wn0
n0 D1
1 n N:
(1.79)
Now, one can show that for " 1, the solution of Eqs. (1.79) satisfies n .x/
.x/ C O."/; 2
D
(1.80)
where .x/ satisfies the diffusion Eq. (1.75). To derive this result, we solve Eqs. (1.79) by assuming a solution that, for " 1, depends on " by a simple asymptotic expansion: 1 X .x/ D "i n.i / .x/: (1.81) n i 0
Introducing Eq. (1.81) into Eq. (1.79) and equating the coefficients of different powers of ", we obtain for i 0 the following system of equations: †t
.i / n .x/
!
N 1 X 2 0
.i / 0 n0 .x/wn
n D1
D n .1/
d dx
.i 1/ .x/ n
N †a X 2 0
.i 2/ .x/ wn0 n0
n D1
C ıi;2
Q.x/ ; (1.82) 2
.2/
where n .x/ D n .x/ D 0. We solve this system recursively, by solving the first .i D 0/ equation, then the second .i D 1/ equation, etc. The first .i D 0/ equation is ! N 1 X .0/ .0/ 0 †t D 0: (1.83) n .x/ n0 .x/wn 2 0 n D1
Assuming that the quadrature set satisfies N X
Z wn D
nD1
1
d D 2;
(1.84)
1
Eq. (1.83) has the general isotropic solution .0/ n .x/
D
.0/ .x/ ; 2
where .0/ .x/ is – for now – undetermined.
(1.85)
1
Advances in Discrete-Ordinates Methodology
33
The second .i D 1/ equation is, using Eq. (1.85), .1/ n .x/
†t
N 1 X 2 0
! .1/ 0 n0 .x/wn
D
n D1
n d .0/
.x/: 2 dx
(1.86)
Assuming that the quadrature set satisfies N X
Z n wn D
1
d D 0;
(1.87)
1
nD1
the general solution of Eq. (1.86) is .1/ n .x/
D
n d .0/
.1/ .x/ .x/; 2 2†t dx
(1.88)
where .1/ .x/ is undetermined. The third .i D 2/ equation, using Eqs. (1.85) and (1.86), is X t
.2/ n .x/
N 1 X 2 0
! .2/ 0 n0 .x/ wn
n D1
d D n dx
n d .0/ .x/
.1/ .x/ 2 2†t dx
!
†a .0/ Q.x/
.x/ C : 2 2
(1.89)
Unlike Eqs. (1.83) and (1.86), this third equation does not automatically possess a solution. To see this, we multiply Eq. (1.89) by wn and sum over 1 n N ; assuming that the quadrature set satisfies N X
Z 2n wn D
nD1
1
2 d D 1
2 ; 3
(1.90)
we obtain the solvability condition 0D
d 1 d .0/ .x/ †a .0/ .x/ C Q.x/: dx 3†t dx
(1.91)
If this equation is satisfied, then it can easily be shown that solutions to Eq. (1.89) exist. Equations (1.91), (1.85), and (1.81) confirm the result (1.80). The asymptotic analysis outlined above provides a direct mathematical link between the SN equations (1.74) and the diffusion equation (1.75). This analysis shows that if the cross sections and source in the SN equations are scaled by Eqs. (1.78) with " 1, the diffusion equation (1.75) is obtained. The condition " 1 is
34
E.W. Larsen and J.E. Morel
consistent with the physical understanding of neutron diffusion: the mean free path [ D 1=†t D O."/] is small, the absorption rate [†a D O."/] is small, and the source [Q D O."/] is small – all of these “smallnesses” being balanced so that the resulting angular flux is O(1) and satisfies the diffusion equation. In the thick diffusion limit, two limits occur that have significance for spatial discretizations: 1 1. †t ! O , "
.x/ 2. n (x) ! . 2 Thus, the total cross section becomes unbounded, yet the SN solution limits to an O.1/ diffusion solution. This result applies to the spatially continuous SN equations (no spatial discretization). We now ask: What happens if this same asymptotic analysis is applied to the spatially discretized SN equations? More precisely, let us consider a spatially discrete SN problem posed on a fixed spatial grid. We scale the cross sections and source in this problem exactly as in Eqs. (1.78). For " 1, we seek a solution of this discrete system in the form of Eqs. (1.81), i.e., we expand all unknowns (cell-average fluxes, cell-edge fluxes, etc.) as power series in ", and we solve the resulting hierarchy of equations as described above for the continuous SN equations. What happens to the spatially discrete SN solution in this limit? There are two possible answers to this question. First, because as " ! 0 the SN solution smoothly limits to the diffusion solution, it is plausible to hope that the spatially discrete SN solution will smoothly limit to the solution of a spatially discrete diffusion solution. (Then, if the chosen spatial grid is adequate to resolve the solution of this discrete diffusion problem, the resulting discrete solution will be accurate.) However, because †t D O."1 /, the optical thickness of spatial cells †t x ! 1 as " ! 0. This and the fact that SN solutions generally become inaccurate as †t x increases suggest that spatially discrete SN solutions may not limit to an accurate result as " ! 0. Which of these two possibilities is correct? The answer to this question depends on the chosen spatial discretization scheme. Some schemes are accurate in the thick diffusion limit; others are not. For example, the Step-Characteristic (SC) scheme fails as " ! 0 (the SC solution ! 0). The Diamond-Difference (DD) scheme fails unless all the diffusive regions of the problem have isotropic incident boundary fluxes (in the presence of nonisotropic boundary fluxes, DD solutions become corrupted by unphysical spatial oscillations). LD-like schemes perform successfully in the thick diffusion limit in 1-D geometries. LD methods also perform well in multi-D geometries with triangular (2-D) or tetrahedral (3-D) spatial grids, but they fail in quadrilateral (2-D) or hexahedral (3-D) grids. (However, bilinear-discontinuous methods work well for quadrilateral grids and trilinear-discontinuous methods work well for hexahedral grids.) The thick diffusion limit analysis, which has been applied to these discretization schemes and many others, accurately predicts the performance of approximation schemes in realistic calculations. This analysis has enabled the successful development of spatial discretization methods for problems with optically thick, diffusive
1
Advances in Discrete-Ordinates Methodology
35
systems – in particular, for the thermal radiation transport and charged-particle transport problems discussed in Section 1.3. A reader may ask that if a transport problem is diffusive, then why not solve a simpler diffusion problem instead? The answer is that in many applications, only a part of the physical system is diffusive, and it may not be obvious where this diffusive part is. Also, some energy groups may be diffusive, while others are not. Finally, for time-dependent problems, some regions of space-energy phase space may be diffusive for certain times but not for others. For these reasons, it is generally infeasible to calculate accurate transport solutions by using the diffusion approximation in subregions of phase space where it is accurate. This leads to an important issue that can be discussed only briefly here: the behavior of SN spatial discretization schemes in the presence of unresolved boundary layers. (These are thin volumes, typically only a few mean free paths in width, containing the material boundaries that separate diffusive and nondiffusive subregions of a problem.) Across boundary layers, the flux usually has a rapid spatial variation; if the spatial grid is not sufficiently fine to resolve this fast variation, the boundary layer is said to be unresolved.) Many problems exist in which, due to computer memory limitations, it is not practical to prescribe a spatial grid that adequately resolves all boundary layers. Thus, one is led to the question of whether a given discretization scheme is accurate across an unresolved boundary layer. In particular, if an optically thick, diffusive region is adjacent to a nondiffusive region, can anything be said about the ability of a given discretization scheme to predict the changes in the flux across an unresolved boundary layer between two such regions? The asymptotic thick diffusion limit analysis does make it possible to study unresolved boundary layers; the conclusions so far are that no known differencing scheme is completely adequate to model unresolved boundary layers accurately. For example, LD methods are generally inaccurate in the first cell (containing the boundary layer) within the thick diffusive region, and they incorrectly predict that the flux exiting the diffusive region is isotropic. Generally, to be certain that a discrete solution is accurate, all spatial boundary layers must be adequately resolved by the spatial grid. For charged-particle transport problems, which are optically thick and have highly forward-peaked scattering, a more complicated asymptotic limit exists in which the total cross section †t D O."1 / and the mean scattering cosine 0 D 1 O."/. As " ! 0, the solution of the continuous transport equation limits to the solution of a Fokker–Planck equation (see the discussion in Section 1.3.2). Spaceangle discretization schemes have also been successfully analyzed in this asymptotic limit [113]. Ensuring that the discretized SN equations limit to a valid discretization of the Fokker–Planck equation is primarily related to the treatment of anisotropic scattering rather than the spatial differencing scheme. Nonetheless, the presence of very large and very small eigenvalues in the spectrum of the angular Fokker–Planck operator necessitates the use of accurate and robust spatial differencing schemes in Fokker–Planck calculations. In the thick diffusion and Fokker–Planck problems discussed above, it is generally impossible, given computer memory limitations, to use optically thin spatial
36
E.W. Larsen and J.E. Morel
grids for the entire problem. To successfully simulate these problems, discretization schemes must produce accurate solutions for optically thick spatial grids away from boundary layers; and a theory is needed to justify the use of these schemes for these problems. The discontinuous finite-element schemes (such as LD and its variants) and the asymptotic (thick diffusion and Fokker–Planck) theories were developed to deal with just these practical difficulties.
1.5 Advances in Angular Discretizations Next we discuss (i) advances in SN discretizations for the angular derivative terms that appear in curvilinear coordinates systems and (ii) improvements to the standard SN treatment for highly anisotropic scattering. Perhaps surprisingly, very little has been accomplished during the past 40 years to successfully reduce the classic ray effects in SN simulations [21, 24].
1.5.1 Angular Derivatives The transport equation in curvilinear geometries contains one or more angular derivatives, in addition to spatial derivative terms. The traditional technique for treating the angular derivative term in the 1-D spherical geometry equation, which is representative of the traditional treatment used in essentially all curvilinear geometries, is described in Section 1.2. This technique is characterized by: The use of special ˇ-coefficients to represent the quantity .12 / at each angular
cell edge (see Eq. (1.23a)) The use of the diamond-in-angle relationship to express each cell-average angu-
lar flux in terms of the adjacent cell-edge angular fluxes (see Eq. (1.24)) The use of a starting-direction flux equation to obtain initial values for the angular
flux at D 1 (see Eq. (1.25))
This treatment has a deficiency, known as the discrete-ordinates flux dip, which consists of an erroneous suppression in the flux at the center of a sphere. Although the existence of the flux dip was recognized in the early 1960s, it was not eliminated until the early 1980s. Three features of the original method contributed to the existence of the flux dip: The starting-direction flux equation is a slab-geometry equation, but this was
originally put in the following curvilinear-like form before being spatially discretized [22]:
d 2 r dr D
1=2 N X n0 D1
C 2r
1=2
C †t .r/r 2
r 2 †s .r; 1; n0 /
1=2
n0 .r/wn0
C
r 2Q 2
(1.92)
1
Advances in Discrete-Ordinates Methodology
37
This was thought to make the discretization for the starting-direction flux equation consistent with that of the other directions. However, it actually contributed to truncation errors that enhanced the flux dip. A boundary condition corresponding to specular reflection was used at the center
of the sphere, even though the angular flux at the center of a sphere is rigorously isotropic and equal to the starting-direction flux. This incorrectly allowed the angular flux at r D 0 to be anisotropic. The diamond-in-angle equation is inconsistent with the location of the quadrature cosines within each angular bin. As a result, the diamond-in-angle scheme does not preserve solutions that are linear in . In the late 1970s, it was proposed that the slab-geometry form of the startingdirection flux equation be discretized rather than the curvilinear-like form, and that all of the angular fluxes at the center of the sphere be set equal to the startingdirection flux value [26]. These two steps significantly reduced the severity of the flux dip. In the early 1980s, an angular weighted-diamond equation was proposed that related the angular edge and average fluxes in a manner consistent with the location of the cosine in each angular bin [38]: n .r/
D
n n1=2 wn
nC1=2 .r/
C
nC1=2 n wn
n1=2 .r/:
(1.93)
When all three of these measures were combined, the resulting angular discretization scheme eliminated the flux dip [38]. This scheme has been generalized to 2-D cylindrical geometry [38]. Very few practical improvements beyond the elimination of the flux dip have been made in SN angular derivative treatments. Discontinuous finite-element discretizations might have been expected to have had an impact, but this has not happened, partly because it is difficult to develop a discontinuous angular finiteelement method that is compatible with the standard SN method in multidimensional geometries. It is interesting that discontinuous angular derivative treatments do not require a starting-direction flux. This would appear to be an advantage, but one of the few linear-discontinuous SN angular derivative treatments ever developed for the 1-D spherical geometry equation was found to be less accurate than the weighteddiamond scheme (Eq. (1.93)) for a series of test problems [60]. A reason for this is that the starting-direction flux is computed (by Eq. (1.25)) with greater accuracy than the other directions; hence, significant accuracy is actually lost if the starting-direction flux plays no role in the angular derivative treatment. However, superior accuracy relative to the weighted-diamond scheme was obtained by using a quadratic-continuous approximation in the first angular cell and using a lineardiscontinuous approximation in the remaining angular cells [60]. All of these factors make it challenging to develop advanced SN angular derivative treatments [100].
38
E.W. Larsen and J.E. Morel
1.5.2 Anisotropic Scattering The standard SN treatment for the scattering source, which is based on a Legendre polynomial expansion for the scattering cross section in conjunction with quadrature-generated spherical-harmonic moments of the angular flux, is still the workhorse for modern discrete-ordinates calculations, even though it is not always satisfactory. There are several reasons why it remains in widespread use: Fundamentally different approaches usually require significant processing of raw
cross-section data. Such techniques often have memory requirements that are significantly larger
than those of the standard treatment. The standard technique is often much more accurate than one would expect, even
when highly truncated cross-section expansions are used in a calculation. Next, we describe the standard method, together with an improvement that has had a notable impact on charged-particle calculations [54]. For simplicity, we consider the monoenergetic 1-D slab-geometry scattering source denoted by S : Z S .x; / D
C1 1
1 X 2m C 1 Pm ./Pm .0 /†s;m 2 mD0
!
x; 0 d0 :
(1.94)
We assume that the angular flux is a Legendre series of degree L, .x; / D where
L X 2m C 1 Pm ./ m .x/; 2 mD0
Z
m .x/ D
(1.95)
C1
1
Pm ./ .x; /d:
(1.96)
Substituting Eq. (1.95) into Eq. (1.94) and using the orthogonality of the Legendre polynomials, we find that the scattering source is S .x; / D
L X 2m C 1 Pm ./†s;m m .x/: 2 mD0
(1.97)
Thus, the scattering source generated by an angular flux that is a Legendre series of degree L is itself a Legendre series of degree no higher than L. Furthermore, the only cross-section information appearing in the scattering source is the first L C 1 moments of the scattering cross section. This same result is obtained if a cross-section expansion of degree L is used, rather than an exact expansion of infinite degree. In this case, the convergence of the cross-section expansion is irrelevant. This powerful result is not widely appreciated. An analogous result holds for multidimensional calculations when the angular flux takes the form of a finite
1
Advances in Discrete-Ordinates Methodology
39
spherical-harmonic expansion. These results follow from the fact that the sphericalharmonic functions (which include the Legendre polynomials) are eigenfunctions of the Boltzmann scattering operator. We now discuss how this property impacts SN calculations. For simplicity, we consider the 1-D slab-geometry scattering source. Assuming that an N -point angular quadrature set is used in conjunction with a cross-section expansion of degree N 1, the SN scattering source takes the following form: S
n .x/ D
N 1 X
2m C 1 Pm .n /†s;m m .x/; 2 mD0
where
m .x/ D
N X
Pm .n /
n .x/wn :
(1.98)
(1.99)
nD1
We assume a Gauss–Legendre quadrature set. With N quadrature points, one can uniquely interpolate those points with a polynomial of degree N 1. Furthermore, since an N -point Gauss–Legendre set exactly integrates polynomials of degree 2N 1 [19], the Legendre moments in Eq. (1.99) are exactly the moments of the interpolatory polynomial. Considering our previous results regarding the scattering source for a polynomial angular flux representation, we see that the discrete scattering source values given in Eq. (1.98) are exactly those of the scattering source generated with the polynomial interpolation for the angular flux. Thus, if the true angular flux is well-represented by the polynomial interpolation of the discrete angular flux values, the true scattering source will similarly be well-represented by the polynomial interpolation of the discrete scattering source values. We again stress that this is true regardless of the convergence of the cross-section expansion. This property does not guarantee positive discrete scattering source values, given positive discrete angular flux values, because the polynomial interpolation of the discrete angular fluxes can be negative at some points, even though the discrete values themselves are positive. However, since polynomial interpolation at the Gauss points is known to be stable, any negativities in the angular flux interpolation will be small relative to the maximum discrete angular flux value. Therefore, any negativities in the discrete scattering source values will also be small relative to the maximum discrete scattering source value. Hence, accurate SN solutions for angle-integrated quantities can be obtained in a wide variety of problems in 1-D slab geometry with highly anisotropic scattering using Gauss–Legendre quadrature, even if the scattering cross-section expansion is highly truncated. If a Gauss–Legendre quadrature set is not used, some of the scattering source moments of the interpolatory polynomial will be properly computed, but others will not, depending on the accuracy of the quadrature set. It can be seen from Eq. (1.98) that the mth moment of the scattering source is just the product of the mth moment of the scattering cross section and the mth moment of the angular flux. Thus, any flux moment that is erroneous yields a corresponding scattering source moment that
40
E.W. Larsen and J.E. Morel
is erroneous. This deficiency can be treated by generating a separate set of quadrature weights for each moment. In particular, for each 0 m N 1, one can generate N weights, fwm;n gN nD1 that are defined by the N linear equations N X
Pm .n /Pj .n /wm;n D
nD1
2 ımj ; 1 j N : 2m C 1
(1.100)
Pm .n /
(1.101)
Then Eq. (1.99) is replaced by
m .x/ D
N X
n .x/wn :
nD1
This method gives the desirable properties of Gauss quadrature to non-Gauss quadrature for the purpose of calculating the scattering source. (However, there is no guarantee that the weights generated in this way will be positive.) This is one variant of a more general technique known as Galerkin quadrature [54]. To present the more general method, we reexpress the standard SN technique for calculating the scattering source in terms of matrix algebra. In particular, we write Eqs. (1.98) and (1.99) as follows: SE D M†D E ;
(1.102)
where E is the vector of discrete angular flux values: E .
1;
2; : : : ;
N/
T
;
(1.103)
D is the N N matrix, Dm;n Pm .n / wn ;
(1.104)
† is the N N diagonal matrix: † diag.†0 ; †1 ; †2 ; : : :/;
(1.105)
and M is the N N matrix: Mn;m
2m C 1 Pm .n /: 2
(1.106)
The discrete-to-moment matrix D maps a vector of discrete angular flux values to a corresponding vector of Legendre flux moments. We note from Eq. (1.104) that the first row of this matrix consists of the standard quadrature weights, because P0 ./ D 1. The matrix † is the scattering matrix in the Legendre basis, or equivalently, the scattering matrix for the PN 1 approximation. It maps a vector of Legendre flux moments to a corresponding vector of Legendre scattering source
1
Advances in Discrete-Ordinates Methodology
41
moments. The moment-to-discrete matrix M maps a vector of Legendre scattering source moments to a corresponding vector of discrete scattering source values. Using the orthogonal property of the Legendre polynomials, one can show that with Gauss quadrature, M D D1 , DM D
N X kD1
Di;k Mk;j D
N X kD1
Pi .k /
2j C 1 Pj .k /wk D ıi;j : 2
(1.107)
Thus, using Eq. (1.107), we can reexpress Eq. (1.102) as follows: SE D D1 †D E :
(1.108)
Equation (1.108) shows that the SN scattering matrix represents a similarity transformation of the Legendre scattering matrix, †. This means that the standard SN scattering source with Gauss quadrature (and a Legendre cross-section expansion of degree N 1) is equivalent to the scattering source of the PN 1 approximation. This is to be expected, considering the well-known equivalence between the SN and PN approximations in 1-D slab geometry [71]. If Gauss quadrature is not used, then M ¤ D1 , which is an undesirable result. The matrix D maps a vector of N discrete function values to N Legendre moments, and the matrix M maps a vector of N Legendre moments to N discrete function values. One can uniquely define a polynomial of degree N 1 either in terms of N Legendre moments or in terms of N discrete function values at N distinct points. Therefore, D and M should be inverses of one another. The moment-dependent weights defined in Eq. (1.100) ensure that this will be the case. We note that it is not necessary to actually generate the moment-dependent weights; one can directly obtain the correct matrix D simply by calculating the inverse of M. This Galerkin quadrature method is useful for 1-D calculations when quadratures with special directions are desired. For example, Lobatto and double Radau quadrature sets, which have quadrature points at D ˙1, are particularly useful for simulating a normally incident plane-wave of radiation [54]. In 2-D and 3-D, the Galerkin quadrature method is based on spherical-harmonic interpolation of the discrete angular fluxes rather than polynomial interpolation. Choosing the correct spherical harmonics for interpolation is more complicated in multidimensions because the number of spherical-harmonic functions of order N 1 does not equal the number of discrete directions in a multidimensional SN quadrature set. Nonetheless, suitable interpolation functions have been defined for triangular quadrature sets [54]. The Galerkin quadrature method in 2-D and 3-D can be much more accurate than the standard quadrature method with highly anisotropic scattering because there is no analog of Gauss quadrature in 2-D and 3-D, i.e., there is no 2-D or 3-D quadrature set that will exactly calculate all of the sphericalharmonic moments of the interpolated angular flux. In fact, fewer than half of the moments are exactly calculated with typical sets, e.g., even-moment symmetric sets [14], etc.
42
E.W. Larsen and J.E. Morel
The Galerkin quadrature method can also accommodate nonpolynomial or nonspherical-harmonic interpolation functions [54]. To demonstrate this in 1-D, we consider a general interpolatory basis set for a given set of N discrete directions: N X
.x; / D
n .x/Bn ./;
(1.109)
nD1
where Bi .j / D ıij :
(1.110)
Multiplying Eq. (1.109) by Pm ./ and integrating over all directions, we obtain
m .x/ D
N X
Z n .x/
C1 1
nD1
Pm ./Bn ./d :
(1.111)
It follows from the definition of the discrete-to-moment matrix M and Eq. (1.110) that the components of D are Z Dm;n D
C1
1
Pm ./Bn ./d:
(1.112)
Equation (1.112) is valid for all types of interpolation functions, including polynomials. We note that the first row of the discrete-to-moment matrix consists of standard quadrature weights that are exact for integrating the interpolated angular flux: Z C1 N X
.x/ D .x; /d D (1.113) n wn ; 1
where
nD1
Z wn D
C1 1
Bn ./d:
(1.114)
These are called the companion quadrature weights. Nonpolynomial interpolation requires much more computational effort to generate the discrete-to-moment matrix, because the interpolatory basis functions must be explicitly formed and their products with the Legendre polynomials must be integrated. Also, one must invert the discrete-to-moment matrix to obtain the moment-to-discrete matrix, because the standard SN expression for the moment-to-discrete matrix, Eq. (1.106), is only correct for polynomial interpolation. We refer to the scattering source obtained by operating on the interpolated angular flux with the exact scattering kernel as the exact interpolation-generated scattering source. When the interpolation functions are nonpolynomial, the exact interpolation-generated scattering source is generally not expressible in terms of the interpolation functions. Thus, if the discrete scattering source values obtained from the Galerkin quadrature method are interpolated, one generally does not obtain
1
Advances in Discrete-Ordinates Methodology
43
the exact interpolation-generated scattering source. Rather, one obtains a scattering source that has the same Legendre moments of degree 0 through N 1 as the exact interpolation-generated scattering source [54]. As an example of a useful nonpolynomial interpolation scheme, we consider a linear-discontinuous angular trial space in 1-D spherical geometry. Such a trial space is fully compatible with a linear-discontinuous treatment for the angular derivative term [60]. An “SN ” trial space of this type is defined to consist of N=2 equalwidth piecewise-linear segments in , where N is even and N > 2. There are two discrete angular flux unknowns per segment located p at the local Gauss S2 quadrature points, i.e., the points corresponding to ˙1= 3 obtained by linearly mapping Œ1; C1 onto each segment. A Galerkin quadrature set is generated for this trial space by exactly evaluating the Legendre angular flux moments of degree 0 through N 1 associated with the linear-discontinuous interpolation of the N discrete flux values [60]. The companion quadrature set corresponding to the Galerkin set, i.e., the standard quadrature set having the same quadrature points as the Galerkin set with quadrature weights that exactly integrate the interpolated angular flux representation, corresponds to a local Gauss S2 set on each linear segment. Since each local Gauss set exactly integrates cubic polynomials, it follows that the companion set will exactly evaluate the zeroth, first, and second Legendre moments of the interpolated angular flux. However, all higher flux moments will be inexactly evaluated, regardless of the quadrature order N . This is in contrast to the Galerkin quadrature set of order N , which always exactly evaluates the Legendre angular flux moments of degree 0 through N 1. Furthermore, because the companion quadrature set never exactly integrates polynomials of degree greater than 3, one cannot use a Legendre cross-section expansion of degree greater than 3 with the companion quadrature set (otherwise particle conservation will be lost). Thus, the accuracy of the scattering source with highly anisotropic scattering can be greatly improved for linear-discontinuous angular trial spaces in 1-D by using Galerkin quadrature. This enables one to use a linear-discontinuous approximation for the angular derivative term in 1-D spherical geometry in conjunction with an accurate treatment for highly anisotropic scattering. Perhaps the most important property of the Galerkin quadrature method, independent of the type of functions used to interpolate the discrete angular flux values, is that straight-ahead delta-function scattering is exactly treated. This has a very strong impact on charged-particle calculations, because it enables the total scattering cross section to be dramatically reduced (with an attendant decrease in the scattering ratio) while leaving the SN solution invariant. To demonstrate how straight-ahead scattering is exactly treated, let us consider the following differential scattering cross section †s .0 / D ˛ı.0 1/; (1.115) where ˛ is an arbitrary constant. The Boltzmann scattering operator associated with this cross section is ˛ times the identity operator: Z S
D
C1 1
˛ı.0 1/
0 0 d D ˛ ./:
(1.116)
44
E.W. Larsen and J.E. Morel
Furthermore, the Legendre moments of this cross section are all equal to alpha: Z †m D ˛
C1 1
ı.0 1/Pm 0 d0 D ˛Pm .1/ D ˛; 0 m 1:
(1.117)
Thus, the diagonal matrix of cross-section moments used to construct the vector of discrete scattering source values is ˛ times the identity matrix: † D ˛I:
(1.118)
Substituting from Eq. (1.118) into Eq. (1.108), and recognizing that M D D1 , we obtain SE E D M˛ID E D ˛MD E D ˛ E ; (1.119) which agrees with Eq. (1.116). We have explicitly considered only the 1-D case, but this result also applies in multidimensions. For charged particles, the scattering ratio for each group is generally very close to unity, and the mean free path is very small; nonetheless, the transport process is not diffusive. This is because the “transport-corrected” scattering ratio, .†0 †1 /=†t , is not close to unity. Within-group straight-ahead scattering is equivalent to no scattering at all, since the particle scatters into the same group and direction it had before the scattering. Thus, one can add or subtract a straight-ahead differential scattering cross section from any physically correct within-group cross section without changing the analytic transport solution. Since all Galerkin quadratures treat straight-ahead scattering exactly, one can subtract the truncated expansion for a within-group straight-ahead scattering cross section from the physically correct cross-section expansion without changing the SN solution. For instance, let us consider the total Boltzmann scattering operator (outscatter minus inscatter) associated with a 1-D SN Galerkin quadrature: †0 E SE D ŒM†0 D M†D E D MŒ†s †D E D MŒdiag.†0 †0 ; †0 †1 ; : : : †0 †N 1 /D E : (1.120) Subtracting the delta-function cross section given in Eq. (1.115) from the physically correct cross section, we obtain the following modified outscatter matrix: †0 D .†0 ˛I/;
(1.121)
and the following modified inscatter matrix
where
.M†D/ D M† D;
(1.122)
† D diag.†0 ˛; †1 ˛; : : : ; †N 1 ˛/:
(1.123)
1
Advances in Discrete-Ordinates Methodology
45
We note that while the outscatter and inscatter matrices are modified by subtraction of the straight-ahead scattering cross section, the total Boltzmann matrix, Eq. (1.120), does not change, i.e., †0 M† D D †0 M†D:
(1.124)
Thus, the SN solution does not change. However, the convergence properties of the source iteration process can be dramatically changed. A discussion of the optimal choice of ˛ is beyond the scope of this review, but the traditional choice (which is nearly optimal) is to set ˛ D †N . This extended transport correction can greatly reduce both the total scattering cross section and the scattering ratio in relativistic charged-particle transport calculations [9, 27]. We note that the significance of this cross-section modification depends on the convergence of the cross-section expansion. If the expansion is essentially converged, †N 1 will be very small relative to †0 , resulting in a negligible reduction in †0 ; and if the cross-section expansion is highly truncated, †N 1 will be comparable to †0 , resulting in a significant reduction in †0 . Acceptable computational efficiency often cannot be achieved without the use of the extended transport correction in charged-particle calculations. Thus, with Galerkin quadrature, the extended transport correction (correctly) leaves the SN solution invariant. This is a powerful motivation for using the Galerkin method in charged-particle calculations.
1.6 Advances in Fokker–Planck Discretizations Next, we discuss advances in Fokker–Planck angle and energy discretizations for charged-particle transport. We first consider the continuous-scattering operator, and then the continuous-slowing-down operator.
1.6.1 The Continuous-Scattering Operator The continuous-scattering operator in 1-D slab geometry is @ †r;t r @ 2 1 .x; ; E/: .x; ; E/ D 2 @ @
(1.125)
Taking the zeroth and first angular moments of Eq. (1.125), we obtain Z
C1 1
.x; / d D 0
(1.126)
46
E.W. Larsen and J.E. Morel
and
Z
C1 1
.x; /d D †r;t r J.x/;
(1.127)
respectively, where J.x/ is the current Z J.x/ D
C1
.x; / d:
(1.128)
1
It is highly desirable for a numerical approximation to the continuous-scattering operator to preserve both the zeroth and first angular moments of that operator. Also, since the continuous-scattering operator is a diffusion operator on the unit sphere [see Section 1.3.2], it is highly desirable that the discretization for this operator yield a coefficient matrix that is symmetric and monotone. These two properties ensure that the matrix (like the analytic operator) will have only positive real eigenvalues and will yield positive solutions given positive sources. A straightforward discretization of Eq. (1.125) is †r;t r 1 nC1 n n n1 2 2 . /n D 1 nC1=2 ; 1 n1=2 2 wn nC1 n n n1 (1.129) where nC1=2 D n1=2 C wn ; 1 n N; 1=2 D 1:
(1.130)
This discretization results in a symmetric and monotone coefficient matrix and preserves Eq. (1.126) under numerical integration, but it preserves Eq. (1.127) only if each quadrature point lies at the center of its associated angular interval. (As previously noted, this never occurs with standard quadrature sets.) A discretization that does preserve Eq. (1.127) with standard quadrature sets is [40] †r;t r 1 . /n D 2 wn
ˇnC1=2
n n n1 ˇn1=2 nC1 n n n1 nC1
;
(1.131)
where the ˇ-coefficients are defined by Eq. (1.23b) and all else remains as previously defined. Thus the ˇ-coefficients used to admit the constant solution in the discretization of the angular derivative term in the spherical geometry transport equation are also used in the discretization of the continuous-scattering operator to preserve Eq. (1.127). This moment-preserving approach has been extended to multidimensions for product quadratures [120]. For instance, in three dimensions, the continuousscattering operator is
†r;t r D 2
1 @2 @ 2 @ .1 / C : @ @ 1 2 @! 2
(1.132)
1
Advances in Discrete-Ordinates Methodology
47
Taking the zeroth and first angular moments of Eq. (1.132), we obtain Z
2
Z
C1
dd! D 0;
and
Z
2
Z
C1
dd! D †r;t r J ;
1
0
(1.133)
1
0
(1.134)
respectively, where J is the current Z
2
Z
C1
J D
0
dd!:
(1.135)
1
Standard triangular SN quadrature sets do not represent a rectangular angular mesh on the unit sphere, but product sets do. Hence, it is reasonably straightforward to derive a discretization for the continuous-scattering operator assuming a product quadrature set. An SN product quadrature set has 2N 2 directions and is formed by the tensor product of an N -point quadrature defined over the polar cosine and a 2N point quadrature defined over the azimuthal angle. Each direction can be uniquely referenced in terms of a polar index n and an azimuthal index j . A momentpreserving discretization for the 3-D continuous-scattering operator is 2 . /n;j D
†r;t r 6 4 2
1 p wn
ˇnC1=2
n 1 C 1 2 wa n j
nC1;j
ˇn1=2
n;j
nC1 n
n;j C1
n;j
!j C1 !j
n;j
n1;j
n n1
n;j
n;j 1
3 7 5:
!j !j 1
(1.136) p
Here, wn and waj are weights associated with the polar and azimuthal quadratures that sum to 2 and 2 , respectively, the ˇ-coefficients are identical to those defined for the 1-D case, and 2 K n ; 1 n 2N; 2N 1 cos N p Kn D 2.1 2n / C cn 1 2n; n D
ˇnC1=2 dnC1=2 ˇn1=2 dn1=2 ; p wn p p 1 2nC1 1 2n D : nC1 n
cn D dnC1=2
(1.137) (1.138) (1.139) (1.140)
48
E.W. Larsen and J.E. Morel
The above discretization is defined only for product quadrature sets constructed with azimuthal quadrature sets of the Chebychev type: 2j 1 ; 1 j 2N; N ; 1 j 2N: waj D N !j D
(1.141) (1.142)
This discretization has a 5-point stencil, and is symmetric positive-definite (SPD) and monotone. It preserves Eqs. (1.133) and (1.134). The restriction to Chebychev azimuthal quadrature arises from the fact that three first-moment equations must be met, but the ˇ-coefficients and the coefficients can only be defined to meet two of them. The ˇ-coefficients are defined to preserve the moment equation associated with the polar cosine, i.e., cos , and for a general quadrature set, the -coefficients can preserve one of the two moment equations associated with the cosines that depend on the azimuthal angle, i.e., sin cos! or sin sin!. However, when a Chebychev azimuthal quadrature set is used, the -coefficients can be defined to preserve both azimuthal cosines. An alternative to a finite-difference representation for the continuous-scattering operator is a Legendre moment representation. Because the total Boltzmann scattering operator (outscatter minus inscatter) and the continuous-scattering operator have the same eigenfunctions, one can define effective cross-section moments to represent the continuous-scattering operator [31]. In particular, the mth eigenvalue of the continuous-scattering operator is c;m D †r;t r
m.m C 1/ ; 2
(1.143)
while the mth eigenvalue of the total Boltzmann scattering operator is b;m D †0 †m :
(1.144)
Without loss of generality, we assume that a 1-D SN calculation is performed with Galerkin quadrature. In this case, an effective cross-section expansion of degree N 1 is required. The first step in defining the effective cross-section moments is to equate the eigenvalues defined by Eqs. (1.143) and (1.144): †e0 †em D †r;t r
m.m C 1/ ; 0 m N 1: 2
(1.145)
This step does not uniquely define the effective cross-section moments, but rather leaves †0 a free parameter. The only consideration for choosing †0 is to minimize the effective scattering ratio. In analogy with the choice of ˛ in the extended transport correction,†0 is defined so that the last moment in the expansion is zero: †e0 D †r;t r
.N 1/N : 2
(1.146)
1
Advances in Discrete-Ordinates Methodology
49
Substituting from Eq. (1.146) into Eq. (1.145), we obtain an expression for the remaining effective moments: †em D †r;t r
.N 1/N m.m C 1/ ; 1 m N 1: 2
(1.147)
When used in conjunction with Galerkin quadrature, the number of eigenvalues preserved is always equal to the number of discrete directions. This is to be contrasted with finite-difference approximations that only preserve the zeroth and first moments. Thus, the moment representation can be considered to be more accurate than the finite-difference representations, but the coefficient matrix for the moment representation is not monotone. Thus the moment representation is less robust than the finite-difference representation.
1.6.2 The Continuous-Slowing-Down Operator We next consider the continuous-slowing down operator: C .x; ; E/ D
@ˇ .x; ; E/ : @E
(1.148)
Discretizations of this operator have advanced from a multigroup or step-like treatment [31] through a diamond treatment [41] to a linear-discontinuous finite-element treatment [47]. Because standard SN codes were not originally intended to solve the charged-particle transport problems, early efforts in treating the continuousslowing-down operator were spent defining effective cross sections to implement various discretization schemes via the standard SN scattering source representation [31, 40, 47]. Modern codes that were designed to solve the charged-particle transport equation use a linear-discontinuous finite-element discretization in space, but treat the energy derivative similar to the spatial derivatives. Thus, this operator is inverted via a space-energy sweep [101]. Self-adjoint codes must still treat the term as a scattering source, and invert it via source iteration [112]. Because the spectral radius associated with iterations on the continuous-slowing down term can be very close to unity, these iterations must be accelerated. A synthetic acceleration technique, based on the diamond-difference approximation as the low-order operator, has been used for this purpose [47]. Although the pure Fokker–Planck equation can be solved, most charged-particle calculations are carried out with the Boltzmann–Fokker–Planck equation [37]. In this case, the Boltzmann scattering operator is treated with the standard multigroup approximation. The resulting hybrid multigroup/linear-discontinuous operator is formally treated as a linear-discontinuous operator. One simply takes the scattering kernel to be piecewise-constant in energy; equivalently, one takes all energy slopes associated with the scattering kernel to be zero.
50
E.W. Larsen and J.E. Morel
For instance, let us assume that the angular flux within group g has the following linear-discontinuous dependence: .E/ D where
a;g
a;g
C
e;g
2 E Eg ; EgC1=2 E < Eg1=2 ; Eg
is the group average flux:
a;g
e;g
(1.149)
D
1 Eg
Z
Eg1=2
.E/ dE;
(1.150)
EgC1=2
is the group energy slope:
e;g
D
6 Eg2
Z
Eg1=2
E Eg .E/ dE;
(1.151)
EgC1=2
and Eg D Eg1=2 EgC1=2 is the group width for group g. We note from Eq. (1.149) that the angular flux at the interface energy between two groups is defined by the solution in the higher energy group. Since the continuous-slowing-down operator causes particles to lose energy, this choice is consistent with the direction of particle flow in energy. Under the assumptions of a Legendre expansion of degree L and 0 energy slopes for the multigroup scattering kernel, and a constant dependence of the restricted stopping power within each group, the discretized 1-D transport equation takes the following form for group g:
@
a;g
@x
C †t;g
a;g
D
L G X X 2m C 1 m Eg 0 †g 0 !g
a;m;g 0 Pm ./ C Qa;g 2 Eg 0 mD1
g D1
1 ˇr;g1 . a;g1 e;g1 / ˇr;g . a;g e;g / ; C Eg 3 @ e;g C †t;g e;g D Qe;g C ˇr;g1 a;g1 e;g1 @x Eg 2ˇr;g a;g C ˇr;g a;g
(1.152a)
e;g
:
(1.152b) Here, 'a;m;g denotes the group average Legendre flux moment of degree m for group g, Qa;g and Qe;g respectively denote the group average source and group source energy slope for group g, and †m g 0 !g is the standard multigroup-Legendre coefficient of degree m for a transfer from group g0 to group g: Z Eg1=2 Z Eg0 1=2 Z C1 1 †m D †s E 0 ! E; 0 Pm .0 /d0 dE 0 dE: g 0 !g Eg 0 EgC1=2 Eg0 C1=2 1 (1.153)
1
Advances in Discrete-Ordinates Methodology
51
Equations (1.152a) and (1.152b) are solved via source iteration, but the continuousslowing-down operator is inverted during the sweep. In particular, the source iteration process takes the form
@
.`C1/ a;g
.`C1/ C †t;g a;g @x 1 h .`C1/ ˇr;g1 a;g1 Eg
D Qa;g C C @
.`C1/ e;g
@x
ˇr;g
.`C1/ a;g
.`C1/ e;g
i
L X 2m C 1 m .`/ †g!g a;m;g Pm ./ 2 mD1
G X g 0 DgC1
.`C1/ e;g1
C †t;g 2ˇr;g
L X 2m C 1 m Eg 0 .`C1/ †g 0 !g
0 Pm ./; 2 Eg a;m;g mD1
3 h ˇr;g1 Eg .`C1/ .`C1/ Cˇ r;g a;g a;g
.`C1/ e;g
.`C1/ a;g1
i
.`C1/ e;g
.`C1/ e;g1
(1.154a)
D Qe;g ; (1.154b)
where ` is the iteration index. If the full linear-discontinuous treatment for the scattering source were used, one would have nonzero scattering source energy slopes. In this case, one would iterate on both the scattering source averages and energy slopes. If the scattering ratio for a given group is sufficiently large to require convergence acceleration, the scattering source energy slopes could require acceleration in addition to the scattering source averages. Accelerating the source energy slopes significantly complicates the acceleration process. (We will address this point again, regarding the convergence acceleration of the temporal scattering source slopes associated with a linear-discontinuous discretization of the time derivative.) When combining the linear-discontinuous energy approximation with discontinuous finite-element approximations in space, one generally assumes a single energy slope per spatial cell rather than a separate energy slope for each spatial unknown within a cell. Although the latter assumption is more accurate, it can be excessively expensive. For example, if a trilinear-discontinuous spatial approximation is used for a 3-D rectangular cell, one gets eight spatial unknowns per cell per angle per group. If a separate energy slope is used for each spatial unknown, the number of unknowns per cell per angle per group increases to 16; but if only a single energy slope is used for the entire spatial cell, the number of unknowns only increases to nine. The linear-discontinuous discretization of the continuous-slowing-down operator represents a major improvement relative to step and diamond-difference discretizations [47]. In particular, the linear-discontinuous method is much less numerically diffusive than the step method and much less oscillatory than the diamond method. Nodal methods can also be applied to the continuous-slowing down operator. One would expect such methods to be comparable to discontinuous finite-element methods. However, because they have rarely been used in practice, we will not explicitly discuss nodal methods here.
52
E.W. Larsen and J.E. Morel
1.7 Advances in Time Discretizations Next, we discuss advanced discretization techniques for the time derivative. As is the case for most of the derivatives terms in the Boltzmann equation, the time derivative has been treated with the discontinuous finite-element method [91,98] and the nodal method [59]. The linear-discontinuous method assumes an angular flux dependence of the following form over the kth time step: .t/ D where
k a
C
k a
k t
2 k t t ; t k1=2 < t t kC1=2 ; t k
is the average flux: k a
k t
(1.155)
D
1 t k
Z
t kC1=2
.t/dt ;
(1.156)
t tk .t/dt ;
(1.157)
t k1=2
is the temporal slope: k t
6 D .t k /2
Z
t kC1=2 t k1=2
t k D .t k1= 2 C t k1= 2 / = 2 is the midpoint of the time step, and t k D .t kC1= 2 t k1= 2 / is the width of the time step. We note from Eq. (1.155) that the angular flux at the interface between two time steps is defined by the solution from the previous time step. For simplicity, let us consider the 1-D time-dependent slab-geometry monoenergetic transport equation with isotropic scattering and an isotropic inhomogeneous source: 1@ @ Q †s C C †t D
C : (1.158) v @t @x 2 2 We obtain the following equations after applying the linear-discontinuous finiteelement approximation in time to Eq. (1.158): 1 h vt k
k a
C
k t
3 h vt k
k a
C
k t
D
†s k
C Qtk ; 2 t
2
k1 a
k a
C
C
k1 t
k1 a
i
C
C
k1 t
@ k C †t @x i
C
k
D
†s k
C Qak ; 2 (1.159a)
@ tk C †t;g @x
k t
(1.159b)
1
Advances in Discrete-Ordinates Methodology
53
where Qak and Qtk respectively denote the source temporal average and source temporal slope for time step k. Equations (1.159a) and (1.159b) can be simultaneously solved via source iteration: i 1 h k;.`C1/ k;.`C1/ k1 k1 C C t a a t vt k k;.`C1/ @ a † s k;.`/ C †t ak;.`C1/ D
C C Qak ; (1.160a) @x 2 a i 3 h k;.`C1/ k;.`C1/ k;.`C1/ k1 k1 2 C C C t a a a t vt k k;.`C1/ @ †s k;.`/ C †t;g tk;.`C1/ D
C t C Qtk ; (1.160b) @x 2 t where ` is the iteration index. We note that one must iterate on both the temporal averages and the temporal slopes of the scattering source. If the scattering ratio is close to unity, the source iterations for both the averages and slopes must be accelerated. Deriving fully consistent diffusion acceleration equations from Eqs. (1.160a) and (1.160b) yields a complicated and difficult-to-solve system of coupled diffusion equations. If one uses step or diamond differencing in time, the diffusion-synthetic acceleration algorithm requires the solution of only one diffusion equation and is essentially identical to the algorithm for steady-state calculations. An approximate method has been developed in which the fully coupled system of diffusion acceleration equations associated with the linear-discontinuous temporal discretization scheme is replaced by two independent diffusion equations [98]. This approximate method appears to work quite well, resulting in a cost increase for performing DSA of about a factor of 2 relative to that associated with traditional temporal differencing schemes. While the linear-discontinuous finite-element approximation in time is more accurate than the step scheme and more robust than the diamond scheme, it is also more expensive. As with the continuous-slowing down operator, when one combines the linear-discontinuous temporal approximation with discontinuous finite-element approximations in space, one generally assumes a single temporal slope per spatial cell rather than a separate temporal slope for each spatial unknown within a cell. Although the latter assumption is more accurate, it can be excessively expensive. As we noted before, if a trilinear-discontinuous spatial approximation is used for a 3-D rectangular cell, one gets eight spatial unknowns per cell per angle per group. If a separate temporal slope is used for each spatial unknown, the number of unknowns per cell per angle per group increases to 16; but if only a single temporal slope for the entire spatial cell is used, the number of unknowns only increases to nine. In analogy with the derivation of Eqs. (1.70) and (1.72), we apply the constantconstant nodal method to Eq. (1.158) to obtain the following equations for > 0 (assuming for simplicity Q D 0): h i k1=2 k1=2 t exp † .t/ D v t t n;x;i n;x;i t h io qn;x;i;k n C 1 exp †t v .t t k1=2 ; (1.161) †t
54
E.W. Larsen and J.E. Morel
where qn;x;i;k D
†s 4 t k
Z
t kC1=2 t k1=2
and n;t;k .x/ D
where †s qn;t;k;i D 4 xi
Z
n xi
n;t;k
xi C1=2
n;t;k .xi 1=2 /
t;k .x/ dx
;
(1.162)
†t .x xi 1=2 / .x / exp n;t;k x1=2 n †t .x xi 1=2 / qn;t;k;i 1 exp ; C †t n
xi C1=2 xi 1=2
x;i .t/ dt
1 h vt k
n;x;i
t kC1=2
n;x;i
(1.163)
i t k1=2 : (1.164)
The considerations for applying nodal methods in time are analogous to those for applying discontinuous finite-element methods. For instance, with a linear nodal method, one must be concerned with accelerating the temporal slopes of the scattering source. With a linear nodal method in both time and space [59], there would be only one temporal slope per space cell, but if one were to apply a nodal method in time in conjunction with another type of spatial discretization, multiple temporal slopes per space cell could arise. The practical need for advanced temporal discretization schemes relative to traditional discretization schemes is not as strong for the time variable as for the space and energy variables. This is due to the relative ease with which adaptive techniques can be applied to time integration, making it feasible to avoid the regimes in which simple discretization schemes perform poorly. In any event, the transport community has little experience with advanced temporal discretization schemes, and little research has been performed in this area.
1.8 Advances in Iteration Acceleration Next, we discuss major advances in iteration acceleration. A plethora of SN iterative acceleration techniques have been developed over the years (we refer the reader to the recent comprehensive review by Adams and Larsen [110]), but there is little doubt that the practical application of diffusion-synthetic acceleration (DSA) to source iteration has been the most significant advance in iteration acceleration techniques in the history of discrete-ordinates methods. Early attempts to utilize DSA were marred by successful performance only for problems with optically thin spatial grids [16]. Later, the subtleties concerning how these methods should be discretized became understood. To motivate the DSA and DSA-like methods, we first discuss the Fourier analysis technique, which has become an invaluable theoretical tool for predicting the convergence rate of iterative solutions of continuous and discrete problems.
1
Advances in Discrete-Ordinates Methodology
55
1.8.1 Fourier Analysis The Source Iteration (SI) method is described in Section 1.2; see Eqs. (1.31) and (1.32). For a model infinite, homogeneous-medium transport problem with no discretization, @ .x; / 1 C †t .x; / D Œ†s .x/ C Q.x/; @x 2 Z 1 x; 0 d0 ;
.x/ D
(1.165a) (1.165b)
1
the SI process begins with an initial guess .0/ .x/ of the scalar flux, and then for ` 1, the `th source iteration is defined by
@
.`/
.`1=2/
.x; /
C †t
@x .x/ D
.`1=2/
Z .`1=2/
.x; / D
1
.x/
.`1=2/
i 1h †s .`1/ .x/ C Q.x/ ; (1.166a) 2
x; 0 d0 :
(1.166b)
1
We now write an exact transport equation for the scalar and angular flux errors: ı .`1/ .x/ D .x/ .`1/ .x; /; ı
.`1=2/
.x; / D
.x; /
(1.167a)
.`1=2/
.x; /:
(1.167b)
To do this, we subtract Eqs. (1.166) from Eqs. (1.165), obtaining
@ı
ı
.`1=2/
.x; /
@x .`/
.x/ D ı
C †t ı
.`1=2/
Z .`1=2/
.x; / D
1
.x/
ı
.`1=2/
1 †s ı .`1/ .x/; (1.168a) 2
x; 0 d0 ;
(1.168b)
1
which define ı .`/ .x/ in terms of ı .`1/ .x/. Clearly, the rate of convergence of Eq. (1.166) is equal to the rate at which ı .`/ .x/ ! 0. To calculate this rate, we introduce the Fourier transforms Z 1 .`1/ ı
.x/ D a.`1/ ./e i †t x d; (1.169a) 1
ı
.`1=2/
.x; / D
Z
1 1
b .`1=2/ .; /e i †t x d;
(1.169b)
56
E.W. Larsen and J.E. Morel
into Eqs. (1.168) to obtain c .i C 1/b .`1=2/ .; / D a.`1/ ./; 2 Z 1 a.`/ ./ D b .`1=2/ ; 0 d0 ;
(1.170a) (1.170b)
1
where c D †s =†t D scattering ratio. Equation (1.170a) gives b .`1=2/ .; / D
c 1 a.`1/ ./ ; 2 1 C i
(1.171)
and then Eq. (1.170b) gives a.`/ ./ D
Z 1 d0 c a.`1/ ./ 2 1 1 C i 0
D ! ./ a.`1/ ./ D D Œ!./` a.0/ ./; where c !./ D 2
Z1 1
c d0 D tan1 ./ 1 C i 0
(1.172a)
(1.172b)
is the iteration eigenvalue. Equations (1.172) and (1.169a) yield Z1 ı
.`/
.x/ D
! ` ./a.0/ ./e i †t x d:
(1.173)
1
Thus, the rate at which the Fourier mode corresponding to wave number limits to zero is determined by !./. If j!./j 1, the corresponding mode converges rapidly. If j!./j < 1 and j!./j 1, the mode converges slowly. If j!./j 1, the mode does not converge. The overall rate of convergence is determined by the most slowly converging error mode, i.e., the largest value of j!./j over the Fourier variable . For large `, Eq. (1.173) implies
.`/
ı .x/ ` A;
(1.174)
where A is a constant, and
.`/
ı .x/
D sup j!./j D lim `!1 ı .`1/ .x/
1<<1 is the spectral radius (see Eqs. (1.33)).
(1.175)
1
Advances in Discrete-Ordinates Methodology
57
From Eqs. (1.175) and (1.172b), the spectral radius of the continuous SI scheme is c D sup tan1 D c; (1.176) 1<<1 which is attained for 0. Thus, the 0 Fourier error modes are the most slowly converging modes in the SI scheme. From Eq. ( 1.171), we have for 0: b .`C1=2/ .; / D
c c 1 ! ` ./a.0/ ./ .1 i / ! ` ./ a.0/ ./; 2 1 C i 2
and thus the most slowly converging modes depend nearly linearly on . The Fourier analysis can be extended to multidimensional problems, to fully discrete (in space, angle, and energy) SN problems for infinite homogeneous (or spatially periodic) media on Cartesian grids, and to iteration strategies beyond Source Iteration [110]. This analysis makes it possible to predict – with relative ease and great accuracy – the rate of convergence of transport iteration schemes, before implementing them in test codes. It also provides a theoretical foundation for iteration schemes, making it possible to understand how a scheme works (if it works), or why it fails (if it fails). In the latter case, the Fourier analysis has often provided clues that have enabled researchers to modify schemes to perform more effectively. Overall, the Fourier analysis has become an invaluable tool in the development of advanced iteration strategies for particle transport problems. For the SI scheme, the Fourier analysis predicts that the spectral radius D c, even for fully discrete SN codes. The accuracy of this prediction has been observed in many calculations [110]. The Fourier analysis also predicts, even for discrete problems, that the most slowly converging modes correspond to 0, and that for such modes, the -dependence is nearly linear. This result provides a motivation for the DSA method, discussed next.
1.8.2 Diffusion-Synthetic Acceleration The DSA method is based on the use of diffusion as an approximation to transport, for the purpose of calculating the iterative error after source iteration. The algorithm can be expressed as follows. We again suppose that the problem to be solved is given by Eqs. (1.165). The `th DSA iteration begins with a SI sweep (Eqs. (1.166)):
@
.`1=2/
.`1=2/
.x; /
@x
Z
C †t
.`1=2/
1 .`1=2/
.x/ D 1
.x; / D
x; 0 d0 :
i 1h †s .`1/ .x/ C Q.x/ ; (1.177a) 2 (1.177b)
58
E.W. Larsen and J.E. Morel
Unlike the SI scheme, the DSA method does not define .`/ .x/ D .`1=2/ .x/. Instead, Eqs. (1.177) are subtracted from Eqs. (1.165) to obtain the following exact equation for the angular flux error (Eqs. (1.167)): Z @ı .`1=2/ .x; / †s 1 .`1=2/ C †t ı .x; / ı .`1=2/ x; 0 d0 @x 2 1 h i †s .`1=2/
D .x/ .`1/ .x/ : (1.178) 2 This equation for ı .`1=2/ .x; / is exact, but it is just as difficult to solve as the original transport equation for .x; / (Eq. (1.165)). However, a good estimate of the iterative error can be obtained by approximating Eq. (1.178) by its diffusion approximation: h i d 1 d ı .`1=2/ .x/ C †a ı .`1=2/ .x/ D †s .`1=2/ .x/ .`1/ .x/ ; dx 3†t dx (1.179) which is much easier to solve than Eq. (1.178). This approximation is further motivated by the fact that the most slowly converging SI modes are linear in angle; these components are treated accurately in the above diffusion approximation. After solving Eq. (1.179) for ı .`1=2/ .x/, the update equation is
.`/ .x/ D .`1=2/ .x/ C ı .`1=2/ .x/:
(1.180)
The DSA scheme is then defined by Eqs. (1.177) (a transport sweep), Eq. (1.179) (the low-order diffusion equation for the approximate scalar flux correction), and Eq. (1.180) (the update equation). A Fourier analysis can be employed to calculate the spectral radius of the DSA algorithm for the same model infinite homogeneousmedium problem used to analyze source iteration alone. The DSA spectral radius for this case is approximately 0:23c, which is bounded less than unity for all 0 c 1. Furthermore, with one exception that is discussed later, this excellent spectral radius can be achieved in practical calculations. Thus, for the most part, DSA is extremely effective. Details of the Fourier analysis show why DSA performs well for the model problem. The transport sweep strongly attenuates scalar flux errors that vary rapidly in space, i.e., high-frequency errors. However, this sweep attenuates low-frequency errors that vary slowly in space by only a factor of c. Thus, when c is close to unity, the low-frequency errors are essentially unattenuated. In contrast, the diffusion step almost completely attenuates low-frequency errors (because such errors have an angular shape that is primarily linear in ) but does basically nothing to highfrequency errors. Thus when DSA is applied, the high-frequency errors are strongly attenuated by the sweep and the low-frequency errors are strongly attenuated by the diffusion step. The minimum level of attenuation occurs for intermediate-frequency errors, but this level of attenuation is very high relative to that of the unaccelerated iteration algorithm.
1
Advances in Discrete-Ordinates Methodology
59
The concept of DSA existed long before 1968 [6], but the synthetic method for discrete problems was originally seen to be unstable for problems in which the cell thickness exceeded roughly a mean free path [11]. Alcouffe [23] made the DSA method practical for the diamond-differenced SN equations by showing that if the spatial discretization of the diffusion equation was chosen to be consistent with the spatial discretization of the SN equations, the instability was eliminated, and one obtained an algorithm that was unconditionally effective. Soon afterward, Alcouffe’s ideas were extended and generalized to nondiamond schemes [34, 35, 99, 108, 110]. A nonlinear “quasidiffusion” method was also developed [8], which is rapidly convergent but is not strictly an acceleration method, because it produces converged solutions that differ from the discrete SN solution due to an extra truncation error. In general, an acceleration scheme is said to be “unconditionally effective” when the accelerated spectral radius is bounded less than unity. Also, an acceleration scheme is said to be “unconditionally efficient” when the computational execution time associated with the accelerated scheme is always much smaller than that of the unaccelerated scheme. While the use of consistent diffusion discretizations makes the DSA method effective, it does not necessarily make it efficient. This is because the discrete diffusion equations that are consistent with advanced SN spatial discretization methods can have a nonstandard form that makes them much more expensive to solve than standard discrete diffusion equations. This results in an effective-but-inefficient DSA algorithm [116]. The most modern SN codes generally use advanced discontinuous finite-element discretization schemes, but they do not use fully consistent diffusion discretizations. Rather, they either use “partially-consistent” diffusion discretizations [64] or they solve the fully consistent discretizations in an approximate manner that involves the solution of a standard discretization of the diffusion equation [61, 67]. Although such schemes generally result in a degradation of the accelerated spectral radius, they are usually much more efficient than fully consistent schemes because of the high cost of solving the fully consistent diffusion equations [116]. The DSA method is not limited to problems with isotropic scattering. When applied to problems with anisotropic scattering, the original DSA algorithm was nearly identical to that for isotropic scattering; all higher-order Legendre angular flux moments (above the scalar flux) were simply left unaccelerated. However, the DSA method becomes ineffective for problems with highly anisotropic forward-peaked scattering because the higher-order Legendre moments become slow to converge and require acceleration. The standard DSA method can be modified to accelerate the current (the n D 1 Legendre moment) in addition to the scalar flux (the n D 0 Legendre moment) [36]. In 1-D calculations, this improves performance with highly anisotropic scattering, but the modified method nonetheless becomes increasingly ineffective as the anisotropy of the scattering increases [36]. In multidimensional calculations, acceleration of the currents becomes unstable as the anisotropy of the scattering increases [68]. For 1-D calculations, an angular multigrid method has been developed, which is unconditionally effective and efficient with anisotropic scattering [62]. However, this approach has had only limited success in multidimensional calculations [93].
60
E.W. Larsen and J.E. Morel
1.8.3 DSA-Like Methods for Outer Iteration Acceleration The DSA method was originally applicable only to within-group source iterations, but variations on DSA have been developed to accelerate energy-dependent sources. In particular, one can accelerate the neutron upscatter source [69], the fission source in steady-state subcritical or time-dependent super-critical neutronics calculations [73], and the fission-like implicit emission source in radiative transfer calculations [42, 50]. To illustrate, we consider time-dependent radiative transfer calculations. The DSA-like scheme that is used to accelerate the outer iterations is called the linear multifrequency-grey method [42,50]. In accordance with Eq. (1.43), an accelerated outer iteration can be described as follows. The first step is a standard outer iteration on the emission source: rI .`1=2/ .r; ; E/ C † .E/I .`1=2/ .r; ; E/ i 1 h .E/f .`1/ .r/ C .r ; E/ ; D 4
†s .E/ .`1=2/
.r; E/ 4 (1.181)
where I is the intensity, is the angle-integrated intensity, and f is the total absorption rate: Z 1 f .r/ D †a E 0 r ; E 0 dE 0 : (1.182) 0
We note from Eq. (1.181) that the monochromatic scattering sources (corresponding to within-group scattering sources in practice) carry an index of ` 1=2, and thus are assumed to be converged within each outer iteration. The convergence of these sources within each outer iteration is required for application of the linear multifrequency-grey method. Of course, one can use the DSA method to accelerate the convergence of these sources if desired. The iterative error in the angular intensity at step ` 1=2 is defined as ıI .`1=2/ D I I .`1=2/ , where I is the converged transport solution. This error satisfies the following transport equation: 1 rıI .`1=2/ .r; ; E/ C †t .E/ıI .`1=2/ .r; ; E/ † .E/ı .`1=2/ .r; E/ 4 s h i 1 .E/ f .`1=2/ .r/ f .`1/ .r/ ; D (1.183) 4 which is just as difficult to solve as Eq. (1.181). The DSA algorithm would approximate Eq. (1.183) by its (energy-dependent) diffusion approximation. Instead, in the multifrequency-grey method, Eq. (1.183) is approximated by a simpler monoenergetic or “grey” diffusion equation. The unknown in this approximate equation is the iterative error in the angle-energyintegrated intensity at step ` 1=2: Z .`1=2/
ıˆ
1
.r/ D 0
h i
r; E 0 .`1=2/ r; E 0 dE 0 :
(1.184)
1
Advances in Discrete-Ordinates Methodology
61
The approximate diffusion equation is r hDirıˆ.`1=2/ .r/ C Œ C .1 /h†a i ıˆ.`1=2/ .r/ h i D f .`1=2/ .r/ f .`1/ .r/ ;
(1.185)
where 1 hDi D 3 Z h†a i D
Z
0 1 0
and
1
.E/ &.E/ D †a .E/ C
&.E 0 / dE 0 ; † .E 0 /
&.E 0 /†a .E 0 /dE 0 ;
Z
1 0
.E 0 / 0 dE : †a .E 0 / C
(1.186) (1.187)
(1.188)
The final step in the algorithm is to add the estimate for the absorption rate error to the absorption rate iterate: f .`/ .r/ D f .`1=2/ .r/ C ha iıˆ.`1=2/ .r/:
(1.189)
A Fourier analysis of the unaccelerated emission source iteration shows that when the spectral radius is near unity, iterative errors that vary slowly in space are poorly attenuated by the transport sweep, while errors that vary rapidly in space are strongly attenuated by the sweep. (Such behavior can always be expected from a sweep, regardless of the particular type of source being iterated upon.) The Fourier analysis also shows that the low-frequency errors take on an angular shape that is linear in the components of the photon direction vector with an energy spectrum that is fixed. The linear angular dependence suggests an energy-dependent diffusion approximation to Eq. (1.183), and the specific, i.e., common, energy shape suggests that an energydependent diffusion approximation can be reduced without loss of accuracy to a grey diffusion approximation. This is exactly how Eq. (1.185) is derived. In particular, it is first assumed that ıI.r; ; E/ D
1 Œı .r; E/ C 3 ıF .r; E/ : 4
(1.190)
A multigroup diffusion approximation is then obtained by substituting Eq. (1.190) into Eq. (1.183), taking angular moments with respect to the weight functions, 1 and , and then eliminating ıF from the resulting P1 equations, to obtain r D.E/rı .`1=2/ .r; E/ C C †a .E/ ı .`1=2/ .r; E/ i h (1.191) D .E/ f .`1=2/ .r/ f .`1/ .r/ ;
62
E.W. Larsen and J.E. Morel
where D.E/ D
1 : 3† .E/
(1.192)
Equation (1.185) is obtained from Eq. (1.191) by first assuming that ı .`1=2/ .r; E/ D &.E/ıˆ.`1=2/ .r/;
(1.193)
where &.E/ is a normalized shape function defined by Eq. (1.188). The next step is to substitute Eq. (1.193) into Eq. (1.191) and integrate that equation over all energies. The resulting equation is identical to Eq. (1.185), except for a drift term that arises in systems with space-dependent cross sections. In practice, the drift term is dropped because doing this simplifies the grey equation with no significant degradation in the effectiveness of the acceleration algorithm. In analogy with DSA, the diffusion step in the linear multifrequency-grey method almost completely attenuates low-frequency errors but does not affect high-frequency errors. With one possible exception discussed in Section 1.8.4, the spectral radius is found to be excellent for practical radiative transfer calculations in the stellar regime. The fission source acceleration method [73] is nearly identical to the linear multifrequency-grey method because, as previously noted, the numerical emission source in radiative transfer has the mathematical form of a fission source. The neutron thermal upscatter source acceleration method [69] is very similar to the fission source acceleration method and the linear multifrequency-grey method, except that the upscatter operator is of full rank in energy as opposed to the fission and emission operators, which are of rank one in energy. Simultaneous upscatter and fission source acceleration has also been investigated [84]. A full discussion of the requirements imposed on acceleration techniques by a general “scattering” operator of rank greater than one is beyond the scope of this chapter. Suffice it to say that effective acceleration techniques for “scattering” operators of full rank in both energy and angle may not be achievable using a one-group diffusion approximation to estimate low-frequency errors. Rather, “multigrid” or multilevel approximations in angle, in energy, or in both angle and energy may be required.
1.8.4 A Deficiency in Multidimensional DSA and DSA-Like Methods For many years, Alcouffe’s consistent DSA approach appeared to yield an unconditionally effective DSA algorithm. However, Azmy [87] has recently shown that the DSA method becomes increasingly ineffective in heterogeneous multidimensional calculations as the jumps in cross sections across material discontinuities increase in magnitude. It is likely that all DSA-like methods will exhibit this same deficiency. This is not significant for neutronics calculations, but it is very significant for certain classes of radiative transfer calculations. Fortunately,
1
Advances in Discrete-Ordinates Methodology
63
this deficiency has been overcome by recasting DSA as a preconditioner and using it in conjunction with preconditioned Krylov methods to solve the SN equations. This topic is discussed next.
1.9 Krylov Methods In the past few years, Krylov methods have had an enormous impact on the manner in which the SN equations are solved. Although the first applications of Krylov methods to the SN equations were made by applied mathematicians in the late 1980s and early 1990s [53, 63], the numerical transport community was initially slow to embrace them. However, during the last several years, Krylov methods have entered the mainstream of SN solution techniques [74, 75, 79, 80, 95, 103, 115, 124, 126]. Indeed, almost every SN solution technique developed today can be expected to be based on a preconditioned Krylov method. There are three basic reasons for the mainstream acceptance of Krylov methods within the numerical transport community. First, the recent recognition that DSA and DSA-like methods are not unconditionally effective in multidimensional problems [94] has motivated a search both for modifications to the DSA method that would eliminate this deficiency and for fundamentally new unconditionally effective solution techniques. Second, it was demonstrated early on that an inconsistently discretized DSA method, when recast as a preconditioner for a Krylov method, can produce an unconditionally effective and efficient SN solution technique [63]. Third, it has been demonstrated that Krylov methods, even with relatively simple preconditioners, can be much more effective than simple source iteration [82]. In this section, we give a basic description of Krylov methods, and then we consider some of the specific issues that arise when applying preconditioned Krylov methods to the SN equations. This is not intended as a review of all forms of Krylov methods, but rather as a basic introduction to Krylov concepts with a focus on those types of Krylov methods that appear to be most relevant for particle transport calculations.
1.9.1 The Central Theme of Krylov Methods Let us assume that we want to iteratively solve the following matrix equation: E AxE D b;
(1.194)
where A is a nonsingular N N matrix, xE is a solution vector of length N , and bE is a source vector of length N . We assume an initial solution guess for Eq. (1.194) of E However, if xE0 is not zero, one can always solve the following equivalent xE0 D 0. system with an initial zero guess: AxE0 D bE0 ;
(1.195a)
64
where and
E.W. Larsen and J.E. Morel
xE0 D xE xE0 ;
(1.195b)
bE0 D bE AxE0 :
(1.195c)
Fundamental to the central theme of a Krylov method is a Krylov space of dimenE We denote sion m, which is defined with respect to the matrix A and the vector b. E A basis for this space consists of M vectors formed by this space by Km .A; b/. E applying successive powers of A to b: n o E D span b; E Ab; E A2 b; E : : : ; Am1 bE : Km .A; b/
(1.196)
We refer to these basis vectors as the Krylov vectors. The basic idea of Krylov methods is to approximate the solution to Eq. (1.194) by a linear combination of Krylov vectors. Before we provide more details on how this is done, we first show that the solution of Eq. (1.194) lies within a Krylov space. We define the minimum polynomial of A, denoted by Pd .A/, as the polynomial in A of minimum degree d such that Pd .A/ D I C a1 A1 C C ad Ad D 0: (1.197) If A is nonsingular, then zero is not a root of its minimal polynomial. Thus, the minimal polynomial can be scaled so that a0 D 1:0. Equation (1.197) implies I D .a1 I C C ad Ad 1 /A:
(1.198)
Multiplying Eq. (1.198) from the right by A1 gives A1 D
d 1 X
aj C1 Aj :
(1.199)
j D0
Thus, the solution to Eq. (1.194) can be written as xE D A1 bE D
d 1 X
E aj C1 Aj b;
(1.200)
j D0
E Thus, one is which, by comparison with Eq. (1.196), is an element of Kd .A; b/. E where motivated to seek an approximation to xE from the Krylov space Kn .A; b/, n d. Although Krylov methods are generally quite similar in spirit, they can be quite different in detail. Recognizing this fact, we nonetheless describe a “typical” Krylov E method as follows. The mth solution iterate, xE .m/ , is an element of Km .A; b/. E The first step in the algorithm is to build an orthogonal basis for Km .A; b/.
1
Advances in Discrete-Ordinates Methodology
65
Orthogonalization of the Krylov vectors is necessary because these vectors become less linearly independent with increasing m. This follows from the fact that Aj bE approaches the fundamental eigenvector (the eigenvector associated with the eigenvalue of largest magnitude) as j increases. Different methods achieve orthogonality in different ways, and in some cases, the vectors are orthogonal with respect to some particular inner product. For illustrative purposes we will simply assume that the vectors are orthogonal with respect to the standard dot product. For reasons that will be explained later, the orthogonal basis vectors are also normalized. The mth solution iterate is expressed as a linear combination of the orthonormal basis vectors: xE .m/ D Vm yEm ;
(1.201)
where Vm is an n m matrix whose j th column consists of the j th orthonormal basis vector, and yEm is the vector of expansion coefficients of length m. The expansion coefficients are uniquely determined via a residual orthogonality condition. More specifically, an m-dimensional weighting space of vectors is first chosen, ˚ Wm D span w E 1; w E 2; : : : ; w Em ;
(1.202)
and then expansion coefficients are chosen so that the residual vector associated with xE .m/ , rEm D bE AxE .m/ D bE AVm yEm ; (1.203) is orthogonal to the weighting space, i.e., WTm rEm D 0;
(1.204)
where Wm is an m m matrix whose j th column consists of the j th weighting vector. Substituting from Eq. (1.203) into Eq. (1.204), we obtain the following m m matrix equation for the coefficient vector: E WTm AVm yEm D WTm b:
(1.205)
Different Krylov methods arise from different choices of the weighting space. For E is a good choice. This results in instance, if A is positive-definite, Wm D Km .A; b/ a classic Ritz–Galerkin approximation because the weighting space and the approximate solution space are identical: E VTm AVm yEm D VTm b:
(1.206)
The A-norm of the error, defined by
x xE .m/ D .xE xE .m/ /T A.xE xE.m/ /;
E A
(1.207)
66
E.W. Larsen and J.E. Morel
is minimized under this approximation. The quantity defined by Eq. (1.206) is always minimized, but this is not a true norm unless A is positive-definite. The conjugate-gradient (CG) method [81] uses the Ritz–Galerkin approximation. E If A is not positive-definite, a good choice for the weighting space is AKm .A; b/, i.e., the space spanned by the A times the Krylov vectors. In this case, Eq. (1.205) becomes E .AVm /T .AVm /yEm D .AVm /T b: (1.208) Equation (1.208) is easily recognized as the least-squares approximation to the overdetermined linear system E A.Vm yEm / D b: (1.209) Thus, the residual associated with this approximation is minimized with respect to the L2 norm, defined as q
rEm L2 D rET rEm : (1.210) m
The generalized minimum-residual (GMRES) and minimum-residual (MINRES) methods [81] use the least-squares approximation. Weighting spaces other than those discussed above can be used, but when this is done, neither the error nor the residual are minimized in any rigorous sense. However, there are advantages to using other weighting spaces, relating to the amount of computational work and the amount of data storage required to solve for xE .m/ . In general, Eq. (1.205) is not actually solved to obtain yEm . For instance, in the GMRES method, an equivalent matrix equation based on an Arnoldi decomposition of A is used. The details of the process used to obtain xE .m/ are not important for our purposes, but the amount of computational work and the amount of data storage required to obtain xE .m/ are important. The storage costs associated with the Krylov vectors can be prohibitive if one is solving very large linear systems for which many iterations are required to achieve convergence. This is not a difficulty if A is symmetric positive-definite and the CG method is used, because xE .m/ can be calculated using a three-term recursion formula [81]. As a result, one need only save the previous solution iterate and one other vector of similar length to compute a new solution iterate. In this case, the required data storage does not increase with the number of iterations as it otherwise does. This is a great advantage associated with the CG method. If A is not symmetric positive-definite, one can avoid the storage issue by choosing the weighting space such that a recursion formula can be used to compute xE.m/ . However, as previously noted, this approach generally fails to minimize the error or the residual at each iteration step, which can result in erratic convergence properties. The biconjugate-gradient (BCG) and quasi-minimum-residual (QMR) methods [81] use this type of approach. If a recursion formula cannot be used, a restart strategy must generally be used. Under such a strategy, one chooses a maximum number of Krylov iterations to perform within each “stage” before restarting the Krylov process with the last iterate from the previous stage serving as the initial solution guess for the next stage. The difficulty with this approach is that convergence of the restarted process is not guaranteed for general matrices. However, the restarted GMRES method is guaranteed to converge if A is positive-definite,
1
Advances in Discrete-Ordinates Methodology
67
i.e., if xE T AxE > 0 for all xE ¤ 0; or equivalently, if the eigenvalues of A C AT are all positive and nonzero. As we later explain, this property is relevant for SN calculations. In summary, all Krylov methods (i) use a Krylov space of dimension m to approximate the mth solution iterate, and (ii) force the residual associated with that iterate to be orthogonal to an m-dimensional weighting space of vectors. The main differences between the various types of Krylov methods arise from the nature of the weighting space of vectors and the computational cost (both in CPU time and memory) of obtaining a solution iterate. Some Krylov methods are designed for general linear systems, while others are specifically designed to be optimal for some particular type of linear system. For instance, the conjugate-gradient method is designed for symmetric positive-definite systems while the minimum-residual method is designed for symmetric indefinite systems.
1.9.2 Convergence and Preconditioning of Krylov Methods The speed of convergence of Krylov methods very much depends on the characteristics of the coefficient matrix associated with the linear system being solved, i.e., the characteristics of the coefficient matrix A in Eq. (1.194). This matrix is normal if AAT D AT A. The convergence properties associated with normal coefficient matrices are fairly well understood, but characterizing the convergence properties associated with non-normal coefficient matrices remains an open problem. A property associated with the convergence of the conjugate-gradient (CG) method is the condition number of the coefficient matrix, defined as the ratio of its largest singular value to its smallest singular value: D
max : min
(1.211)
If is not large, the convergence of the CG method will be rapid. However, if is large, no conclusion can be made regarding the rate of convergence of CG iterations. The condition number is not particularly relevant to the convergence of the generalized minimum-residual (GMRES) method. More relevant factors are the distribution of the eigenvalues of A in the complex plane, and (assuming that A is diagonalizable) the condition number of the matrix of eigenvectors of A. An eigenvalue spectrum clustered away from zero and entirely contained in either half-plane and an eigenvector matrix of A with a small condition number are desirable. If any single property of the coefficient matrix is desirable with a Krylov method, it is that its eigenvalues should be clustered away from zero. A set of eigenvalues is considered to be clustered if the distance between any two eigenvalues is much smaller than the distance of any eigenvalue from the origin. We stress that all of the eigenvalues need not be in one cluster or a collection of clusters. Any clustering of eigenvalues can be advantageous relative to a completely unclustered eigenvalue distribution.
68
E.W. Larsen and J.E. Morel
The maximum number of iterations required for a Krylov method to converge is N , the dimension of A. However, it is desirable to use the technique of preconditioning to reduce the number of required iterations, both from the viewpoint of efficiency and from the fact that roundoff errors can be problematic when N is large. A preconditioner for A is a matrix that approximates A1 . Given a preconditioning matrix C; the preconditioning process can take two forms. The first, called left-preconditioning, corresponds to solving CAE x D Cy: E
(1.212)
In the absence of round-off error, the above equation clearly has the same solution as Eq. (1.194). The second is called right-preconditioning and corresponds to solving ACEz D y; E
(1.213)
xE D CEz:
(1.214)
where We note from Eq. (1.214) that once Eq. (1.213) has been solved, xE is obtained from Ez via the action of C on Ez. If C D A1 , both Eqs. (1.212) and (1.213) can be solved in a single Krylov iteration. This is why a preconditioner should approximate A1 . However, from a practical point of view, a preconditioner should approximate A1 only in a limited sense, because it is not generally possible to find a nearly exact approximation to A1 at a low computational cost. Also if a nearly exact approximation to A1 were known, a nearly exact solution to the problem, Eq. (1.194), would be immediately realizable without the need for iterations. Experience in solving the transport equation with Krylov methods indicates that the best preconditioners move the smallest eigenvalues significantly away from zero, while leaving the largest eigenvalues relatively unaffected [124]. Assuming a preconditioned transport system that is SPD, the effectiveness of such preconditioners is easily explained when they are used in conjunction with the CG method. In particular, the eigenvalues and singular values of an SPD matrix are identical, so the condition number of such a matrix is just the ratio of the largest eigenvalue to the smallest eigenvalue. Thus, moving the eigenvalues closest to zero away from zero, while leaving the largest eigenvalues essentially unaffected, will decrease the condition number of the coefficient matrix and thereby result in faster convergence of the CG method. However, even though such preconditioners are observed to remain effective when used in conjunction with nonsymmetric transport systems and more general Krylov methods, the reasons for their effectiveness are not yet well understood. To move the smallest eigenvalues away from zero, the preconditioner must accurately approximate the inverse of the coefficient matrix when operating on the eigenvectors associated with the smallest eigenvalues. To leave the largest eigenvalues relatively unaffected, the preconditioner must act approximately as the identity matrix when operating on the eigenvectors associated with the largest eigenvalues. Such preconditioners are analogous to the coarse-grid operators
1
Advances in Discrete-Ordinates Methodology
69
used in multigrid methods and the low-order operators used in synthetic acceleration schemes. Thus, it is somewhat clear how such preconditioners should be constructed. As previously stated, the convergence of Krylov methods can be significantly improved by clustering some of the eigenvalues. Unfortunately, the properties required for a preconditioner to cluster eigenvalues are generally much less clear than those required to move the smallest eigenvalues away from zero. Nonetheless, as we shall later see, moderately effective preconditioners for transport calculations have been found that cluster some of the eigenvalues while leaving the smallest eigenvalues essentially unaltered [124]. Finally, moderately effective preconditioners for transport calculations have been found that move the smallest eigenvalues away from zero, but also significantly increase and spread out (uncluster) the largest eigenvalues [121, 122]. One can give a plausible explanation for the effectiveness of such preconditioners when they are used in conjunction with the CG method, but such an explanation is not currently possible with more general Krylov methods. For instance, if we assume a preconditioned transport system that is SPD, moving the smallest eigenvalues away from zero decreases the condition number of the coefficient matrix, while increasing the large eigenvalues increases the condition number of the coefficient matrix. We can conjecture that these preconditioners are moderately effective when used in conjunction with the CG method because the decrease in the condition number associated with moving the smallest eigenvalues away from zero weakly dominates the increase in the condition number associated with increasing the largest eigenvalues. This results in a net decrease in the condition number of the coefficient matrix and an attendant increase in the convergence rate of the CG method. Preconditioners of this type are analogous to unstable acceleration schemes that strongly attenuate the low-frequency Fourier error modes but weakly amplify the high-frequency Fourier error modes. We emphasize that not every acceleration scheme that attenuates lowfrequency Fourier error modes and amplifies high-frequency Fourier error modes can be expected to be effective when recast as a preconditioned Krylov method. If the amplification factors for the high-frequency Fourier error modes are too large, the corresponding preconditioner may increase the largest eigenvalues too much relative to the movement of the smallest eigenvalues away from zero, presumably resulting in a net decrease in convergence rate.
1.9.3 Applying Krylov Methods to the SN Equations The optimal application of Krylov methods to the transport equation is not necessarily obvious. To illustrate, let us consider a monoenergetic approximation with isotropic scattering in 1-D slab geometry. The transport equation can be expressed as 1 L †s P 2
D Q;
(1.215)
70
E.W. Larsen and J.E. Morel
where L
D
@ C †t ; @x
and
Z P
(1.216)
C1
D D
d:
(1.217)
1
A Krylov method could be used to solve a fully discretized SN version of Eq. (1.215), but it would not be optimal. A better approach is to left-precondition Eq. (1.215) with L1 : 1 1 I L †s P 2
D L1 Q:
(1.218)
This approach is better for three reasons. First, the analytic operator on the left side of Eq. (1.218) represents the integral transport operator, which is bounded, whereas the differential transport operator is unbounded. This implies that the discretized SN version of the integral operator will have eigenvalues restricted to a bounded (hence much smaller) region of the complex plane than the discretized SN version of the differential operator. Furthermore, the integral transport operator is a compact perturbation of the identity operator, hence many (but not all) of the eigenvalues of the discretized SN version of the integral operator will be clustered about unity. Thus, Krylov methods will generally converge faster when used to solve Eq. (1.218) than when used to solve Eq. (1.215). The second reason for solving Eq. (1.218) is that the action of L1 is easily and economically obtained via a sweep. Thus, the improved convergence rate will not be outweighed by the cost of preconditioning with L1 . (We note that L1 is an example of a preconditioner that clusters eigenvalues but does not significantly move the smallest eigenvalues away from zero. The improvement in convergence rate is significant, but preconditioning with L1 will not result in rapid convergence for all problems.) The third reason for solving Eq. (1.218) is that it has been observed (but not rigorously proven [124]) that the matrices associated with SN discretizations of Eq. (1.218) are positive-definite. As previously noted, the restarted GMRES algorithm is guaranteed to converge when applied to linear systems with this property. This is a significant property of Eq. (1.218). A further improvement can be obtained by multiplying Eq. (1.218) by P. This results in an integral equation for the scalar flux (also known as Peierls’ equation): 1 I PL1 †s D PL1 Q: 2
(1.219)
The main advantage of this approach is that the dimension of the matrix associated with a discrete version of Eq. (1.219) is much less than that associated with a discrete version of Eq. (1.218), greatly reducing the amount of computation required per Krylov iteration. The derivation yielding Eq. (1.219) can be generalized for any order of anisotropic scattering, resulting in an integral equation for the Legendre (or spherical-harmonic) flux moments. Solving an integral moments equation will be
1
Advances in Discrete-Ordinates Methodology
71
advantageous relative to Eq. (1.218) whenever the number of moments is less than the number of discrete angular flux directions. Another potential advantage of the integral moments approach is that analytic versions of such equations can be made self-adjoint and positive-definite (SAPD) via both a preconditioner and the use of a nonstandard inner product [107]. If a discretization for such an equation preserves this SAPD property, then the corresponding discrete system can be expressed in an SPD form and the conjugate-gradient method can be used to solve it. The SAPD property has been observed to be preserved for Eq. (1.219) on orthogonal meshes with a wide variety of SN spatial discretization schemes [82], but it is not preserved with the linear-discontinuous spatial discretization scheme on unstructured tetrahedral meshes [124]. The conditions under which the SAPD property is preserved are not currently well understood, but for reasons given later, this is not as important an issue as it might appear to be. Finally, perhaps the optimal approach would be to multiply Eq. (1.219) by the operator I C D1 †s : 1 .I C D1 †s / I PL1 †s D .I C D1 †s /PL1 Q; 2
(1.220)
where D is the diffusion operator: D D
@ 1 @
C †a : @x 3†t @x
(1.221)
This is the analog of diffusion-synthetic acceleration, and it (presumably) results in rapid convergence under almost all practical conditions [124]. The deficiency of DSA in multidimensions with large discontinuities in the cross sections is strongly diminished when it is recast as a preconditioned Krylov method [124]. This is the great advantage of Krylov methods. Only one eigenvalue of the iteration matrix very near unity can ruin the performance of an acceleration scheme, but a single anomalously large eigenvalue associated with the system being solved will generally have little effect on a Krylov method. As previously noted, modern SN codes generally use discontinuous spatial discretization schemes. If a discontinuous diffusion discretization is used, the left side of Eq. (1.220) will not be symmetric [124]. A great advantage of preconditioned Krylov methods is that the diffusion discretization does not have to be fully consistent with the SN spatial discretization to be effective. However, if a discontinuous SN spatial discretization is used, some capability for calculating a discontinuous solution must be included in the diffusion approximation to ensure unconditional effectiveness, and this will almost certainly cause the overall diffusion operator to be either nonsymmetric or symmetric-indefinite. Thus, even if a discontinuous discretization of Eq. (1.219) were to preserve the SAPD property of Peierls’ operator and result in an SPD system, applying a DSA-like preconditioner would result in an overall non-SPD system, precluding the use of the conjugate-gradient method to solve that system. This is why the failure of discontinuous methods to preserve the
72
E.W. Larsen and J.E. Morel
SAPD property of Peierls’ operator on unstructured meshes is not as important an issue as it might be. On the other hand, even when a discontinuous diffusion approximation is used, the operator on the left side of Eq. (1.220) remains positive-definite, ensuring the convergence of the restarted GMRES method. This is an important property of Eq. (1.220). Next, we review the operations required to solve a fully discretized SN version of Eq. (1.220) and show that they are quite similar to the operations that take place in a standard SN code with diffusion-synthetic acceleration. We first note that to solve a general linear system such as Eq. (1.194), most Krylov routines do not require the formation of the matrix A. Rather, it is required that the calling routine provide the Krylov routine with a vector that represents the action of A. Specifically, the Krylov routine provides the calling program with a vector, which we denote by vE, and the calling routine returns the vector vE0 , where vE0 D AEv:
(1.222)
The Krylov space can easily be built up this way, with one matrix-vector multiply per iteration. The simplest Krylov methods (e.g., the conjugate-gradient method) require only one matrix-vector multiply per iteration, but others may require more (e.g., the biconjugate-gradient method requires two). We now consider the solution of Eq. (1.220) in detail. Since the unknown in Eq. (1.220) is the monoenergetic or one-group scalar flux, a Krylov method used to solve this equation works with “scalar flux” vectors, i.e., vectors with a length equal to the number of spatial cells times the number of spatial unknowns per cell. The latter number clearly depends on the spatial discretization used for Eq. (1.220). In the process of generating the scalar flux vectors required by the Krylov solver, intermediate “angular flux vectors” arise. These vectors have a length equal to the length of a scalar flux vector times the number of discrete directions in the quadrature set. In the descriptions that follow, angular flux vectors carry an additional subscript “a” to distinguish them from scalar flux vectors. The first vectors that must be provided to a Krylov solver are the initial solution guess, and the vector corresponding to the right side of Eq. (1.220). The latter “source” vector is generated as follows: E a as the source to obtain 1. Perform a transport sweep with Q E a: vE1;a D L1 Q 2. Integrate vE1;a over all directions to obtain E a: vE2 D PL1 Q 3. Multiply vE 2 by †s (a diagonal matrix in this context) to obtain a diffusion source vector: E a: vE3 D †s P L1 Q
1
Advances in Discrete-Ordinates Methodology
73
4. Solve the diffusion equation with vE 3 as the source to obtain E a: vE4 D D1 †s P L1 Q 5. Add vE2 and vE4 to obtain the desired source vector: E a: vE 5 D .I C D1 †s / P L1 Q Next, every iteration requires the calling routine to provide the Krylov solver with the action of the operator on the left side of Eq. (1.220). The action of this operator on the vector vE is calculated as follows: 1. Multiply vE by †s =2 and map it to an isotropic angle-dependent vector to obtain a transport source vector: 1 vE1;a D †s vE: 2 2. Perform a sweep with vE1;a as the source to obtain vE2;a D
1 1 L †s vE: 2
3. Integrate vE2;a over all angles to obtain vE3 D
1 1 PL †s vE: 2
4. Subtract vE3 from vE to obtain 1 vE 4 D I PL1 †s vE: 2 5. Multiply vE4 by †s to obtain a diffusion source vector: 1 1 vE5 D †s I PL †s vE : 2 6. Perform a diffusion calculation with vE 5 as the source to obtain 1 1 1 vE6 D D †s I PL †s vE: 2 7. Add vE4 to vE6 to obtain the desired action on vE: 1 vE7 D .I C D1 †s / I PL1 †s vE: 2
74
E.W. Larsen and J.E. Morel
Thus we see that only sweeps, diffusion solves, and vector additions and subtractions are required to solve the transport equation via a preconditioned Krylov method. Because these operations occur in standard SN codes with DSA, it is not difficult to modify existing SN codes to use preconditioned Krylov solution techniques.
1.10 Future Challenges In this review, we have discussed some of the major improvements to numerical techniques, developed during the last three decades, for the SN equations. Perhaps the most far-reaching improvements have resulted from discontinuous finiteelement methods, which have impacted the discretization of essentially all of the variables in the transport equation. The present challenge for discontinuous finite-element methods is to achieve both accuracy and robustness on general nonorthogonal meshes in the optically thin limit, the optically thick absorptive limit, and the optically thick diffusive limit. These properties can be achieved on orthogonal meshes with standard lumping techniques, but such techniques are problematic on nonorthogonal meshes. Achieving robust strictly positive solutions with at least second-order accuracy in regions where fixup is not required is a classic problem that arises in many fields. Typical fixup schemes for transport are highly nonlinear and nondifferentiable. For instance, a popular fixup scheme used with spatial diamond differencing is to set any negative outflow fluxes in a cell to zero and then recalculate the cell-averaged flux [71]. When a problem contains both highly absorptive and highly scattering regions, the resulting equations can be difficult to solve even when nonlinear solution techniques are used because of the nondifferentiable nature of the “fixup” scheme. A new concept is now emerging by which solutions are not “fixed up” during the iteration process, but rather are “repaired” after convergence [123]. New ideas, such as this, will be required to solve the old and difficult problem of ensuring positive and monotone second-order solutions. Discrete-ordinates methods have traditionally been viewed as being limited to simple geometries, due to the use of orthogonal meshes. The recent development of SN methods for general unstructured meshes constitutes a major advance in the applicability of SN methods to geometrically complex problems. Highly efficient and scalable massively parallel SN solution techniques have been developed for orthogonal meshes [51], but massively parallel solution techniques for unstructured meshes are not yet as efficient or scalable [104, 114]. Also, fundamental problems occur in the SN method on meshes with curved cell faces. These problems have been addressed to a limited extent [109], but much more computational experience is needed before the efficacy of current approaches is fully demonstrated. Tremendous progress in DSA and DSA-like acceleration schemes has been made during the last two decades. The field of acceleration techniques was dealt a significant setback when it was discovered that these schemes are not always unconditionally effective, even with fully consistent diffusion discretizations [87]. However, the advances recently made in the application of Krylov methods to
1
Advances in Discrete-Ordinates Methodology
75
transport calculations have enabled synthetic acceleration schemes to be recast as unconditionally effective preconditioners, thereby regaining a powerful potential for these methods [124]. Developing optimal preconditioned Krylov methods for transport calculations remains an outstanding research topic. A significant challenge for charged-particle transport is to use the SN method to efficiently and accurately treat problems with pencil-beam or near pencil-beam sources. Some progress has recently been made in this regard [125], but more efficient methods requiring lower orders of approximation are needed. Since charged-particle scattering is extremely anisotropic, Galerkin quadratures represent an important alternative to standard quadratures for charged-particle transport calculations. However, much remains to be understood regarding the optimal properties of Galerkin quadrature sets. For example, it is desirable for standard quadrature sets to have positive quadrature weights. Galerkin quadrature sets have a (potentially different) set of weights for evaluating each flux moment. The Galerkin weights associated with the evaluation of the zeroth flux moment represent the weights associated with the standard companion quadrature set. These quadrature weights should be positive because (among other things) positivity indicates a stable spherical-harmonic interpolation. However, the connection between positive weights for evaluating the higher-order flux moments and the stability of the spherical-harmonic interpolation is not clear. To our knowledge, a multidimensional Galerkin quadrature set beyond S2 with positive weights for all moments has never been constructed. Finally, very little progress has been made with respect to perhaps the most significant of all SN deficiencies – the ray effect [119]. Although PN methods do not suffer from classic ray effects, they rarely provide the correct solutions to problems for which SN solutions exhibit ray effects. This is because the exact solutions to such problems usually have an extremely anisotropic angular dependence, and the global nature of spherical-harmonic functions makes them inefficient for representing such dependencies. Unfortunately, the introduction of angular coupling via continuous and discontinuous finite-element approximations does not appear promising for rayeffect mitigation [57, 119]. Because the solutions associated with ray effects are so complex, the accurate elimination of ray effects will probably require angular adaptation. Although adaptive methods are quite mature in many fields of computation, they are just beginning to be investigated for transport calculations [85,92,111,117]; this possibly represents an important research area for the future. Acknowledgments We would like to acknowledge the invaluable assistance of Michele Benzi of Emory University, James Warsa of Los Alamos National Laboratory, and Carrie Beck. Michele graciously reviewed our section on Krylov methods. James provided us with basic information on Krylov methods and their application to the SN equations. Carrie accomplished the laborious task of typing this manuscript in its present format. We would also like to acknowledge that one of the authors (JEM) was an employee of Los Alamos National Laboratory when much of this manuscript was written. Los Alamos National Laboratory is operated by Los Alamos National Security, LLC, for the US Department of Energy under Contract DE-AC52–06NA25396.
76
E.W. Larsen and J.E. Morel
Authors’ Note The following reference list consists mostly of papers that, in the authors’ opinions, have significantly contributed to the topics discussed in this review. We have included several other important publications, but we do not intend for the list to be a full compilation of significant publications on SN methods.
References 1900–1964 1. Eddington AS (1922) The internal constitution of the stars. Cambridge University Press, Cambridge 2. Chandrasekhar S (1960) Radiative transfer. Dover, New York. First published by Oxford University Press, London (1950) 3. Davison B (1957) Neutron transport theory. Oxford University Press, London 4. Carlson BG (1961) Numerical solution of neutron transport problems. In: Proc. of symposia in applied mathematics, Vol. 11, Nuclear reactor theory, American Mathematical Society, Providence, RI, 219 5. Carlson BG (1963) The numerical theory of neutron transport. In: Methods in Computational Physics, Vol. 1, Academic, New York 6. Kopp HJ (1963) Synthetic method solution of the transport equation. Nucl Sci Eng 17:65 7. Vladimirov VS (1961) Mathematical problems in the one-velocity theory of particle transport, Transactions of V.A. Steklov Mathematical Institute, USSR Academy of Sciences, 61. English translation published by Atomic Energy of Canada Limited, Tech. Report AECL1661 (1963) 8. Gol’din VYa (1964) A quasi-diffusion method for solving the kinetic equation. Zh Vych Mat I Mat Fiz 4:1078 (in Russian) English translation (1967) published in: USSR Comp Math Math Phys 4:136
1965–1969 9. Lathrop KD (1965) Anisotropic scattering approximations in the mono-energetic Boltzmann equation. Nucl Sci Eng 21:498 10. Carlson BG, Lathrop KD (1968) Transport theory – the method of discrete ordinates. In: Greenspan H, Kelber CN, Okrent D (eds) Computing methods in reactor physics. Gordon & Breach, New York 11. Gelbard EM, Hageman LA (1969) The synthetic method as applied to the SN equations. Nucl Sci Eng 37:288 12. Lathrop KD (1969) Spatial differencing of the transport equation: positivity vs accuracy. J Comp Phys 4:475
1970–1974 13. Bell GI, Glasstone S (1970) Nuclear Reactor Theory. Van Nostrand Reinhold, New York 14. Carlson BG (1970) Transport theory: discrete ordinates quadrature over the unit sphere. Los Alamos Scientific Laboratory report LA-4554
1
Advances in Discrete-Ordinates Methodology
77
15. Carlson BG (1971) Tables of symmetric equal weight quadrature EQn over the unit sphere. Los Alamos Scientific Laboratory Report LA-4734 16. Reed WH (1971) The effectiveness of acceleration techniques for iterative methods in transport theory. Nucl Sci Eng 45:245 17. Pomraning GC (1973) The equations of radiation hydrodynamics. Pergamon Press, Oxford 18. Reed WH, Hill TR (1973) Triangular mesh methods for the neutron transport equation. Los Alamos Scientific Laboratory Report LA-UR-73–479 19. Dahlquist G, Bj¨orck Å (1974) Numerical methods. Prentice Hall, Englewood Cliffs, NJ 20. Kellogg RB (July 1974) First derivatives of solutions of the plane neutron transport equation, Technical Note BN-783. Institute for Fluid Dynamics and Applied Mathematics, University of Maryland, College Park, MD
1975–1979 21. Briggs LL, Miller WF Jr, Lewis EE (1975) Ray effect mitigation in discrete ordinate-like angular finite-element approximations in neutron transport. Nucl Sci Eng 57:205 22. Hill TR (1975) ONETRAN: a discrete-ordinates finite-element code for the solution of the one-dimensional multigroup transport equation. Los Alamos Scientific Laboratory Report LA-5990-MS 23. Alcouffe RE (1977) Diffusion synthetic acceleration methods for the diamond-differenced discrete-ordinates equations. Nucl Sci Eng 64:344 24. Miller WF Jr, Reed WH (1977) Ray effect mitigation methods for two-dimensional neutron transport theory. Nucl Sci Eng 62:391 25. Alcouffe RE, Larsen EW, Miller WF Jr, Wienke BR (1979) Computational efficiency of numerical methods for the multigroup, discrete-ordinates neutron transport equations: the slab geometry case. Nucl Sci Eng 71:111 26. Dudziak DJ, O’Dell RD, Alcouffe RE (July 1979) Transport and reactor theory. Los Alamos National Laboratory Report, LA-7911-PR 27. Morel JE (1979) On the validity of the extended transport cross-section correction for lowenergy electron transport. Nucl Sci Eng 71:64
1980–1984 28. Lawrence RD, Dorning JJ (1980) A discrete nodal integral transport theory method for multidimensional reactor physics and shielding calculations. In: Proc. ANS topical conference. Advances in reactor physics and shielding, 14–19 Sept 1980. Sun Valley, Idaho, 840 29. Walters WF, O’Dell RD (1980) Nodal methods for discrete-ordinates transport problems in (x-y) geometry. In: Proc. ANS topical conference. Advances in mathematical methods for the solution of nuclear engineering problems, 27–29 April 1980. 1, 115. Munich 30. Gupta NK (1981) Nodal methods for three-dimensional simulators. Prog Nucl Energy 7:127 31. Morel JE (1981) Fokker–Planck calculations using standard discrete ordinates codes. Nucl Sci Eng 79:340 32. Sanchez R, Mc Cormick NJ (1982) A review of neutron transport approximations. Nucl Sci Eng 80:481 (review) 33. Larsen EW (1982) Spatial convergence properties of the diamond difference method in X,Ygeometry. Nucl Sci Eng 80:710 34. Larsen EW (1982) unconditionally stable diffusion synthetic acceleration methods for the slab geometry discrete-ordinates equations. Part I: theory. Nucl Sci Eng 82:47
78
E.W. Larsen and J.E. Morel
35. McCoy DR, Larsen EW (1982) Unconditionally stable diffusion synthetic acceleration methods for the slab geometry discrete-ordinates equations. Part II: numerical results. Nucl Sci Eng 82:64 36. Morel JE (1982) A synthetic acceleration method for discrete ordinates calculations with highly anisotropic scattering. Nucl Sci Eng 82:34 37. Caro M, Ligou J (1983) Treatment of scattering anisotropy of neutrons through the Boltzmann–Fokker–Planck equation. Nucl Sci Eng 83:242 38. Morel JE, Montry GR (1984) Analysis and elimination of the discrete ordinates flux dip. Transp Theory Statist Phys 13:615 39. Mihalas D, Mihalas BW (1984) Foundations of radiation hydro-dynamics. Oxford University Press, New York
1985–1989 40. Morel JE (1985) An improved Fokker–Planck angular differencing scheme. Nucl Sci Eng 89:131–136 41. Morel JE (1985) Diamond-difference multigroup-Legendre coefficients for continuousslowing down operator. Nucl Sci Eng 91:324 42. Morel JE, Larsen EW, Matzen MK (1985) A synthetic acceleration scheme for radiative diffusion calculations. J. Quant. Spectro. Radiat Transf 34:243 43. Badruzzaman A (1985) An efficient algorithm for nodal transport solutions in multidimensional geometry Nucl Sci Eng 89:281 44. Khalil H (1985) A nodal diffusion technique for synthetic acceleration of nodal SN calculations. Nucl Sci Eng 90:263 45. Lawrence RD (1986) Progress in nodal methods for the solution of the neutron diffusion and transport equations. Prog Nucl Energy 17:271 (review) 46. Marchuk GI, Lebedev VI (1986) Numerical methods in the theory of neutron transport. Harwood Academic Publishers, London (originally published in Russian in 1981) 47. Lazo MS, Morel JE (1986) A linear discontinuous Galerkin approximation for the continuous slowing down operator. Nucl Sci Eng. 92:98 48. Ullo JJ (1986) Use of multidimensional transport methodology on nuclear logging problems. Nucl Sci Eng 92:228 49. Larsen EW, Morel JE, Miller WF Jr (1987) Asymptotic solutions of numerical transport problems in optically thick, diffusive regimes. J Comp Phys 69:283 50. Larsen EW (1988) A grey transport acceleration method for thermal radiative transfer problems. J Comp Phys 78:459 51. Baker RS, Koch KR (1988) An SN algorithm for the massively parallel CM-200 computer. Nucl Sci Eng 128:312 52. Larsen EW, Morel JE (1989) Asymptotic solutions of numerical transport problems in optically thick, diffusive regimes II. J Comp Phys 83:212. See also Corrigendum. J Comp Phys 91:246 (1990) 53. Faber V, Manteuffel TA (1989) A look at transport theory from the point of view of linear algebra. In: Nelson P et al. (eds) Lecture notes in pure and applied mathematics, Vol. 115. Marcel Dekker, New York, p 31 54. Morel JE (1989) A hybrid collocation-Galerkin-SN method for solving the Boltzmann transport equation. Nucl Sci Eng 101:72 55. Landesman M, Morel JE (1989) Angular Fokker–Planck decomposition and representation techniques. Nucl Sci Eng 103:1
1
Advances in Discrete-Ordinates Methodology
79
1990–1994 56. Cefus GR, Larsen EW (1990) Stability analysis of coarse mesh rebalance. Nucl Sci Eng 105:31 57. Coppa GGM, Lapenta G, Ravetto P (1990) Angular finite-element techniques in neutron transport. Ann Nucl Energy 17:363 58. Lorence LJ Jr, Morel JE,Valdez GD (1990) Results guide to CEPXS/ONELD: a onedimensional coupled electron-photon discrete ordinates code package. Sandia National Laboratories Report SAND89–211 59. Badruzzaman A (1991) Finite moments approaches to the time-dependent Boltzmann equation. Prog Nucl Eng 25:127 60. Walters WF, Morel JE (1991) Investigation of linear-discontinuous angular differencing for the 1-D spherical geometry SN equations. In: Proc. ANS M&C topical meeting. Advances in mathematics, computation, and reactor physics, 28 April–May 2 May 1991, Sec. 11.1, Pittsburgh 61. Wareing T, Larsen EW, Adams ML (1991) Diffusion accelerated discontinuous finite element schemes for the SN equations in slab and X,Y geometries. In: Proc. ANS topical meeting. Advances in mathematics, computations, and reactor physics, 29 April–2 May 1991, Vol. 3, Sec. 11.1. Pittsburgh, p 2–1 62. Morel JE, Manteuffel TA (1991) An angular multigrid acceleration technique for the SN equations with highly forward-peaked scattering. Nucl Sci Eng 107:330 63. Ashby SF, Brown PN, Dorr MR, Hindmarsh AC (1991) Preconditioned iterative methods for discretized transport equations. In: Proc. International topical meeting. Advances in mathematics, computations, and reactor physics, 28 April–2 May 1991, Vol. 2. American Nuclear Society, Pittsburgh, PA, p. 6.1 2–1 64. Adams ML, Martin WR (1992) Diffusion synthetic acceleration of discontinuous finite element transport iterations. Nucl Sci Eng 111:145 65. Azmy YY (1992) Arbitrarily high order characteristic methods for solving the neutron transport equation. Ann Nucl Energy 19:593 66. Larsen EW (1992) The asymptotic diffusion limit of discretized transport problems. Nucl Sci Eng 112:336 (review) 67. Wareing T (November, 1992) Asymptotic diffusion accelerated discontinuous finite element methods for transport problems. Los Alamos National Laboratory Report LA-12425-T 68. Adams ML, Wareing TA (1993) Diffusion-synthetic acceleration given anisotropic scattering, general quadratures, and multi-dimensions. Trans Am Nucl Soc 68:203 69. Adams BT, Morel JE (1993) A two-grid acceleration scheme for the multigroup SN equations with neutron upscattering. Nucl Sci Eng 115:253 70. Morel JE, Dendy JE Jr, Wareing TA (1993) Diffusion accelerated solution of the 2-D SN equations with bilinear-discontinuous differencing. Nucl Sci Eng 115:304 71. Lewis EE, Miller WF Jr (1984) Computational methods of neutron transport. WileyInterscience, New York [reprinted: American Nuclear Society, La Grange Park, IL (1993)] 72. Briesmeister JF (ed) (1993) MCNP – A General Monte Carlo N-Particle Transport Code, Version 4A. Los Alamos National Laboratory Report, LA-12625 73. Morel JE, McGhee JM (1994) A fission-source acceleration technique for time-dependent even-parity SN calculations. Nucl Sci Eng 116:73–85
1995–1999 74. Brown PN (1995) A linear algebraic development of diffusion synthetic acceleration for threedimensional transport equations. SIAM J. Numer Anal 32:179 75. Kelly CT (1995) Multilevel source iteration accelerators for the linear transport equation in slab geometry. Transp Theory Stat Phys 24:697
80
E.W. Larsen and J.E. Morel
76. Castrianni CL, Adams ML (1995) A nonlinear corner-balance spatial discretization for transport on arbitrary grids. In: Proc. ANS M&C international conference on mathematics and computations, reactor physics, and environmental analyses, 30 April–4 May 1995, Vol. 2. Portland, p 916 77. Morel JE, Wareing TA, Smith K (1996) A linear-discontinuous spatial differencing scheme for SN radiative transfer calculations. J Comp Phys 128:445 78. Wareing TA, McGhee JM, Morel JE (1996) ATTILA: a three-dimensional unstructured tetrahedral mesh discrete ordinates transport code. Trans Am Nucl Soc 17:146 79. Patton BW, Holloway JP (1996) Application of Krylov subspace iterative methods to the slab geometry transport equation. In: Proc. 1996 ANS topical meeting. Advances and applications in radiation protection and shielding, 21–25 April 1996, Vol. 1. N. Falmouth, MA, p 384 80. Kelly CT, Xue ZQ (1996) GMRES and integral operators. SIAM J Sci Comp 17:217 81. Saad Y (1996) Iterative methods for sparse linear systems. PWS Publishing Company, Boston, MA 82. Ramone GL, Adams ML, Nowak PF (1997) A transport synthetic acceleration method for transport iterations. Nucl Sci Eng 125:257 83. Adams ML (1997) A subcell balance method for radiative transfer on arbitrary spatial grids. Transp Theory Stat Phys 26(4 & 5):385 84. Adams BT, Morel JE (1997) An acceleration scheme for the multigroup SN equations with fission and thermal upscatter. In: Proc. ANS M&C topical meeting. Joint international conference on mathematical methods and supercomputing for nuclear applications, 5–10 Oct 1997, Vol. 1. Saratoga Springs, New York, p. 343 85. Aussourd C (1997) An adapted DSN scheme for solving the two-dimensional neutron transport equation on a structured AMR grid. In: Proc international conference on mathematical methods and supercomputing for nuclear applications, October 5–9, 1997, Vol. 1. American Nuclear Society, Saratoga Springs, New York, p. 41 86. Adams ML, Nowak PF (1998) Asymptotic analysis of a computational method for time- and frequency-dependent radiative transfer. J Comp Phys 146:366 87. Azmy YY (2002) Unconditionally stable and robust adjacent-cell diffusive preconditioning of weighted-difference particle transport methods is impossible. J Comp Phys 182:213 88. Adams ML, Wareing TA, Walters WF (1988) Characteristic methods in thick diffusive problems. Nucl Sci Eng 130:18 89. Wareing TA, Morel JE (1998) ACTI Task 1 Summary. Los Alamos National Laboratory Report LA-UR-98–4749 90. Castrianni CL, Adams ML (1998) A nonlinear corner-balance spatial discretization for transport on arbitrary grids. Nucl Sci Eng 128:278 91. Warsa JS, Prinja AK (1998) Bilinear-discontinuous numerical solution of the time dependent transport equation in slab geometry. Ann Nucl Energy 26:195 92. Jesse JP, Fiveland WA, Howell LH, Colella P, Pember RB (1998) An adaptive mesh refinement algorithm for the radiative transport equation. J Comp Phys 139:380 93. Pautz SD, Morel JE, Adams ML (1999) An angular multigrid acceleration method for SN equations with highly forward-peaked scattering. In: Proc international conference on mathematics and computation, reactor physics and environmental analyses in nuclear applications, 27–30 Sept 1999, Vol. 1. Madrid, Spain, pp 647–656 94. Azmy YY (1999) Iterative convergence acceleration of neutral particle transport methods via adjacent-cell preconditioners. J Comp Phys 152:359 95. Guthrie B, Holloway JP, Patton BW (1999) GMRES as a multi-step transport sweep accelerator. Transp Theory Statist Phys 28:83 96. Thompson KG, Adams ML (1999) A spatial discretization for solving the transport equation on unstructured grids of polyhedra. In: Proc. ANS M&C international topical conference. Mathematics and computation, reactor physics and environmental analysis, 27–30 Sept 1999, Vol. 2. Madrid, p 1196 97. Wareing TA, McGhee JM, Morel JE, Pautz SD (1999) Discontinuous finite element SN methods on 3-D unstructured grids. In: Proc. ANS M&C international topical conference. Mathematics and computation, reactor physics and environmental analysis, 27–30 Sept 1999, Vol. 2. Madrid, p 1185
1
Advances in Discrete-Ordinates Methodology
81
98. Wareing TA, Morel JE, McGhee JM (1999) A diffusion synthetic acceleration method for the SN equations with discontinuous finite element space and time differencing, In: Proc. ANS M&C international topical conference. Mathematics and computation, reactor physics and environmental analysis, 27–30 Sept 1999. Vol. 1. Madrid, p 45
2000–2005 99. Azmy YY (2000) Acceleration of multidimensional discrete ordinates methods via adjacentcell preconditioners. Nucl Sci Eng 136:202 100. Lathrop KD (2000) A comparison of angular difference schemes for one-dimensional spherical geometry SN equations. Nucl Sci Eng 134:239 101. Wareing TA, Morel JE, McGhee JM (2000) Coupled electron–photon transport methods on 3-D unstructured grids. Trans Am Nucl Soc 83:240–242 102. Mathews KA, Miller RL, Brennan CR (2000) Split-cell linear characteristic transport method for unstructured tetrahedral meshes. Nucl Sci Eng 136:178 103. Zika MR, Adams ML (2000) Transport synthetic acceleration with opposing reflecting boundary conditions. Nucl Sci Eng 134:159 104. Plimpton S, Hendrickson B, Burns S, McLendon W III (2000) Parallel algorithms for radiation transport on unstructured grids. In: Proc. SuperComputing 2000, 4–10 Nov 2000. Dallas, TX 105. Adams ML (2001) Discontinuous finite element transport solutions in thick diffusive problems. Nucl Sci Eng 137:298 106. Brennan CR, Miller RL, Mathews KA (2001) Split-cell exponential characteristic transport method for unstructured tetrahedral meshes. Nucl Sci Eng 138:26 107. Sanchez R, Santandrea S (2001) Symmetrization of the transport operator and Lanczos’ iterations. In: Proc. international meeting on mathematical methods for nuclear applications, 9–13 Sept 2001. American Nuclear Society, Salt Lake City, Utah 108. Sanchez R, Chetaine A (2001) A synthetic acceleration for a two-dimensional characteristic method in unstructured meshes. Nucl Sci Eng 136:122 109. Wareing TA, McGhee JM, Morel JE, Pautz SD (2001) Discontinuous finite element SN methods on three-dimensional unstructured grids. Nucl Sci Eng 138:256 110. Adams ML, Larsen EW (2002) Fast iterative methods for discrete-ordinates particle transport calculations. Prog Nucl Energy 40:3 (review) 111. Baker RS (2002) A block adaptive mesh refinement algorithm for the neutral particle transport equation. Nucl Sci Eng 141:1 112. Liscum-Powell JL, Prinja AB, Morel JE, Lorence LJ Jr (2002) Finite element solution of the self-adjoint angular flux equation for coupled electron–photon transport. Nucl Sci Eng 142:270 113. Pautz SD, Adams ML (2002) An asymptotic study of discretized transport equations in the Fokker–Planck limit. Nucl Sci Eng 140:51 114. Pautz SD (2002) An algorithm for parallel SN sweeps on unstructured meshes. Nucl Sci Eng 140:111 115. Patton BW, Holloway JP (2002) Application of preconditioned GMRES to the numerical solution of the neutron transport equation. Ann Nucl Energy 29:109 116. Warsa JS, Wareing TA, Morel JE (2002) Fully consistent diffusion synthetic acceleration of linear discontinuous SN transport discretizations on unstructured tetrahedral meshes. Nucl Sci Eng 141:236 117. Aussourd C (2003) Styx: a multidimensional AMR SN scheme. Nucl Sci Eng 143:281 118. Haghighat A, Wagner JC (2003) Monte Carlo variance reduction with deterministic importance functions. Prog Nucl Energy 42:25 (review) 119. Morel JE, Wareing TA, Lowrie RB, Parsons DK (2003) Analysis of ray-effect mitigation techniques. Nucl Sci Eng 144:1
82
E.W. Larsen and J.E. Morel
120. Morel JE, Prinja AK, McGhee JM, Wareing TA, Franke BC (2003) A discretization scheme for the 3-D continuous-scattering operator. Trans Am Nucl Soc 89:360 121. Hanshaw HL, Larsen EW (2003) The explicit slope SN discretization method. In: Proc. topical meeting on mathematics and computations in nuclear applications, 6–10 April 2003. American Nuclear Society, Gatlinburg, Tennessee, 122. Hanshaw HL, Nowak PF, Larsen EW (2003) Stretched and filtered transport-synthetic acceleration of SN problems: part 1, homogeneous media. Trans Am Nucl Soc 89:354 123. Shashkov M, Wendroff B (2004) The repair paradigm and application to conservation laws. J Comp Phys 198:265 124. Warsa JS, Wareing TA, Morel JE (2004) Krylov iterative methods and the degraded effectiveness of diffusion synthetic acceleration for multidimensional SN calculations in problems with material discontin-uities. Nucl Sci Eng 147:218 125. Sanchez R, McCormick NJ (2004) Discrete ordinates solutions for highly forward peaked scattering. Nucl Sci Eng 147:249 126. Warsa JS, Wareing TA, Morel JE, McGhee JM, Lehoucq RB (2004) Krylov subspace iterations for deterministic k-eigenvalue calculations. Nucl Sci Eng 147:26
1
Advances in Discrete-Ordinates Methodology
83
Professor Edward Larsen was born in New York City in 1944. He attended Rensselaer Polytechnic Institute, graduating with a Ph.D. in Mathematics in 1971. His first position after graduate school was an assistant professorship in the Department of Mathematics at New York University. At the Courant Institute of Mathematical Sciences at NYU, he started a research program on neutron transport theory and made significant contributions to the applications of asymptotic expansions to this subject. In 1977, after 5 years at NYU and 1 year at the University of Delaware, he accepted a staff position in the Transport Theory Group at Los Alamos National Laboratory, where he investigated the numerical methods that underlie the discretization and solution strategies of the group’s large-scale deterministic neutron transport codes. During his 9 years at Los Alamos, Larsen’s research focus underwent a fundamental shift from analytical problems of mainly theoretical interest to computational problems of practical interest. At Los Alamos he made significant contributions to the development of methods for accelerating the iterative convergence of transport calculations, and to theoretically predicting the accuracy of numerical solutions in regions of large optical thickness. Several of these techniques are now commonplace in the computational transport community. In 1986, Larsen accepted a professorship in the Department of Nuclear Engineering at the University of Michigan. At Michigan, he has expanded his research in the development of advanced methods for numerically simulating radiation interactions with matter. His recent work includes photon and electron transport problems in medical physics, and merging deterministic and Monte Carlo methodologies. In 1988 he was made a Fellow of the American Nuclear Society; in 1994 he was awarded the US Department of Energy’s E.O. Lawrence Award for his innovative contributions to nuclear technology; in 1996 he won the Arthur Holly Compton Award of the American Nuclear Society in recognition of his outstanding contributions to education in the nuclear field; and in 1999 he won the Special Recognition Award from the Mathematics and Computations Division of the American Nuclear Society. Larsen is the author of over 150 scholarly journal articles on the mathematical analysis and computer simulation of radiation transport, and he has graduated 28 Ph.D. students who have worked in this technical area.
84
E.W. Larsen and J.E. Morel
Professor Jim E. Morel received a B.S. in mathematics from Louisiana State University in 1972, an M.S. in nuclear engineering from Louisiana State University in 1974, and a Ph.D. in nuclear engineering from the University of New Mexico in 1979. He began his career in 1974 as a nuclear research officer at the Air Force Weapons Laboratory. In 1976 he became a staff scientist at Sandia National Laboratories. In 1984 he became a staff member at Los Alamos National Laboratory, eventually serving as a group leader and scientific advisor. In 2005 he accepted a professorship in the Department of Nuclear Engineering at Texas A&M University. He has published over 140 refereed articles in journals and conference proceedings in the areas of neutron transport, coupled electron–photon transport, thermal radiation transport, and radiation-hydrodynamics.
Chapter 2
Second-Order Neutron Transport Methods E.E. Lewis
2.1 Introduction Among the approaches to obtaining numerical solutions for neutral particle transport problems, those classified as second-order or even-parity methods have found increased use in recent decades. First-order and second-order methods differ in a number of respects. Following discretization of the energy variable, invariably through some form of the multigroup approximation, the time-independent forms of both are differential in the spatial variable and integral in angle. They differ in that the more conventional first-order equation includes only first derivatives in the spatial variables, but requires solution over the entire angular domain. Conversely, the second-order form includes second derivatives but requires solution over one half of the angular domain. The two forms in turn lead to contrasting approaches to reducing the differential–integral equations to sets of linear equations and in the formulation of iterative methods suitable for the numerical solution of large engineering design problems. In what follows, we explore the state of methods used to solve the second-order transport equation, comparing them, where possible, to first-order methods. Historically, diffusion theory was the earliest and remains the most widely employed second-order computational method in reactor core design. Fine mesh spatial discretization has been performed through a variety of finite difference [1] and finite element techniques [2–4]. Along with the continuing advance of computing power, two events greatly influenced the development of methods that are emphasized in this work. The first was the translation in 1962 of Vladimirov’s variational formulation of the second-order form of the transport equation [5]. There followed increased interest in variational formulations and the systematic exploration of alternate variational principles and their interconnectedness [6]. The second was the rise of finite element methods, first in computational mechanics but then spreading to other fields [7–9]. The power of finite element methods largely supplanted
E.E. Lewis () Department of Mechanical Engineering, Northwestern University, Evanston, IL 60208, USA e-mail:
[email protected]
Y. Azmy and E. Sartori, Nuclear Computational Science: A Century in Review, c Springer Science+Business Media B.V. 2010 DOI 10.1007/978-90-481-3411-3 2,
85
86
E.E. Lewis
earlier finite difference techniques not only in computational mechanics, but also in a number of related fields as well. Since finite element methods in computational mechanics were closely associated with variational principles, the method’s application to transport problems was greatly facilitated by the variational framework that had been developed for the Boltzmann equation. The first applications of finite element methods to neutronics problems appeared in the early 1970s, and not surprisingly to the diffusion approximation [2–4]. But soon thereafter finite element methods appeared coupled with spherical harmonics [10–14], discrete ordinates [14–20], and also with finite elements in angle [22, 23]. Through the 1970s and into the 1980s, however, second-order transport methods were largely limited to stand-alone codes applied to model problems. At that time, computer memory restrictions continued to favor very effective marching algorithms with which first-order discrete ordinates methods were able to solve large engineering problems with very limited memory [24, 25]. It has only been with the rapid expansion of computer memories since that time that second-order methods have become a viable alternative for engineering calculation, and production codes based on the methods became viable for large-scale engineering computations [11–14, 17–21, 26, 27]. To present the current state of even-parity computational methods, we begin in Section 2.2 by deriving the second-order form of the linear Boltzmann equation from its first-order counterpart. We then examine the weak and variational forms of these equations that are used almost without exception as the points of departure for numerical approximation. For brevity and clarity, isotropic scattering is assumed. Section 2.3 reduces these forms to the diffusion approximation and then discretizes the spatial variables. The simplicity of diffusion theory provides a convenient vehicle for introducing finite element methods, and for establishing notation that then carries over for use in conjunction with more accurate angular approximations. Following the inclusion of anisotropic scattering into the even-parity formulation, Section 2.4 treats angular approximations: spherical harmonics, discrete ordinates as well as their simplified forms. The section then combines these angular approximations with finite elements in space to obtain fully discretized forms of the even-parity equation. Section 2.5 examines two variants of even-parity approaches: a hybrid or nodal method and an integral even-parity method. Section 2.6 then offers concluding remarks.
2.2 The Transport Equation The numerical algorithms of the following sections are based primarily on the variational form of the even-parity transport equation. We begin, however, with the standard first-order form of the equation and proceed to arrive at the variational principle. Along the way, we also present both the mixed and the second-order even- and odd-parity equations. Before proceeding to the variational formulation, we examine briefly the weak form of the even-parity equation and of the mixed
2
Second-Order Neutron Transport Methods
87
equations in their primal and dual weak forms. The even-parity weak form may be used interchangeably with the variational formulation. Mixed methods are less well developed but are included because of the future potential that they may hold. In what follows, we assume the time-independent form of the neutron transport equation in which a multigroup discretization of the energy variable has already been performed. Thus, we need to deal only with the energy-independent or withingroup form of the equation. For brevity, we also assume isotropic scattering in this section, reserving the introduction of anisotropic scattering to Section 2.4.
2.2.1 First- and Second-Order Forms The first-order form of the transport equation is [28] *
* O C .* O D s .* O r .* r ; / r / . r ; / r/
Z
* * O 0 / C s.* d0 . r ; r /; r 2 V; (2.1)
* O is the direction of neutron travel; and s where r is the spatial location, and are the macroscopic total and scattering cross sections, Rrespectively, s is the group source, and we normalize the angular integrals such that d D 1. Integrating over angle yields the neutron conservation equation *
* *
*
*
r J . r / C r '. r / D s. r /; Z
where *
O d . r ; /
(2.3)
O . r ; / O d
(2.4)
*
'. r / D and
Z
* *
J .r / D
(2.2)
*
are the scalar flux and current, respectively, and r D s
(2.5)
defining the even- and odd-parity flux components as ˙
O D 1= . r ; / 2 *
h
O ˙ . r ; / *
i * O . r ; /
(2.6)
O and O and add and subtract the results to obtain a We may evaluate Eq. (2.1) at set of coupled first-order equations *
O r
C
C
D s C s
(2.7)
88
E.E. Lewis
and
*
O r
C
C
D 0:
(2.8)
A pair of second-order equations may then be obtained. Eliminating Eqs. (2.7) and (2.8) yields the even-parity equation *
*
O r 1 O r while eliminating *
C *
O r O r 1
C
C
C
between
D s C s
(2.9)
yields the odd-parity equation
C
h i * * * O r. s /1 .s =/ r J s : D
These two equations contain only and current may be expressed as
C
and Z
D and
*
Z
J D
d
, respectively, since the scalar flux
C
O d
(2.10)
(2.11)
:
(2.12)
Finally, we may also write a second-order equation for the angular flux by first * O r s s/ and substituting into Eq. (2.1) solving Eq. (2.1) for D 1 . to obtain *
*
O r 1 O r
C
*
O r 1 /.s C s/: D .1
(2.13)
2.2.2 Weak Forms The starting point for most space–angle approximations is the weak form of the forgoing equations. To obtain the weak forms of the coupled equations (2.7) and (2.8) we multiply the two by even- and odd-parity test functions, Q C and Q , respectively, and integrate over angle and space: Z
Z dV
Z
Z dV
* O r d Q C
C
C
* O r d Q
C
C
s ' s D 0;
D 0:
(2.14) (2.15)
Applying the divergence theorem to the first term of the two equations yield Z
Z dV
i h * Q s C s/ O r Q C / C Q C C . d . Z Z O nO Q C D 0 C d d
(2.16)
2
Second-Order Neutron Transport Methods
and Z
Z dV
h * O r Q / d .
C
89
C Q
i
Z C
Z d
O nO Q d
C
D 0: (2.17)
where d indicates integration over the surface of the spatial domain, V , and nO is the outward normal from d. Two classes of methods arise from these equations [8, 19]. Equation (2.16) is the basis for primal methods, and Eqs. (2.16) and (2.15) taken together constitute the mixed-primal formulation. Alternately, Eq. (2.8) may be used to eliminate from the volume integral to obtain the second-order even-parity primal formulation: Z
Z
h * * O r Q C /. O r C/ C Q C d 1 . Z Z O nO Q C D 0 C d d
dV
C
Q s C s/ .
i
(2.18)
This even-parity result may also be obtained directly by multiplying Eq. (2.9) by Q C , integrating over space and angle, and then applying the divergence theorem. Equation (2.17) is the basis for dual methods. Taken together, Eqs. (2.17) and (2.14) constitute the mixed dual formulation. Alternately, Eq. (2.7) may be used to eliminate C from the volume integral in Eq. (2.17) to form the second-order oddparity dual formulation: Z
Z
*
*
O r Q /. O r d 1 .
/C Q Z i Z * * * * Q h 1 O nO Q . s / .r J / .s = / r J s C d d dV
C
D0 (2.19)
Multiplying Eq. (2.10) by Q , integrating over space and angle and then applying the divergence theorem also leads to this result. The surface terms in the above equations determine the form of the boundary conditions [9, 28]. Setting them equal to zero yields the homogeneous form of the * natural boundary conditions. Thus D 0, and C D 0 for r 2 are the natural boundary conditions, respectively, in the primal and dual formulations. Inhomogeneous natural conditions may be obtained by setting D , in the primal and C D C , in the dual formulation; hereafter, we employ the subscript to indicate a known function on the boundary. Conversely, if the boundary conditions specify C in the primal or in the dual formulations, they are essential; the surface integral is deleted, and they are imposed directly on the solution. Classically, it is the incoming angular flux that is known on the boundary. Hence C
O C . r ; / *
O . r ; / *
*
O D 0; * O < 0; r 2 ; nO
. r ; /
(2.20)
90
E.E. Lewis
* O D 0, * O < 0 is the and in particular the vacuum boundary . r ; / r 2 , nO homogeneous form of this condition. These conditions may be treated as modified natural conditions by first forming weighted residuals
Z 2
Z d
O nO Q ˙ . d
C
C
/
D0
(2.21)
O n O <0
for primal and dual formulations, respectively. By making use of angular parity arguments, it can be written Z Z Z Z Z O nO Q ˙ D d dj O nj d d O Q ˙ ˙ C 2 d Z O nO Q ˙ : d (2.22) O n O <0
By employing this expression to eliminate the surface integral on the left of Eq. (2.22) from the primal or dual formulations in Eq. (2.16) or (2.17), modified natural boundary conditions may be obtained for a known incoming flux distribu* O 0 / D .* O tion. Reflected boundary conditions, which have the form . r ; r ; /, 0 O O where and are the angles of incidence and reflection are essential since they apply directly to , with no contribution from its derivatives. Until quite recently, the vast majority of second-order transport work has applied to the even-parity form of the equation given by Eq. (2.9), whose weak form is given by Eq. (2.18). Thus, we focus our attention on it. With the incoming flux boundary conditions, Eq. (2.18) becomes Z Z h i * * O r Q C /. O r C / C Q C C . Q s C s/ dV d 1 . Z Z Z Z O nO Q C D 0; O nj d C d dj O Q C C C 2 d O n O <0
(2.23) where for vacuum boundary conditions we set D 0. For most computations, the problem domain is bounded by some combinations of reflected and vacuum boundaries. We indicate this by dividing the boundary as D r C . Then, instead of Eq. (2.23), we have Z Z h i * * O r Q C /. O r C / C Q C C . Q s C s/ dV d 1 . Z Z O nj O Q C C D 0; (2.24) C d dj
since no surface integral appears for r , where the essential reflected conditions are applied.
2
Second-Order Neutron Transport Methods
91
2.2.3 Variational Formulation Both coupled and second-order forms of the primal and dual formulations may also be formulated as variational principles, and surface terms are added to impose modified natural boundary conditions. Here, we restrict attention to the primal second-order form, since it was the original variational principal of Vladimirov [5] and is that upon which virtually all second-order methods are based. The variational principle corresponding to Eq. (2.24) derives from the requirement that the following functional be stationary with respect to variations in C : FŒ
C
Z D
Z dV
2 * O r C C d 1 Z Z O nj C d dj O C2 :
C2
s 2 2 s (2.25)
To illustrate, suppose we make the substitution C ! C C ı Q C where ı is a very small number, and Q C is an arbitrary deviation about the true solution C . We then have Z Z h i * C C O r C /2 C C2 s 2 2 s FŒ Cı D dV d 1 . (Z Z Z Z h * * C2 O nj O r Q C /. O r C/ C d dj O C 2ı dV d 1 .
C Q C .
C
Z
s s/ C
Z d
) O nj dj O QC
C
(Z Cı
2
Z dV
d
) Z Z 2 * 1 O C C2 2 C2 O Q Q Q Q : (2.26)
r C s C d dj nj O
For the functional to be stationary, the linear term in ı must vanish. This term, however, is identical to Eq. (2.24) derived from the weak form. Applying the divergence theorem to Eq. (2.24), or to the linear term in ı in Eq. (2.26), yields: Z
Z * * O r 1 O r dV d Q C Z Z * O nO Q C 1 O r C d d
C C s s Z Z C O nj C d dj O QC C
C
D 0: (2.27)
For this expression to hold, both the volume and surface integrals must vanish. Since Q C is an arbitrary function, the expression in parentheses must vanish. Thus, the even-parity transport equation given by Eq. (2.9) is satisfied. This is the
92
E.E. Lewis
Euler–Lagrange equation. On the vacuum boundary the two surface integral terms may be rewritten as Z
Z d
r
*
O nO Q C 1 O r d
Z C2
Z
*
O nO Q C . 1 O r d
d
C
C
C
/:
(2.28)
O n<0 O *
O r C and Since from Eqs. (2.8) and (2.6) we have D 1 D C * O r C , the first term in Eq. (2.28) yields the natural boundary condition 1 D 0. However, on reflected boundary condition we take Q C D 0 on r and impose the essential boundary condition on the solution. From the second term, the O < 0 on ) is modified natural boundary condition on the vacuum ( D 0, for nO satisfied.
2.3 The Discretized Diffusion Equation The diffusion approximation may be viewed as arising naturally as the lowestorder angular approximation to the even-parity equation. Indeed a straightforward exercise is to eliminate the angular variables from the weak or variational forms discussed in Section 2.2 by using the diffusion approximation. Here, a simple statement of the diffusion equation in variational form serves as a vehicle for introducing the finite element method. Finite element notation established for use in conjunction with the diffusion equation then allows for a more straightforward discretization of the spatial variable in conjunction with the higher order angular approximations treated in Section 2.4.
2.3.1 The Diffusion Formulation The diffusion approximation may be obtained by making the approximations R * C O J and then operating on Eqs. (2.7) and (2.8) with d , 3 R O respectively, to obtain and d, *
and
*
r J C r D s
(2.29)
* * 1= r
C J D 0: 3
(2.30)
2
Second-Order Neutron Transport Methods
93 *
The second-order form of the diffusion equation is obtained by eliminating J between Eqs. (2.29) and (2.30): *
*
r.3/1 r C . s / D s:
(2.31)
Alternately, we may obtain this equation directly from the even-parity transport equation, or from its variational form. Let C
:
(2.32)
R Then operating on Eq. (2.9) with d yields Eq. (2.31). The approximation C likewise reduces the even-parity functional F Œ C , given by Eq. (2.25), to its diffusion form Z Z * 2 1 2 1 1 F Œ D dV =3 r C r 2 s C =2 d 2 : (2.33)
The diffusion equation can be shown to be the Euler–Lagrange equation by letting Q where Q is an arbitrary deviation from the solution and requiring
! C ı , the linear term in ı to vanish: Z Z h i * * Q r / C r
Q Q s Q C 1= dV 1=3 1 .r /. (2.34) 2 d
D 0:
This is identical to the diffusion approximation’s weak form obtainable by inserting Eq. (2.32) into Eq. (2.27). If we apply the divergence theorem to Eq. (2.34), we obtain Z
* Z * * 1 1 Q dV r =3 r C r s C d Q 1=3 1 nO r
Z C
*
r
d Q 1=3 1 nO r C 1=2 D 0:
(2.35)
Q the quantity in parentheses in the first term must vanish, yielding For arbitrary , Eq. (2.31) as the Euler–Lagrange equation. The surface integral over r yields the *
reflected or zero current condition nO r D 0 as the natural boundary condition, and in diffusion theory this corresponds to the reflected boundary condition. (Recall, however, that for the transport equation more generally reflective boundary conditions are essential.) Requiring the quantity in parentheses in the last term to vanish yields the modified natural boundary condition; it approximates the vacuum condition extrapolating the flux to zero at a distance of 2=3 1 outside of .
94
E.E. Lewis
2.3.2 Finite Element Discretization We discretize the spatial variable employing the finite element method. For clarity, we illustrate using simple triangular elements in two-dimensional Cartesian geometry [7]. We first divide the problem domain into elemental volumes Ve : V D
X
Ve :
(2.36)
e
In two dimensions, these may appear, for example, as the triangles in Fig. 2.1. * Within each element, we approximate . r / as the scalar product of a vector of * polynomial trial functions, ne . r /, and unknown coefficient vector, Ÿe : *
*
. r / nTe . r /Ÿe ;
*
r 2 Ve :
(2.37)
Representative linear and quadratic trial functions for triangular elements, for * which the length of ne . r / is 3 for the linear element and 6 for the quadratic element,
Linear elements
Quadratic elements
Fig. 2.1 Triangular finite element grids 1
1
1
0
0 0 0 ne(r) linear
0
0
0 0
Fig. 2.2 Triangular finite element trial functions
0 ne(r) quadratic
0
2
Second-Order Neutron Transport Methods
95
respectively, are shown in Fig. 2.2. (These and other classes of hfinite elements are i * discussed in detail elsewhere [7]). They have the properties that ne . r i / D ıij so j
*
that the components of Ÿe are equal to at r i , i D 1; : : : , 3 or 6, the mesh points shown in Fig 2.2. Moreover, if the same sets of trial functions are used in adjoining elements, the flux approximation will be continuous across the interfaces. Provided continuity is maintained, the functional given by Eq. (2.33) may be written as the sum of elemental contributions. X X F ŒŸe D ŸTe Ae Ÿe 2 ŸTe qe ; (2.38) e
e
where the elemental matrices involve integrals of the known trial functions, Ae D 1=3e1
Z
Z Z * * dV rne rnTe C re dV ne nTe C 1=2 dne nTe ;
e
e
(2.39)
ve
with the last term present only where one or more of the element surfaces lie along a vacuum boundary; the source term is given by Z qe D
dV ne s:
(2.40)
e
We may formally assemble the global functional from its elemental contributions as follows. The continuity of the trial functions across element interfaces allows the elemental unknowns to be mapped on to a globally numbered vector of N unknowns: Ÿe D „© Ÿ:
(2.41)
where „e is 3 N or 6 N Boolean transformation matrices. Inserting this equation into Eq. (2.38), we obtain the algebraic functional F ŒŸ D ŸT AŸ 2ŸT q; where AD
X
„Te Ae „e ;
(2.42)
(2.43)
e
and qD
X
„Te qe :
(2.44)
e
We obtain a set of linear equations for Ÿ by requiring the reduced functional Q Hence F ŒŸ to be stationary with respect to variations: Ÿ ! Ÿ C ı Ÿ. h i Q F Ÿ C ı ŸQ T D .ŸT AŸ 2ŸT q/ C 2ı ŸQ T .AŸ q/ C ı 2 ŸQ T AŸ;
(2.45)
96
E.E. Lewis
and since the linear terms in ı must vanish we have AŸ D q:
(2.46)
Here, A is a symmetric matrix. Provided a consistent numbering scheme has been applied to the mesh points the matrix will also be banded. Solution may be obtained using any number of direct methods for smaller problems, or iterative techniques such as preconditioned conjugate gradients for large problems [29–31].
2.4 The Discretized Transport Equation In this section, we first write Eq. (2.1) with anisotropic scattering included, and then derive the corresponding form of the even-parity equation as well as stating the variational principle that provides the starting point for numerical approximation. We then derive spherical harmonic and discrete ordinates angular approximations (referred to frequently as Pn and Sn methods, respectively) along with their simplified spherical harmonic and discrete ordinates (SPn and SSn) counterparts. For each approximation, the result is a coupled set of second-order partial differential equations. The sets differ only in the structure of their coefficient matrices. Thus, we can apply the finite element methods discussed in Section 2.3 to discretize the spatial variables for all of the approximations simultaneously.
2.4.1 Anisotropic Scattering With anisotropic scattering included, the form of the second-order equation becomes more complex [15, 17, 32]. To obtain it, we begin with the first-order form of the equation: *
O r
O C * r; r
*
Z * O O O0 r ; D d0 s r ;
*
O 0 Cs * O ; r; r;
*
(2.47) 0 O O where s r ; is the macroscopic differential scattering cross section. In the multigroup approximation the group source is given by
*
X Z * O O O0 s r; D d0 sgg0 r ;
*
g0
O 0 C Sfg * r; r
*
(2.48)
g 0 ¤g
where g designates the group under consideration, sgg0 represents scattering from group g0 to g, and Sfg includes the isotropic fission and external sources.
2
Second-Order Neutron Transport Methods
97
O and O and add and subtract the results to We may evaluate Eq. (2.47) at obtain a pair of coupled first-order equations *
O r
where
and
O C * r; r
*
˙
Z O D d0 s˙ * O O0 r; r; * O ; Cs ˙ r ;
*
˙
O0 r;
*
(2.49)
i h * O O 0 / D 1= s * O O 0 ˙ s * O O0 r ; r ; s˙ . r ; 2
(2.50)
h i * O D 1= s * O ˙s * O : s˙ r ; r; r ; 2
(2.51)
Here, s˙ and s ˙ indicate the even- and odd-parity components of the anisotropic scattering cross section and source, respectively. We next express the anisotropic scattering cross sections as expansions in an orthonormal set of spherical harmonics [28, 33] O D Clm P m ./ Ylm ./ l
cos.m!/ ; sin.m!/
l D 0; 1; 2; : : : ;
jmj D 0; 1; 2; : : : ; l (2.52)
where Plm ./ are the associated Legendre polynomials, and the Clm are chosen R O l 0 m0 ./ O D ıll0 ımm0 ; we follow the convention that m 0 such that dYlm ./Y * O O 0 / as signifies the cosine series and m < 0 the sine series. We first write s˙ . r ; expansions in Legendre polynomials O O 0/ D s˙ . r ; *
X l
* O O0 : l r Pl
(2.53)
even odd
The Legendre addition theorem [33] O O 0/ D Pl .
l X
O lm . O 0/ Ylm ./Y
(2.54)
mDl
then allows Eq. (2.53) to be written in the convenient vector form * O O 0 / D yT˙ ./† O ˙ .* O 0 /; r /y˙ . s˙ . r ;
(2.55)
where we have formed vectors of the even- and odd-parity spherical harmonics O D ŒY00 ; Y22 ; Y21 ; Y20 ; Y21 ; Y22 ; Y44 ; ; yTC ./ O D ŒY11 ; Y10 ; Y11 ; Y33 ; Y32 ; Y31 ; Y30 ; Y31 ; yT ./
(2.56) (2.57)
98
E.E. Lewis
R R O T ./ O D I and dy˙./y O T ./ O D 0. The diagonal matrices with dy˙ ./y ˙ are defined by † C D diagŒ0 ; 2 ; 2 ; 2 ; 2 ; 2 ; 4 ; ;
(2.58)
† D diagŒ1 ; 1 ; 1 ; 3 ; 3 ; 3 ; 3 ; :
(2.59)
The coupled pair of even- and odd-parity equations given by Eq. (2.49) then becomes *
O r
O C . r / C . r ; / O . r ; / Z O C .* O 0/ D yTC ./† r / d0 yC .
*
*
*
C
O 0 / C s C . r ; /; O .r ; *
*
(2.60)
and *
* * O C .* O . r ; / r / . r ; / Z O .* O 0 / .* O 0 / C s .* O D yT ./† r / d0 y . r ; r ; /:
O r
C
(2.61)
To obtain the even-parity equation, we employ Eq. (2.61) to obtain the odd-parity moments in terms of the even-parity moments: Z Z * O ./ O D 1 s 1 r dy O ./ O C ./; O ŒI 1 † dy ./ (2.62) where we define the even- and odd-parity group-source moments as Z ˙ * O ˙ .* O s . r / D dy˙ ./s r ; /:
(2.63)
Using Eq. (2.62) to eliminate the integral of on the right side of Eq. (2.61), we may solve for in terms of C and the group-source terms:
*
O r O D 1 ./
O C 1 s ./ O ./ Z * O Q O 0 / O0r d0 y . 2 yT ./†
where
C
C
Q s ; (2.64) O 0 / C 2 yT ./ O † .
Q ˙ D † ˙ ŒI 1 † ˙ 1 : †
(2.65)
Finally, substituting Eq. (2.64) into Eq. (2.60) we obtain the second-order evenparity equation; Z 0 0 C O0 C O C C D yT y . / . / C s † d C C C Z * 1 T 1 Q 0 0 O0 * C O0 1 Q O O C r y † d y . / r . / .I C † /s ; (2.66)
*
*
O r O r 1
C
2
Second-Order Neutron Transport Methods
99
where we have also expanded the group source in harmonic moments sCD
X
g 0 ¤g
sD
X
Z † Cgg0
O dyC./
C O g 0 ./
C sfg ;
(2.67)
Z 1 * 1 O ./ O sg 0 r dy †gg0 g1 0 I g 0 † g 0 g 0
: (2.68)
C O g 0 ./
g 0 ¤g
Comparing Eq. (2.9) to Eq. (2.66), it is apparent that the second-order forms of the equation appear to be considerably more complex than the first-order form when anisotropic scattering is included. The weak form of Eq. (2.66) may be obtained by integrating over angle and volume and then applying the divergence theorem: (Z
Z
h * * O r Q C /. O r d 1 .
dV
Z
dyC Q C
Z
T
C
/ C QC
Z †C
*
O r QC dy
dyC
T
Q †
C
C
i
Z
dyC Q
Z
*
O r dy C ) T Z * C 2 1 Q /s O r Q .I C † dy Z
Z
C
d
2
O nO Q C d
C
T
sC
D 0;
(2.69)
where is given by Eq. (2.64). Alternately, a variational principle may be written, which yields Eq. (2.66) as the Euler–Lagrange equation. Variational formulation of the within-group problem is FŒ
C
Z D
(Z dV
h * O r d 1 .
Z dyC Z
C 2
T
C
*
i
Z †C
O r dy
C2
/ C
dyC
T
Q †
C
Z dyC
Z
*
O r dy C ) T Z * C 2 1 Q /s : O r 2 .I C † dy C
The natural boundary condition remains Eq. (2.64).
2
D 0, but where
C
C
T 2sC
(2.70)
is defined by
100
E.E. Lewis
2.4.2 Angular Approximations We next use Eq. (2.70) as the point of departure for deriving spherical harmonics and discrete ordinates approximations.
2.4.2.1 Spherical Harmonics Expansions The spherical harmonics approximations may be expressed as the scalar product of O is given by Eq. (2.56) a row and a column vector, where yC ./ C
* O yTC ./§ O C .* . r ; / r /:
(2.71)
O we then have the space-dependent coeffiFrom the orthonormality of the yC ./, cients to be Z * O C .* O § C . r / D dyC./ r ; /: (2.72) Likewise, we may write C
Z
*
Uk 0 rk 0 § . r / D Z
where Uk D
*
O O r dy ./
C
* O . r ; /;
O kO y ./y O TC ./: O d
(2.73)
(2.74)
and hereafter repeated k or k 0 in the same term indicates summation over the spatial directions. We next substitute Eq. (2.71) into the functional given by Eq. (2.70) to obtain: F Τ C D
Z
n Q /.Uk 0 rk 0 § C / dV .Uk rk § C /T 1 .I C 1 †
o Q /s ; C§ CT .I 1 † C /§ C 2§ CT sC 2.rk § C /T 2 .I C 1 †
(2.75) O to obtain the identity where we have used the orthonormal properties of yC ./ Z O kO O kO 0 yC ./y O TC ./ O UTk Uk 0 D d (2.76) and thus simplify the streaming term in the reduced functional. Requiring the func* tional to be stationary with respect to variations in § C . r / yields the spherical harmonics approximation as the Euler–Lagrange equation: Q Uk 0 rk 0 § C C .I † C /§ C rk UTk 1 ŒI C 1 † Q /s : D sC rk UT 1 .I C 1 † k
(2.77)
2
Second-Order Neutron Transport Methods
101
2.4.2.2 Discrete Ordinates Approximations The discrete ordinates equation may be obtained from the Functional, Eq. (2.70), by O n and replacing integrals over evaluating all the quantities at discrete directions angle with an appropriate quadrature approximation Z X * * O O n /; d f . r ; / wn f . r ; (2.78) n
O n are the discrete ordinates directions. The evenwhere wn are the weights and * O n /. Thus, parity flux is then evaluated in the discrete ordinates directions by C . r ; to reduce the functional we create a vector of the even-parity flux approximated in the discrete ordinates directions: i h T * * C * O O2 ; C * O 3 ; ; C * O n ; : §C . r / r ; 1 ; C r ; r; r; (2.79) To apply the quadrature rule of Eq. (2.78) to the functional, we also define two diagonal matrices h i O O O ; O O 1 k; O 2 k; O 3 k; O n k; k D diag (2.80) and W D diagŒw1 ; w2 ; w3 ; ; wn ; :
(2.81)
O column vectors evaluated in the We also employ matrices made up of the y˙ ./ ordinates directions: h i O 1 /; y˙ . O 2 /; y˙ . O 3 /; ; y˙ . O n /; : Y˙ D y˙ . (2.82) Utilizing the angular quadrature approximation and Eqs. (2.79) through (2.82), the Functional reduces to the form Z n C Q Y W .k 0 rk 0 § C / F Œ§ D dV .k rk § C /T 1 W I C 1 YT † C§ CT W I 1 YTC † C YC W § C 2§ CT WYTC sC o Q /s ; (2.83) 2.k rk § C /T WYT 2 .I C 1 † where the group sources are obtained by applying the quadrature formula to C Eqs. (2.67) and (2.68). If we require F Œ§ C to be stationary by taking F Œ§ C Cı §Q and requiring the linear term in ı to vanish, we obtain an Euler–Lagrange equation h i Q Y W k 0 rk 0 § C C I YT † C YC W § C rk k 1 I C 1 YT † C Q /s ; D YTC sC k rk 1 YT .I C 1 † which is just the even-parity form of the discrete ordinates equations.
(2.84)
102
E.E. Lewis
Both the spherical harmonics and discrete ordinates approximations can be written in forms that are identical except for the coefficient matrices. The variational principle has the form F §C D
Z dV
˚
Hkk0 rk 0 § C C § CT K§ C 2§ CT GC sC 2.rk § C /T Gk s ; rk § C
T
(2.85)
and the corresponding even-parity equations are rk Hkk0 rk 0 § C C K§ C D GC sC rk Gk s :
(2.86)
The coefficient matrices are given in Table 2.1, along with those for the simplified approximations treated in the following section. Thus far, the derivations hold for three dimensions. For one or two dimensions they may be appropriately reduced by eliminating terms in the spherical harmonics or discrete ordinates expansions. In spherical harmonics all terms with m < 0 for x–y geometry and all terms with m ¤ 0 for plane geometry are eliminated from Eqs. (2.71) through (2.77). The duplicate directions are likewise eliminated from discrete ordinates approximations (polar axis in x direction, and azimuthal angle measured from y direction k D 1, 2, 3 for x; y, and z axes). The plane-geometry spherical harmonics equation, in which the forgoing matrices are expressed in terms of Legendre polynomials, is particularly relevant here as the basis for the simplified spherical harmonics approximation.
Table 2.1 Uniform notation for Eqs. (2.84) and (2.85) Pn
Hkk0
K
Q Uk 0 UTk 1 ŒI C 1 †
GC
I † C
I
Gk UTk 1 Q / .I C 1 †
Sn
k 1 ŒW C
SPn
1
i
Q Y W WYT †
W WYTC † C YC W
YTC
k 1 WYT
I † C
I
UT0 1
k 0
Q UT ıkk0 U0 1 ŒI C 1 † 0
Q / .I C 1 †
Q / .I C 1 † SSn k 1 ŒW
i Q Y W k 0 ıkk0 C 1 WYT †
W WYTC † C YC W
YTC
k 1 WYT
Q / .I C 1 †
2
Second-Order Neutron Transport Methods
103
2.4.2.3 Simplified Angular Approximations Cross-derivative terms rk . /rk 0 with k ¤ k 0 appear in both the spherical harmonics and discrete ordinates approximations. Eliminating them greatly simplifies the spatial discretization. The widely employed simplified spherical harmonics, or SPn, approximation provides such simplification and reduces the number of coupled differential equations that must be solved, often without substantial loss of accuracy [34–41]. We obtain the SPn equations by taking the one-dimensional form of the Pn equations, given by Eq. (2.77) i @ T 1 h Q U1 @ § C C .I † C /§ C U1 I C 1 † @x @x @ T 1 C 1 Q U1 I C † s Ds @x and replacing the derivatives with gradient and divergence operators
h i Q U1 rk § C C .I † C /§ C rk UT1 1 I C 1 † X Q s : D sC rk UT1 1 I C 1 †
(2.87)
(2.88)
k
The resulting equation may also be written in variational form and expressed as coupled partial differential equations; the coefficient matrices are included in Table 2.1. More importantly, Eq. (2.88) can be written as coupled sets of diffusion equations, allowing highly developed diffusion computational methods to be used to obtain solutions with great computational efficiency. The simplified discrete ordinates approximation is much more recent [42], and to date not widely employed. It simply eliminates the cross-derivative terms from Eq. (2.84) by letting h h i i Q Y W k 0 ! k 1 I C 1 YT † Q k 1 I C 1 YT † Y W k 0 ıkk0 (2.89) to yield h i Q Y W k rk § C C I YTC † C YC W § C rk k 1 I C 1 YT † Q /s : D YTC sC k rk 1 YT .I C 1 †
(2.90)
The SSn equations may also be written as coupled sets of partial differential equations as indicated in Table 2.1. Before proceeding, it is instructive to briefly compare Pn and Sn solutions for which the spatial discretization error is insignificant. Figure 2.3 shows results for the widely used Azmy benchmark [43], which consists of a fixed source located in a highly absorbing medium. The flux plots along the surface far from the source accentuate errors in angular approximations. The P11 solution is converged in angle, and may be used as a reference.
Relative Flux Magnitude
104
E.E. Lewis 6.00 5.75 5.50 5.25 5.00 4.75 4.50 4.25 4.00 3.75 3.50 3.25 3.00 2.75 2.50 2.25 2.00 1.75 1.50 1.25 1.00 0.75 0.50 0.25 0.00
VARIANT P1 VARIANT P3 VARIANT P5 VARIANT P11 TWODANT S8 TWODANT S16
0
1
2
3
4
5
6
7
8
9
10
Y Position (cm)
Fig. 2.3 Flux plots from Sn and Pn calculations
Note that the Sn solutions oscillate about the reference demonstrating the wellknown ray effects. Low order Pn solutions appear more physically plausible, since they are smooth curves and their errors tend to be either systematically low (as in this problem) or high. For this problem, SPn solutions, which are not shown, closely track the corresponding Pn solutions. Since SPn has fewer angular degrees of freedom, computational algorithms for SPn solutions run faster and use less memory than those for the same level Pn approximation. Unlike discrete ordinates or spherical harmonics methods, however, SPn calculations do not converge to the true solution as n is increased. In many cases, however, the residual errors are acceptably small. The circumstances under which SPn solutions may be expected to reasonably approximate the transport equation are well examined elsewhere [34, 35, 39, 40].
2.4.3 Spatial Discretization We spatially discretize the foregoing angular approximations using the same finite element techniques employed in Section 2.3. Thus, we begin by subdividing the problem domain into a finite number of volume elements. V D
X e
Ve :
(2.91)
2
Second-Order Neutron Transport Methods
105
Then, provided we consider only spatial trial functions that are continuous across element interfaces, we may write the functional given by Eq. (2.85) as a superposition of elemental contributions: Z n X T F §C D dV rk § C Hekk0 rk 0 § C C § CT Ke § C e
e
2§
CT
o T GeC sC 2 rk § C Gek s :
(2.92)
Within each element, we represent the spatial distribution trial functions, designated * by the vector ne . r /, and a vector of unknown magnitudes Ÿe . The even-parity flux moments become * * * § C . r / D I ˝ nTe . r /Ÿe ; r 2 Ve : (2.93) Then, using the properties of the tensor product, we may write § CT Ke § C D .I ˝ nTe Ÿe /T Ke I ˝ nTe Ÿe D ŸTe I ˝ ne Ke ˝ nTe Ÿe D ŸTe Ke ˝ ne nTe Ÿe : (2.94) Similarly, it follows that T rk § C Hekk0 rk 0 § C D ŸTe Hekk0 ˝ .rk ne / rk 0 nTe Ÿe :
(2.95)
The functional given by Eq. (2.92) reduces to a superposition of subelement contributions: X X F ŒŸe D ŸTe Ae Ÿe 2 ŸTe qe ; (2.96) e
e
where the coefficient matrices are given in terms of the known trial functions of space and angle Z Ae D
Hekk0
˝
dV .rk ne / r
k0
nTe
Z CK ˝ e
e
dV ne nTe :
(2.97)
e
Here, the superscripts on Hekk0 and Ke indicate that the cross sections are evaluated for element Ve . The source term is Z Z qe D GeC dV sC ˝ ne C Gek dV s ˝ rk ne : (2.98) e
e
With piecewise polynomial trial functions for the finite elements, the components of Ÿe are just the approximate values of § C at the element vertices [7]. Since these trial functions must be continuous across element interfaces, the process for assembling the elemental contributions and determining a set of linear equations is completely analogous to that of Eqs. (2.38) through (2.46): The components of Ÿe corresponding to the same physical location on either side of a subelement must have the same value. This continuity condition is enforced by creating a Boolean
106
E.E. Lewis
matrix „e for each subelement that maps the Ÿe onto Ÿ, a node wide vector of coefficients: Ÿe D „e Ÿ. This transformation allows us to write the discretized functional in the form of Eq. (2.38). The set of algebraic equations is again obtained by requiring the discretized functional to be stationary. The result, once again, is a set of equations with the form AŸ D q, but where the elemental contributions to A and q are now given by Eqs. (2.97) and (2.98). Regardless of the angular approximation employed, the A matrix is sparse and symmetric. For smaller problems, direct methods may be used for solving the matrix problem. For large problems, an array of sparse matrix iterative techniques may be employed [29–31].
2.5 Hybrid and Integral Methods Thus far, we have examined a number of angular approximations to the even-parity transport equations coupled with the use of finite elements in space. There are, of course, other possibilities for the discretization of the second-order equations. Here, we briefly examine two of these, the variational nodal method [11, 13, 32, 41] and an integral method [44], and then discuss recent work in combining nodal, finite element, and integral methods.
2.5.1 A Variational Nodal Method The variational forms of the even-parity equation that we have utilized have incoming flux, vacuum, or reflected boundary conditions. Suppose, however, that we create a functional that is easily shown to be equivalent to the weighted residual, Eq. (2.69), which has an inhomogeneous natural boundary condition on the oddparity flux. We simply append the following surface term to the functional given by Eq. (2.70): Z Z C C O C : F Œ ; D F Œ C 2 d dnO (2.99)
The subscript is appended to denote that the problem domain is a volume V bounded by . By requiring this functional to be stationary with respect to variations in C within V we obtain the Euler–Lagrange equation (2.66). Variations on the boundary, , yield the relationship, Eq. (2.64), giving in terms of C . Thus, we may consider solving the transport problem within V , assuming that the odd-parity flux is known at the boundary. In the finite element literature the following would be classified as a hybrid element approach [7, 8]. Suppose we consider V to be the volume of one “node” of the problem domain, and the volume of the entire domain to be the sum of the nodes’ volumes:
2
Second-Order Neutron Transport Methods
107
V D
X
V ;
(2.100)
Then, we may write the functional for the entire domain as FŒ
C
;
D
X
F Œ
C
;
;
(2.101)
where now appears as a Lagrange multiplier at the nodal interfaces. Requiring F Œ C ; to be stationary with respect to variations in C within V , just yields Eq. (2.66) within each V . Requiring it to be stationary with respect to ! C ı Q yields the condition Z
Z d
O dnO
C
0C
Q D 0;
(2.102)
where nO and nO 0 D nO are the outward normal vectors from nodes V and V0 on either side of . Thus, C must be continuous across the interfaces. In the neutronics literature, a nodal method is generally defined as one in which neutron conservation is enforced for each node or subregion V [45]. The variational method described here R R may be shown to meet this condition as follows: suppose we let N D V1 dV d C be the scalar flux averaged over node V . We may then R R write C D N C 0C where dV d 0C D 0 and substitute this expression into Eq. (2.99) to obtain F Œ
C
;
D . s /V N 2 2V N sN C 2 N C terms independent of N ;
Z
*
d nO J
(2.103)
where sN is the group source averaged over V and angle. If we require the functional to be stationary with respect to variations N ! N C ı QN we obtain the nodal balance condition Z * N (2.104) . s /V C d nO J D V sN :
This enforcement of neutron conservation over each V allows larger nodes to be used than typical in the case of fine mesh methods that do not enforce such balance. To proceed, we apply spherical harmonics, discrete ordinates, or one of the simplified angular approximations given in Section 2.4 to F Œ C given by Eq. (2.99). We must consistently discretize the surface term. We first divide the surface into a number of flat surfaces, . In the spherical harmonics approximation, we let
* * * O yT ./§ O . r ; / . r /; r 2 :
(2.105)
O to indicate that the odd-parity spherical Here, the subscript is attached to y ./ harmonics are rotated such that the polar axis is perpendicular to the surface. In
108
E.E. Lewis
O this is necessary to obtain the correct addition, the Yll are deleted from y ./; number of linearly independent coupling conditions [14]. Employing Eqs. (2.71) and (2.105), we get Z
Z d
O dnO
C
D
XZ
d§ CT C § ;
(2.106)
R O C yT , while for the SPn approximation C D UT . with C D dnO y 1 For discrete ordinates, we approximate the odd-parity flux on by using Eqs. (2.79) through (2.81) with *
§ T . r /
h
* O 1 /; .r ;
* O 2 /; .r ;
* O 3 /; ; .r ;
i * O n /; .r ; (2.107)
and h i O 1 nO ; O 2 nO ; O 3 nO ; ; O n nO ; : D diag
(2.108)
The result is again Eq. (2.106), but with C D W ; this equality remains unchanged in the SSn approximation. Next, we rewrite the reduced form of the functional given by Eq. (2.99) with the angularly discretized variables discretized in a form similar to Eq. (2.92): F § C ; § D
Z
Hkk0 rk 0 § C C § CT K§ C 2§ CT GC sC XZ 2.rk § C /T Gk s C 2 d § CT C § (2.109) : dV
˚
rk § C
T
Within the node, we approximate the spatial dependence of the even-parity flux by a * vector f. r / containing the orthonormal components of a complete polynomial, and on the interfaces the spatial dependence of the odd-parity flux is given by a second * set of orthonormal polynomials, h . r /, defined only on the interface. Thus, *
*
§ C . r / D I ˝ f T . r /Ÿ
*
r 2 V
(2.110)
and *
*
*
T § . r / D I ˝ h . r / r 2 ;
(2.111)
where Ÿ and are the unknown coefficients. The reduced functional then becomes F ŒŸ; D ŸT AŸ 2ŸT q C 2ŸT
X
M ;
(2.112)
2
Second-Order Neutron Transport Methods
109
where Z Z A D Hkk0 ˝ dV .rk f/ rk 0 f T C K ˝ dV f f T ; Z Z C q D GC dV s ˝ f C Gk dV s ˝ rk f
(2.113) (2.114)
Z
and M D C ˝
dfhT :
(2.115)
Requiring Eq. (2.112) to be stationary with respect to variations in Ÿ yields AŸ D q
X
M ;
(2.116)
or equivalently
Ÿ D A1 q A1 M; (2.117) T T T where M D ŒM1 ; M2 ; : : : and D 1 ; 2 ; : : : . To obtain the interface continuity conditions we first note that F ŒŸ; D
X
F ŒŸ;
(2.118)
Requiring that the functional be stationary with respect to the variations ! C ı Q , we obtain the condition X ŸT M Q D 0 (2.119)
where the sum is now over all interfaces in the problem domain. This condition can be met for arbitrary Q only if the even-parity moments ® D MT Ÿ
(2.120)
are continuous across the interfaces. Thus for each node, we may combine this expression with Eq. (2.117) to express the even-parity interface moments in terms of the node source and the odd-parity interface moments ® D MT A1 q MT A1 M¦:
(2.121)
Letting ®T D ®T1 ; ®T2 ; : : : ; and therefore ® D MT Ÿ, we may write for each node ® D MT A1 q MT A1 M¦:
(2.122)
110
E.E. Lewis
A convenient way to solve these equations is to convert them to response matrix form. We make a linear transformation of variables j˙ D 1=4® ˙ 1=2¦;
(2.123)
which in the diffusion approximation correspond to the partial currents. We then may rewrite Eq. (2.122) in response matrix form jC D Rj C Bq;
(2.124)
i1 h i h 1= MT A1 M I where the matrices are defined by R D 1=2MT A1 M C I 2 i1 h T 1 T 1 1 1 =2M A . and B D =2M A M C I Red-black iteration or other methods, then, may be applied to the solution of the resulting equations. Partitioning algorithms, over-relaxation methods, and other techniques have also been developed to accelerate the iterative solutions of the systems of nodal response matrix equations [46, 47].
2.5.2 An Even-Parity Integral Method The functional given by Eq. (2.25) may also be used to derive an even-parity integral transport method [28, 44]. The treatment is restricted to isotropic scattering, and we also eliminate the surface term from Eq. (2.25) by assuming essential boundary conditions. To obtain the integral method, we reverse the discretization order used in the preceding sections and first discretize the spatial variables, using finite elements, while leaving the unknowns functions of angle. Dividing the problem domain into elements, Eq. (2.25) reduces to F
C
D
XZ e
e
Z dV
h d e1 k rk
C 2
C e
C2
i se 2 2 s :
(2.125) * Then, employing the same finite element trial functions, ne . r /, used in Sections 2.4 and 2.5, we get * C * O O . r ; / D nTe . r /®e ./; (2.126) and correspondingly
*
*
. r / D nTe . r /¥e :
(2.127)
O and ¥e approximate the even-parity angular flux and the Here, the vectors ®e ./ scalar flux, respectively, at the spatial mesh points. Combining these approximations with Eq. (2.125) then yields
2
Second-Order Neutron Transport Methods
F Ψe D
X Z
111
Z T O 1 d®e ./ k k 0 e dV .rk ne / rk 0 nTe e
e
Z C e e
Z O ¥Te se dV ne nTe ¥e 2¥Te se dV ne nTe ®e ./
(2.128)
e
R where se D e dV ne s. As in Eqs. (2.38) through (2.46), we assemble the elemental contributions into global vectors of angularly dependent coefficients through the O D „e ®./ O and ¥e D „e ¥. The reduced use of the Boolean transformations ®e ./ functional is then Z O I ./®. O O ¥Te BI ¥ 2®T sI ; F Œ® D d®T ./A / (2.129) where O D k k 0 AI ./ C BI D
X
X e
X e
„Te e1 Z
„Te e
e
e
Z
„Te se
e
Z e
dV .rk ne / rk 0 nTe „e
dV ne nTe „e ;
dV ne nTe „e ;
and sI D
X
(2.130) (2.131)
„Te se :
(2.132)
e
O then yields Requiring Eq. (2.129) to be stationary with regard to variations in ®./ the Euler–Lagrange equation O O D BI ¥ C sI : AI ./®. /
(2.133)
We may obtain scalar flux equations by first inverting A and then integrating over angle. We obtain
Z I
O dA1 I ./BI
Z ¥D
O dA1 I ./sI :
(2.134)
This equation has a number of similarities to those obtained using collision probability theory [28]. The dimension of the problem is only that of the number of spatial nodes, but the coefficient matrix on the left is both dense and nonsymmetric. MoreO represents an intractable task, numerical over, since analytical inversion of AI ./ quadrature must be used, inviting comparison to the ray tracing methods used in integral transport schemes. Treating curved boundaries and other irregular features is straightforward using isoparametric finite elements. Moreover, the truncation errors
112
E.E. Lewis
are order h2 for the lowest-order finite elements (triangles with piecewise linear trial functions), compared to h for collision probability methods, allowing coarser element meshes to be used.
2.5.3 Combined Methods The variational nodal method as described in Section 2.5.1 is applicable to homogenous nodes. However, by using finite element trial functions within the nodes, heterogeneous nodes may also be treated. Recently, this has been accomplished in what is called the subelement nodal method and applied to reactor problems in which each node corresponds to one pin-cell [48]. Likewise, the integral method described in Section 2.5.2 may be placed within the nodal framework, and this too has resulted in the ability to treat heterogeneous nodes, often times with substantial savings in memory over what is required using the corresponding differential method [49].
2.6 Discussion The foregoing sections attempt to provide an overview of the second-order methods that are finding increased use in neutron transport calculations. The focus has been placed upon the discretization of the transport equation rather than on the algorithms that are employed to solve the resulting sets of linear equations. The vast literature on iterative methods used to solve large sets of sparse matrix equations, and in particular the intense efforts being made to effectively utilize parallel computing to speed such computations, lies beyond the scope of this overview. In addition, the foregoing exposition has been limited to the linear neutron transport equation. No attempt has been made to include recent work in which second-order transport methods are combined with computational fluid mechanics or other techniques to include nonlinear thermal-hydraulic feedback mechanisms into neutronics calculations. Likewise, the scope of this work has not included techniques needed specifically in treating the unique characteristics of thermal radiation or of electron transport problems. Work in progress seems destined to expand significantly the value of secondorder methods. In particular, interest in the primal and dual coupled forms of the transport equations is beginning to break down the sharp distinction between firstand second-order methods. Perhaps the greatest challenge facing the expanded use of second-order methods, however, is in the treatment of void regions. Since the total cross section appears in the dominator of the even-parity equations, they cannot be applied directly to vacuum regions. Rather, they must be coupled with ray tracing or other techniques in situations, where neutron streaming in voids must be incorporated into second-order computations.
2
Second-Order Neutron Transport Methods
113
References 1. HASSITT (1968) Diffusion theory in two and three dimensions. In: Greenspan H, Kelber CN, Okrent D (eds) Computing methods in reactor physics, Chap. 2. Gordon & Breach, New York 2. Semenza LA, Lewis EE, Rossow EC (1972) Application of the finite element method to the multigroup neutron diffusion equation. Nucl Sci Eng 47:302 3. Hansen KF, Kang CM (1975) Finite element methods in reactor physics analysis. Adv Nucl Sci Tech 8:173 4. Kavenoky A, Lautard JJ (1977) A finite element depletion diffusion calculations method with space-dependent cross-sections. Nucl Sci Eng 64:563 5. Vladimirov VS (1961) Mathematical problems in the one-velocity theory of particle transport, Atomic Energy of Canada Ltd., Ontario (1963) (trans: V. A. Steklov Mathematical Institute) 61. 6. Kaplan S, Davis JA (1967) Canonical and involutory transformations of the variational problems of transport theory. Nucl Sci Eng 28:166–176 7. Zienkiewicz OC (1989) The finite element method, 4th edn. McGraw-Hill, London 8. Brezzi F, Fortin M (1991) Mixed and hybrid finite element methods. Springer-Verlag, New York 9. Strang G, Fix GJ (1973) An analysis of the finite element method. Prentice-Hall, Englewood Cliffs, NJ 10. Blomquist RN, Lewis EE (1980) A rigorous treatment of transverse buckling effects in twodimensional neutron transport computations. Nucl Sci Eng 73:125 11. Dilber I, Lewis EE (1985) Variational nodal methods for neutron transport. Nucl Sci Eng 91:132 12. deOliveira CRC (1986) An arbitrary geometry finite element method for multigroup neutron transport with anisotropic scattering. Prog Nucl Energy 18:227 13. Carrico CB, Lewis EE, Palmiotti G (1992) Three-dimensional variational nodal transport methods for Cartesian, triangular and hexagonal criticality calculations. Nucl Sci Eng 111:223 14. Lewis EE, Carrico CB, Palmiotti G (1996) Variational nodal formulation for the spherical harmonics equations. Nucl Sci Eng 122:194 15. Lillie RA, Robinson JC (1976) A linear triangle finite element formulation for multigroup neutron transport analysis with anisotropic scattering, ORNL/TM-5281. Oak ridge National Laboratory 16. Jung J, Kobayashi NO, Nishihara N (1973) Second-order discrete ordinate Pl equations in multi-dimensional geometry. J Nucl Energy 27:577 17. Morel JE, McGhee JM (1995) A diffusion-synthetic acceleration technique for the even-parity Sn equations with anisotropic scattering. Nucl Sci Eng 120:147–164 18. Morel JE, McGhee JM (1999) A self-adjoint angular flux equation. Nucl Sci Eng 132:312–325 19. Lautard JJ, Schneider D, Baudron AM (1999) Mixed dual methods for neutronic reactor core calculations in the CRONOS system. In: Proc. Int. Conf. Mathematics and Computation, Reactor Physics and Environmental Analysis of Nuclear Systems, 27–30 Sept 1999, Madrid 20. Fedon-Magnaud C (1999) Pin-by-pin transport calculations with CRONOS reactor code. In: Proc. Int. Conf. Mathematics and Computation, Reactor Physics and Environmental Analysis of Nuclear Systems, 27–30 Sept 1999, Madrid 21. Akherraz B, Fedon-Magnaud C, Lautard JJ, Sanchez R (1995) Anisotropic scattering treatment for the neutron transport equation with primal finite elements. Nucl Sci Eng 120:187–198 22. Miller WF Jr, Lewis EE, Rossow EC (1973) The application of phase-space finite elements to the two-dimensional neutron transport equation in X-Y geometry. Nucl Sci Eng 52:12 23. Briggs LL, Miller WF Jr, Lewis EE (1975) Ray-effect mitigation in discrete ordinate-like angular finite element approximations in neutron transport. Nucl Sci Eng 57:205–217 24. Carlson BG, Lathrop KD (1968) Transport theory: the method of discrete ordinates. In: Greenspan H, Kelber CN, Okrent D (eds) Computing methods in reactor physics, Chap. 3. Gordon & Breach, New York 25. Gelbard EM (1968) Spherical harmonics methods: PL and double PL approximations. In: Greenspan H, Kelber CN, Okrent D (eds) Computing methods in reactor physics, Chap. 4. Gordon & Breach, New York
114
E.E. Lewis
26. Fletcher JK (1994) The solution of the multigroup neutron transport equation using spherical harmonics. Nucl Sci Eng 116:73 27. Fedon-Magnaud C, Lautard JJ, Akherraz B, Wu GJ (1995) Coarse mesh methods for the transport calculations in the CRONOS reactor code. In: Proc. int. conf. mathematics, computations, reactor physics and environmental analysis, 30 Apr–4 May 1995, Portland, Oregon 28. Lewis EE, Miller WF Jr (1984) Computational methods of neutron transport. Wiley, New York 29. Greenbalm A (1977) Iterative methods for solving linear systems. SIAM, Philadelphia, PA 30. Saad Y (1996) Iterative methods for sparse linear systems. PWS Publishing Co, Boston, MA 31. Bemmel JD (1997) Applied Numerical Linear Algebra. SIAM, Philadelphia, PA 32. Palmiotti G, Carrico CB, Lewis EE (1966) Variational nodal transport methods with anisotropic scattering. Nucl Sci Eng 122:194 33. Morse PM, Feshbach H (1953) Methods of theoretical physics. McGraw-Hill, New York 34. Gelbard EM (1960) Application of spherical harmonics method to reactor problems, WARDBT-20. Bettis Atomic Power Laboratory 35. Gelbard EM (1961) Simplified spherical harmonics equations and their use in shielding problems, WAPD-T 1182 (Rev. 1). Bettis Atomic Power Laboratory 36. Smith KM (1986) Multidimensional nodal transport using the simplified PL method. In: Proc. topl. mtg. reactor physics and safety, 17–19 Sept 1986, Saratoga Springs, New York, p 223 37. Smith KS (1991) Multi-dimensional nodal transport using the simplified PL method. In: Proc. ANS topl. mtg. advances in mathematics, computations, and reactor physics, 29 Apr–2 May 1991, Pittsburgh, PA 38. Pomraning CG (1993) Asymptotic and variational derivations of the simplified P n equations. Ann Nucl Energy 20:623 39. Larsen EW, McGhee JM, Morel JE (1993) Asymptotic derivation of the simplified P n equations. In: Proc. topl. mtg. mathematical methods and supercomputers in nuclear applications, M&C + SNA’93, 19–23 Apr 1993, Karlsruhe, Germany 40. Larsen EW, Morel JE, McGhee JM (1995) Asymptotic derivation of the multigroup P1 and simplified P n equations. In: Proc. int. conf. mathematics and computations, reactor physics and environmental analysis, 30 Apr– 4 May 1995, Portland, Oregon 41. Lewis EE, Palmiotti G (1997) Simplified spherical harmonics in the variational nodal method. Nucl Sci Eng 126:48 42. Noh T, Miller WF Jr, Morel JE (1996) The even-parity and simplified even-parity transport equations in two-dimensional x-y geometry. Nucl Sci Eng 123:38–56 43. Azmy YY (1988) The weighted diamond-difference form of the nodal transport methods. Nucl Sci Eng 98:29 44. Lewis EE, Miller WF Jr, Henry TP (1975) A two-dimensional finite element method for integral neutron transport calculations. Nucl Sci Eng 58:202 45. Lawrence RD (1986) Progress in nodal methods for the solution of the neutron diffusion and transport equations. Prog Nucl Energy 17:271 46. Palmiotti G, Lewis EE, Carrico CB (1995) VARIANT: VARIational Anisotropic Nodal Transport for multidimensional Cartesian and hexagonal geometry calculation, ANL-95/40. Argonne National Laboratory 47. Yang WS, Palmiotti G, Lewis EE (2001) Numerical optimization of computing algorithms for the variational nodal method. Nucl Sci Eng 139:74–185 48. Smith MA, Tsoulfanidis N, Lewis EE, Palmiotti G, Taiwo TA (2003) A finite subelement generalization of the variational nodal method. Nucl Sci Eng 144:36 49. Smith MA, Palmiotti G, Lewis EE, Tsoulfanidis N (2004) An integral form of the variational nodal method. Nucl Sci Eng 146:141
2
Second-Order Neutron Transport Methods
115
Professor Elmer E. Lewis received his B.S. in engineering physics (1960) and an M.S. (1962) and Ph.D. (1964) in nuclear engineering at the University of Illinois, Urbana. He served as a captain in the US Army Ordnance Corps and as a Ford Foundation Fellow and assistant professor of nuclear engineering at MIT before joining as Northwestern’s faculty in 1968. In addition to serving as chair of Northwestern’s Department of Mechanical Engineering (1987–1997), he has held appointments as visiting professor at the University of Stuttgart and Guest Scientist at the Nuclear Research Center at Karlsruhe, Germany. He has been a frequent consultant to Argonne and Los Alamos National Laboratories and to a number of industrial firms. A Fellow of the American Nuclear Society, and winner of its Mathematics and Computation Distinguished Service and Arthur Holly Compton Awards, Professor Lewis serves on the Editorial Boards of the journals Nuclear Science and Engineering and Transport Theory and Statistical Physics. He has held a number of offices in the American Nuclear Society, including chair of its Mathematics and Computation Division. His research resulted in significant advances in a wide variety of topics including neutronics computational methods, radiation transport, the physics and safety of nuclear systems, reliability and quality modeling, and Monte Carlo simulation. Professor Lewis has taught a wide range of courses in mechanical and nuclear engineering, ranging from freshman seminars to graduatelevel offerings, and currently serves as his department’s undergraduate curriculum coordinator. In addition to undergraduate advising, he has been a primary supervisor to more than 20 Ph.D. and approximately 30 M.S. students, three of them winning the American Nuclear Society’s Mark Mills Award for their doctoral work. He is the author or co-author of nearly 200 journal articles and conference proceeding papers. He has written four engineering textbooks as well as a historical appreciation of engineering intended for a more general audience.
Chapter 3
Monte Carlo Methods Jerome Spanier
3.1 Introduction Monte Carlo methods comprise a large and still growing collection of methods of repetitive simulation designed to obtain approximate solutions of various problems by playing games of chance. Often these methods are motivated by randomness inherent in the problem being studied (as, e.g., when simulating the random walks of “particles” undergoing diffusive transport), but this is not an essential feature of Monte Carlo methods. As long ago as the eighteenth century, the distinguished French naturalist Compte de Buffon [1] described an experiment that is by now well known: a thin needle of length l is dropped repeatedly on a plane surface that has been ruled with parallel lines at a fixed distance d apart. Then, as Laplace suggested many years later [2], an empirical estimate of the probability P of an intersection obtained by dropping a needle at random a large number, N , of times and observing the number, n, of intersections provides a practical means for estimating . The relationship is 2l d 2l PO d
P D
or
where PO D n=N and we assume that l < d . We introduce another example that can be used to illustrate several important features of Monte Carlo simulation. This “model” transport problem, one of the simplest random walk problems one might imagine, can be solved completely without resorting to sampling at all and yet exhibits characteristics of problems that are typical of more complex particle transport. The study of such model problems is crucial in obtaining a deeper understanding of the basic principles that underlie Monte Carlo methods. J. Spanier () Beckman Laser Institute, University of California, Irvine, California, USA e-mail:
[email protected]
Y. Azmy and E. Sartori, Nuclear Computational Science: A Century in Review, c Springer Science+Business Media B.V. 2010 DOI 10.1007/978-90-481-3411-3 3,
117
118
J. Spanier
We imagine particles (random walkers) that are assumed to impinge on the left face of a vertical slab of unit thickness. Each particle moves only to the right in steps selected at random from a uniform distribution on [0,1] until it escapes from the slab. Let X be the number of steps required to escape. The problem is to estimate EŒX , the average number of steps to escape, where EŒX is the expectation of the random variable X . For this problem, one expresses the expectation as an infinite series, the nth term of which is the product of n and the probability pn that the particle escapes after exactly n steps. This infinite series representation of EŒX is precisely analogous to the Neumann series representation of the solution of the transport equation that describes this problem, as well as so many problems that are solved using Monte Carlo methods. Making use of the fact that for this simple problem, pn D 1 = n.n 2/Š for n D 2; 3; : : : the infinite series can be summed exactly, which yields EŒX D e Š 2:71828 and the variance of X is 2 ŒX D 3e e 2 Š 0:76579: This very simple test problem provides a very useful vehicle for analyzing more complex Monte Carlo random walk problems for which exact values of the moments of key random variables will be unknown in general. Of course, much more accurate and efficient (deterministic) methods may be used to estimate both and e. However, even these very simple simulation problems serve to illustrate a number of key ingredients of the Monte Carlo method: (1) The need to generate random samples drawn from a variety of probability distributions; (2) the need to express the outcomes of a Monte Carlo experiment as estimates of a theoretical expected value of some random variable; (3) the need to perform an error analysis based on statistical fluctuations of a random variable from sample to sample; and (4) where possible, the desirability of reducing the sample to sample fluctuations by thinking deeply about the inherent cause of these fluctuations and taking appropriate measures to reduce them. For example, in the needle-tossing experiment, why not toss a cruciform-shaped needle, or even one with many needles of the same length equally distributed around the circumference of a circle of radius l? This would seem to provide a more efficient experiment since each toss produces many possible intersections, yet each “spoke” retains the same distributional characteristics as each single needle toss in the original experiment. But clearly these more sophisticated “needles” produce correlated sampling results. How does this affect the statistical analysis of the outcomes? Some of these questions are addressed in the interesting references [3–5]. For the one-dimensional random walk problem, one might imagine that a more systematic sampling (instead of random sampling) of the unit interval to obtain step sizes for each step to the right would lead to reduced statistical fluctuations in the Monte Carlo estimate. Suppose, then, that one were to subdivide the unit interval
3
Monte Carlo Methods
119
into a large, but fixed, number, S , of equal subdivisions and choose as individual step sizes the midpoints, say, of these subintervals ordered deterministically. For example, one could move through these in order, going from the least to the greatest, to generate steps for the random walkers. Pretty clearly, this choice is not a very good one since, if S is very large compared to the number of samples generated, there would be a bias in the direction of short steps. Perhaps one should average a small step with a large one or run through the midpoints randomly. Again, what about the correlation introduced? And what is the impact of any such scheme on the sample to sample variability? In addition to containing many of the same critical features of most Monte Carlo problems, these simple model problems illustrate some of the advantages of the Monte Carlo method: (a) its appeal to intuition; (b) its simplicity of implementation; and (c) its accessibility to nonexperts. However, as more and more sophistication is considered in an attempt to speed up the computation or to reduce the sampling variability per unit computing cost, the model for the experiment can depart more and more from intuitive plausibility, and the need for mathematical rigor is accentuated. A firm theoretical foundation becomes not only desirable, but also essential. There are many problems for which analytic or good deterministic methods are simply unavailable that benefit from being formulated stochastically. Particle transport problems provide a fertile field of examples of such problems, and this field will be our main emphasis here. Since the earliest applications of Monte Carlo methods to neutron transport problems, however, the number and range of applications have grown well beyond the bounds of a single book chapter. The field of operations research is rife with such examples, which we do not discuss here (see, e.g., [7]). We have deliberately ignored the discussion of developments in computer architecture (e.g., use of parallel or vectorized computation) and many of the rapidly growing list of important application areas, such as financial modeling, design of radiation therapy plans, Markov chain Monte Carlo, and others. Because of the literal explosion in the number of applications of Monte Carlo methods and the avalanche of publications dealing with both the theory and applications, there is no possibility of dealing with the subject comprehensively here. Finally, we presume that the reader is familiar with at least the rudiments of Monte Carlo. Several books and articles can provide an introduction to the subject matter (e.g., [8–13]). For those more familiar with at least the rudiments, a review of [14] would provide an appropriate introduction since our ultimate goal here is to update that article.
3.2 Organizing Principles Initially, a historical context was suggested by the organizers for each of the Gelbard lectures. Each lecture was intended to survey one of the topics traditionally important to the Mathematics and Computation Division of the American Nuclear Society in such a way as to update the 1968 publication of [14]. While this context seemed
120
J. Spanier
to serve well for the lectures at the Gatlinburg conference – at least the chronology featured prominently in the oral accounts – a division according to subject content seemed more appropriate for the written version. Our hope is that this switch in perspective might make the chapter more useful as a reference. Accordingly, we have abandoned the idea of dividing the content into two historical periods, one prior to 1968 and the other afterward. Instead, the material here will be organized into what we perceive to be the key elements of Monte Carlo methods development: generating sequences, error analysis, error reduction, and theoretical foundations. Here is a brief overview of what the reader might expect to find.
3.2.1 Generating Sequences Section 3.4, dealing with generating sequences, shows that the relatively simple algorithms used to create a sequence of unpredictable, “random” numbers for early use in simulation have evolved into several quite different streams of research. These involve both modern-day successors to the earliest pseudorandom number generators and algorithms that are completely deterministic, focusing only on uniformity in a manner that forsakes the idea of stochastic independence altogether.
3.2.2 Error Analysis For the analysis of errors in Monte Carlo output, we will discuss in Section 3.5 the evolution, in the case of pseudorandomly generated samples, from reporting the sample mean and standard deviation to the now fairly common use of higher moments and additional statistical tests (see [15]). When completely deterministic sequences are used in place of pseudorandom ones, and no probabilistic model is invoked, however, we will see that a markedly different error analysis must be applied.
3.2.3 Error Reduction Perhaps the greatest concentration of effort to improve Monte Carlo methods has been devoted to the topic of error reduction in the last 50 years or so. Whether the simulation makes use of pseudorandom number sequences or their deterministic cousins – quasi-random sequences – highly sophisticated techniques have been developed that are capable of producing not only increased rates of convergence, but also much lower error levels for a fixed sample size. Some of these developments are described in Section 3.6.
3
Monte Carlo Methods
121
3.2.4 Foundations/Theoretical Developments In discussing this last of our “big four” topics in Section 3.7, we shall attempt to list the major advances in understanding the foundations of the subject. Our (admittedly biased) perspective is that these have had a great deal to do with the practical advances made since the earliest uses of simulation methods to solve complex problems. Following our discussion of the development of each of these four major themes, we try to formulate at the close of each section, a succinct summary of the present state of the art for each such theme. We end this chapter with a short list, presented in Section 3.8, of major challenges that might serve to stimulate further thinking.
3.3 Historical Perspectives Before we pursue our discussion of each theme, we provide an overview of the early history of the subject. Much has already been written about the development of a nuclear weapons program whose history began with the famous experiments conducted during World War II at the University of Chicago. These culminated on December 2, 1942 with the first controlled nuclear chain reaction on a squash court situated beneath Chicago’s football stadium. Working later in Los Alamos, New York, Oak Ridge, and other locations, Enrico Fermi and others (for instance, Stanislaw Ulam, John von Neumann, Robert Richtmyer, and Nicholas Metropolis) played an important part in solving the problems connected with the development of the atomic bomb. This work depended crucially on rudimentary numerical simulations of multiplying neutron populations. It is widely held that the first paper on the Monte Carlo method was [16]. The marriage of relatively unsophisticated simulation methods with the development of automatic digital computers provided the key ingredients for success in this rapidly expanding wartime undertaking. Shortly after the end of World War II another major effort was initiated, spearheaded by Admiral Hyman Rickover, to design and implement nuclear propulsion systems for the Navy. This highly successful program began in the 1940s, with the first test reactor started up in the United States in 1953. The first nuclear-powered submarine – the USS Nautilus – put to sea in 1955. This development marked the transition of submarines from slow underwater vessels to warships capable of sustaining 20–25 knots while submerged for weeks at a time. The success of the Nautilus effort led to the development of additional submarines, each powered by a single pressurized water reactor, and an aircraft carrier, the USS Enterprise, powered by eight reactor units, in 1960. A cruiser, the USS Long Beach, was placed into service in 1961 and by 1962 the United States boasted a nuclear fleet of 26 operational nuclear submarines with 30 more under construction. Today, the US Navy operates more than 80 nuclear-powered ships including 11 aircraft carriers and a number of cruisers.
122
J. Spanier
The postwar activities to produce nuclear propulsion units for a nuclear navy were concentrated primarily at the Westinghouse-managed Bettis Atomic Power Laboratory in suburban Pittsburgh, PA and the General Electric-managed Knolls Atomic Power Laboratory in Schenectady, New York during the 1950s and 1960s. In that same time frame there was a very rapid expansion in the capability of digital computers at these and at the nation’s National Laboratories at Los Alamos, Oak Ridge, Brookhaven, Argonne, and Livermore. The development of the giant (using nearly 18,000 vacuum tubes) ENIAC machine by John W. Mauchly and J. Presper Eckert at the University of Pennsylvania during the period 1943–1946 and the EDVAC computer, for which conceptual design was completed in 1946 but which was not fully operational until 1952, led the way. It is perhaps no coincidence that von Neumann and Metropolis were heavily involved in both the development of modern computing machines and the Monte Carlo method as a practical numerical method. As a result of this dual evolution of science and technology, the same period was marked by a dramatic increase in the levels of sophistication of computations in support of the nuclear energy program, including the design and development of reactors for peacetime uses. The commercial development of nuclear power-generating plants provided added incentives for acceleration of this effort. As a result, Monte Carlo methods began to find greater use as a design tool and as a partial replacement for the much more expensive (and risky!) criticality experiments that were needed to validate the various nuclear designs. An unfortunate consequence of the fact that much of the work done was classified during this early period is that publication occurred mainly in classified government reports rather than in the open literature. This undoubtedly prevented many important ideas from becoming known to a much wider audience sooner. Indeed, many of these reports, such as the seminal work of Herman Kahn [17, 18], were never republished.
3.4 Generating Sequences It seems appropriate to begin our review of this topic with an often cited quotation due to R.R. Coveyou [19] – “Random number generation is too important to be left to chance.” Indeed, this statement, which was certainly valid in 1969 when a good deal of effort was being devoted to try to understand how to generate high quality pseudorandom numbers, is even more accurate today. This is so because there are very sophisticated new methods for generating pseudorandom sequences as well as methods for generating completely deterministic uniform sequences that serve in place of pseudorandom ones. We will deal with such deterministic sequences1 in Section 3.4.2. 1 Of course, even pseudorandom sequences are deterministic, a fact that has stirred some debate about whether a probabilistic analysis made any sense at all for pseudorandomly implemented Monte Carlo. This, in turn, was one of the motives for developing a mathematically rigorous analysis divorced from probability theory and based only on a notion of uniformity arising out of number-theoretic considerations.
3
Monte Carlo Methods
123
3.4.1 Pseudorandom Sequences Pseudorandom numbers are commonly understood to be computer substitutes for “truly random” numbers. Their function is to simulate realizations of independent, identically distributed (iid) random variables on the unit interval. Other distributions that might be needed in a stochastic simulation are then obtained by transformation methods, of which there are many (see [20] and the software package C-Rand [21, 22]). The most common early source of pseudorandom numbers was the multiplicative congruential generator i C1 a i .mod m/ originally suggested by Lehmer [23], or one incorporating an additive component i C1 Œa i C b.mod m/: The pseudorandom numbers themselves are then defined through division by the modulus: ri D i =m 2 Œ0; 1: When employing numbers generated by such linear congruential generators, appropriately chosen “seeds” 0 , moduli m, and multipliers a provide the means to generate reasonably high quality pseudorandom sequences, with sufficiently long periods for many problems (see [24]). Following Lehmer’s original suggestion to use such sequences for simulation, substantial effort and analysis was invested in assessing their imperfections, such as the persistence of serial correlation [25, 26]. Knuth [24] devised a number of statistical tests to bolster confidence in using pseudorandom sequences for generating samples from the many distributions required during the course of a simulation experiment. For much of the early history of Monte Carlo computations, the emphasis was on obtaining results, not on looking carefully at the theoretical underpinnings of the computations. When using linear congruential generators as a source of nearly independent and nearly uniform realizations of independent and identically distributed uniform distributions on the unit interval, it seemed sufficient to assure sufficiently long periods of pseudorandom sequences with serial correlation properties that seemed “safe.” The ideal desiderata for pseudorandom sequences were maximal periods and minimal “structure.” Here, the word structure is being used nearly synonymously with predictability. And indeed, recursive multiplications of large integers produces, as remainders, numbers that work surprisingly well in this regard for many Monte Carlo problem applications. In 1967, however, George Marsaglia published his seminal paper [27] with the surprising conclusion that all multiplicative congruential generators possess a defect that makes them unsuitable for use in many applications. Furthermore, this defect cannot be eliminated by adjusting the starting values, multipliers, or moduli of the congruence. The fatal flaw revealed by Marsaglia’s paper is that if successive n-tuples .u1 ; u2 ; : : :; un /, .u2 , u3 , : : :, unC1 ), : : : produced by the generator are
124
J. Spanier
treated as points in a unit cube of dimension n, then all of these points will lie on a relatively small number of parallel hyperplanes. If one plots in two or three dimensions a set of successive pairs or triples of numbers obtained from a linear congruential generator, this hyperplane structure is readily apparent. In applications requiring as much uniformity as possible in two (or more) dimensional space, not just on each axis separately, this would be a crucial factor. For example, it is easy to imagine specific piecewise linear functions of a single variable whose integrals – estimated crudely by selecting a pair of points randomly in the unit square and counting the fraction that fall below the graph of the function – would not be estimated very accurately even after many samples were generated. After nearly 20 years of essentially unquestioning use of such generators, the stage had been set for an explosion of effort and analysis to create improved pseudorandom sequences as well as methods that do not rely on randomness at all. After all, as John von Neumann stated “Anyone who considers arithmetical methods of producing random numbers is, of course, in a state of sin” (quoted in [24]). There are many excellent sources of additional material about pseudorandom numbers. Beginning with Knuth’s book [24], which may be the best reference for a rigorously mathematical discussion, another more recent reference, which belongs to any basic library on the subject is Harald Niederreiter’s book [10] based on lectures he gave at a CBMS-NSF Regional Conference held at the University of Alaska, Fairbanks in 1990. In addition to these standard reference works, there are now several Internet web sites that provide not only lists of references but also links to various other sites, algorithms, and a variety of other relevant information. A good choice among these is the one maintained at the University of Salzburg at http://random.mat.sbg.ac.at. Two important developments characterize the past 30 years of progress with respect to generating sequences. The first of these is the exhaustive, rigorous analysis of uniform pseudorandom number algorithms, including linear and nonlinear congruential generators and the emergence of a host of other ideas for generating sequences that behave nearly randomly. The second development that occurred more or less in parallel with the first was much more radical. This involved the abandonment of randomness as a requirement for decision making in favor of reliance on uniformity in an appropriately defined high-dimensional space. In this latter area of research, number-theoretic methods are used for generating and analyzing optimally regular sequences. The use of such “quasi-random,” as opposed to pseudorandom numbers, in turn, can produce more rapid convergence of sample means to theoretical means for many practical problems (see Section 3.5.2). Following the discovery by Marsaglia of the parallel hyperplanes phenomenon characteristic of linear congruential generators it became clear that many simulations could be adversely affected by this behavior. As a result, much effort was devoted to careful theoretical analyses of the behavior and fundamental properties of uniform pseudorandom number generators and algorithms. Excellent material describing these developments can be found in [28–34] and in [10] and [35, 36]. A detailed exposition of this topic alone is beyond the scope of this chapter. The reference [28] lists 147 relevant papers, most of them published during the
3
Monte Carlo Methods
125
10-year interval, 1985–1995. However, we try to summarize the salient facts here to provide a flavor of the material to be found in the literature. Taking into account the important, indeed, pivotal role played by pseudorandom numbers in any Monte Carlo simulation, the significance of these investigations can hardly be overemphasized. Computer algorithms for generating uniform pseudorandom numbers all yield periodic sequences. Naturally, it is desirable that these sequences have long periods, good equidistribution properties, minimal serial correlation, and as little intrinsic structure as possible. Obviously, it is also important that the algorithm be amenable to a fast computer implementation. The purpose of a pseudorandom number generator is to simulate independent, identically distributed (iid) random variables that are uniform in the unit interval. Stringing s such numbers together in sequence then simulates iid uniform random variables in Œ0; 1s for every integer s. Clearly, this cannot be the case for every s since there are, in any event, only finitely many numbers available from any pseudorandom generator. It remains, then, to find sensible criteria for assessing the quality of a given pseudorandom generator and to construct specific generators that satisfy these criteria. Presumably, this will provide a measure of the evenness of the distribution of successive s-tuples in all dimensions s up to some sufficiently large integer or some carefully selected subset of dimensions, if these can be identified. A common quantification of quality is the discrepancy between the empirical distribution (i.e., one based on sample, rather than theoretical, averages) of a point set, such as the set of all s-tuples of pseudorandom numbers) and the uniform distribution over Œ0; 1s . This same notion of discrepancy will play a fundamental role in analyzing so-called quasi-random sequences – sequences chosen solely based on their uniformity properties rather than on any probabilistically – inspired ones. Definition 1. For any N points u0 ; u1 ; : : : ; uN 1 in the s-dimensional unit cube I s D Œ0; 1s , s 1, their discrepancy is defined by DN .u0 ; u1 ; : : : ; uN 1 / D sup jEN .J / V .J /j J
where the supremum is extended over all subintervals J of I s with one vertex at the origin, EN .J / is N 1 times the number of points among the u0 ; u1 ; : : : ; uN 1 that lie in J and V .J / is the s-dimensional volume of J. Evidently, the first study of the concept of discrepancy is in a paper of Bergstrom [37]. The term “discrepancy” was most likely coined by van der Corput and the first intensive study of it appeared in a paper of van der Corput and Pisot [38]. The discrepancy provides the statistical test quantity for the s-dimensional Kolmogoroff test, which is a goodness-of-fit test for the empirical distribution of initial segments of a pseudorandom sequence. For fixed N and theoretically random .u0 ; u1 ; : : : ; uN 1 / 2 Œ0; 1, the distribution of DN .u0 ; u1 ; : : : ; uN 1 / is known, which gives rise to various formulas for ProbfDN .u0 ; u1 ; : : : ; uN 1 / tg;
0 t 1:
126
J. Spanier
For s D 1 one obtains a test of one-dimensional uniformity (equidistribution in [0,1]), while for s > 1 one obtains a test of higher dimensional uniformity (which encompasses the independence, or lack thereof, of successive pseudorandom numbers). As we saw earlier, the classical method for generating pseudorandom numbers is the linear congruential method i C1 Œa i C b.mod m/: where m is always chosen to be a large integer and 0 , a, and b are suitably chosen integers. Algorithms based on this simple idea have been widely studied [10, 24, 34, 40–43], especially in the past 40 years. In spite of well-founded criticism of linear congruential generators stemming from the hyperplane structure they exhibit, they remain the most commonly used in practice, especially in standard computer software libraries. There are several reasons for this state of affairs: Linear congruential algorithms are fast. Alternative generators are essentially al-
ways considerably slower. Many large Monte Carlo programs that undergo periodic revision rely on repro-
ducing output from test problems run with previous versions of the program. Introducing change in the basic pseudorandom sequence employed would destroy the reproducibility of results obtained with the earlier versions of the program. Those responsible for maintaining Monte Carlo programs may be unaware of the potential danger in using pseudorandom number generators that were devised many years earlier, generators that may well have outlived their usefulness. Unfortunately, many of the “default” generators currently available in popular computer software are old and could be dangerous to use in modern applications that require much larger sample sizes than might have been needed earlier. An increasing demand for parallel or vector pseudorandom streams of numbers has aggravated the problem as well since these often make use of subsequences of sequences that may not have sufficiently long periods to justify this subdivision. For example, consider the simple generator i C1 Œa i C b.mod m/ with ri D i =m and the popular choices m D 231 – 1, a D 16; 807. The period length is 231 – 2, which is judged to be too small for serious applications [44, 45]. Furthermore, this generator has a lattice structure with rather large distances between the small number of hyperplanes that contain the higher dimensional s-tuples, which could easily prove to be a problem in simulation results [46, 47].
3
Monte Carlo Methods
127
One method for controlling the lattice structure is to combine linear recursive generators [48]. For example, beginning with two such linear recurrences x1;n D .a1;1 x1;n1 C C a1;k x1;nk /.mod m1 / x2;n D .a2;1 x2;n1 C C a2;k x2;nk /.mod m2 / where k, the mj ’s, and the ai;j ’s are fixed integers, one can define the pseudorandom numbers by rn D .x1;n =m1 x2;n =m2 /.mod1/: This is an example of a combined linear multiple recursive generator. At step n this generator produces the 2k-dimensional vector .x1;n ; : : : ; x1;nkC1 ; x2;n ; : : : ; x2;nkC1 /, whose first k components lie in f0; 1; : : : ; m1 1g and whose last k components lie in f0; 1; : : : ; m2 1g. It can be shown in [24, 44] that this generator gives good coverage of the unit hypercube Œ0; 1s for all dimensions s k. For dimensions higher than that there is the usual lattice structure, but parameters can be chosen that make the distance between the parallel hyperplanes of this lattice quite small. L’Ecuyer [47] recommends parameter choices that produce a generator with two main cycles of length 2192 each and whose lattice structure in dimensions up to 48 has been found to be excellent. This would seem to make it a good choice for many applications. The lattice structure that Marsaglia [27] discovered plagues every linear congruential generator. Inversive congruential generators (introduced by Eichenauer and Lehn [48] in 1986) were designed to overcome this difficulty. By analogy with linear congruential methods, inversive congruential sequences are defined by the nonlinear congruence i C1 Œa Ni C b.mod p/ with i Ni 1.mod p/ and
ri D i =p 2 Œ0; 1:
In these equations, p is a prime modulus, a is a multiplier, b is an additive term, and 0 is a starting value. From these definitions it follows that the i take values in the set f0; 1; : : : ; p 1g. We denote this generator by ICG .p; a; b; 0 /. A key feature of the ICG with prime modulus is the absence of any lattice structure, in sharp contrast to linear congruential generators. Figure 3.1 is a plot of pairs of consecutive pseudorandom numbers .rn ; rnC1 / generated by ICG .231 1; 1288490188; 1; 0/ concentrated in a region of the unit square near the point (0.5, 0.5). The extra inversion step dramatically reduces the effect of the parallel hyperplanes phenomenon. For example, an inversive congruential algorithm modulo p D 231 – 1 passes a rather stringent s-dimensional lattice test for all dimensions s 230 , whereas, for the linear congruential algorithm with this same modulus, it is difficult to guarantee a nearly optimal lattice structure for s 10 [10]. Inversive congruential algorithms also display better behavior for a rather severe test of serial correlation. They also enjoy robustness with respect to the choice of parameters. These algorithms are promising candidates for parallelization because, unlike
128
J. Spanier
t000_102.out 0.5004 0.5002 0.5 0.4998 0.4996 0.4996 0.4998
0.5
0.5002 0.5004
Fig. 3.1 Points generated by an inversive congruential generator
linear congruential generators, they do not have long-range correlation problems. The only downside to their use is that they are substantially costlier to produce (by approximately a factor of 8) than their linear congruential counterparts because of the relative costliness of computing multiplicative inverses in modular arithmetic. In addition to these linear and inversive congruential generators for uniform pseudorandom numbers, several other classes have been studied – some quite extensively – in an attempt to circumvent the problems perceived with the classical ones. Of course, no single generator can prove to be ideal for all applications. Any single generator can satisfy only a finite number of randomness tests. This, along with the finiteness of the set of computer numbers, means that a test can always be devised that cannot be passed by a specific generator. It has been said that pseudorandom number generators are like antibiotics in that respect: no one is appropriate for all tasks. What is needed is an arsenal of possible choices with distinct properties. If two very different generators yield the same outcome in a simulation, then additional confidence is gained in the result. In addition to the generator families mentioned above, there are laggedFibonacci, generalized feedback shift register, matrix, Tausworthe and other classes of generators, and combinations of these. There are also various nonlinear generators. Literally thousands of publications dealing with these topics have appeared in print in the last 30 years. In [49], L’Ecuyer suggests the following generator families as having the essential requirements of good theoretical support, extensive testing, and ease of use: the Mersenne twister [50], the combined multiple recursive generators of L’Ecuyer [47], the combined linear congruential generators of L’Ecuyer and Andres [51], and the combined Tausworthe generators of L’Ecuyer [52]. More information can be found on the web pages: http://www.iro.umontreal.ca/ lecuyer http://random.mat.sbg.ac.at http://cg.scs.carleton.ca/ luc/rng.html http://www.robertnz.net/
3
Monte Carlo Methods
129
3.4.2 Quasirandom Sequences In the past 35 years or so there has been a surge in the number of publications (see, e.g., [10, 53–58]) that recommend the use of quasi-random sequences (i.e., sequences more regular than pseudorandom ones) in place of pseudorandom sequences for difficult problems. There is no universally accepted, rigorous definition of the term “quasi-random sequence,” but it has come to mean sequences with low discrepancy (see definition of discrepancy: Definition 1 of Section 3.4.1). Indeed, the terms quasi-random and low-discrepancy sequences are frequently used synonymously. These quasi-Monte Carlo methods, as they are sometimes called, have become the methods of choice recently for many problems involving financial modeling [59–62], radiosity, and global illumination problems [54, 55, 63, 64] and other applications. Quasi-random methods offer the potential for improved asymptotic (i.e., for sufficiently large sample size) convergence rates when compared with pseudorandom methods and have performed even better than can easily be explained by existing theory in many applications. Additionally, deterministic rather than statistical error analysis can be applied to their use, even though sharp error bounds are not easily obtained. Consequently, a sizeable research effort is presently devoted to obtaining a deeper understanding of the potential of quasi-Monte Carlo methods. In spite of this potential, most traditional nuclear applications continue to depend upon Monte Carlo programs, such as MCNP [15], that rely on pseudorandom sequences. An important reason for this is that a completely different (and more complex) error analysis must be applied for simulations based on quasi-random sequences. Also, the generation of quasi-random sequences is costlier, in general, than that for pseudorandom sequences. In return for the extra computation, quasi-random sequences offer the prospect of accelerated convergence rates when compared with pseudorandom Monte Carlo. There is sufficient complexity involved in deciding which method might be best to use for a given problem, however, that no hard and fast rule can be applied. In any case, the development of simulation methods based on the use of quasi-random sequences represents, in our view, one of the most important lines of Monte Carlo research since 1968. As stated above, the term low-discrepancy sequences is normally used in place of quasi-random sequences to characterize the highly regular sequences used in quasi-Monte Carlo implementations. The definition of discrepancy (Section 3.4.1) provides a quantitative measure of the regularity of a sequence of s-dimensional points. For the case s D 1 we are concerned with either a finite set u0 ; u1 ; : : : ; uN 1 or with the first N members of an infinite sequence u0 ; u1 ; : : : of points drawn from the unit interval [0,1]. In this case the discrepancy reduces to DN .u0 ; u1 ; : : : ; uN 1 / D sup jEN .J / V .J /j; J
where the supremum is extended over all subintervals J of [0,1] with one vertex at the origin, EN .J / is N 1 times the number of points among the u0 ; u1 ; : : : ; uN 1 that lie in J and V .J / is simply the length of the interval J .
130
J. Spanier
A useful example of a low-discrepancy infinite sequence in [0,1) is the Van der Corput sequence [65], which is defined by
2 .n/ D
N X
aj .n/2j 1 ;
(3.1)
aj .n/2j :
(3.2)
j D0
where nD
N X j D0
These formulas produce 2 .1/ D 1=2, 2 .2/ D 1=4, 2 .3/ D 3=4, 2 .4/ D 1=8,
2 .5/ D 5=8; : : : and the numbers f 2 .n/g1 n D 1 systematically run through the multiples of 2k without duplicating any that arose earlier. Such numbers are much more uniformly distributed in the unit interval than are pseudorandom numbers. In similar fashion, one can define the radical inverse function for any number base b by
b .n/ D
N X
aj .n/b j 1 I
(3.3)
j D0
it enjoys properties very similar to the b D 2 case when b is a prime larger than 2. k That is, f b .n/g1 without dun D 1 systematically runs through the multiples of b plication for any prime b. The Halton sequence [66] is an infinite, s dimensional, low-discrepancy sequence defined by f b1 .n/; b2 .n/; : : : ; bs .n/g, where b1 ; b2 ; : : : ; bs are relatively prime in pairs (e.g., the first s primes). It is useful for generating very uniform sdimensional vectors, as when random walks in an s-dimensional phase space are required. In Fig. 3.2, a visual comparison is made of 2,000 pseudorandom pairs (left) with 2,000 Halton pairs (right). Another family of low-discrepancy sequences, called lattices, has been especially useful for integrating periodic functions. Their ancestor is the number-theoretic method of good lattice points, developed by Korobov [67] and Hlawka [68] for the approximate evaluation of integrals over I s D Œ0; 1s under the assumption that the integrand is 1-periodic in each variable. Lattice methods, or lattice rules, generalize and extend this early work making use of algebraic, rather than numbertheoretic, principles and techniques. Excellent references for lattice rules are the books [10, 69, 70]. Many other low-discrepancy sequences have been used in various quasi-Monte Carlo simulations. The reader is referred to [10] for a more thorough treatment of this general topic.
3
Monte Carlo Methods
131
Fig. 3.2 Visual comparison of pseudorandom (left) and quasi-random (right) sequences
3.4.3 Hybrid Sequences Hybrid sequences are meant to combine the best features of both pseudorandom (convergence rate is independent of the problem dimension) and quasi-random (asymptotic rate of convergence is greater than N 1=2 but weakly dependent on dimension). Ideas for generating hybrid sequences rely, in general, on combining both random and quasi-random elements in a single sequence. For example, randomly scrambling the elements of a low-discrepancy sequence or restricting the use of the low-discrepancy component to a lower dimensional portion of the problem and filling out the remaining dimensions (“padding”) with pseudorandom sequence elements can be effective strategies. Thus, Spanier [58] introduces both a “scrambled” and a “mixed” sequence based on these ideas, Owen [71] describes a method for scrambling certain low-discrepancy sequences called nets [10], Faure [72] describes a method for scrambling the Halton sequence to achieve lowered discrepancy, Wang and Hickernell [73] randomize Halton sequences, and Moskowitz [74], Coulibaly and Lecot [75], and Morokoff and Caflisch [56] present various methods for renumbering the components of a low-discrepancy sequence – in effect, introducing randomness somewhat differently into the sequence. Okten [76, 77] has introduced a generalization of Spanier’s mixed sequence and Moskowitz’s renumbering method and also indicated how error estimation can be performed when using such sequences. Because of its generality, we describe Okten’s ideas briefly here.
132
J. Spanier
In [77], Okten provides the following: Definition 2. Let D fi1 ; : : : ; id g.i1 < < id / be a subset of the index set f1; : : : ; sg . For a given d-dimensional sequence fqn g1 n D 1 , a mixed .s; d / sequence i 1 is an s-dimensional sequence fmn gn D 1 .s d / such that mnk D qnk , k D 1; : : : ; d ik and all other components of mn (i.e., mn for i 2 f1; : : : ; sg ) come from independent realizations of a random variable uniformly distributed on Œ0; 1sd . This definition is useful inasmuch as it specializes to a number of interesting sequences introduced by other authors earlier. For example, Spanier’s mixed sequence corresponds to the choices D f1; : : : ; d g with s D 1; i.e., it is a mixed .1; d / sequence that can be used for either high-dimensional integration or random walk problems. Also, the continuation method introduced in [78] (see also [71]) amounts to using a mixed .s; d / sequence with D fs d C 1; s d C 2; : : : ; sg. Furthermore, the Spanier mixed sequence obviously specializes to an ordinary pseudorandom sequence when d D 0 and is empty, while if D f1; : : : ; d g and s D d , the resulting mixed .d; d / sequence is clearly completely deterministic with no random components at all. Okten [79] also introduces a new family of hybrid sequences obtained by random sampling from a universe consisting of low-discrepancy sequences of the appropriate dimension for the problem. This idea permits the use of conventional statistical analyses to be performed on the resulting estimates and it therefore attempts to overcome one of the major drawbacks of using low-discrepancy sequences: the unavailability of an effective and convenient error analysis. Hybrid sequences are designed to produce good results for general problems with dimensions s that are too large for pure low-discrepancy sequences to be effective. The dimension that defines this threshold depends upon the details of the problem. For example, a number of problems arising in financial modeling involve integrations over 360 dimensions and have been successfully accomplished with purely low-discrepancy sequences, whereas it is not difficult to compose integrands of only 20 variables for which the use of pseudorandom sequences provides better results than when a 20-dimensional low-discrepancy sequence is used. This disparity exists because, in the 360-dimensional case, the integrand function does not depend strongly on all of its 360 variables: it is much more affected by fluctuations in only a handful of the variables while behaving very smoothly with respect to the others. In other words, the partial derivatives of the integrand are all quite large in the case of the 20-dimensional integrand function while in the 360-dimensional problem cited, only a few of the partial derivatives are large and the remaining ones are much smaller. Hybrid sequences should, therefore, be useful for s-dimensional integration of arbitrary functions or for random walk problems whose Neumann series converge rather slowly. But one should not overlook the possibility to which we alluded in the previous paragraph that for certain integrands or random walk problems, special features of that problem might suggest the use of special sequences designed to take advantage of additional information about the problem. For example, if the s-dimensional integrand is, in fact, independent of several of the s variables, the
3
Monte Carlo Methods
133
properties of the hybrid sequence with respect to these variables becomes much less important. More generally, if an s-dimensional integrand exhibits diminished dependence on some subset of the variables, it makes sense to design a hybrid sequence that takes advantage of that information. Similar special considerations would apply in the case of certain random walk problems also. Based on this sort of reasoning, quite recently some authors have focused attention on restricting the class of integrands treated by each method in an attempt to explain why some sequences perform surprisingly well for certain problems. Interest in pursuing this point of view might have been piqued by provocative results reported when purely quasi-random sequences were used to estimate some very high-dimensional integrals arising in financial applications [80, 81]. This has led to a rash of publications in which the sensitivity of an integrand function with respect to its independent variables and/or parameters is studied [82–87].
3.4.4 State of the Art The idea of replacing pseudorandom sequences in Monte Carlo programs by sequences that are more regular, although correlated, has had a profound effect on the field in the past 40 years. Although use of pseudorandom sequences still dominates the more traditional applications involving neutron and charged particle transport, quasi-random sequences are used increasingly in the newer applications areas. Thus, low-discrepancy or hybrid sequences are used almost routinely for financial modeling, global illumination, and other problems for which Monte Carlo methods have recently been shown to be useful. This trend has also dramatically influenced the amount and kind of research needed to analyze errors and to develop error reduction strategies, which is described in Section 3.5.
3.5 Error Analysis 3.5.1 The Pseudorandom Case Throughout the first 20 or more years (1942–1962) of the exciting period during which digital computers and Monte Carlo methods developed rapidly, only minimal information was available from most of the computer programs employing simulation. At that time, the primary output consisted of one or more sample means mN D
N 1 X i N i D1
134
J. Spanier
of an estimating random variable, , together with estimates of the sample standard deviation, s 8 2 N < N X 41 sD i2 :N 1 N i D1
N 1 X i N i D1
!2 391= 2 = 5 : ;
The estimated variance, s 2 =N , of the sample mean, mN , then establishes the very slow p O.N 1=2 / convergence of the Monte Carlo error (based on the standard deviation s 2 =N ) to zero for pseudorandom Monte Carlo implementations. The central limit theorem states that the sample mean mN is approximately normally distributed for large sample sizes N and that this normal distribution has as its true mean the expected value of the random variable and as its variance 2 =N , where 2 is the population variance. It is the assumption of asymptotic normality that permits the derivation of various confidence intervals that, in turn, provide the foundation for assigning precision to each Monte Carlo result. Quite often it is the estimate of the relative error R D Œs=N 1=2 =mN
(3.4)
that is supplied with each estimated mean. It is common to use the size of R as a mechanism for interpreting the quality of the Monte Carlo estimates. Small values of R indicate high precision, whereas values near to 1 suggest sample means that are suspect. The use of higher-order statistical quantities and other statistical tests has been recommended in conjunction with some Monte Carlo programs. For example, the program MCNP [15] estimates, in addition to tally means and variances, the variance of the variance (VOV), and the users’ manual contains guidelines for interpreting these measures of precision, along with a number of other test quantities provided routinely with MCNP output. Partly driven by the frustration caused by the slowness of the O.N 1=2 / convergence rate of pseudorandom Monte Carlo, the development of Monte Carlo methods that abandoned the probability theory model and the central limit theorem for error analysis was undertaken. Of course, this necessitated the construction of a deterministic model and error analysis. Radically, different error analyses must be applied when simulations are based on quasi-random or hybrid-generating sequences.
3.5.2 The Quasi-random Case When quasi-random sequences are used as generators, deterministic error bounds are available. The key ingredients of the quasi-Monte Carlo theory can be illustrated using simple one-dimensional integration.
3
Monte Carlo Methods
135
Definition 3. For a given sequence Q D fx1 ; x2 ; : : :g Œ0; 1/, and any t, 0 t 1, first define a counting function A.Œ0; t/I N; Q/ D number of xi ;
1 i N; with xi 2 Œ0; t/:
(3.5)
Using this notion, the discrepancy of the sequence Q becomes DN .Q/ D sup0 t 1 jLN .Œ0; t//j
(3.6)
where
A.Œ0; t/I N; Q/ t: (3.7) N The discrepancy DN .Q/ plays a key role in bounding the error that results when estimating the theoretical mean of a random variable by its sample average. For finite-dimensional integrals, quasi-Monte Carlo methods replace probability with asymptotic frequency: LN .Œ0; t// D
Z N 1 X lim f .xi / D f .x/dx N !1 N i D1
(3.8)
Is
for a reasonable class of f . Equation 3.8 means, then, that the sequence x1 , x2 , . . . produces convergent sums for the estimation of integrals of functions in the given class. Such sequences are said to be uniformly distributed in I s , a condition that clearly has nothing to do with randomness. For integral equations, the analogous condition is Z N 1 X lim .!i / D d (3.9) N !1 N i D1
and (which here ordinarily represents an estimator of a weighted integral R g.x/‰.x/dx of the solution ‰.x/ of the integral equation) must satisfy mild smoothness restrictions (and Eq. 3.9 then defines the -uniformity of !1 ; !2 ; : : : ; !N in ). The idea of -uniformity was introduced by Chelson [88] who showed that replacing pseudorandom sequences by appropriately chosen uniformly distributed sequences produces -uniformity in . This is the critical result needed to ensure that quasi-random sequences can be used to provide asymptotically valid (as N ! 1) estimating sums for solutions of integral equations. Chelson’s construction, modified slightly in [89], is simply to sample the usual onedimensional conditional probability density functions derived from the source and kernel of the transport equation by using low-discrepancy sequences, rather than pseudorandom ones. However, if one were simply to use a one-dimensional lowdiscrepancy sequence, such as the van der Corput sequence for all of the decisions needed to generate the random walks !1 ; !2 ; : : : , a little thought shows that the random walks would not necessarily satisfy the Markov property. In other words, in switching from pseudorandom sequences that are approximately uniformly and
136
J. Spanier
independently distributed in the unit interval to low-discrepancy sequences that are very uniformly distributed but obviously serially “correlated,” the required condition Eq. 3.9 may be lost. The way around this predicament is to use sequences that are uniform (in this new, deterministic way) in a unit cube I s of sufficiently high dimension s to suffice for generating all collisions of every random walk. The fact that there is no a priori upper bound for such a dimension s in the case of integral equations means that the sequence used must be uniform over the infinitedimensional unit cube. A sequence such as the Halton sequence would suffice, for example, and this is the sequence that Chelson employed in [88]. These ideas can be illustrated using the simple, one-dimensional random walk problem introduced in Section 3.1. We first generated ten random walks using a conventional pseudorandom number generator to make the required decisions and compute the sample mean, m.1/ 10 . The results of that simulation are listed in the table below: Particle 1 2 3 4 5 6 7 8 9 10 X 5 2 2 2 5 5 3 3 6 3
m.1/ 10 3:6 jm.1/ 10 EŒX j D j3:6 ej 0:9 0:87509 0:28: p D 3:162 10 p Here, D 2 is the population standard deviation. These results show that we had rather bad luck with our sample of ten particles. If we want a 95% probability of a relative error no worse than 1/100, using simple probabilistic arguments we would need to take n 3:84.100/2 .0:77=2:72/2 D 3;100 random walk samples. Next, we used the Van der Corput sequence instead of pseudorandom numbers to select step sizes for the random walks. That produces, for n D 10 particles: Particle X
1 3
2 3
3 3
4 2
5 3
6 3
7 2
8 3
9 3
10 2
m.2/ 10 2:7 .2/
jm10 EŒX j D j2:667 ej 0:0183: It appears as though we have improved our estimate of e. However, continuing the process (i.e., incorporating the results of additional particle histories generated in this way) does not improve the estimate further. In fact, this particular quasirandom sequence produces estimates that converge (rapidly!) to 2 2/3 rather than to e. Obviously, great care is needed in implementing quasi-Monte Carlo methods,
3
Monte Carlo Methods
137
even for such simple problems. The difficulty here is that the correlation which is intrinsic in the Van der Corput sequence has defeated the Markov property in the execution of particle random walks and has, therefore, not provided a faithful simulation of the underlying physical process. If we are careful to restore a kind of statistical independence in using quasi-random numbers, which is accomplished here by using components of a higher dimensional quasi-random vector sequence (in fact, the Halton sequence can again be used) to generate the individual steps of each random walk, we can indeed improve the use of pseudorandom sequences. When this was executed for model problem 1, we found: Particle X
1 2 3 4 5 6 7 8 9 10 3 3 3 3 2 7 2 3 3 3
m.3/ 10 3:2 jm.3/ 10 EŒX j D j3:2 ej 0:4818: This provides a better estimate than the one obtained using pseudorandom numbers, and the advantage in employing the quasi-random sequence in place of the pseudorandom one can be shown to increase as the number of samples grows. The basis for analyzing error when using quasi-Monte Carlo methods is the Koksma–Hlawka inequality [90, 91]. It provides a method for bounding the difference between an integral and an average of integrand values. In one variable, this result takes the following form: Theorem 1. Let Q D fx1 ; x2 ; : : :g Œ0; 1/ and let f be a function of bounded variation on [0,1]. Then ˇ ˇ Z1 N ˇ1 X ˇ ˇ ˇ jıN .f /j D ˇ f .xi / f .t/dt ˇ ˇN ˇ i D1
0
DN .Q/V .f /
(3.10)
where DN .Q/ D discrepancy of Q, V .f / D total variation of f. The Koksma–Hlawka inequality has been extended to functions of many variables and provides a rigorous (deterministic) upper bound for the difference between a Monte Carlo-type sum and an integral of a function f of bounded variation. It can be applied to any set of points x1 ; : : : ; xN that lie in the domain of the function f . This idea of bounding such differences by a product of two factors, one of which describes the “smoothness” of the integrand, and the other describes the uniformity of the set of points used in the evaluation, has been generalized by making use of the theory of reproducing kernel Hilbert spaces. In this more general setting, the space of integrands is regarded as a reproducing kernel Hilbert space and the resulting
138
J. Spanier
inequality makes use of the norm in this space to characterize the smoothness of the integrand, while the factor that replaces the discrepancy DN measures the uniformity of the point set in a way that generalizes the classical definition of discrepancy. The interested reader should examine [93] and references cited therein. A Koksma–Hlawka-type inequality has been established for the transport equation [88, 89, 93], which is shown in these references to be an infinitedimensional extension of the finite-dimensional quadrature problem. That is, jıN . /j CO DN
(3.11)
R P O where ıN . / N1 N i D 1 .!i / d. The constant C in Eq. 3.11 measures the variation of ; reductions in CO can be accomplished by importance sampling and similar conventional variance reduction mechanisms, as described in [88, 93]. But improvements in the rate of convergence as N ! 1 based on the Koksma–Hlawka inequality can be obtained only as a result of the rate of decrease of the factor DN . The key question then becomes: How rapidly can DN converge to 0 for arbitrary sequences or point sets? The answer is widely believed to be DN D OŒ.log N /S =N ; S D “effective” dimension of the problem (though slightly more rapid convergence cannot yet be ruled out theoretically). Integral equations are really infinite-dimensional problems in the sense that in general, no a priori upper bound exists for the number of steps in a random walk. However, a finite effective dimension of such a transport problem might be given by the product of the average number of steps and dim (); here is the physical phase space for the underlying transport model. In this case, the effective dimension is essentially the average number of decisions needed to simulate a random walk in the transport process being modeled. Sequences in s dimensions, whose discrepancies are OŒ.log N /S =N are the ones typically used in quasi-Monte Carlo implementations, and these are often referred to as low-discrepancy sequences. A very general family of low-discrepancy sequences are the (t,s)-sequences [10, 94, 95]. These sequences generalize to arbitrary base previous constructions for base 2 [96] and any prime base [97, 98], and are generally believed to possess the lowest discrepancies of any known sequences. Accordingly, these sequences are in wide use for quasi-Monte Carlo implementations. Let S denote either the actual dimension of a multidimensional integral to be estimated or the effective dimension of a discrete or continuous random walk problem to be simulated, as defined, for example, above. For fixed S , quasi-Monte Carlo methods will be superior to pseudorandom methods as N ! 1 because of the inequality (3.11) and because Œ.log N /S =N becomes much smaller than N 1=2 in this limit. However, for practical values of N and moderate values of S , such a comparison may well favor the pseudorandom convergence rate. In fact, when S is only 3, N must be larger than 107 for quasi-random sampling to be expected to improve upon pseudorandom sampling based on the error upper bounds expressed in (3.10) or (3.11). There is also some evidence in support of the conjecture that N must be exponential in S before the advantages of quasi-Monte Carlo methods
3
Monte Carlo Methods
139
over conventional Monte Carlo using pseudorandom sequences can be realized [56]. This means that, for all practical purposes, S cannot be too large. It is when S is too large that hybrid sequences have often been used successfully. Another problem with the use of the Koksma–Hlawka inequality to bound quasiMonte Carlo errors is that the individual terms V .f /, DN appearing on the right side of (3.10) (or the terms CO , DN on the right side of (3.11)) are difficult to estimate. This creates another argument in favor of hybrid sequences, especially those designed with components of randomness that enable a statistical analysis of the error, bypassing the Koksma–Hlawka inequality. Even with these caveats against the routine use of purely quasi-random sequences for estimating high-dimensional integrals or solutions of transport problems, they have been amazingly successful in certain situations for which the Koksma–Hlawka bounds suggest they would not. Examples of this sort arising, for example, in stochastic financial modeling, have inspired a good deal of research aimed at obtaining a deeper understanding of the pros and cons of the use of quasi-random sequences. Figure 3.3 compares the theoretical asymptotic convergence rates associated with pseudorandom Monte Carlo and quasi-random Monte Carlo implemented in two dimensions .S D 2/. The line with slope 1 is shown since it provides a theoretical optimum (at least asymptotically) for quasi-Monte Carlo implementations whose error analysis is based on the Koksma–Hlawka inequality. While this graph is instructive for values of the sample size N that are sufficiently large, for practical values of N there is no assurance that quasi-random errors will be smaller than
100
Pseudorandom
Error
10−5 Quasirandom (S=2) 10−10
10−15 100
Line with slope = −1
105 1010 N = number of random samples
1015
Fig. 3.3 Comparison of pseudorandom, quasi-random (S D 1; 2) convergence rates
140
J. Spanier
pseudorandom ones, as discussed above. Notice that the quasi-random .S D 2/ and pseudorandom lines cross for modest values of N . We have alluded earlier to the fact that good lattice point methods, or their extensions to lattice rules, can provide extremely good results (i.e., estimates of finite-dimensional integrals) when the integrand is a periodic function of each of its variables. In fact, the unusual effectiveness of the simple trapezoidal rule when applied to periodic functions, which has been well known for some time, is an illustration of this phenomenon. The explanation lies in the fact that the analysis of the error made in applying lattice rules to periodic functions is quite different from both of the error analyses discussed so far: statistically based for pseudorandom Monte Carlo or for some hybrid methods, and based on the Koksma–Hlawka inequality for quasi-Monte Carlo methods. In fact, the usual error analysis for lattice methods applied to periodic integrands makes use of number-theoretically based estimates of certain exponential sums. The interested reader might consult Chapter 5 of [10]. Any elaboration here would take us much too far afield.
3.5.3 The Hybrid Case We have just seen that a major drawback to the use of purely quasi-random methods – especially for random walk problems – is the lack of an effective and low-cost error analysis when it is used. By contrast, use of the sample standard deviation or variance in conventional Monte Carlo applications as a measure of uncertainty in the output is simple and inexpensive. Quite recently, Halton [99] has advocated analyzing low-discrepancy sequences as though they were independent and identically distributed uniform sequences, but this device entails generating low-discrepancy sequences in dimensions much higher than actually needed for the simulation itself, and there are some disadvantages in doing this. A similar error analysis has been suggested by Okten [100] when employing hybrid sequences. Okten’s idea is to define a universe consisting of a number of different low-discrepancy sequences of the appropriate dimension for the problem under study (e.g., of dimension s when estimating s-dimensional integrals or infinite dimensional when solving integral equations). One then draws such a sequence at random from this universe and uses it to perform the simulation. Repetition of this process a finite number of times then permits conventional statistical analysis to be applied rigorously to the resulting estimates. Okten has presented evidence [77, 79, 100] that this can be an effective strategy.
3.5.4 Current State of the Art Confidence interval theory is routinely applied to conventional pseudorandom Monte Carlo implementations. For quasi-Monte Carlo implementations, there are no known efficient ways of estimating the error bounds that result from application of
3
Monte Carlo Methods
141
the Koksma–Hlawka inequality. Certain hybrid sequences – for example, randomized low-discrepancy sequences – enable a conventional statistical error analysis to be used, and this seems to be one of the major reasons for employing hybrid sequences for difficult Monte Carlo simulations. Use of such an error analysis circumvents the thorny problem of estimating variations and discrepancies in order to obtain rigorous deterministic error bounds for quasi-random methods that have no random component at all. Many open questions remain concerning how best to utilize low-discrepancy and/or hybrid-generating sequences, and the question of effective error estimation for these methods is far from settled.
3.6 Error Reduction 3.6.1 Introduction The period following World War II was marked by a shift in emphasis from weapons development to peacetime applications of simulation methods. The design of nuclear reactors for power generation, both for use in naval propulsion systems and for commercial application, focused attention anew on Monte Carlo methods. This interest, in turn, accelerated the development of such methods, especially inasmuch as the limitations of deterministic solutions of the transport equation, or various approximations to that equation, became better understood in the 1950s and 1960s. For example, while formulation in terms of the transport equation was frequently replaced by the simpler diffusion equation (which was then often solved by finite difference methods), the inaccuracies inherent in this approach could not be assessed without having “benchmark” transport calculations available. The early development of Monte Carlo methods concentrated on the solution of fairly specific families of reactor physics problems and the development of techniques designed to improve the efficiency of their solution. For example, the need to deal with shielding problems – for which most of the useful information is carried in analog histories that occur only very rarely – gave rise to the study of importance sampling [7, 8, 11, 101–106]. In the review [13], considerable attention was paid to the use of importance sampling to achieve variance reduction, especially in problems involving deep penetration. Provided that sufficiently many random samples could be processed in early pseudorandom Monte Carlo codes, statistical fluctuations could be expected to be low enough to meet critical design criteria (at least most of the time!), albeit with sizeable computing expenditures. Eventually, however, the demands for increased accuracy and speed – especially in the naval reactors program and in the rapidly expanding peacetime applications – inspired the quest for additional clever error reduction strategies. In spite of the gains made in understanding how to use Monte Carlo methods to solve an increasing number of important physical problems, the method seems to have been used only as a last resort during the early period following World War II.
142
J. Spanier
For reactor calculations generally, diffusion theory was dominant. Computations based on finite-difference approximations to the diffusion equation were routinely used for the design of nuclear reactors. There were, no doubt, several valid reasons for this. Monte Carlo calculations required large amounts of computer time and produced only statistical estimates of a few quantities at a time. While diffusion theory produced only an approximation to the solution of the transport equation of uncertain quality (and a rigorous examination of the approximation error was impractical), it provided at least qualitative knowledge of the particle behavior everywhere in the phase space – a distinct advantage. Another factor might have been the growing realization that Monte Carlo simulations making use of importance sampling could produce anomalous results. That is, certain rare occurrences of high-weight particles could produce an “effective bias” that was not well understood at the time. For pseudorandom Monte Carlo implementations, error reduction is usually equated with variance reduction because the N – sample error, declines at the rate ¢N 1=2 where is the standard deviation of the estimating random variable. The analogous issue for quasi-Monte Carlo methods is to seek reductions in the constant CO appearing in the inequality (3.11). In both cases, it is the fluctuations in the sample-to-sample values of the estimator that determines how large the Monte Carlo error is for any sample size. It is natural to inquire whether variance reduction methods developed for pseudorandom Monte Carlo can be directly applied to quasiMonte Carlo implementations, as one might perhaps expect. There has not been a systematic effort to convert variance reduction schemes for pseudorandom Monte Carlo to error reduction schemes for quasi-random Monte Carlo, but we will report on what seems to be known in this regard with respect to each strategy discussed in this section. As the number and kind of error reduction strategies has grown, it has become increasingly difficult to organize them all into a short list of “types.” In the first part of Section 3.6.2, however, we will mainly rely on the classification schemes used by earlier authors [8, 11, 107] for describing variance reduction strategies such as control variates, importance sampling, stratified sampling, and the use of expected values. We will complete this section by discussing a few other error reduction strategies that seemed sufficiently important to treat here. Since we cannot hope for an exhaustive treatment of the subject of error reduction, we will content ourselves with tracing what we think are the most important developments since the publication of [13], especially as they relate to impact on transport applications.
3.6.2 Control Variates The classical method of control variates has been well known in the statistical community for many years. In that context, the method has found application in the design of certain types of sample surveys. For instance, suppose one is interested in estimating the expected value y of a random variable and one can observe the
3
Monte Carlo Methods
143
outcomes of a control variable for which the expected value x is known. Then y N where ; can be estimated as N C x ; N N are the sample means of , . If and are highly positively correlated, this method will be much more effective than if the simple estimate N were used for x. When formulated as a technique for estimating integrals by Monte Carlo, the idea is to represent the integrand f as a sum of a function, , that mimics the behavior of f but whose integral is known (or easier to estimate than f ) and a remainder function, f – . Then, Monte Carlo is used only to estimate the integral of f – , and a substantial reduction in variance or variation can result. A similar idea finds use in transport applications, based on the linearity of the transport operator L.F˛ C Fˇ / D Q˛ C Qˇ (3.12) where L.F˛ / D Q˛ ; L.Fˇ / D Qˇ and L is the transport operator. One way to make use of linearity, if the problem being studied is described by the equation L.F˛ / D Q˛ , is to identify a source Qˇ such that the sum problem (3.12) has a simple, analytically known solution. For example, in one-energy transport problems with an isotropic source Q˛ one can simply define the source Qˇ to be isotropic and of sufficient strength in each region so that the ratio R of source strength to absorption cross section is constant across the entire geometry. This implies that the flux is also isotropic and constant; in fact, the scalar flux is also equal to R. The method then finds use in converting the “’-problem” to the ““-problem”; solving the “-problem by Monte Carlo might provide significant advantages over simulating the ’-problem directly. In general terms, this technique was described in [11] as the superposition principle. It was used by these authors to estimate both thermal flux averages and resonance escape probabilities. In both of these applications, the method was responsible for large gains in efficiency and accuracy. For the resonance escape application, this was especially true when the escape probability pres is close to 1, which is the situation that presents the greatest computational challenge when conventional simulation of the “’-problem” is employed. The method makes use of an analytic calculation of the narrow resonance approximation as a control [108]. Although it is usually identified by a different name, the method of antithetic variates could equally well be described as a control variate method with negative rather than positive correlation. Instead of seeking a random variable that is strongly positively correlated with the original one and which has a known expectation, one seeks a random variable with the same expectation as the original one that is strongly negatively correlated to it. Then forming the average of the two random variables produces a new random variable with the same mean but reduced variance. The idea was first presented in [5] and can be a powerful method for lowering the resulting error. Furthermore, this very simple idea can be extended in several ways, as was already made apparent in [5]. For example, if one is able to construct n mutually antithetic random variables with identical means, their average, or some appropriately chosen weighted average, has the potential to provide unbiased estimates of the same mean with greatly reduced variance. The antithetic
144
J. Spanier
variates method has recently enjoyed a resurgence of interest in problems arising in the finance community, problems that entail estimating integrals of functions that are well approximated by linear functions, for which the method is exceptionally well suited. In [109] (see also [110]), Halton applied the superposition principle iteratively to solve matrix problems by means of a technique that he called “sequential Monte Carlo.” The goal was to improve the Monte Carlo estimates steadily so that geometric convergence of the error to zero could be accomplished. In our view, this idea – which has recently been extended to treat transport problems [111–114] – marks one of the more important developments in Monte Carlo over the last 40 years because the idea of using Monte Carlo sampling to produce global solutions of problems – e.g., the transport flux or collision density everywhere – is so striking. We will devote a bit more attention to it here for that reason. The main idea underlying this method is easy to describe. How can one build a feedback loop, or “learning” mechanism, into the Monte Carlo algorithm by means of which a larger and larger part of the problem can serve as a control variate, leaving a smaller and smaller portion to be estimated stochastically? Since matrix problems can be solved by Monte Carlo by generating random walks on a discrete index set consisting of N objects, where the matrix is of order N N , it is possible to encompass both matrix and (continuous) transport problems within the same formulation by studying random walks on a general (either discrete or continuous) state space, and we will adopt this point of view shortly. Of course, in implementing such a sequential (or adaptive) algorithm, if the feedback mechanism is imposed after each random walk, the additional overhead might easily overwhelm the improvement caused by the increased information content. Accordingly, the approach taken has been to process random walks in stages, each consisting of many samples, and to revise the sampling method at the end of each adaptive stage. The goal then becomes to achieve Ek < Ek1 < k E0 ;
0<<1
k D stage number;
(3.13)
where Ek = error after the kth stage. For example, for continuous transport problems, En D jj .P / Q n .P /jj; and Q n .P / is an approximation to the transport solution obtained in the nth stage. In this context, iterative zero variance Monte Carlo algorithms for global solutions of transport equations make use of expansions .P / D
1 X
ai Bi .P /
i D1
of the solution in a complete setP of basis functions, Bi , and produce essentially exact truncated solutions Q .P / D 1 .P /, where .P / satisfies i D 1 ai Bi .P / the transport equation
3
Monte Carlo Methods
145
Z .P / D
K.P; P 0 / .P 0 /dP 0 C S.P /:
This is accomplished by estimating the expansion coefficients Z ai D
Bi .P / .P /dP
(if Bi are orthonormal) in adaptive stages of ever-increasing accuracy. We consider now the abstract transport equation
D C ;
(3.14)
in which represents a source term and is either a matrix or an integral operator. The solution is most commonly interpreted as a (discrete or continuous) collision density, so that describes the density of initial collisions and incorporates information that describes the probability of transfer from a given state in phase space to the next one. Then, an iterative or multistage procedure can be written quite generally as
D .k/ C .k/ .0/ D ; .0/ D : (3.15) Thus, using Eq. 3.15 we reserve the right to modify both the source term .k/ and the operator kernel term .k/ after each stage of our adaptive algorithm, but our first stage only makes use of the source and kernel of the original transport equation. The first method described by Halton alters only the source term .k/ iteratively, so that .k/ D for all k. We will make use of the more general iterative procedure (3.15) later when we describe an adaptive form of importance sampling. In the context of Eq. 3.15, the control variate, or correlated sampling, algorithm may be characterized by setting .kC1/ D .k/ C yO .k/ yO .k/ ;
.0/ D ;
(3.16)
where yO .k/ is an approximate solution to (3.15). Then as .k/ ! 0; yO .k/ ! 0, x .k/ D yO .k/ C yO .k1/ C C yO .0/ ! and convergence should be geometric with sufficient care in establishing the number of samples in each stage. Thus, we subtract an approximate solution from both sides of the transport equation and solve for the difference between the approximate and exact solutions in each stage. The geometric convergence of an algorithm based on this idea was established rigorously in [113]. For details about the implementation of this sequential correlated sampling (SCS) algorithm that produces geometric convergence, the interested reader should consult [112,114]. Here, we summarize the apparent advantages and disadvantages of using SCS to solve either discrete or continuous transport problems. We notice that Eq. 3.16 indicates that only the analog kernel is needed to implement SCS. This makes sampling the transition probabilities easiest, and is a distinct advantage. However, the reduced source .k/ is nonvanishing everywhere, but it
146
J. Spanier
is normally small and of mixed sign. Most of the cost of using SCS stems from the complexity of dealing with this reduced source. In addition, the solutions of some transport problems vary by many orders of magnitude over the phase space, and for such problems, analog construction of random walk histories may not be sufficient to guarantee that sufficiently many “important” contributors to the solution are represented in the sample space obtained. For example, problems generally unsuitable for analog treatment (e.g., shielding or streaming-type problems) may require many random walks per sequential stage to achieve strict error reduction. For these reasons, a rather different strategy was developed for solving transport equations adaptively, one based on importance sampling. This will be described in Section 3.6.3. As for the use of a control variate strategy in conjunction with quasi-Monte Carlo simulations, quite recently, Hickernell et al. [115] have explored its potential. The context for their study was the estimation of definite integrals and they found, somewhat surprisingly, that functions that serve well as control variates in the stochastic setting may not work well in the deterministic one. The implications of this result for transport applications have apparently not been studied.
3.6.3 Importance Sampling For the estimation of a weighted integral of the transport flux or collision density Z I D
g.P / .P /dP
(3.17)
where g is a known (weighting) function, is the physical phase space, and satisfies the transport equation Z K.P; Q/ .Q/dQ C S.P /;
.P / D
(3.18)
an importance function equation
could be defined as the solution of the adjoint transport Z
.P / D
K .P; Q/
.Q/dQ C g.P /;
(3.19)
where K .P; Q/ K.Q; P /. Under appropriate restrictions, then, it is quite easy to demonstrate that Z I D S.P / .P /dP (3.20)
3
Monte Carlo Methods
147
so that the integral I can be obtained either as a weighted integral (3.17) of the solution of the transport equation or as a weighted integral (3.20) of the solution of a “backward” transport equation. Notice that the roles of the source S and detector g are interchanged in Eqs. 3.18 and 3.19. The reason for describing as an importance function will be made apparent in Section 3.7. The duality expressed by the equality of the integrals (3.17) and (3.20) means that it can be estimated by a Monte Carlo simulation of Eq. 3.18, with initial collisions described by the source function S , as well as by a Monte Carlo simulation of Eq. 3.19, with the adjoint source described by the “detector” function g. Furthermore, while the function serves as an importance function for the estimation of (3.17), the collision density serves as an importance function for the estimation of (3.20). The references cited in Section 3.6.1 describe various aspects of this importance sampling theory and discuss how to use an importance function to alter the analog sampling functions so that a zero variance estimate of the weighted integral (3.17) or (3.20) can be obtained, given perfect information about the importance function. It appears to have been Maynard [116] who suggested that use of the reciprocity principle for the transport operator might be advantageous when applied to certain kinds of Monte Carlo calculations. In that paper he illustrated the use of reciprocity to estimate absorption in a small region and to solve a flux-peaking problem (literally obtaining the transport solution at a point by Monte Carlo). It was appreciated from the outset that accurate estimation of an importance function is as difficult as estimation of the global solution of the original transport equation, so that various practical approximations were brought into play. At their core, many of these variance reduction methods depend on the identification of an approximate importance function. For example, the assumption that underlies use of the exponential transformation is that the importance function is well described by parametrized exponential functions (see, e.g., [117]). The parametrization is provided by the optical distance between the source of radiation and the detection region under investigation. Use of a simple version of the Russian roulette and splitting techniques [11, 12, 118, 119] amounts to the application of a region-wise constant importance function. At the boundary between two subregions of differing “importance,” particles are split into two or more independent particle “fragments,” each with a reduced weight, when moving from a region of lower to higher importance. When moving from a region of higher to lower importance, however, a game of Russian roulette is played that is designed to terminate the random walk with a high probability while increasing the weight of any particles that survive this Russian roulette game in such a way that the unbiased nature of the game is maintained. In the case of shielding problems, use of the exponential transformation is designed to maintain a roughly constant population of particle fragments whose weights should roughly decline exponentially as the particle moves from source to detector. The ideal simulation would, of course, result in every particle reaching the detector with a weight which is precisely the quantity being estimated, for example, the probability of transmission associated with the shield.
148
J. Spanier
Significant effort has continued to be invested in devising mechanisms for reducing variance in difficult Monte Carlo simulations using, for example, splitting and Russian roulette which essentially relies on input of an approximate importance function that takes particularly simple forms. When this approximate importance function is not sufficiently accurate, history weights can fluctuate wildly, adding to the variance and making reliance on this method very risky. A weight windows strategy [120, 121] that controls weight fluctuations by setting upper and lower limits and using Russian roulette and splitting to maintain those limits assures that variances cannot become too large. However, the parameters needed to guarantee high precision using weight windows also rely on knowledge of how the importance function behaves over the phase space. Partly as a natural consequence of this vast effort at creating “practical” variance reduction schemes making use of splitting and Russian roulette, there has been interest [122–127] in the development of an iterative form of importance sampling with goals similar to those achieved for sequential correlated sampling, as described in the previous section. An iterative importance sampling strategy can be based on the construction of ever more accurate approximations to an importance function throughout the entire phase space. Next, we sketch this development. Returning to Eq. 3.15, use is made of an approximate importance function (as obtained from approximate solutions of an appropriate adjoint transport equation) to modify both the source and the kernel of the original transport equation at each adaptive stage. In other words, Eq. 3.15 is used in its full generality for adaptive importance sampling (AIS) and now both .k/ and .k/ will change with k. Provided that an improving approximation to the exact importance function can be assured, convergence will also be geometric for this method. Proof of this fact for matrix problems can be found in [109], and details about implementing AIS may be found in [127, 128]. In these references and in [109] one can also find descriptions of how use is made of importance sampling theory, based on the duality between the original transport equation and its adjoint, to modify both the source and the kernel in each adaptive stage. As for the benefits and disadvantages of AIS, the most serious objection to its use arises from the fact that sampling the nonanalog, importance-modified kernel can be very costly. On the plus side, however, use of an importance function in the sampling usually results in the need for fewer random walks in each adaptive block of histories than is the case for sequential correlated sampling. Also, convergence rates obtained from a fixed number of histories in each stage tend to be more favorable for especially difficult (i.e., slowly convergent) problems when adaptive importance sampling is used than when sequential correlated sampling is used. Overall, however, each of the two methods is very problem-dependent and one cannot state categorically that it is always better to use one algorithm or the other. It is an interesting and challenging question to determine a priori criteria for deciding which method will be superior for any given transport problem. A third iterative method, a variant of adaptive importance sampling, was quite recently developed [129] in order to try to combine the best features of the previous two methods. By relaxing the requirement that the importance sampling estimator
3
Monte Carlo Methods
149
be unbiased, extra freedom in the choice of density functions used to generate the random walks is obtained. This idea had been suggested much earlier for estimating integrals [130] and was extended to transport equations in [131]. Although it makes use of estimators that are biased, they can be shown to be asymptotically (i.e., as the sample size N ! 1) unbiased and to achieve rates of convergence comparable to those obtainable with (unbiased) importance sampling. It remains to be seen whether or not effective ways can be found to choose the sampling density functions so as to realize the full potential of this new adaptive method. The investigation of importance sampling for quasi-Monte Carlo applications was taken up in the dissertation of Paul Chelson [88] where it was shown that the method could be used to achieve reduction in the variation of an integrand function or of a transport estimator. In a later dissertation [93], Earl Maize explored the question of quasi-Monte Carlo applications of the weighted analog sampling estimator. Some of these results are summarized in [57]. Although these results pave the way for a possible iterative application of these strategies for quasi-Monte Carlo implementation along the lines described above in the pseudorandom case, such studies have not yet been carried out to the author’s knowledge.
3.6.4 Stratified Sampling Stratified sampling is another conventional statistical method that has been adapted for estimating integrals or solving transport problems with reduced sampling error. When using Monte Carlo to estimate an integral, stratified sampling amounts to decomposing the range of integration into a number of subsets and applying standard Monte Carlo methods to each subset separately. Optimization of this method then involves deciding how to define the subsets and how many sample values to be used in each. It is less obvious how to make use of this idea for solving transport problems by Monte Carlo. One application of the principle involved would be to subdivide the phase space into mutually disjoint subsets and distribute the initial collision sites of random walks among them according to some prescription that lowers the sampling errors. In the book [11], one version of this idea is called systematic source sampling, and it was shown there that this method always reduces the variance. An extension of this idea might be to subdivide the sample space of random walks into disjoint subsets and attempt to distribute the random walks among these in an optimal way from the point of view of error reduction. This would require imposing a metric, or measure, on the sample space, rather than on the phase space. Recalling that the implementation of Monte Carlo methods for (discrete or continuous) transport problems involves generating the various collision points of each random walk one at a time by random sampling, the use of low-discrepancy sequences rather than pseudorandom ones might be seen as a kind of intensive stratified sampling employed over the unit hypercube rather than over the phase space or the sample space. Thus, the development of quasi-Monte Carlo for the solution
150
J. Spanier
of transport problems can be likened to using stratified sampling of the individual collision sites visited by the random walks. As we have seen earlier, this can lower the sampling error by increasing the rate of convergence of sample averages to theoretical expected values, depending upon the phase space dimension and the number of samples processed. An idea that appears to be related to these is introduced in [132]. In that paper, the author replaces the continuous transport problem by a discrete one by representing the discrete states as obtained by averaging over a user-specified decomposition of the continuous phase space. This leads to a replacement of the integral transport equation by a matrix problem that is inherently much easier to solve than the original one. A similar point of view is taken in [88,133,134], where it was also demonstrated that the use of low-discrepancy, rather than pseudorandom sequences would result in further advantages in terms of rate of convergence. It is primarily because of the potentially useful connections between stratified sampling as a conventional statistical strategy for reducing error and the use of low-discrepancy sequences that we felt it important enough to warrant separate mention here.
3.6.5 Use of Expected Values Many important devices for lowering simulation error succeed because some component of statistical fluctuation in the computation has been replaced by a nonstochastic, exact or approximate, analytic representation. Perhaps the most obvious example of this involves the use of expected values wherein an estimating random variable is replaced by one that has been obtained by computing averages over certain events where this is possible. For example, the use of absorption weighting, or survival biasing, for transport simulations consists of disallowing nonproductive absorption events in favor of reductions of the particle weight through multiplication by the survival probability at each interaction where absorption would normally have been possible. This technique is easily shown to reduce variance at the expense, however, of increased cost per random walk. A more sophisticated use of expected values for transport applications is normally called next-event estimation or expected value scoring. We sketch its use in estimating the tally at some detector in a problem. Instead of waiting until a random walk has reached the detector to record a tally, one can calculate exactly the expected direct (i.e., assuming no intervening collisions) contribution to the detector along the current direction of each random walk. This produces an exponential that involves the optical distance between the current position and detector (see, e.g., Section 3.6 of [11]). The general idea, of course, is to decrease the variability in the tally produced by each random walk simulated by eliminating event-level variability through this theoretical averaging device. By summing all of the event-level contributions (many of which may be zero) over all the events of each history, one is able to extract more information from each random walk without altering the walk
3
Monte Carlo Methods
151
probabilities. One might be tempted to conjecture that it is always advantageous to perform such averaging whenever theoretical averages can be calculated without adding too much to the computational cost. However, reduction in the event-level variability does not necessarily lower the history-level variability, as simple model problem analyses can reveal. For example, if the size of the detector shrinks to a very small volume or even a point, difficulties can be anticipated (see [12]). Therefore, since event-level averaging does add to the computational cost, it is wise to apply next-event estimation with a certain amount of caution. Obtaining the flux or collision density at a point can, however, actually be accomplished by means of a simulation of the transport equation dual to the original one. This will be discussed further in the next section. A nontrivial application of the use of expected values has been worked out recently [135] for the estimation of pulse height tallies in problems arising in oil well logging. In that application, the technique was responsible for improvements that were impressive in simulations of practical importance. When used in conjunction with a weight windows strategy, the gains in efficiency were even more pronounced. An idea related to the use of expected values led to the development of Monte Carlo codes to estimate spatial density functions in infinite media. This approach makes use of the fact that, in a homogeneous medium, the spatial density of particles undergoing random walk can be determined analytically once the sequence of collision parameters is known. Thus, one can use Monte Carlo to sample the sequence of angles and energies and, using these as parameters, it is possible to calculate the probability that a random walking particle suffers any collision between parallel planes at distances z and z C z from the point of origin. This led to the creation of Monte Carlo codes [136] to calculate estimates of entire spatial density functions and other quantities related to these functions that avoided the need to perform any spatial sampling at all. The method is mentioned here because, while it is not, strictly speaking, an example of the use of expected values in the sense described earlier, it does take advantage of the idea that it is most efficient to use Monte Carlo sampling only for those elements of the transport model that cannot be treated analytically. The interested reader can find details in [136].
3.6.6 Other Error Reduction Strategies Space limitations permit only the mention of two other error reduction methods: perturbation Monte Carlo methods and condensed history methods that seem too important to omit, even in such a highly compressed survey. Each of these methods has commanded a lot of attention over a long period of time and each has contributed greatly to the class of transport problems that can be solved effectively by Monte Carlo methods. The correlated sampling method on which perturbation analysis relies is described in [12, 137–139]. Perturbation techniques have been valuable in estimating small differences accurately by Monte Carlo methods. There are several ways to achieve this, but the
152
J. Spanier
purest is to use the same random number or low-discrepancy sequence to generate a set of random walks that can serve to solve both a background, unperturbed, transport problem and a perturbation of that problem. It achieves this by associating two different sets of weights with the histories, weights that reflect the differences between the two problems in a statistically faithful way. Then the strong correlation between the pair of problems makes estimates of the small perturbing effects much more reliable than if the two problems were solved using independently generated random walks. O where More formally, the key is to track a pair of tallying random variables , , O is an unbiased estimator in the unperturbed problem, and estimates the same quantity for the perturbed problem. For example, the unknown to be estimated might be the transmissivity of a shielding array and could be a straightforward analog estimate of transmissivity for some design specification of the shield geometry, while O might represent the estimate of transmissivity with one (or more) small changes introduced in the shielding configuration. Then if denotes the analog measure characteristic of the design shielding array, and if O denotes the analog measure characteristic of the perturbed configuration, the identity Z
holds provided
O d D
Z
dO O D d
dO
(3.21)
(3.22)
R R O Defining O in this way serves to correlate estimates of d; d. In (3.21), the left-hand side is the expected transmissivity for the design geometry, and the righthand side is the expected transmissivity for the perturbed geometry. A single set of random walks generated according to is thus used to represent the solution of two (or more) problems: one, with no perturbation, and the other with the perturbation of known size and composition. In other words, when both and O are averaged with respect to a single set of random walks generated according to the “background” measure , they must be highly positively correlated for small perturbations. Through an extension of this idea, estimates can be obtained of the rates of change of some output quantity with respect to changes in one or more parameters of the problem. For example, if the geometry of the perturbation is assumed to be known but its composition is unknown, this idea can be used to estimate the effect on various output quantities of changes in the composition of the perturbing region. This, then, provides an extremely powerful tool for performing sensitivity analysis by means of Monte Carlo. Finally, the availability of accurate estimates of these derivatives can be combined with the use of an optimization algorithm to provide solutions to inverse problems. Such a solution would be provided, for example, by finding the best (in the sense of least squares) fit with a set of measured or experimentally observed quantities. A recent example of the use of this method to solve an inverse problem arising in biomedical optics can be found in [140, 141].
3
Monte Carlo Methods
153
Condensed history models – which have been widely used for modeling the transport of ionizing radiation for many years (see [142–147]) – have been shown to speed up Monte Carlo simulations significantly while retaining reasonable accuracy for many problems. They achieve this acceleration by replacing detailed, collisionby-collision sampling with multiple collision models or equivalent compressions of information. One such method makes use of similarity relationships for the transport equation [148]. The critical idea is to rewrite the transport equation in terms of altered parameters in such a way that the solution to the equation remains unchanged, and then introduces an approximation that is designed to preserve certain moments of the solution, yet speed up the computation significantly. Specifically, the one-speed integro-differential transport equation is 1@ Cr v @t Z
C †t .r/ .r; ; t / D .r; 0 ; t/†s .r; 0 ! /d0 C q.r; ; t/
(3.23)
4
where the solution describes the radiation flux, q is the physical source, †t .r/ D †s C †a is the total cross section, decomposed as the sum of scattering and absorption cross sections, .r; / describe the position and unit vector along the direction of motion, respectively, of a typical particle, and t denotes the time. This equation can be rewritten as 1@ Cr v @t
qQ.r; ; t/ C I.r; ; t/ D 0
(3.24)
where I.r; ; t/ D †a .r/ .r; ; t / 2 C†s .r/ 4 .r; ; t /
Z
3 f .r; / d0 5 .r; 0 ; t / 2
(3.25)
4
and f .r; / is the probability density function for D 0 , the cosine of the scattering angle. Clearly, then, the solution of Eq. 3.24 is unchanged by the replacement of †a .r/; †s .r/, and f .r; / by †a .r/; †s .r/, and f .r; /, respectively, that use a different set of physical parameters, provided that the quantity I.r; ; t/ is unchanged. This substitution yields the condition Œ†a †a C †s †s
Z D 4
.r; 0 ; t /
†s f .r; / †s f .r; / 0 d 2
(3.26)
154
J. Spanier
which, upon expanding into spherical harmonics and the angular probability density functions f and f into Legendre polynomials and simplifying, gives the following family of equivalence relations: SD
†s 1 fn D ; †s 1 fn
n D 1; 2; : : : ; N:
(3.27)
Here, the nth terms correspond to the nth coefficients in the Legendre expansions of the angular probability density functions, f and f , and N is the similarity relation order. By choosing larger N , one increases the simulation accuracy, admitting more directional anisotropy and thereby approximating the exact transport solution more closely. The assumption that only N –1 angular moments, i.e., only N terms in the series expansion are significant, produces the efficiency S D 1 fN . From Eq. 3.27 it follows that the similarity efficiency, S , lies between 0 and 1. It is also clear from this equation that for optimal efficiency, one wants to choose †s as small as possible for the given N . For many problems involving optically dense media, †s †t (absorption is negligible compared to scattering), †t is very large, and reductions in †s accelerate the simulation by increasing the mean free path approximately by the ratio S . A somewhat different approach assumes that each particle travels a fixed distance s between collisions, where s is chosen to be greater than the inherent mean free path and remains fixed throughout simulation. This artificial enlargement of the mean free path is then accompanied by treating each scattering event by means of a multiple-scattering model, rather than by sampling from the original single scattering phase function repeatedly. The theory that underlies the multiple-scattering model is due to Goudsmit and Saunderson [142, 149]. This method has been carefully analyzed by various authors [145–147, 150] and has been shown to produce very good results, both with respect to speed and accuracy, over a wide range of problems arising in connection with radiation therapy planning.
3.6.7 State of the Art A great deal of progress has been made in advancing the theory and practice of error reduction methods since the publication of [13]. Even so, the time has not yet arrived when Monte Carlo methods can be used routinely to solve general transport problems, even though codes such as MCNP [15] are in very wide use globally. The optimum choice of a sampling/weighting strategy depends in a complicated way on the details of the problem and, without fairly sophisticated controls, error reduction techniques, such as importance sampling, can produce poor results. The recent development of adaptive Monte Carlo algorithms offers the promise of a general-purpose code that automatically extracts the information it requires for each problem; such a code might then finally fulfill this promise. It remains to be seen whether an extremely efficient general-purpose code can be implemented, perhaps
3
Monte Carlo Methods
155
making use of advanced adaptive methods that converge geometrically to prescribed quantities with very small statistical errors. In the meantime, special codes for special applications will still be needed in order to meet very high precision goals for important problems/projects.
3.7 Foundations/Theoretical Developments The fact that several of the most important publications of the early period were classified may well have prevented more rapid dissemination of the critical theoretical ideas. Then too, the emphasis throughout this period was on results, whether in support of the Manhattan project or to speed up development of the nuclear navy. In both the cases, the “proofs of principle” were established by successful implementations – not mathematically rigorous arguments. Indeed, because Monte Carlo methods are so intuitively plausible, there may well have been a reduced dependence on rigor tolerated by its early practitioners. Coupled with the fact that those directly involved with the early advances were preoccupied with races against the clock in one way or another, publication in scholarly journals was often postponed or foregone in the interest of national security. In time, however, the stimuli for improved understanding of the mathematical foundations underlying Monte Carlo methods were at least twofold: the appearance of perplexing or anomalous numerical results (e.g., erratic behavior of sample means in some problems; the possibility of theoretically infinite variance importance sampling strategies that seem quite reasonable otherwise, etc.) and the pressure for constant improvement in new results obtained via Monte Carlo. In turn, not unexpectedly these newer methods often depended on sophisticated transformations of the original problem into problems fully equivalent to it but easy to solve by Monte Carlo. With this came the imposition of increased mathematical sophistication and understanding. Recognition that transport problems are natural infinite-dimensional extensions of finite-dimensional quadrature problems has provided the motivation for developing a rigorous measure-theoretic foundation for Monte Carlo solutions of transport problems. This allows a demonstration of the equivalence of formulations based on the transport equation (analytic model), Monte Carlo sampling (probability model), and quasi-Monte Carlo sampling (deterministic, number-theoretic model) [11, 58, 151]. It has also been valuable to recognize that Monte Carlo solutions of matrix problems can further our understanding of Monte Carlo solutions of continuous transport problems. The mathematical models of the two classes of problems are very similar. In both the discrete and the continuous cases, the solution can be represented as an infinite series of terms, each of which accounts for random walks that make exactly k collisions, k D 1; 2; : : : . The degree of difficulty of each problem can be measured, to some extent, by the rate of convergence of this infinite series. For example, the effective dimension of either type of problem can be defined as the product of the average number of collisions made by the random walks and the
156
J. Spanier
phase space dimension, as we remarked earlier. If this effective dimension is higher, more computational effort must be invested, in general, in order to solve the problem. An important contribution to our theoretical understanding of the analysis of error in Monte Carlo calculations was advanced in the 1970s in a series of publications by Harvey Amster and his collaborators [152–155]. The key idea involved is to relate the expected value of an estimating random variable to an adjoint transport equation. For example, consider the integral transport equation for the collision density Z .P / D S.P / C
K.P; Q/ .Q/dQ;
(3.28)
C.P; P 0 /T .P 0 ; Q/dP 0 ;
(3.29)
Z
where K.P; Q/ D
and the kernel T describes free flight transport and the kernel C describes the collision mechanics. The function S is the density of initial collision states and is related to the physical source density q via Z S.P / D T .P; P 0 /q.P 0 /dP 0 : (3.30) It is instructive to write down the equation adjoint to (3.28): Z .P / D S .P / C K.P; Q/ .Q/dQ
(3.31)
so that, as we showed in Section 3.6, we have the equality Z Z .P /S .P /dP D .P /S.P /dP :
(3.32)
Substitution of (3.30) into (3.32) gives Z
.P /S .P /dP D
Z
Z
Now if we denote M1 .P / D
.P /T .P; P 0 /q.P 0 /dP 0 dP :
.P /T .P; P 0 /dP 0 ;
it follows quite readily that the adjoint solution .P /Rmust be the expected contribution to the estimation of the “reaction rate” I D .P /S .P /dP due to a particle originating at P from the physical source q. It is also straightforward to show that the integral equation satisfied by the function M1 is Z M1 .P / D
0
0
T .P; P /S .P /dP C
Z
L.P; P 0 /M1 .P 0 /dP 0
(3.33)
3
Monte Carlo Methods
157
Z
where L.P; Q/ D
T .P; P 0 /C.P 0 ; Q/dP 0 :
Making use of uniqueness of solutions of the transport equation and its adjoint, it is not difficult to show that Eq. 3.33 is adjoint to the integro-differential form of the original transport process, making the function M1 an importance function for this problem. Higher moment equations, that is, integral equations for the expected square, cube, etc. of the score can be derived in similar fashion. This technique was initially developed as a mechanism for comparing variances of competing Monte Carlo strategies, thereby providing useful information about whether or not a proposed Monte Carlo method might be superior to an alternative formulation. However, the connection between these moment equations and the original transport process has led to a variety of other uses over the years.
3.7.1 State of the Art We now know how to demonstrate equivalence between an analytic model of a given problem derived from the transport equation with either a probabilistic model to be used for pseudorandom simulation or a deterministic model to be used for quasi-random simulation. Likewise, the derivation of coupled integral equations for expected values of higher moments of estimators is well understood. However, applying these models and derivations to achieve optimal performance is still as much art as it is science. Nevertheless, such theoretical advances have proven to be of great value in advancing the development of effective Monte Carlo techniques.
3.8 Challenges In this chapter, we have focused on the Monte Carlo solution of integral equations, and especially transport equations, as seemed in keeping with the spirit of the Gelbard lecture series. We have, nevertheless, tried to indicate that estimation of definite integrals and other conventional and unconventional Monte Carlo applications areas have also spurred developments highly relevant to the solution of transport problems. We close this chapter with some thoughts about open questions such as whose resolutions would, in our opinion, further advance the theory and practice of Monte Carlo methods for traditional nuclear applications. We have seen that high-dimensional integrals and transport problems can both benefit from the use of a judiciously chosen mixture of pseudorandom and quasirandom generating sequences. We have also suggested that these same techniques ought to play a useful role in the Monte Carlo solution of transport problems, but this has not been attempted in any systematic way as yet.
158
J. Spanier
A relatively new branch of the theoretical analysis of Monte Carlo algorithms deals with their computational complexity (see, e.g., [87] and references cited therein). It would certainly be instructive to develop practical criteria for optimality with respect to complexity. The use of perturbation and differential Monte Carlo tools, coupled with optimization algorithms, to solve inverse problems is a rather new and important development, in our view. Much more effort would seem warranted for such problems. We have sketched the development of another rather new circle of ideas: the use of sequential or adaptive algorithms to achieve very rapid convergence of Monte Carlo estimates. Three different strategies have evolved to date: sequential correlated sampling, adaptive importance sampling, and generalized weighted analog sampling. It will be important to learn how these, or possibly others, can be used to solve various families of practical transport problems easily and efficiently. Strengthening our theoretical understanding of the application of low-discrepancy sequences to difficult transport problems would seem to be overdue, inasmuch as most traditional Monte Carlo programs continue to rely on pseudorandom sequence generators. At a minimum it would be well to derive more precise criteria for estimating the overall efficiency of a program implemented with low-discrepancy sequences in terms of the parameters that characterize the problem. This will, no doubt, prove to be a difficult exercise. Acknowledgments The author gratefully acknowledges the support of the Laser Microbeam and Medical Program NIH P-41-RR-01192, and grants UCOP 41730 and NSF/DMS 0712853 during the preparation of this chapter.
References 1. Buffon GC (1777) Essai d’arithmetique morale. Supplement a´ l’histoire naturelle 4 2. Laplace MP-S (1886) Theory Analytiques des Probabilities, Livre 2, contained in Oeuvres Completes de Laplace, de L’Academie des Sciences, vol 7, part 2. Paris, pp 365–366 3. Mantel N (1953) An extension of the Buffon needle problem. Ann Math Stat 24:674–677 4. Kahan BC (1961) A practical demonstration of a needle experiment designed to give a number of concurrent estimates of . J R Stat Soc Series A 124:227–239 5. Hammersley JM, Morton KW (1956) A new Monte Carlo technique: antithetic variates. Proc Camb Phil Soc 52:449–475 6. Fishman G (1996) Monte Carlo: Concepts, Algorithms, and Applications, Springer Series in Operations Research 7. Cashwell ED, Everett J (1959) Monte Carlo method for random walk problems. Pergamon, New York 8. Hammersley JM, Handscomb DC (1964) Monte Carlo methods. Methuen & Co., Ltd., London 9. Kalos MH, Whitlock PA (1986) Monte Carlo methods, Volume I: basics. Wiley-Interscience, New York 10. Niederreiter H (1992) Random number generation and quasi-Monte Carlo methods, #63 in CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia, PA 11. Spanier J, Gelbard EM (1969) Monte Carlo principles and neutron transport problems. Addison-Wesley, Reading, MA
3
Monte Carlo Methods
159
12. Lux I, Koblinger L (1991) Monte Carlo particle transport methods: neutron and photon calculations. CRC Press, Boca Raton, FL 13. Kalos MH, Nakache FR, Celnik J (1968) Monte Carlo methods in reactor computations. In: Greenspan H, Kelber CN, Okrent D (eds) Computing methods in reactor physics. Gordon & Breach, New York, pp 365–438 14. Greenspan H, Kelber CN, Okrent D (eds) (1968) Computing methods in reactor physics. Gordon & Breach, New York, pp 365–438 15. X-5 Monte Carlo Team (2003) MCNP – a general N-particle transport code, Version 5,” LA-UR-03–1987, Los Alamos National Laboratory 16. Metropolis N, Ulam S (1949) The Monte Carlo method. J Am Stat Assoc 44:335–341 17. Kahn H (1954) Applications of Monte Carlo, RAND Corp. Report AECU – 3259 (April 1954; revised April 1956) 18. Kahn H (1956) Use of different Monte Carlo sampling techniques. In: Meyer HA (ed) Symposium on Monte Carlo methods. Wiley, New York, pp 146–190 19. Coveyou RR (1969) Random number generation is too important to be left to chance. Appl Math 3:70–111 20. Devroye L (1986) Non-uniform random variate generation. Springer, New York 21. Stadlober E, Kremer R (1992) Sampling from discrete and continuous distributions with C-Rand. In: Pflug G, Dieter U (eds) Simulation and optimization. Lecture notes in economics and math. systems, vol 374. Springer, Berlin, pp 154–162 22. Stadlober E, Niederl F (1994) C-Rand: a package for generating nonuniform random variates. In Compstat’94, Software Descriptions, pp 63–64 23. Lehmer DH (1964) Mathematical methods in large-scale computing units. Proc 2nd Symp on Large-Scale Calculating Machinery (1949), Ann Comp Lab Harvard Univ 26:141–146 24. Knuth DE (1998) The art of computer programming, Seminumerical Algorithms, vol 2, 3rd edn. Addison-Wesley, Reading, MA 25. Coveyou RR (1960) Serial correlation in the generation of pseudo-random numbers. J ACM 7:72–74 26. MacLaren MD, Marsaglia G (1965) Uniform random number generators. J ACM 12:83–89 27. Marsaglia G (1968) Random numbers fall mainly in the planes. Proc Natl Acad Sci USA 61:25–28 28. Anderson SL (1990) Random number generators on vector supercomputers and other advanced architectures. SIAM Rev 32:221–251 29. Dagpunar J (1988) Principles of random variate generation. Oxford University Press, Oxford 30. Deak I (1989) Random number generators and simulation. Akademiai Kiado, Budapest 31. Dieter U (1986) Non-uniform random variate generation. Springer, New York 32. James F (1990) A review of pseudorandom number generators. Comp Phys Commun 60:329–344 33. L’Ecuyer P (1990) Random numbers for simulation. Commun ACM, 33:85–97 34. L’Ecuyer P (1994) Uniform random number generation. Ann Oper Res 53:77–120 35. Niederreiter H (1995) New developments in uniform random number and vector generation. In: Niedderreiter H, Shiue P J-S (eds) Monte Carlo and quasi-Monte Carlo methods in scientific computing, Lecture Notes in Statistics #106. Springer, New York, pp 87–120 36. Niederreiter H (1993) Finite fields, pseudorandom numbers, and quasi-random points. In: Mullen GL, Shiue PJ-S (eds) Finite fields, coding theory, and advances in communications and computing. Marcel Dekker, New York, pp 375–394 37. Bergstrom V (1936) Einige Bemerkungen zur Theorie der Diophantischen Approximationen. Fysiogr Salsk Lund Forh 6(13):1–19 38. Van der Corput JG, Pisot C (1939) Sur la Discr´epance Modulo un. Indag Math 1:143–153, 184–195, 260–269 39. Bratley P, Fox BL, Schrage LE (1987) A guide to simulation, 2nd edn. Springer, New York 40. Fishman G, Moore III LS (1986) An exhaustive analysis of multiplicative congruential random number generators with modulus 231 – 1. SIAM J Sci Stat Comp 7:24–45 41. Fishman G (1989) Multiplicative congruential random number generators with modulus 2ˇ : an exhaustive analysis for ˇ D 32 and a partial analysis for ˇ D 48. Math Comp 54:331–344
160
J. Spanier
42. Ripley BD (1983) The lattice structure of pseudo-random number generators. Proc R Soc Lond Ser A 389:197–204 43. Law AM, Kelton WD (2002) Simulation modeling and analysis, 3rd edn. McGraw-Hill, New York 44. L’Ecuyer P (1998) Random number generation. Chapter 4. In: Banks J (ed) Handbook of simulation. Wiley, New York, pp 93–137 45. Hellekalek P, Larcher G (eds) (1998) Random and quasi-random point sets, vol 138 of Lecture Notes in Statistics. Springer, New York 46. L’Ecuyer P, Simard R (2000) On the performance of birthday spacings tests for certain families of random number generators. Math Comp Simul 55:131–137 47. L’Ecuyer P (1999) Good parameters and implementations for combined multiple recursive random number generators. Oper Res 47:159–164 48. Eichenauer J, Lehn J (1986) A nonlinear congruential pseudorandom number generator. Stat Papers 27:315–326 49. L’Ecuyer P (2002) Random numbers. In: Smelser NJ, Paul B Baltes (eds) The international encyclopedia of the social and behavioral sciences. Pergamon, Oxford, pp 12735–12738 50. Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comp Simul 8:3–30 51. L’Ecuyer P, Andres TH (1997) A random number generator based on the combination of four LCGs. Math Comp Simul 44:99–107 52. L’Ecuyer P (1999) Tables of maximally equidistributed combined LFSR generators. Math Comp 68:261–269 53. Zaremba SK (1968) The mathematical basis of Monte Carlo and quasi-Monte Carlo methods. SIAM Rev 10:304–314 54. Keller A (1995) A Quasi-Monte Carlo Algorithm for the global illumination problem in the radiosity setting. In: Niederreiter H, Shiue PJ (eds) Monte Carlo and quasi-Monte Carlo methods in scientific computing, Lecture Notes in Statistics 106. Springer, New York, pp 239–251 55. Keller A (1998) The quasi-random walk. In: Niederreiter H, Hellekalek P, Larcher G, Zinterhof P (eds) Monte Carlo and Quasi-Monte Carlo methods 1996, Lecture Notes in Statistics 127. Springer, New York, pp 277–291 56. Morokoff WJ, Caflisch RE (1993) A Quasi-Monte Carlo approach to particle simulation of the heat equation. SIAM J Num Anal 30:1558–1573 57. Spanier J, Maize EH (1994) Quasi-random methods for estimating integrals using relatively small samples. SIAM Rev 36:18–44 58. Spanier J (1995) Quasi-Monte Carlo methods for particle transport problems. In: Niederreiter H, Shiue PJ (eds) Monte Carlo and quasi-Monte Carlo methods in scientific computing, Lecture Notes in Statistics 106. Springer, New York, pp 121–148 59. Boyle P (1977) Options: a Monte Carlo approach. J Fin Econ 4(4):323–338 60. Morokoff WJ, Caflisch RE (1997) Quasi-Monte Carlo simulation of random walks in finance. In: Niederreiter H, Hellekalek P, Larcher G, Zinterhof P (eds) Monte Carlo and quasi-Monte Carlo methods 1996, Lecture Notes in Statistics 127. Springer, New York, pp 340–352 61. Joy C, Boyle P, Tan KS (1996) Quasi-Monte Carlo methods in numerical finance. Manage Sci 42:926–938 62. Tezuka S (1998) Financial applications of Monte Carlo and Quasi-Monte Carlo methods. In: Hellekalek P, Larcher G (eds) Random and quasi-random point sets, Lecture Notes in Statistics 138. Springer, New York, 303–332 63. Cohen M, Wallace J (1993) Radiosity and realistic image synthesis. Academic Press Professional, Cambridge 64. Lafortune E (1996) Mathematical models and Monte Carlo algorithms for physically based rendering. Ph.D. dissertation, Katholieke Universitiet, Leuven, Belgium 65. Van der Corput JG (1935) Verteilungsfunktionen I, II, Nederl. Akad Wetensch Proc Ser B, 38:813–821, 1058–1066 66. Halton JH (1960) On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Num Math 2:84–90
3
Monte Carlo Methods
161
67. Korobov NM (1959) The approximate computation of multiple integrals. Dokl Akad Nauk SSSR 124:1207–1210 (in Russian) 68. Hlawka E (1962) Zur Angen¨aherten Berechnung Mehrfacher Integrale. Monatsch Math 66:140–151 69. Hua K, Wang Y (1981) Applications of number theory to numerical analysis. Springer, Berlin 70. Sloan IH, Joe S (1994) Lattice methods for multiple integrals. Oxford University Press, Oxford 71. Owen A (1995) Randomly permuted (t; m; s)-nets and (t; m; s)-sequences. In: Niederreiter H, Shiue PJ (eds) Monte Carlo and quasi-Monte Carlo methods in scientific computing, Lecture Notes in Statistics 106. Springer, New York, pp 299–317 72. Faure H (1992) Good permutations for extreme discrepancy. J Num Theor 41:47–56 73. Wang J, Hickernell FJ (2000) Randomized Halton sequences. Math Comp Model 32:887–899 74. Moskowitz B (1995) Quasi-random diffusion Monte Carlo. In: Niederreiter H, Shiue PJ-S (eds) Monte Carlo and quasi-Monte Carlo methods in scientific computing, Lecture Notes in Statistics, 106. Springer, Berlin, pp 278–298 75. Coulibaly I, Lecot C (1998) Monte Carlo and quasi-Monte Carlo algorithms for a linear integro-differential equation. In: Niederreiter H, Hellekalek P, Larcher G, Zinterhof P (eds) Monte Carlo and quasi-Monte Carlo methods 1996, Lecture Notes in Statistics 127. Springer, New York, 176–188 76. Okten G (1999) High dimensional integration: a construction of mixed sequences using sensitivity of the integrand. Technical Report, Ball State University, Muncie, IN 77. Okten G (2000) Applications of a hybrid Monte Carlo sequence to option pricing. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods, 1998. Springer, New York, pp 391–406 78. Moskowitz BS (1993) Application of quasi-random sequences to Monte Carlo methods. Ph.D. dissertation, UCLA 79. Okten G (1999) Random sampling from low discrepancy sequences: applications to option pricing. Technical Report, Ball State University, Muncie, IN 80. Paskov SH (1997) New methodologies for valuing derivatives. In: Pliska S, Dempster M (eds) Mathematics of securities. Isaac Newton Institute, Cambridge University Press, Cambridge 81. Paskov SH, Traub JF (1995) Faster valuation of financial derivatives. J Portfolio Manage 22:113–120 82. Cukier RI, Levine HB, Shuler KE (1978) Nonlinear sensitivity analysis of multiparameter model systems. J Comp Phys 26:1–42 83. Owen A (1992) Orthogonal arrays for computer experiments, integration and visualization. Statistica Sinica 2:439–452 84. Radovic I, Sobol’ IM, Tichy RF (1996) Quasi-Monte Carlo methods for numerical integration: comparison of different low discrepancy sequences. Monte Carlo Meth Appl 2:1–14 85. Sobol IM (1993) Sensitivity estimates for nonlinear mathematical models. MMCE 1:407–414 86. Sloan IH, Wozniakowski H (1998) When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? J Complexity 14:1–33 87. Wozniakowski H (2000) Efficiency of quasi-Monte Carlo algorithms for high dimensional integrals. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods 1998. Springer, New York, pp 114–136 88. Chelson P (1976) Quasi-random techniques for Monte Carlo methods. Ph.D. dissertation, The Claremont Graduate School, Claremont 89. Spanier J, Li L (1998) Quasi-Monte Carlo methods for integral equations. In: Niederreiter H, Hellekalek P, Larcher G, Zinterhof P (eds) Monte Carlo and quasi-Monte Carlo methods 1996, Lecture Notes in Statistics 127. Springer, New York, pp 398–414 90. Koksma JF (1942–1943) Een Allgemeene Stelling uit de Theorie der Gelijkmatige Verdeeling Modulo 1. Mathematica B. (Zutphen) 11:7–11 91. Hlawka E (1961) Funktionen von Beschr¨ankter Variation in der Theorie der Gleichverteilung. Ann Mat Pura Appl 54:325–333
162
J. Spanier
92. Hickernell FJ (2006) Koksma-Hlawka inequality. In: Kotz S, Johnson NL, Read CB, Balakrishnan N, Vidakovic B (eds) Encyclopedia of statistical sciences, vol 6, 2nd edn. Wiley, Hoboken, NJ, pp 3862–3867 93. Maize EH (1981) Contributions to the theory of error reduction in quasi-Monte Carlo methods. Ph.D. dissertation, The Claremont Graduate School, Claremont 94. Niederreiter H, Xing C (1998) The algebraic-geometry approach to low-discrepancy sequences. In: Niederreiter H, Hellekalek P, Larcher G, Zinterhof P (eds) Monte Carlo and quasi-Monte Carlo methods 1996, Lecture Notes in Statistics 127. Springer, New York, pp 139–160 95. Niederreiter H (2000) Construction of (t,m,s)-nets. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods, 1998. Springer, New York, pp 70–85 96. Sobol IM (1967) The distribution of points in a cube and the approximate evaluation of integrals. Zh Vychisl Mat i Mat Fiz 7:784–802 (in Russian) 97. Faure H (1981) Discr´epances de Suites Associ´ees a` un Syst`eme de Num´eration (en Dimension un). Bull Soc Math France 109:143–182 98. Faure H (1982) Discr´epances de Suites Associ´ees a` un Syst`eme de Num´eration (en Dimension S). Acta Arith 41:337–351 99. Halton J (1998) Independence of quasi-random sequences and sets. Working Paper CB#3175, University of North Carolina, Chapel Hill, NC 100. Okten G (1998) Error estimation for Quasi-Monte Carlo methods. In: Niederreiter H, Hellekalek P, Larcher G, Zinterhof P (eds) Monte Carlo and quasi-Monte Carlo methods 1996, Lecture Notes in Statistics 127. Springer, New York 101. Goertzel G, Kalos MH (1958) Monte Carlo methods in transport problems. In: Hughes DJ, Sanders JE, Horowitz J (eds) Progress in nuclear energy, vol II, series I, Physics and Mathematics. Pergamon, New York, pp 315–369 102. Leimdorfer M (1964) On the transformation of the transport equation for solving deep penetration problems by the Monte Carlo methods. Trans Chalmers University of Tech, #286. Goteborg, Sweden 103. Leimdorfer M (1964) On the use of Monte Carlo methods for calculating the deep penetration of neutrons in shields. Trans Chalmers University of Tech, #287, Goteborg, Sweden 104. Coveyou RR, Cain VR, Yost KJ (1967) Adjoint and importance in Monte Carlo application. Oak Ridge National Laboratory Report ORNL-4093 105. Kalos MH (1963) Importance sampling in Monte Carlo shielding calculations – neutron penetration through thick hydrogen shields. Nucl Sci Eng 16:227 106. Goertzel G (1949) Quota sampling and importance functions in stochastic solution of particle problems. Oak Ridge National Laboratory Report ORNL-434 107. Halton JH (1970) A retrospective and prospective survey of the Monte Carlo method. SIAM Rev 12:1–63 108. Gelbard EM, Spanier J (1964) Use of the superposition principle in Monte Carlo resonance escape calculations. Trans Am Nucl Soc 7:259–260 109. Halton J (1962) Sequential Monte Carlo. Proc Camb Phil Soc 58:57–73 110. Halton J (1994) Sequential Monte Carlo techniques for the solution of linear systems. J Sci Comp 9:213–257 111. Kong R (1999) Transport problems and Monte Carlo methods. Ph.D. dissertation, Claremont Graduate University, Claremont 112. Kong R, Spanier J (2000) Sequential correlated sampling methods for some transport problems. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods 1998. Springer, Berlin, pp 238–251 113. Kong R, Spanier J (2000) Error analysis of sequential Monte Carlo methods for transport problems. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods 1998. Springer, Berlin, pp 252–272 114. Spanier J (2000) Geometrically convergent learning algorithms for global solutions of transport problems. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods 1998. Springer, Berlin, pp 98–113
3
Monte Carlo Methods
163
115. Hickernell FJ, Lemieux C, Owen AB (2005) Control variates for quasi-Monte Carlo, 2002. Stat Sci 20:1–31 116. Maynard CW (1961) An application of the reciprocity theorem to the acceleration of Monte Carlo calculations. Nucl Sci Eng 10:97–101 117. Spanier J (1970) An analytic approach to variance reduction. SIAM J Appl Math 18:172–190 118. Burn KW, Nava E (May 1997) Optimization of variance reduction parameters in Monte Carlo radiation transport calculations to a number of responses of interest. Proceedings of the international conference on nuclear data for science and technology. Italian Physical Society, Trieste, Italy 119. Burn KW, Gualdrini G, Nava E (2002) Variance reduction with multiple responses. In: Kling A, Barao F, Nakagawa M, Tavora L, Vaz P (eds) Advanced Monte Carlo for radiation physics, particle transport simulation and applications. Proceedings of the MC2000 conference. Lisbon, Portugal, 23–26 October 2000, pp 687–695 120. Hendricks J (1982) A code – generated Monte Carlo importance function. Trans Am Nucl Soc 41:307 121. Cooper MA, Larsen EW (2001) Automated weight windows for global Monte Carlo particle transport calculations. Nucl Sci Eng 137:1–13 122. Booth TE (1986) A Monte Carlo learning/biasing experiment with intelligent random numbers. Nucl Sci Eng 92:465–481 123. Booth TE (1988) The intelligent random number technique in MCNP. Nucl Sci Eng 100:248–254 124. Booth T (1985) Exponential convergence for Monte Carlo particle transport. Trans Am Nucl Soc 50:267–268 125. Booth T (1997) Exponential convergence on a continuous Monte Carlo transport problem. Nucl Sci Eng 127:338–345 126. Kollman C (1993) Rare event simulation in radiation transport. Ph.D. dissertation, University of California, Berkeley, CA 127. Lai Y, Spanier J (2000) Adaptive importance sampling algorithms for transport problems. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods 1998. Springer, New York, pp 276–283 128. Hayakawa C, Spanier J (2000) Comparison of Monte Carlo algorithms for obtaining geometric convergence for model transport problems. In: Niederreiter H, Spanier J (eds) Monte Carlo and quasi-Monte Carlo methods 1998. Springer, New York, pp 214–226 129. Spanier J, Kong R (2004) A new adaptive method for geometric convergence. In: Niederreiter H (ed) Proceedings MCQMC 2002. 25–28 November 2002, Singapore, pp 439–449 130. Powell MJD, Swann J (1966) Weighted uniform sampling – a Monte Carlo technique for reducing variance. J Inst Math Appl 2:228–236 131. Spanier J (1979) A new family of estimators for transport problems. J Inst Math Appl 23:1–31 132. Booth TE (1990) A quasi-deterministic approximation of the Monte Carlo importance function. Nucl Sci Eng 104:374–384 133. Li L (1995) Quasi-Monte Carlo methods for transport equations. Ph.D. dissertation, The Claremont Graduate School, Claremont 134. Li L, Spanier J (1997) Approximation of transport equations by matrix equations and sequential sampling. Monte Carlo Meth Appl 3:171–198 135. Mosher S, Maucec M, Spanier J, Badruzzaman A, Chedester C, Evans M, Gadeken L Expected-value techniques for Monte Carlo modeling of well logging problems. In review 136. Amster HJ, Kuehn H, Spanier J (February 1960) Euripus-3 and Daedalus – Monte Carlo Density Codes for the IBM-704. Westinghouse Atomic Power Laboratory report WAPD-TM205 137. Rief H (1984) Generalized Monte Carlo perturbation theory for correlated sampling and a second order Taylor series approach. Ann Nucl Energy 11:455–476 138. Rief H, Gelbard EM, Schaefer RW, Smith KS (1986) Review of Monte Carlo techniques for analyzing reactor perturbations. Nucl Sci Eng 92:289–297 139. Rief H (1996) Stochastic perturbation analysis applied to neutral particle transport. Adv Nucl Sci Tech 23:69–140
164
J. Spanier
140. Hayakawa C, Spanier J, Bevilacqua F, Dunn AK, You JS, Tromberg BJ, Venugopalan V (2001) Perturbation Monte Carlo methods to solve inverse photon migration problems in heterogeneous tissues. Optics Lett 26(17):1335–1337 141. Hayakawa CK, Spanier J Perturbation Monte Carlo methods for the solution of inverse problems. In: Niederreiter H (ed) Proceedings MCQMC 2002. 25–28 November 2002, Singapore, Springer, pp 227–241 (to appear) 142. Goudsmit S, Saunderson JL (1940) Multiple scattering of electrons. Phys Rev 57:24–29 143. Lewis HW (1950) Multiple scattering in an infinite medium. Phys Rev 78:526–529 144. Berger MJ (1963) Monte Carlo calculations of the penetration and diffusion of fast charged particles. In: Alder B, Fernbach S, Rotenberg M (eds) Methods in computational physics, vol I. Academic, New York, pp 135–215 145. Larsen EW (1992) A theoretical derivation of the condensed history algorithm. Ann Nucl Energy 19(10–12):701–714 146. Fernandez-Varea JM, Mayol R, Baro J, Salvat F (1993) On the theory and simulation of multiple elastic scattering of electrons. Nucl Inst Meth Phys Res B73:447–473 147. Kawrakow I, Bielajew AF (1998) On the condensed history technique for electron transport. Nucl Inst Meth Phys Res B142:253–280 148. Wyman DR, Patterson MS, Wilson BC (1989) Similarity relation for anisotropic scattering in Monte Carlo simulations of deeply penetrating neutral particles. J Comp Phys 81:137–150 149. Bielajew AF, Salvat F (2000) Improved electron transport mechanics in the PENELOPE Monte Carlo model. Nucl Inst Meth Phys Res B173:332–343 150. Tolar DR, Larsen EW (2001) A transport condensed history algorithms for electron Monte Carlo simulations. Nucl Sci Eng 139:47–65 151. SpanierJ, Li L (1998) General sequential sampling techniques for Monte Carlo simulations: Part I – matrix problems. In: Niederreiter H, Hellekalek P, Larcher G, Zinterhof P (eds) Monte Carlo and quasi-Monte Carlo methods 1996. Springer Lecture Notes in Statistics #127, Springer, New York, 382–397 152. Amster HJ, Djomehri MJ (1976) Prediction of statistical error in Monte Carlo transport calculations. Nucl Sci Eng 60:131–142 153. Booth TE, Amster HJ (1978) Prediction of Monte Carlo errors by a theory generalized to treat track-length estimators. Nucl Sci Eng 65:273–281 154. Booth TE, Cashwell ED (1979) Analysis of error in Monte Carlo transport calculations. Nucl Sci Eng 71:128–142 155. Amster HJ (1971) Determining collision variances from adjoints. Nucl Sci Eng 43:114–116
3
Monte Carlo Methods
165
Professor Jerome Spanier received a BA in mathematics and physics at the University of Minnesota in 1951 and an M.S. and Ph.D. in mathematics from the University of Chicago in 1952 and 1955, respectively. He spent the next 16 years at industrial research laboratories, first in suburban Pittsburgh at the Bettis Atomic Power Laboratory operated by Westinghouse, then at the North American Aviation (later Rockwell International) central research laboratory – the Science Center – in Thousand Oaks, California. In 1971, he moved to academia as Full Professor of Mathematics at the Claremont Graduate School (CGS) in Claremont, California. There he founded the Mathematics Clinic, a practicum course in which students and faculty solve real world problems, in 1973–1974. This course has played a central role in the applied mathematics curriculum at the Claremont Colleges since its inception. In 1998, Spanier became Professor Emeritus in order to devote full time to research and he established a small research institute, the Claremont Research Institute of Applied Mathematical Sciences (CRIAMS), in Claremont. He devoted 8 of the intervening years to full-time administration at CGS: first, as Dean of Faculty in 1982 and subsequently as Vice President for Academic Affairs and Dean of the Graduate School until his return to the faculty in 1990. Spanier is the author of several books and numerous articles and technical reports, and he has spent much of his career contributing to both the theory and applications of Monte Carlo methods. He has applied these, and other numerical and analytical methods, to a variety of problems arising in chemistry, physics, and engineering. He now focuses much of his attention on medical applications at the University of California at Irvine, although he remains a Senior Fellow and Director of CRIAMS in Claremont.
Chapter 4
Reactor Core Methods Robert Roy
4.1 Introduction This chapter addresses the simulation flow chart that is currently used for reactor-physics simulations. The methodologies presented are more appropriate to the context of power reactors, and the chapter focuses particularly on the threedimensional (3D) aspect of core calculations. Software design that is currently used to achieve accurate numerical simulations of reactor cores is also studied from a practical nuclear engineering point of view. The focus here is on processes and the needs for reactor physicists or nuclear engineers to use modern-day software with confidence and reliability. In Section 4.2, some early combinations of mathematics with a computational environment are given with no intention to give any global historical perspective. Section 4.3 is devoted to the concepts in lattice cell calculations by which most of the core databases are still constructed today. Section 4.4 is a selection of modern tools and methodologies that are now used for industrial applications. In Section 4.5, some applications of reactor core methods are given. Concluding remarks are drawn in Section 4.6.
4.2 Analytic Methods and Early Calculation Schemes A nuclear reactor must maintain a sustained neutron reaction chain. The ratio of the number of neutrons in any generation to the number of neutrons from the previous generation is called the multiplication factor. First core calculation schemes were trying to factor out the different important states that neutrons were trying to reach during their lives. An idealized reactor core is a homogeneous infinite medium where neutrons of different energies interact with the medium. Criticality means equilibrium between neutrons produced and removed, which is unitary R. Roy () ´ Nuclear Engineering Institute, Ecole Polytechnique de Montr´eal, P.O. Box 6079, Station Centre-Ville, Montr´eal (Qu´ebec) H3C 3A7, Canada e-mail:
[email protected] Y. Azmy and E. Sartori, Nuclear Computational Science: A Century in Review, c Springer Science+Business Media B.V. 2010 DOI 10.1007/978-90-481-3411-3 4,
167
168
R. Roy
infinite multiplication. To take into account the neutron losses due to leakage out of a finite core, corrections were added. Early core calculations were based on the four- and six-factor formulas following the neutron life cycle: keff D .k1 /ƒther ƒfast D ."pf ther /ƒther ƒfast
(4.1)
Of these six factors, two, ther and ", essentially concern the fuel pins. The middle two, p and f , strongly depend on the heterogeneity of the fuel assembly (coolant/moderator, structural materials, etc.). These first four factors are the following: " The fast fission factor or the total number of fission neutrons per thermal-fission
neutron. p The probability that this neutron escapes resonance capture. f The thermal utilization factor that this neutron is captured in fuel. ther The thermal reproduction factor is the average number of fission neutrons
produced per absorption in fuel. The last two factors depend on the overall core geometry: ƒther The thermal nonleakage probability. ƒfast The fast nonleakage probability.
Another way to express the criticality is to use a formula such as keff D
k1 2 1 C M 2 Beff
(4.2)
where the new variables are the following: M 2 The so-called migration area. 2 Beff The critical buckling value.
Early calculation schemes dealt mostly with such formulas to describe the neutron multiplication inside physical systems. Homogeneous bare and lumped geometric models were analytically deduced from the transport or diffusion equation using two energy groups in order to get accurate slide-rule results. To carry more significant figures, the use of desk-type calculating machines was considered as a great evolution. However, such an automated process requires the validation of every significant result, as errors in the digital input could mean a bad tabulated value. It was very soon realized that power reactors could benefit from having a reflector zone surrounding the lumped fuel arrangement. To approximate how the reactor core could be reduced from an equivalent bare configuration, calculations of the reflector saving involved spatial coupling of different materials, and matrices were needed to interconnect the fuel and reflector regions together. In his review on the development of nuclear reactor theory in the Montreal laboratory, Prof. M.M.R. Williams provides some letters to show the kind of personnel problems that such a laboratory can have [1]. Here is a memorandum to George Placzek where Bengt Carlson is stressed because many projects are ready for computation . . . without computer!
4
Reactor Core Methods
169
Memorandum to – Dr. Placzek Concerning: the Computing Situation At present, there is a great amount of accumulated work in the computing section. In the following, a list is given of the projects ready for computation and the estimated time necessary for their completion with the present staff and equipment of the computing section (see Table 4.1). We have thus about 12 weeks of accumulated work. Improvement of this situation is impossible with the present staff, rather we expect it to become worse. We have also been advised of the desirability of an acceleration of output. Since the current rate of work thus is considered insufficient and since it is besides a result of a somewhat forced tempo, more manpower and calculating machines are necessary. The most effective remedy, in my opinion, would be to hire two additional men, one with a college education including mathematics courses, and one with an excellent high school record to be trained here; and at the same time acquire two Marchant calculators, model ACRM. If we have to operate with an increased staff before the new calculators arrive, we might try to arrange a double shift, but such a step with the present type of work, which requires frequent decisions on my part and hence my presence, is at best an emergency solution. No computing project with which I have ever had contact left the staff without supervision during half of the day. That would be too much of a menace to accuracy and efficiency over an extended period. Bengt Carlson BC:VL Montreal, October 13, 1943
Can you imagine doing that kind of projects using calculators like the one in Fig. 4.1? In early calculations, tabulations were always used for Bickley–Naylor functions, exponential integral functions, and all the others. No computer was needed to obtain crude solutions. However, the analytic work to reduce the problems into mathematics tractable by hand was tremendous. For example, let us think of Dr. Boris Davison and Jeanne Lecaine in their Montreal laboratory as they were trying to approximate the linear extrapolation length using several approximations. Their working process was to embed several approximations together into analytical formulations with the aim of obtaining observable results. Variational principles were then very important because the manual
170
R. Roy Table 4.1 Projects ready for computation in the Montreal laboratory Project Estimated time Density distribution in systems with 2 weeks multiplication factor near 1 and nonmultiplying reflector (Dr. Volkoff) Integral equation for absorption in an 2 weeks aluminum slab (Dr. Wallace) 2 weeks Solution of transcendental equations and calculations of residues in connection with slowing-down problems (Dr. Marshak) Slowing-down length in water and related 3 weeks problems (Dr. Marshak) Albedo problems (Dr. Adler) 1 week Improved numerical solution of Milne 1 week equation (Dr. Mark) Miscellaneous 1 week Total
12 weeks
Fig. 4.1 Picture of a Marchant 8D calculator (The Marchant model ACRM has two more digits!)
4
Reactor Core Methods
171
numerical results were easier to obtain. Today’s formulation of the linear extrapolation length as 9 8 Z1 > ˆ > ˆ > ˆ > ˆ dx .x/E3 .x/ > ˆ > ˆ = <3 3 0 2 3 lext D sup 2L2 C 1 1 Z > ˆ 8 2Z > ˆ ˇ ˇ 0 ˆ > ˆ 0 0 5> ˇ ˇ 4 > ˆ dx
.x/ 2 .x/ dx E x
.x / x 1 > ˆ ; : 0
0
(4.3) is quite easy to process using mathematical scripting language and obtain accurate values of lext 0:7104. The quality of analytic methods used in the 1940s and 1950s can certainly be observed in Dr. Davison’s book [2]. In Report LA-756 (also available in [1]), Bengt Carlson gives a list of functions that are needed to perform Serber calculations: exponential, circular hyperbolic, exponential integral, and exponential integral for complex arguments. In Report LA-2595, Clarence E. Lee states that [3]: One of the first numerical experiments performed by Carlson after a computer was available was an attempt to perform Serber calculations by numerical integration and a semianalytical approach. From the analysis of those experiments and recognition of the intrinsic directional derivative treatment, the original Sn difference method was born.
Nowadays, the range of computing resources has many scales: from hyperthreading and multicore processors up to clusters and grid computing. But we still rely on coherency of physical approximations in order to tackle reactor core problems . . . since the number of unknowns is too large to have full-core “ready for computation” models. Even though we now have sophisticated tools for reactor simulations, there is still “too much of a menace to accuracy and efficiency over an extended period” if we use these tools without being aware of their limits. Note: The material of this section is mainly extracted from the master work of Prof. Williams in analyzing a collection of papers on the development of the socalled Montreal theory involving many of the greatest nuclear reactor physicists. The interested reader should find in this work [1] valuable historical landmarks for many of the early reactor theory.
4.3 Lattice Cell and Assembly Codes A reactor core is made of several materials. The evaluation of the neutron flux distribution inside all regions in a reactor core still demands considerable computer resources. A direct transport solution for the entire core is not affordable for day-to-day exploitation. One must proceed using various stages of calculations interconnected together in order to obtain reliable data at the core level. In an attempt to clarify these stages, let us describe the equation governing the core behavior. The neutron balance in a reactor can be expressed by the time-dependent transport equation [4]:
172
R. Roy
1 @ˆ.r; ; E; t / O ; E; t/ C Lstatic ˆ.r; ; E; t/ D Q.r; v @t
(4.4)
where v, ˆ, and QO are, respectively, the speed, the neutron angular flux, and the source (including the scattering and the fission term), and Lstatic is a general static transport operator: Lstatic ˆ D rˆ.r; ; E; t/ C †t .r; E; t/ˆ.r; ; E; t/
(4.5)
Macroscopic cross sections, e.g., the macroscopic total cross section †t in Eq. 4.5, represent probabilities per unit path length of neutron interaction in the physical medium. In reactors at power, many types of nuclei can compose the medium, and the microscopic values of cross sections are compounded by the nuclei concentrations (number of nuclei per volume unit) as X †t .r; E; t/ D Ni .r; t/t;i .E/ (4.6) i
to give the local probability per unit path length of a neutron collision. Neutron collisions expressed by the total microscopic cross section t;i include different interactions: elastic and inelastic scattering, radiative capture, fission, etc. Some of these interactions exhibit resonances. A resonance self-shielding calculation is required in order to take into account the resonant behavior. Other interactions will affect the concentration Ni .r; t/. New nuclei will be formed (e.g., fission products), others will disappear (as burnable absorbers). The depletion (or burnup) equations can be linearized into X˚ dNi D i j ˆ C i j N j (4.7) dt j
where i j and i j represent the production rate after fission or capture and the radioactive decay constant, respectively. At any given space point, the concentrations of all the nuclides will affect the neutron flux in a complicated manner. From the point of view of neutron kinetics, the production and elimination of some fission products can have a considerable influence on reactor operation (fuel poisoning products, delayed-neutron precursors, etc.) In lattice cell calculations, it is generally assumed that the flux (or the power) remains constant over the sp