Systems of Non-Linear Equations

Slides:



Advertisements
Similar presentations
Lecture 5 Newton-Raphson Method
Advertisements

Numerical Solution of Nonlinear Equations
SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture KFUPM Read , 26-2, 27-1 CISE301_Topic8L8&9 KFUPM.
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.
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
CSE 245: Computer Aided Circuit Simulation and Verification Fall 2004, Nov Nonlinear Equation.
Chapter 4 Roots of Equations
PHYS2020 NUMERICAL ALGORITHM NOTES ROOTS OF EQUATIONS.
Roots of Equations Open Methods (Part 2).
Lecture #18 EEE 574 Dr. Dan Tylavsky Nonlinear Problem Solvers.
Special Matrices and Gauss-Siedel
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 5 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
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.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 6 Roots of Equations Bracketing Methods.
Open Methods (Part 1) Fixed Point Iteration & Newton-Raphson Methods
Chapter 1 Introduction The solutions of engineering problems can be obtained using analytical methods or numerical methods. Analytical differentiation.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.
Revision.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Martin Mendez UASLP Chapter 61 Unit II.
Special Matrices and Gauss-Siedel
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 5 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
CHE/ME 109 Heat Transfer in Electronics LECTURE 11 – ONE DIMENSIONAL NUMERICAL MODELS.
Open Methods Chapter 6 The Islamic University of Gaza
NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS
Roots of Equations Open Methods Second Term 05/06.
Differential Equations and Boundary Value Problems
Chapter 3 Root Finding.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Linear Algebraic Equations ~ Gauss Elimination Chapter.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 8. Nonlinear equations.
Solving Non-Linear Equations (Root Finding)
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.
Taylor Series.
Introduction This chapter gives you several methods which can be used to solve complicated equations to given levels of accuracy These are similar to.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 111.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Open Methods Chapter 6 Credit:
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 7.
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.
Boundary Value Problems l Up to this point we have solved differential equations that have all of their initial conditions specified. l There is another.
Linear Systems – 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
Today’s class Roots of equation Finish up incremental search
MECN 3500 Inter - Bayamon Lecture 6 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
ROOTS OF EQUATIONS. Bracketing Methods The Bisection Method The False-Position Method Open Methods Simple Fixed-Point Iteration The Secant Method.
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
Solving Non-Linear Equations (Root Finding)
Iteration Methods “Mini-Lecture” on a method to solve problems by iteration Ch. 4: (Nonlinear Oscillations & Chaos). Some nonlinear problems are solved.
Non-Linear Models. Non-Linear Growth models many models cannot be transformed into a linear model The Mechanistic Growth Model Equation: or (ignoring.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 27.
§3.6 Newton’s Method. The student will learn about
Part 3 Chapter 12 Iterative Methods
4 Numerical Methods Root Finding.
Computers in Civil Engineering 53:081 Spring 2003 Lecture #8 Roots of Equations: Systems of Equations.
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.
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
Newton’s Method for Systems of Non Linear Equations
Chapter 6.
Solution of Equations by Iteration
Chapter 27.
Computers in Civil Engineering 53:081 Spring 2003
Some Comments on Root finding
Chapter 6.
1 Newton’s Method.
Pivoting, Perturbation Analysis, Scaling and Equilibration
Presentation transcript:

Systems of Non-Linear Equations

Objective Finding the roots of a set of simultaneous nonlinear equations (n equations, n unknowns). where each of fi(x1, … xn) cannot be expressed in the form

Review of iterative methods for finding unknowns Finding x that satisfies f(x) = 0 (one equation, one unknown) - Fixed-Point Iteration - Newton-Raphson - Secant Solving Ax = b or Ax – b = 0, or finding multiple x's that simultaneously satisfy a system of linear equations - Gauss-Seidel - Jacobi Variation of Fixed-Point Iteration

Fixed Point Iteration To solve We can create updating formula as or Which formula will converge? What initial points should we pick?

Fixed Point Iteration Diverging Converging

Fixed Point Iteration – Converging Criteria For solving f(x) = 0 (one equation, one unknown), we have the updating formula Trough analysis, we derived the following relationship which tells us convergence is guaranteed if

Fixed Point Iteration – Converging Criteria For solving two equations with two unknowns, we have the updating formula Through similar reasoning, we can demonstrate that convergence can be guaranteed if

Fixed-Point Iteration – Summary Updating formula is easy to construct, but updating formula that satisfy (guarantees convergence) is not easy to construct. Slow convergent rate

Newton-Raphson (one equation, one unknown) Want to find the root of f(x) = 0. From 1st-Order Taylor Series Approximation, we have Idea: use the slope at xi to predict the location of the root. If xi+1 is the root, then f(xi+1) = 0. Thus we have Single-equation form

Newton-Raphson (two equations, two unknowns) Want to find x and y that satisfy From 1st-Order Taylor Series Approximation, we have Using similar reasoning, we have ui+1 = 0 and vi+1 = 0. continue …

Newton-Raphson (two equations, two unknowns) Replacing ui+1 = 0 and vi+1 = 0 in the equations yields continue …

Newton-Raphson (two equations, two unknowns) Solving the equations algebraically yields Alternatively, we may solve for xi+1 and yi+1 using well-known methods for solving systems of linear equations

Newton-Raphson Example To solve First evaluate With x0 = 1.5, y0 = 3.5, we have continue …

Newton-Raphson Example From these two formula, we can then calculate x1 and y1 as These process can be repeated until a "good enough" approximation is obtained.

Newton-Raphson (n equations, n unknowns) Want to find xi (i = 1, 2, …, n) that satisfy From 1st-Order Taylor Series Approximation, we have

Newton-Raphson (n equations, n unknowns) For each k = 0, 1, 2, …, n, setting fk,i+1 = 0 yields These equations can be expressed in matrix form as where

Newton-Raphson – Summary Updating formula is not convenient to construct. Excellent initial guesses are usually required to ensure convergence. If the iteration converges, it converges quickly.