Reservoir Convergence Algorithms

Slides:



Advertisements
Similar presentations
Lecture 5 Newton-Raphson Method
Advertisements

Numerical Solution of Nonlinear Equations
Numeriska beräkningar i Naturvetenskap och Teknik 1.Solving equations.
Roots: Bracketing Methods
Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.
Planning under Uncertainty
I. Reservoirs Reservoirs are natural basins. Reservoirs are natural basins. It is usually surrounded with mountains or high areas. It is usually surrounded.
Roots of Equations Bracketing Methods.
Systems of Non-Linear Equations
Dr. Marco A. Arocha Aug,  “Roots” problems occur when some function f can be written in terms of one or more dependent variables x, where the.
- + Suppose f(x) is a continuous function of x within interval [a, b]. f(a) = - ive and f(b) = + ive There exist at least a number p in [a, b] with f(p)
Solving Systems of three equations with three variables Using substitution or elimination.
7.1 Systems of Linear Equations: Two Equations Containing Two Variables.
Solving Systems Using Elimination. Elimination When neither equation is in the slope- intercept form (y =), you can solve the system using elimination.
Roots of Equations Chapter 3. Roots of Equations Also called “zeroes” of the equation –A value x such that f(x) = 0 Extremely important in applications.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 8. Nonlinear equations.
Solving Non-Linear Equations (Root Finding)
Chapter 6 Finding the Roots of Equations
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
3.5 – Solving Systems of Equations in Three Variables.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 111.
Implicit Differentiation
Systems of Linear Equations: Substitution and Elimination.
Loop Application: Numerical Methods, Part 1 The power of Matlab Mathematics + Coding.
Part 2 Chapter 5 Roots: Bracketing Methods PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright © The McGraw-Hill.
5.3 Solving Trigonometric Equations
Newton’s Method Other Recursive Methods Modified Fixed Point Method.
Numerical Methods for Engineering MECN 3500
Numerical Methods.
GRAPHING EQUATIONS. 6.EE.9 Use variables to represent two quantities in a real- world problem that change in relationship to one another; write an equation.
Implicit Differentiation Objective: To find derivatives of functions that we cannot solve for y.
Newton’s Method, Root Finding with MATLAB and Excel
Today’s class Roots of equation Finish up incremental search
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
Solving Non-Linear Equations (Root Finding)
MAT 4725 Numerical Analysis Section 2.1 The Bisection Method
Suppose we are given a differential equation and initial condition: Then we can approximate the solution to the differential equation by its linearization.
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
CADSWES Engineering Enhancements New Methods and Improved Functionality Steve Setzer.
Review after Christmas!. Solve the below equations for the variable..5 (6x +8) = 16 1.
Elimination Method - Systems. Elimination Method  With the elimination method, you create like terms that add to zero.
Chapter 30.
Differential Equations
6.4 Growth and Decay.
Implicit Differentiation
Making complex decisions
Definition of “outer” (energy) iteration
Building Linear Models from Data
Solving Systems Using Elimination
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.
Sequences Day 6 Happy Thursday!!.
MURI Kickoff Meeting Randolph L. Moses November, 2008
2 Understanding Variables and Solving Equations.
Solving Systems of Equations by Substitution
Instructor :Dr. Aamer Iqbal Bhatti
Slope = m = rate of change
EXIT TICKET: Graphing Linear Equations 11/17/2016
Absolute Value Functions
Roots: Bracketing Methods
Section 4.8: Newton’s Method
Algorithms and Convergence
Solving Equations with Variables on Both Sides
Solving Equations with Variables on Both Sides
Some Comments on Root finding
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Some iterative methods free from second derivatives for nonlinear equation Muhammad Aslam Noor Dept. of Mathematics, COMSATS Institute of Information Technology,
Chapter 11 Chapter 11.
Roots: Bracketing Methods
EE, NCKU Tien-Hao Chang (Darby Chang)
Presentation transcript:

Reservoir Convergence Algorithms Convergence Algorithm Previously Used Current Convergence Algorithm

General Convergence algorithm used in functions that require the simultaneous solving of a set of 2 equations Bisection algorithm used in all reservoir types in getMaxOutflowGivenInflow getMaxReleaseGivenInflow getMinSpillGivenInflowRelease solveMB_givenInflowRelease

Example - getMaxOutflowGivenInflow fMAX(stor,Q) QMAX,MB fMB(stor,Q) storMAX,MB storage

1. Simple Convergence Algorithm Iterates by updating the dependent variable (outflow) based on the changing of the independent variable (storage) outflow outflow fMAX(stor,Q) fMAX(stor,Q) These functions started out using this simple convergence algorithm. The first step in an iteration is to calculate the outflow based on the storage of the previous iteration, using the max outflow function. Using that outflow, a storage is determined using the mass balance function. Again, the max outflow function determines an outflow based on this storage value. When these values for outflow converge, the method is exited. This becomes problematic when an area of zero slope is present in one of the curves. Convergence can never be obtained under this scenario using this algorithm. fMB(stor,Q) fMB(stor,Q) storage storage Ideal Problematic

Bisection Algorithm Incremental search method where the interval is divided in half at each iteration outflow outflow QMBave fMAX(Q,stor) fMAX(Q,stor) QMAXave QMBave To fix that problem an algorithm based on the bisection method was implemented. This is an incremental search method that divides the search interval in half at each iteration QMAXave fMB(Q,stor) fMB(Q,stor) stor_low stor_ave stor_high storage stor_low stor_ave stor_high storage stor_low stor_ave

2. Bisection Replaces Simple Algorithm The simple algorithm was replaced with the bisection algorithm. This approach also proved to be problematic. outflow outflow fMAX(Q,stor) fMAX(Q,stor) QMBave QMAXave fMB(Q,stor) fMB(Q,stor) stor_low stor_ave stor_high stor_low stor_high storage storage stor_low stor_ave Ideal Problematic

3. Current Algorithm - Combination of Simple & Bisection If the simple convergence routine fails, the bisection routine is employed. The last 4 points of the simple routine become the bisection routine’s starting points. outflow outflow fMAX(Q,stor) fMAX(Q,stor) QMBave QMAXave fMB(Q,stor) fMB(Q,stor) stor_low stor_ave stor_high storage storage Simple Bisection