Definition of “outer” (energy) iteration

Slides:



Advertisements
Similar presentations
Numerical Solution of Linear Equations
Advertisements

Numerical Algorithms Matrix multiplication
Special Matrices and Gauss-Siedel
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 3 Approximations and Errors.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 20 Solution of Linear System of Equations - Iterative Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.
Special Matrices and Gauss-Siedel
Sections 1.4 and 1.5 Order of Operations, Part 1
Simplifying Fractions. October 1, 2012 Standard: 6.NS.1. Interpret & compute quotients of fractions, & solve word problems involving division of fractions.
Lesson 13.4 Solving Radical Equations. Squaring Both Sides of an Equation If a = b, then a 2 = b 2 Squaring both sides of an equation often introduces.
Section 2-5 Complex Numbers.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 31.
Systems of Linear Equations Iterative Methods
12-5 Warm Up Lesson Presentation Lesson Quiz
1 Lesson 9: Solution of Integral Equations & Integral Boltzmann Transport Eqn Neumann self-linked equations Neumann self-linked equations Attacking the.
1 Lesson 5: Flux, etc. Flux determination Flux determination Cell Cell Surface Surface Flux integral tallies (reaction rates) Flux integral tallies (reaction.
4-1 Lesson 4 Objectives Development of source terms Development of source terms Review of Legendre expansions Review of Legendre expansions Resulting full.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 111.
Absolute Value Equations 3.6 solving equations only.
MECN 3500 Inter - Bayamon Lecture 3 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods.
Lesson 4: Computer method overview
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 3.
Lesson 6: Computer method overview  Neutron transport overviews  Comparison of deterministic vs. Monte Carlo  User-level knowledge of Monte Carlo 
Linear Systems – Iterative methods
ECE 576 – Power System Dynamics and Stability Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
6-1 Lesson 6 Objectives Beginning Chapter 2: Energy Beginning Chapter 2: Energy Derivation of Multigroup Energy treatment Derivation of Multigroup Energy.
Dear Power point User, This power point will be best viewed as a slideshow. At the top of the page click on slideshow, then click from the beginning.
Section 6.4 Rational Equations
8-1 Lesson 8 Objectives Recap and iteration practice Recap and iteration practice Reduction of B.E. to 1D Reduction of B.E. to 1D 1D Quadratures 1D Quadratures.
Linear Systems Numerical Methods. 2 Jacobi Iterative Method Choose an initial guess (i.e. all zeros) and Iterate until the equality is satisfied. No guarantee.
Modeling of geochemical processes Numeric Mathematics Refreshment
Development of source terms Resulting full Boltzmann Equation
CLOSE Please YOUR LAPTOPS, and get out your note-taking materials.
Solving Equations With Fractions
Solving Equations Conceputally
Eigenfaces (for Face Recognition)
ECE 476 POWER SYSTEM ANALYSIS
Lesson #6 Modular Programming and Functions.
Beginning Chapter 2: Energy Derivation of Multigroup Energy treatment
Decrease-and-Conquer Approach
Lesson #6 Modular Programming and Functions.
Recap and iteration practice Reduction of B.E. to 1D 1D Quadratures
Gauss-Siedel Method.
Iterative Methods Good for sparse matrices Jacobi Iteration
Lecture 19 MA471 Fall 2003.
Lesson #6 Modular Programming and Functions.
Autar Kaw Benjamin Rigsby
Algorithm An algorithm is a finite set of steps required to solve a problem. An algorithm must have following properties: Input: An algorithm must have.
Metode Eliminasi Pertemuan – 4, 5, 6 Mata Kuliah : Analisis Numerik
Instructors: Fei Fang (This Lecture) and Dave Touretzky
Objective Numerical methods Finite volume.
Numerical Analysis Lecture13.
topic16_cylinder_flow_relaxation
Polar Area Day 3 Section 10.5B Calculus BC AP/Dual, Revised ©2018
Lesson #6 Modular Programming and Functions.
topic4: Implicit method, Stability, ADI method
Fundaments of Game Design
Stencil Pattern ITCS 4/5145 Parallel computing, UNC-Charlotte, B. Wilkinson Oct 14, 2014 slides6b.ppt 1.
topic4: Implicit method, Stability, ADI method
Engineering Analysis ENG 3420 Fall 2009
Stencil Pattern ITCS 4/5145 Parallel computing, UNC-Charlotte, B. Wilkinson StencilPattern.ppt Oct 14,
Example 5A: Solving Simple Rational Equations
Absolute Value Equations
Chapter 11 Chapter 11.
Top 10 maths topics that GCSE students struggle with
Lesson 9: Basic Monte Carlo integration
Linear Algebra Lecture 16.
Solving Equations with Fractions
Presentation transcript:

Definition of “outer” (energy) iteration Lesson 7 Objectives Definition of “outer” (energy) iteration Reduction to one-group analysis: Stand-in for space-direction calculations Expected convergence rate Simple algorithm Solution of sample problem in infinite medium

Energy solution strategies: Fixed source The resulting energy group equations are coupled through scattering and fission We will first deal with non-fission situation, where the group equation is:

“Outer” iteration solution strategies (1) There are two iterative approaches that are in common use Jacobi and Gauss-Seidel. We will use to count iterations (where means an original guess of the fluxes) Jacobi (“simultaneous update”) uses: Key point = the scattering source comes from flux of the previous generation

“Outer” iteration solution strategies (2) Gauss-Seidel (“successive update”) uses: Key point = for groups that have already been calculated in the CURRENT outer iteration, you use the NEW fluxes when calculating the down-scattering source term.

“Outer” iteration solution strategies (3) In practice, the groups are solved one at a time (group 1, then group 2, etc.) A single sweep through all groups is called an OUTER ITERATION. We continue iterations, sweeping through all groups over and over, until the absolute value of the fractional change in ANY group flux value is less than a given “convergence criterion” (user-defined). The G-S approach takes advantage of the fact that, for groups of LOWER number, the current iteration has already been done. For many problems (esp. photon and “fast” group structures) one outer iteration is all that is required (no up-scatter) Bottom Line: We can worry about space and direction for ONE group at a time

Infinite medium: Fixed source For the idealized problem of an INFINITE uniform medium, the group fluxes do not depend on either flux or direction (so each direction flux is the same as the scalar flux): So, the group balance equations (excluding fission) are: or (Removal formulation)

Analysis of 1-group eqn. Basic idea: We can attack the B.E. as a series of ONE GROUP problems in space and direction The effects of other groups will be BURIED in the scattering-in source term Therefore, each group’s solution for spatial/direction flux will use methods (e.g., FORTRAN subroutines) that IGNORE energy This is of enormous value in MODULARIZING the computer codes

1-group analysis (2) The equation for group g is: where:

1-group analysis (4) With the group g flux on the right side AND the left side, we proceed by introducing ANOTHER LEVEL of iteration, the INNER iteration: where k is the inner iteration counter. This inner iteration has an interesting physical interpretation. If you set the initial flux (which is traditionally referred to “Iteration Zero”) to zero: then

Expected inner convergence rate This physical analogy leads us to expect that the convergence rate of the inner iterations (i.e., how quickly we expect the flux to settle down) will depend on how important within-group scattering is: Therefore: High absorption problems=fast convergence High scattering, low absorption=slow convergence REMEMBER: We are inside a group, so the scattering term is the “within-group” scattering.

“Inner” iteration solution procedure Set initial flux guess to zero in each group For each energy group (high to low): Find Sg using fixed source and other group fluxes Using latest group flux, add within-group scattering source to RHS to Sg Solve for new group flux [REST OF COURSE] Repeat steps B&C to “inner” convergence of flux Repeat step 2 to “outer” convergence of flux. Be sure NOT to reset the fluxes to zero (i.e., do NOT return to step 1!). Start with the best fluxes you have for each group.

Infinite medium procedure For infinite-medium problems, the group equation simplifies to: With procedure: Set initial flux guess to zero in each group For each energy group (high to low): Find Sg using fixed source and other group fluxes Using latest group g flux, add within-group scattering source to RHS Solve for new group Repeat steps B&C to “inner” convergence of flux Repeat step 2 to “outer” convergence of flux.

Homework 7-1 Group 1 2 3 Total 0.6 0.8 1.0 Scat to 1 0.4 0.1 0.1 Scat to 2 0.1 0.3 0.1 Scat to 3 0.05 0.3 0.4 Source 1 0 0 Write the balance equations for each group using the removal formulation (bottom of slide 7-6) Solve for the group fluxes (without INNER iterations), using: Jacobi numerical scheme (convergence of 1.e-6) Gauss-Siedel numerical scheme (convergence of 1.e-6) Collapse to 1 group total, source, scattering, absorption cross sections

Group Homework 7-2 1 2 3 Total 0.6 0.8 1.0 Scat to 1 0.4 0 0 1 2 3 Total 0.6 0.8 1.0 Scat to 1 0.4 0 0 Scat to 2 0.1 0.3 0 Scat to 3 0.0 0.3 0.4 Source 1 0 0 Write the group balance equations using full formulation (on top of slide 7-12) Solve for the group fluxes (using INNER iterations), one group at a time with Gauss-Siedel. (You should find that one outer iteration does it.) Use a 1.e-6 convergence criterion. Collapse to 1 group total, source, scattering, absorption cross sections