Www.le.ac.uk Numerical Methods: Finding Roots Department of Mathematics University of Leicester.

Slides:



Advertisements
Similar presentations
Integration – Volumes of revolution Department of Mathematics University of Leicester.
Advertisements

Department of Mathematics University of Leicester
Partial Fractions Department of Mathematics University of Leicester.
Department of Mathematics University of Leicester
Vectors 5: The Vector Equation of a Plane
Differentiation – Product, Quotient and Chain Rules
MATHEMATICAL METHODS. CONTENTS Matrices and Linear systems of equations Eigen values and eigen vectors Real and complex matrices and Quadratic forms Algebraic.
Lecture 5 Newton-Raphson Method
Numerical Solution of Nonlinear Equations
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
CSE 330: Numerical Methods
Computer Programming (TKK-2144) 13/14 Semester 1 Instructor: Rama Oktavian Office Hr.: M.13-15, W Th , F
Coursework Requirements Numerical Methods. 1.Front Cover indicating that the coursework is about the numerical Solution of Equations. Include your name,
Numeriska beräkningar i Naturvetenskap och Teknik 1.Solving equations.
Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.
CSCE Finding Roots of Equations This is a fundamental computational problem Several methods exist. We will look at the bisection method and at Newton’s.
Notes, part 5. L’Hospital Another useful technique for computing limits is L'Hospital's rule: Basic version: If, then provided the latter exists. This.
Lectures on Numerical Methods 1 Numerical Methods Charudatt Kadolkar Copyright 2000 © Charudatt Kadolkar.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
NUMERICAL METHODS WITH C++ PROGRAMMING
Notes, part 4 Arclength, sequences, and improper integrals.
Bracketing Methods Chapter 5 The Islamic University of Gaza
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Lecture 8 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Lecture 3 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
Solving equations numerically The sign - change rule If the function f(x) is continuous for an interval a  x  b of its domain, if f(a) and f(b) have.
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
Numerical Methods.
CHAPTER 3 NUMERICAL METHODS
The Bisection Method. Introduction Bisection Method: Bisection Method = a numerical method in Mathematics to find a root of a given function.
© Annie Patton Newton-Raphson Method Next Slide. © Annie Patton Aim of lesson To learn how the Newton- Raphson method can be used for finding non integer.
Newton’s Method, Root Finding with MATLAB and Excel
Numerical Methods and Computational Techniques Solution of Transcendental and Polynomial Equations.
ME 142 Engineering Computation I Root Finding & Iterative Solutions.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 5 Bracketing Methods.
Numerical Methods Solution of Equation.
Perfect squares: 1, 4, 9, __, __, __, __, __, __, __,…
4.8 Newton’s Method Mon Nov 9 Do Now Find the equation of a tangent line to f(x) = x^5 – x – 1 at x = 1.
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Yasser F. O. Mohammad Assiut University Egypt. Previously in NM Bracketing Methods Bisection False Position Fixed Point Iteration Local Convergence Methods.
Lecture 39 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
2.3 Solving Radical Equations Function EquationsRadical Equations Math
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 ? ? ?
Chapter 5 Numerical Root Findings
CHAPTER 3 NUMERICAL METHODS
Numerical Analysis Lecture 5.
LECTURE 4 OF SOLUTIONS OF NON-LINEAR EQUATIONS OBJECTIVES
Bracketing Methods (Bisection Method)
Numerical Methods and Analysis
LECTURE 3 OF SOLUTIONS OF NON -LINEAR EQUATIONS.
MATH 2140 Numerical Methods
Solution of Equations by Iteration
Numerical Analysis Lecture 7.
Computers in Civil Engineering 53:081 Spring 2003
What is an equation? An equation is a mathematical statement that two expressions are equal. For example, = 7 is an equation. Note: An equation.
SOLUTION OF NONLINEAR EQUATIONS
Mathematical Solution of Non-linear equations : Newton Raphson method
3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.
3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.
Sec:5.2 The Bisection Method.
Some Comments on Root finding
Copyright © Cengage Learning. All rights reserved.
MATH 1910 Chapter 3 Section 8 Newton’s Method.
1 Newton’s Method.
Solutions for Nonlinear Equations
Presentation transcript:

Numerical Methods: Finding Roots Department of Mathematics University of Leicester

Content MotivationChange of sign methodIterative methodNewton-Raphson method

Reasons for Finding Roots by Numerical Methods If the data is obtained from observations, it often won’t have an equation which accurately models Some equations are not easy to solve Can program a computer to solve equations for us Next Iterative method Newton- Raphson Change of sign method Motivation

Solving equations by change of sign This is also known as ‘Iteration by Bisection’ It is done by bisecting an interval we know the solution lies in repeatedly Next Iterative method Newton- Raphson Change of sign method Motivation

METHOD Find an interval in which the solution lies Split the interval into 2 equal parts Find the change of sign Repeat Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

Step 3: Now we just keep repeating the process Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

So to 3 s.f. the solution is Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

Solving equations by change of sign Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method ‘Iteration’ is the process of repeatedly using a previous result to obtain a new result Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Click on a seed value to see the cobweb: start here start here start here start here start here start here Clear Cobwebs Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

This gives us the solution to 3 d.p. Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Solving using iterative method Next Iterative method Newton- Raphson Change of sign method Motivation

Newton-Raphson Method Sometimes known as the Newton Method Named after Issac Newton and Joseph Raphson Iteratively finds successively better approximations to the roots Next Iterative method Newton- Raphson Change of sign method Motivation

Newton-Raphson Method Next Iterative method Newton- Raphson Change of sign method Motivation

Newton-Raphson Method Next Iterative method Newton- Raphson Change of sign method Motivation

Newton-Raphson Method Next Iterative method Newton- Raphson Change of sign method Motivation

Newton-Raphson Method Next Iterative method Newton- Raphson Change of sign method Motivation

Newton-Raphson Method So this means that the cube root of 37 is approximately Next Iterative method Newton- Raphson Change of sign method Motivation