Lecture #18 EEE 574 Dr. Dan Tylavsky Nonlinear Problem Solvers.

Slides:



Advertisements
Similar presentations
Part 2 Chapter 6 Roots: Open Methods
Advertisements

Chapter 6: Roots: Open Methods
Lecture 5 Newton-Raphson Method
Part 2 Chapter 6 Roots: Open Methods
Numerical Solution of Nonlinear Equations
Power Flow Problem Formulation
Open Methods Chapter 6 The Islamic University of Gaza
ROOTS OF EQUATIONS Student Notes ENGR 351 Numerical Methods for Engineers Southern Illinois University Carbondale College of Engineering Dr. L.R. Chevalier.
EE 369 POWER SYSTEM ANALYSIS
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 61.
Open Methods Chapter 6 The Islamic University of Gaza
PHYS2020 NUMERICAL ALGORITHM NOTES ROOTS OF EQUATIONS.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 51.
Roots of Equations Open Methods (Part 2).
Lecture #22 EEE 574 Dr. Dan Tylavsky Newton-Raphson Power Flow Implementation.
A few words about convergence We have been looking at e a as our measure of convergence A more technical means of differentiating the speed of convergence.
Open Methods (Part 1) Fixed Point Iteration & Newton-Raphson Methods
Lecture #23 EEE 574 Dr. Dan Tylavsky Decoupled Power Flow Algorithms.
Newton-Raphson Power Flow Algorithm
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.
Lecture #21 EEE 574 Dr. Dan Tylavsky Newton-Raphson Power Flow Algorithm II.
Revision.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 9 Roots of Equations Open Methods.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Martin Mendez UASLP Chapter 61 Unit II.
Systems of Non-Linear Equations
Open Methods Chapter 6 The Islamic University of Gaza
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Newton's Method for Functions of Several Variables
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 8 Roots of Equations Open Methods.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM.
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 Roots of Equations Why? But.
Newton-Raphson Method
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
MA/CS 375 Fall MA/CS 375 Fall 2002 Lecture 31.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Open Methods Chapter 6 Credit:
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Chapter 3 Roots of Equations. Objectives Understanding what roots problems are and where they occur in engineering and science Knowing how to determine.
Numerical Methods for Engineering MECN 3500
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods.
Numerical Methods Root Finding 4. Fixed-Point Iteration---- Successive Approximation Many problems also take on the specialized form: g(x)=x, where we.
Newton’s Method, Root Finding with MATLAB and Excel
Dr. Jie Zou PHY Chapter 2 Solution of Nonlinear Equations: Lecture (II)
4 Numerical Methods Root Finding Secant Method Modified Secant
Circuits Theory Examples Newton-Raphson Method. Formula for one-dimensional case: Series of successive solutions: If the iteration process is converged,
linear  2.3 Newton’s Method ( Newton-Raphson Method ) 1/12 Chapter 2 Solutions of Equations in One Variable – Newton’s Method Idea: Linearize a nonlinear.
Newton-Raphson Method. Figure 1 Geometrical illustration of the Newton-Raphson method. 2.
Linearization and Newton’s Method. I. Linearization A.) Def. – If f is differentiable at x = a, then the approximating function is the LINEARIZATION of.
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
Numerical Methods Solution of Equation.
Iteration Methods “Mini-Lecture” on a method to solve problems by iteration Ch. 4: (Nonlinear Oscillations & Chaos). Some nonlinear problems are solved.
Lecture 11 Power Flow Professor Tom Overbye Special Guest Appearance by Professor Sauer! Department of Electrical and Computer Engineering ECE 476 POWER.
ECE 476 Power System Analysis Lecture 12: Power Flow Prof. Tom Overbye Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Project on Newton’s Iteration Method Presented by Dol Nath Khanal Project Advisor- Professor Dexuan Xie 05/11/2015.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 / Chapter 5.
ECE 476 POWER SYSTEM ANALYSIS
ECE 476 Power System Analysis
Newton’s Method for Systems of Non Linear Equations
LECTURE 3 OF SOLUTIONS OF NON -LINEAR EQUATIONS.
ECE 476 POWER SYSTEM ANALYSIS
Chapter 6.
Computers in Civil Engineering 53:081 Spring 2003
SOLUTION OF NONLINEAR EQUATIONS
3.8 Newton’s Method How do you find a root of the following function without a graphing calculator? This is what Newton did.
Newton-Raphson Method
Chapter 6.
1 Newton’s Method.
Pivoting, Perturbation Analysis, Scaling and Equilibration
Presentation transcript:

Lecture #18 EEE 574 Dr. Dan Tylavsky Nonlinear Problem Solvers

© Copyright 1999 Daniel Tylavsky 4 Two traditional methods for solving simultaneous nonlinear eqautions: –Guass-Seidel Method (Overview - available in many text books and easy to understand.) –Newton Raphson Method (We’ll work through in detail).

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Gauss- Seidel Method –Suppose we wish to find solutions to equation: –Let’s write this equation in the following fixed- point form: –We can always get this form. If by no other means we can ways write:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky –Then iterate as follows: –Where we start with an initial estimate, x 0. –Depending on the characteristics of the problem, the result may be fast or slow to converge, or the solution process may diverge. –With power flow problems that have been examined, the process usually converges. –Converged when, |x k+1 -x k |< .

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky Think-Pair-Square: Find a solution to the following problem starting with an initial estimate of x 0 =0.4. If x is a bus voltage, determine a reasonable convergence criteria and be able to justify it.

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky –Asymptotic Rate of Convergence: Largest integer r such that: –Gauss-Seidel method has linear convergence, i.e., r=1. –Define error as:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 For linear convergence, asymptotic rate of convergence: 4 Incremental improvement in estimate is constant on a log scale.

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Gauss- Seidel Method –Advantages Simple conceptually Simple to program No LDU factorization. Sparsity is used simply Iterations take little execution time. Often more robust than Newton-Raphson –Disadvantages Sometimes not as robust. Slow linear convergence rate.

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Newton’s Method –Single Equation: Looking for the roots of f(x) Approach 1. Guess at solution x=x 0 x0x0 2. Represent f(x) as a linear approximation about x=x 0 using a Taylor series expansion: 3. Solve for a better estimate of x*: x1x1 x2x2 x* 4. Converged when: |f(x k )|< 

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky Think-Pair-Square: Using Newton’s method, find a solution to the following problem starting with an initial estimate of x 0 =0.4. If f(x) is sum of real/reactive power flow into a bus, and x represents bus voltage, determine a reasonable convergence criteria and be able to justify it.

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Compare iterates from G-S and Newton. G-S Newton Newton starts off worse because it is more sensitive to: An accurate initial guess. The “smoothness” of f(x) near x 0.

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky x1x1 x2x2 x0x x3x3 x4x4 Newton x0x1x2x3x4x0x1x2x3x4

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky –Asymptotic Rate of Convergence: Largest integer r such that: –Newton’s method has quadratic convergence, i.e., r=2. Precision Limitation

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Newton-Raphson Method –Apply Newton’s Method to Simultaneous Equations: Looking for the roots of:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Repeat same Newton-type steps: 1. Make ‘good’ guess at solution: 2. Approximate f(x) using a Taylor series expansion about point x 0 :

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 3. Solve linearized equations for a better estimate of x*:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4. Check for convergence: 5. If converged, end, otherwise perform next iteration with i=2:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Ex: Find the solution to the following 2-bus power flow problem:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Bringing all terms to one side and multiplying numerator and denominator by (-j) gives: 4 Break equation into real and imaginary parts:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Setting x 1 =  2,x 2 =V 2 gives: 1. Make a ‘good’ guess at solution: 2a. Evaluate f(x) at x 0 :

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 2b. Calculate analytical form of the Jacobian

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 2c. Evaluate the Jacobian at best estimate of solution:

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 3. Solve the linear approximation for a better estimate of x*. 4. Check for convergence.

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky 4 Iteration Results

Nonlinear Problem Solvers © Copyright 1999 Daniel Tylavsky

The End