Numerical Solution of Nonlinear Equations

Slides:



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

Lecture 5 Fixed point iteration Download fixedpoint.m From math.unm.edu/~plushnik/375.
Chapter 6: Roots: Open Methods
Lecture 5 Newton-Raphson Method
Solution of Nonlinear Equation (b)
Fixed point iterations and solution of non-linear functions
Part 2 Chapter 6 Roots: Open Methods
Suggested problems from text (6 th edition) Chapter 3.1 p85 Problems 1, 4, 9, 10 Computer problems 1, 2, 4, 7 Chapter 3.2 p101 Problems 4, 15, 17, 19 Computer.
Lecture 14: Newton’s method for system of two nonlinear equations Function newton2d01 Set initial (x,y) point, maximum number of iterations, and convergence.
Numeriska beräkningar i Naturvetenskap och Teknik 1.Solving equations.
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.
Empirical Maximum Likelihood and Stochastic Process Lecture VIII.
Open Methods Chapter 6 The Islamic University of Gaza
Chapter 4 Roots of Equations
Chapter 6 Open Methods.
Lecture #18 EEE 574 Dr. Dan Tylavsky Nonlinear Problem Solvers.
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
Systems of Non-Linear Equations
CVEN Exam 1 Review. Matlab Basic commands and syntax Basic commands and syntax Creation of functions and programs Creation of functions and programs.
Open Methods Chapter 6 The Islamic University of Gaza
Nonlinear Algebraic Systems 1.Iterative solution methods 2.Fixed-point iteration 3.Newton-Raphson method 4.Secant method 5.Matlab tutorial 6.Matlab exercise.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Newton's Method for Functions of Several Variables
NUMERICAL METHODS WITH C++ PROGRAMMING
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 8 Roots of Equations Open Methods.
Roots of Equations Open Methods Second Term 05/06.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM.
ME451 Kinematics and Dynamics of Machine Systems Newton-Raphson Method October 04, 2013 Radu Serban University of Wisconsin-Madison.
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.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Newton's Method for Functions of Several Variables Joe Castle & Megan Grywalski.
Lecture 8 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
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.
Graphics Graphics Korea University kucg.korea.ac.kr 2. Solving Equations of One Variable Korea University Computer Graphics Lab. Lee Seung Ho / Shin.
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.
Newton’s Method, Root Finding with MATLAB and Excel
559 Fish 559; Lecture 25 Root Finding Methods. 559 What is Root Finding-I? Find the value for such that the following system of equations is satisfied:
Dr. Jie Zou PHY Chapter 2 Solution of Nonlinear Equations: Lecture (II)
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.
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
Solving Non-Linear Equations (Root Finding)
Computers in Civil Engineering 53:081 Spring 2003 Lecture #8 Roots of Equations: Systems of Equations.
The formulae for the roots of a 3rd degree polynomial are given below
Newton’s Method Problem: need to solve an equation of the form f(x)=0. Graphically, the solutions correspond to the points of intersection of the.
Project on Newton’s Iteration Method Presented by Dol Nath Khanal Project Advisor- Professor Dexuan Xie 05/11/2015.
Lecture 4 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
 The equation with one variable. At P(atm) equals 0.5 atm, What is T ? ? ?
CSE 330: Numerical Methods. Introduction The bisection and false position method require bracketing of the root by two guesses Such methods are called.
CHAPTER 3 NUMERICAL METHODS
Modeling of geochemical processes Numeric Algorithm Refreshment
LECTURE 3 OF SOLUTIONS OF NON -LINEAR EQUATIONS.
Solving Nonlinear Equation
Chapter 6.
Solution of Equations by Iteration
ME 123 Computer Applications I Lecture 24: Character Strings 4/18/03
Computers in Civil Engineering 53:081 Spring 2003
Chapter 10. Numerical Solutions of Nonlinear Systems of Equations
ROOTS OF 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.
Some Comments on Root finding
Chapter 6.
ME 123 Computer Applications I Lecture 25: MATLAB Overview 4/28/03
1 Newton’s Method.
Presentation transcript:

Numerical Solution of Nonlinear Equations Lecture 4 Chapter 2 (continued) Numerical Solution of Nonlinear Equations

Numerical methods for the solution of Nonlinear equations Single Nonlinear Equations Fixed-Point Iteration. bisection method Newton–Raphson method Secant method System of Nonlinear Equations Newton Method

3- Newton–Raphson (tangents) method The Newton–Raphson formula can be derived from the Taylor series expansion of f (x) about x:

Geometric interpretation The equation of the tangent to the curve y = f(x) at P(x(0), y(0)) which is x f(x) x* x0 y0 x3 x1 y1 x2

4- Secant method The secant method can be regarded as a modification of the Newton method in the sense that the derivative is replaced by a difference approximation based on the successive estimates By this approximation, the iterative formula of becomes

We observe that the Secant method will take iterations more than required when using Newton-Raphson method.

Newton Method for a System of Nonlinear Equations Consider the system of two equations by taking the Taylor series expansion up to first-order about some estimate point (x0,y0) This can be arranged into a matrix–vector form as

we solve for (x, y) to get the updated vector estimate let, Jacobian matrix

For 2x2 system we prefer to apply Cramer’s rule.

Steps of Newton–Raphson method for simultaneous, nonlinear equations:

The Jacobian matrix is defined as From the plot we can get a rough estimate of the coordinates of an intersection point: (x0,y0 ) =(0.5, 1.5), which we use as the starting values.

the coordinates of the four intersection points are ±(0.618 03, 1.618 03) and ± (1.618 03, 0.618 03)

Apply Bisection Method Matlab Functions Apply Bisection Method fzero Find root of continuous function of one variable Syntax x = fzero(fun,x0) >> fzero(@(x)exp(x)-exp(-x)-1,4) ans = 0.481211825059603

Apply Newton-Raphson Method fsolve Solve system of nonlinear equations Equation Solves a problem specified by F(x)=0 for x where x is a vector and F(x) is a function that returns a vector value. Syntax x = fsolve(fun,x0) Apply Newton-Raphson Method >> x=fsolve(@(x)x.^3+cos(x),-1) Equation solved. fsolve completed because the vector of function values is near zero as measured by the default value of the function tolerance, and the problem appears regular as measured by the gradient. <stopping criteria details> x = -0.865474075950360

% For system of nonlinear equations >> x=fsolve(@(x)[x(1).^2+x(2).^2-3;x(1).*x(2)-1],[0.5,1.5]) Equation solved. fsolve completed because the vector of function values is near zero as measured by the default value of the function tolerance, and the problem appears regular as measured by the gradient. <stopping criteria details> x = 0.618033988957653 1.618033988958327

End of Chapter 2