This document summarizes three numerical methods for finding the roots of equations: the regula falsi method, Newton's method, and the secant method. The regula falsi method chooses two numbers with opposite signs of the function and iteratively finds a root between them. Newton's method and the secant method both use iterative schemes to successively approximate a root by finding the x-intercept of the tangent or secant line. The document outlines the basic steps for each method.
Original Description:
numerical analysis
Original Title
Lecture No,_2Week No,_2Course Code_BSI242 Noor Badshah
This document summarizes three numerical methods for finding the roots of equations: the regula falsi method, Newton's method, and the secant method. The regula falsi method chooses two numbers with opposite signs of the function and iteratively finds a root between them. Newton's method and the secant method both use iterative schemes to successively approximate a root by finding the x-intercept of the tangent or secant line. The document outlines the basic steps for each method.
This document summarizes three numerical methods for finding the roots of equations: the regula falsi method, Newton's method, and the secant method. The regula falsi method chooses two numbers with opposite signs of the function and iteratively finds a root between them. Newton's method and the secant method both use iterative schemes to successively approximate a root by finding the x-intercept of the tangent or secant line. The document outlines the basic steps for each method.
Method of False Position/Regula Falsi Method • Steps of the method: • Choose two numbers 𝑎, 𝑏 such that 𝑓 𝑎 𝑓 𝑏 < 0 ⟹ 𝑎 < 𝛼 < 𝑏. 𝑎𝑓 𝑏 −𝑏𝑓 𝑎 • Set 𝑥𝑟 = . 𝑓 𝑏 −𝑓 𝑎 • If 𝑓 𝑥𝑟 = 0 then 𝛼 = 𝑥𝑟 and done. • If 𝑓 𝑎 𝑓 𝑥𝑟 < 0 then 𝛼 ∈ (𝑎, 𝑥𝑟 ) and set 𝑥𝑟 = 𝑏 and go to step 2. • If 𝑓 𝑏 𝑓 𝑥𝑟 < 0 then 𝛼 ∈ (𝑥𝑟 , 𝑏) and set 𝑥𝑟 = 𝑎 and go to step 2. Stagnation of the end point • It means that one end does not move. • Make the convergence very slow. Iterative Schemes: • Simple Iteration Method/Fixed Point Method: • Let an equation 𝑓 𝑥 = 0 has a root near 𝑥0 . • Express 𝑓 𝑥 = 0 in the form 𝑥 = 𝜙(𝑥) and then set up the following iterations: 𝑥𝑟+1 = 𝜙 𝑥𝑟 , 𝑟 = 0, 1, 2, … , 𝑛 • Let 𝑥 3 + 𝑥 2 − 2 = 0, this equation can be expressed in the following ways: ′ Condition for convergence: 𝜙 𝑥0 < 1. Newton Raphson Method: Secant Method Method of Iterations