A New Modification of Newton s Method
|
|
- Rachel Harper
- 5 years ago
- Views:
Transcription
1 A New Modification of Newton s Method Vejdi I. Hasanov, Ivan G. Ivanov, Gurhan Nedjibov Laboratory of Mathematical Modelling, Shoumen University, Shoumen 971, Bulgaria v.hasanov@@fmi.shu-bg.net Faculty of Economics and Business Administration, Sofia University, Sofia 1113, Bulgaria i ivanov@@feb.uni-sofia.bg Abstract A new iterative modification of Newton s method for solving nonlinear scalar equations are proposed. Weerakoon and Fernando have been propose a variant of Newton s method in which they approximate the indefinite integral by a trapezoid instead of a rectangle. This modification has third-order convergence. We approximate the indefinite integral by a Simpson s formula instead of a trapezoid and obtain a new modification with third-order convergence. This new variant achieves less error than the Newton s method and the Weerakoon s and the Fernando s variant in special cases. It is showed that the convergence order of our method is three. Keywords: Newton s method, nonlinear equations, iterative methods, order of convergence. 1 Introduction It is well known that the iterative Newton s formula for numerical solving a nonlinear equation computes the function value the value of its first derivative. The Newton s method converges to the root quadratically. Weerakoon and Fernando 1] have suggested an improvement to the iteration of Newton s method. They have approximated the indefinite integral by a trapezoid instead of a rectangle and the results is a new method with third-order convergence. In this paper we propose a modification the Newton s iteration in which we approximate the integral by a Simpson formula. This new modification has third order convergence also. Preliminaries We use the following definitions 1]. Definition 1 Let α R, x n R, n = 0, 1,,.... Then the sequence x n } is said to convergence to α if lim n x n α = 0. If there exists a constant c 0 an integer n 0 0 and p 0 such that for all n > n 0 we have x n+1 α c x n α p, then x n } is said to convergence to α with convergence order at least p. convergence is said to be quadratic or cubic, respectively. If p = or p = 3 the The notation e n = x n α is the error in the n th iteration. The equation e n+1 = ce p n + O(e p+1 n ) is called the error equation and the parameter p is called the order of this method. 1
2 Definition Let α be a root of the function f(x) and suppose that x n 1, x n, x n+1 are three consecutive iterations closer to the root α. Then the computational order of convergence p can be computed using the formula p ln (x n+1 α)/(x n α) ln (x n α)/(x n 1 α). (1) 3 Iterative methods 3.1 Newton s method The Newton s method for computing the α of the nonlinear equation f(x) = 0 uses the following iteration x n+1 = x n f(x f (x n ), () where x n is the n-th approximation of α. It is well known this method is quadratically convergent. The solution of the equation M(x) = 0 is denoted x n+1 where M(x) = f(x n ) + f (x n )(x x n ). (3) The equation (3) is the tangent s equation to the function f(x) to point x n. If at the formula f(x) = f(x n ) + the integral is approximated by the rectangle, i.e. x we obtain the linear equation (3). x x n f (λ) dλ f (x n )(x x n ), 3. The Weerakoon s and the Fernando s modification Weerakoon and Fernando 1] have been proposed the following variant x n f (λ) dλ (4) f(x n ) x n+1 = x n f (x n ) + f (x (5) n+1 ), where x n+1 = x n f(x f (x n ). The equation (5) is received from (4) when the integral is approximated by trapezoid. This method has third-order convergence. 3.3 A New Modification of Newton s method We approximate the integral by Simpson s formula which is x We obtain the equation f (λ) dλ x x n x n ˆM n (x) = f(x n ) + x x n We find the solution x n+1 of the equation ˆM n (x n+1 ) = 0 and obtain f(x n ) + x n+1 x n ( ) } x + f (x) + 4f xn + f (x n ). ( ) } x + f (x) + 4f xn + f (x n ). () ( ) } f (x n+1 ) + 4f xn+1 + x n + f (x n ) = 0
3 x n+1 = x n f(x n ) f (x n+1 ) + 4f ( xn+1 +x n ) + f (x n ) In order to compute x n+1 it is used values of the derivative of the function at points x n+1 and x n+1+x n. Further on we replace x n+1 with x n+1 and use Newton s iterative step to compute x n+1. Define where and obtain the formula x n+1 + x n = 1 x n+1 = x n f (x n ), f (x n ). x n f(x ] f (x n ) + x n = x n f(x f (x n ). f(x n ) f (x n+1 ) + 4f (x n+1 ) + f (x n ), (8) x n+1 = x n f(x f (x n ). Theorem 1 Let f be a real function. Assume that f(x) has first, second and third derivatives in the interval (a, b). If f(x) has a simple root an α (a, b) and x 0 is sufficiently close to α, then the iterative method (8) satisfies the following error equation: where e n = x n α and C = 1 f () (α) f (α). e n+1 = (C ) e 3 n + O(e 4, Proof: Let α be a simple root of f(x), i.e. f(α) = 0, f (α) 0. Assume x n = α + e n,. We use the Taylor expansions f(x n ) = f(α + e n ) = f(α) + f (α)e n + 1! f () (α)e n + 1 3! f (3) (α)e 3 n + O(e 4 = f (α) e n + 1 f () (α)! f (α) e n + 1 f (3) ] (α) 3! f (α) e3 n + O(e 4 = f (α) e n + C e n + C 3 e 3 n + O(e 4 ], (7) where C j = 1 f (j) (α) j! f (α), j =, 3. We have f (x n ) = f (α + e n ) = f (α) + f () (α)e n + 1! f (3) (α)e n + O(e 3 = f (α) 1 + f () (α) f (α) e n + 1 f (3) ] (α)! f (α) e n + O(e 3 = f (α) 1 + C e n + 3C 3 e n + O(e 3 ]. Compute f(x n ) f (x n ) = 1 en + C e n + C 3 e 3 n + O(e 4 ] 1 + C e n + 3C 3 e n + O(e 3 ] 1 = 1 en + C e n + O(e 3 ] 1 C e n + 3C 3 e n + O(e 3 ] + C e n + 3C 3 e n + O(e 3 ] } = 1 en + C e n + O(e 3 ] 1 C e n + 3C 3 e n + O(e 3 ] + 4Ce n + } = 1 e n 1 C e n + O(e 3, 3
4 Thus we obtain for x n+1 and x n+1 Compute f (x n ) = α + e n e n C e n + O(e 3 ] = α + C e n + O(e 3, x n+1 = x n f(x f (x n ) 1 = α + e n e n 1 ] C e n + O(e 3 f (x n+1) = f (α) + C e n + O(e 3 ] f () (α) + O(e 4 = f (α) 1 + C e n + O(e 3 ] f () ]} (α) f (α) = α + 1 e n + 1 C e n + O(e 3. = f (α) 1 + Ce n + O(e 3 }, 1 f (x n+1) = f (α) + e n + 1 ] C e n + O(e 3 f () (α) 1 + e n + 1 ] C e n + O(e 3 f (3) (α) + O(e 3! = f (α) 1 + e n + C e n + O(e 3 ] 1 C + e n + 1 ] } C e n + O(e 3 3C 3 + O(e 3 = f (α) 1 + e n + C e n + O(e 3 ] ] } 1 C + 4 e n + O(e 3 3C 3 + O(e 3 = f (α) 1 + C e n + C + 3 ] } 4 C 3 e n + O(e 3, Hence f (x n ) + 4f (x n+1) + f (x n+1) = f (α) 1 + C e n + 3C 3 e n + O(e 3 ] ( +4f (α) 1 + C e n + C + 3 ) ] 4 C 3 e n + O(e 3 +f (α) 1 + Ce n + O(e 3 ] = f (α) 1 + C e n + (C 3 + C )e n + O(e 3 ]. f(x n ) e n + C e n + C 3 e 3 n + O(e 4 f (x n ) + 4f (x n+1 ) + f (x n+1 ) = 1 + C e n + (C 3 + C ) e n + O(e 3 = e n + C e n + C 3 e 3 n + O(e 4 ] 1 C e n + ( C 3 + C ) e n + O(e 3 ] Finally we obtain + C e n + ( C 3 + C ) e n + O(e 3 ] } = e n + C e n + C 3 e 3 n + O(e 4 ] 1 C e n C 3 e n + O(e 3 } = e n + C e n + C 3 e 3 n + O(e 4 C e n C e 3 n C 3 e 3 n + O(e 4 = e n C e 3 n + O(e 4. e n+1 + α = e n + α e n C e 3 n + O(e 4 ], e n+1 = C e 3 n + O(e 4. 4
5 The theorem is proved. The new modification has third-order convergence. We use notations MN - the Newton s method; V T - the Weerakoon and the Fernando 1] variant; V S - the proposed modification. Table 1 shows iterative formulas of the methods and their error equations. Table 1 MN x n+1 = x n f(x f (x n ) e n+1 = C e n + O(e 3 V T x n+1 = x n f(x n ) f (x +f (x n+1 ), x n+1 = x n f(x f (x n ) e n+1 = ( C + 1 C 3) e 3 n + O(e 4, V S x n+1 = x n f(x f (x n )+4f (x n+1 )+f (x n+1 ), f (x, x n+1 = x n f(x f (x n ) e n+1 = (C ) e 3 n + O(e 4, 4 Numerical experiments We were done numerical experiments for different functions and initial points. All programs were writen in Matlab. We compare three iterative procedures for computing the root of nonlinear equations. We use the following stopping criteria for computer programs (i) x n+1 x n < ε, (ii) f(x n+1 ) < ε, where ε =. e 1 is a Matlab constant. We introduce notations: x 0 - a initial point; iter - number of iterations for which (i) and (ii) are satisfied; time the execution time for 500 times execution; p - convergence order by (1). Table f(x) x 0 iter time 500 MN V T V S MN V T V S ) x 3 + x ) cos x x ) (x 1) ) xe x sin x cos x ) e x +7x
6 Tables and 3 show results from numerical experiments for different initial points. Methods VT and VS are convergent for every initial point. 5 Conclusion Table 3 f(x) f(x n+1 ) p α MN V T V S MN V T V S e e ) 0 4.7e e e e e e e e e-13.34e ) 4.44e e e e e e e-14.19e e e e-9.71e ) 1.05e e e e-11 9.e e e ) 5.9e-9.4e-9 1.e e-9.05e ) 1.41e e e e Our method and the Weerakoon s and the Fernando s variant do not need to compute the second or third derivatives of the function, while other third-order convergence methods require these computations. Our method makes less number of iterations than the Newton s method and uses different initial points when compared to Newton s method. The VS method has at least third-order convergence. Results from numerical experiments show that the convergence of the our method is independent from initial points. If C 3 > 0 then our modification achieves less error than the Weerakoon s and the Fernando s variant. Unfortunately, we can not give mathematical statement for choice a initial point for our method. It is a problem of a future research. Acknowledgment. This work is supported by Shoumen University under Grant 3/ References 1] Weerakoon, S., Fernando, T.G.I. (000) A Variant of Newton s Method with Accelerated Third- Order Convergence, Applied Mathematics Letters, 13, ] Ralston, A. (197) A Course in Numerical Analysis, Nauka i Izkustvo, Sofia, (in Bulgaria
NEW ITERATIVE METHODS BASED ON SPLINE FUNCTIONS FOR SOLVING NONLINEAR EQUATIONS
Bulletin of Mathematical Analysis and Applications ISSN: 181-191, URL: http://www.bmathaa.org Volume 3 Issue 4(011, Pages 31-37. NEW ITERATIVE METHODS BASED ON SPLINE FUNCTIONS FOR SOLVING NONLINEAR EQUATIONS
More informationOn a few Iterative Methods for Solving Nonlinear Equations
On a few Iterative Methods for Solving Nonlinear Equations Gyurhan Nedzhibov Laboratory of Matheatical Modelling, Shuen University, Shuen 971, Bulgaria e-ail: gyurhan@shu-bg.net Abstract In this study
More informationThree New Iterative Methods for Solving Nonlinear Equations
Australian Journal of Basic and Applied Sciences, 4(6): 122-13, 21 ISSN 1991-8178 Three New Iterative Methods for Solving Nonlinear Equations 1 2 Rostam K. Saeed and Fuad W. Khthr 1,2 Salahaddin University/Erbil
More informationAn efficient Newton-type method with fifth-order convergence for solving nonlinear equations
Volume 27, N. 3, pp. 269 274, 2008 Copyright 2008 SBMAC ISSN 0101-8205 www.scielo.br/cam An efficient Newton-type method with fifth-order convergence for solving nonlinear equations LIANG FANG 1,2, LI
More informationA Fifth-Order Iterative Method for Solving Nonlinear Equations
International Journal of Mathematics and Statistics Invention (IJMSI) E-ISSN: 2321 4767, P-ISSN: 2321 4759 www.ijmsi.org Volume 2 Issue 10 November. 2014 PP.19-23 A Fifth-Order Iterative Method for Solving
More informationSOME MULTI-STEP ITERATIVE METHODS FOR SOLVING NONLINEAR EQUATIONS
Open J. Math. Sci., Vol. 1(017, No. 1, pp. 5-33 ISSN 53-01 Website: http://www.openmathscience.com SOME MULTI-STEP ITERATIVE METHODS FOR SOLVING NONLINEAR EQUATIONS MUHAMMAD SAQIB 1, MUHAMMAD IQBAL Abstract.
More informationSolving Nonlinear Equations Using Steffensen-Type Methods With Optimal Order of Convergence
Palestine Journal of Mathematics Vol. 3(1) (2014), 113 119 Palestine Polytechnic University-PPU 2014 Solving Nonlinear Equations Using Steffensen-Type Methods With Optimal Order of Convergence M.A. Hafiz
More informationTwo New Predictor-Corrector Iterative Methods with Third- and. Ninth-Order Convergence for Solving Nonlinear Equations
Two New Predictor-Corrector Iterative Methods with Third- and Ninth-Order Convergence for Solving Nonlinear Equations Noori Yasir Abdul-Hassan Department of Mathematics, College of Education for Pure Science,
More informationNewton-Raphson Type Methods
Int. J. Open Problems Compt. Math., Vol. 5, No. 2, June 2012 ISSN 1998-6262; Copyright c ICSRS Publication, 2012 www.i-csrs.org Newton-Raphson Type Methods Mircea I. Cîrnu Department of Mathematics, Faculty
More informationIterative Methods for Single Variable Equations
International Journal of Mathematical Analysis Vol 0, 06, no 6, 79-90 HII Ltd, wwwm-hikaricom http://dxdoiorg/0988/ijma065307 Iterative Methods for Single Variable Equations Shin Min Kang Department of
More informationGeometrically constructed families of iterative methods
Chapter 4 Geometrically constructed families of iterative methods 4.1 Introduction The aim of this CHAPTER 3 is to derive one-parameter families of Newton s method [7, 11 16], Chebyshev s method [7, 30
More informationA nonlinear equation is any equation of the form. f(x) = 0. A nonlinear equation can have any number of solutions (finite, countable, uncountable)
Nonlinear equations Definition A nonlinear equation is any equation of the form where f is a nonlinear function. Nonlinear equations x 2 + x + 1 = 0 (f : R R) f(x) = 0 (x cos y, 2y sin x) = (0, 0) (f :
More informationA new sixth-order scheme for nonlinear equations
Calhoun: The NPS Institutional Archive DSpace Repository Faculty and Researchers Faculty and Researchers Collection 202 A new sixth-order scheme for nonlinear equations Chun, Changbum http://hdl.handle.net/0945/39449
More informationCOURSE Iterative methods for solving linear systems
COURSE 0 4.3. Iterative methods for solving linear systems Because of round-off errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme
More informationX. Numerical Methods
X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced
More informationMath 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1
ath 651 Introduction to Numerical Analysis I Fall 2010 SOLUTIONS: Homework Set 1 1. Consider the polynomial f(x) = x 2 x 2. (a) Find P 1 (x), P 2 (x) and P 3 (x) for f(x) about x 0 = 0. What is the relation
More informationFamily of Optimal Eighth-Order of Convergence for Solving Nonlinear Equations
SCECH Volume 4, Issue 4 RESEARCH ORGANISATION Published online: August 04, 2015 Journal of Progressive Research in Mathematics www.scitecresearch.com/journals Family of Optimal Eighth-Order of Convergence
More informationSOLVING NONLINEAR EQUATIONS USING A NEW TENTH-AND SEVENTH-ORDER METHODS FREE FROM SECOND DERIVATIVE M.A. Hafiz 1, Salwa M.H.
International Journal of Differential Equations and Applications Volume 12 No. 4 2013, 169-183 ISSN: 1311-2872 url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijdea.v12i4.1344 PA acadpubl.eu SOLVING
More informationOn matrix equations X ± A X 2 A = I
Linear Algebra and its Applications 326 21 27 44 www.elsevier.com/locate/laa On matrix equations X ± A X 2 A = I I.G. Ivanov,V.I.Hasanov,B.V.Minchev Faculty of Mathematics and Informatics, Shoumen University,
More informationFIXED POINT ITERATION
FIXED POINT ITERATION The idea of the fixed point iteration methods is to first reformulate a equation to an equivalent fixed point problem: f (x) = 0 x = g(x) and then to use the iteration: with an initial
More informationMA 8019: Numerical Analysis I Solution of Nonlinear Equations
MA 8019: Numerical Analysis I Solution of Nonlinear Equations Suh-Yuh Yang ( 楊肅煜 ) Department of Mathematics, National Central University Jhongli District, Taoyuan City 32001, Taiwan syyang@math.ncu.edu.tw
More informationChebyshev-Halley s Method without Second Derivative of Eight-Order Convergence
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 4 2016, pp. 2987 2997 Research India Publications http://www.ripublication.com/gjpam.htm Chebyshev-Halley s Method without
More information1 Newton s Method. Suppose we want to solve: x R. At x = x, f (x) can be approximated by:
Newton s Method Suppose we want to solve: (P:) min f (x) At x = x, f (x) can be approximated by: n x R. f (x) h(x) := f ( x)+ f ( x) T (x x)+ (x x) t H ( x)(x x), 2 which is the quadratic Taylor expansion
More informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
More informationIntroduction to Numerical Analysis
Introduction to Numerical Analysis S. Baskar and S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay Powai, Mumbai 400 076. Introduction to Numerical Analysis Lecture Notes
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... Introduce the topic of numerical methods Consider the Error analysis and sources of errors Introduction A numerical method which
More informationOn Newton-type methods with cubic convergence
Journal of Computational and Applied Mathematics 176 (2005) 425 432 www.elsevier.com/locate/cam On Newton-type methods with cubic convergence H.H.H. Homeier a,b, a Science + Computing Ag, IT Services Muenchen,
More information1 Exam 1 Spring 2007.
Exam Spring 2007.. An object is moving along a line. At each time t, its velocity v(t is given by v(t = t 2 2 t 3. Find the total distance traveled by the object from time t = to time t = 5. 2. Use the
More informationModified Cubic Convergence Iterative Method for Estimating a Single Root of Nonlinear Equations
J. Basic. Appl. Sci. Res., 8()9-1, 18 18, TextRoad Publication ISSN 9-44 Journal of Basic and Applied Scientific Research www.textroad.com Modified Cubic Convergence Iterative Method for Estimating a Single
More informationMath /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined
Math 400-001/Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined using limits. As a particular case, the derivative of f(x)
More informationMATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations.
MATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of f(x) = 0, their advantages and disadvantages. Convergence
More informationTAYLOR AND MACLAURIN SERIES
TAYLOR AND MACLAURIN SERIES. Introduction Last time, we were able to represent a certain restricted class of functions as power series. This leads us to the question: can we represent more general functions
More informationUniversity of Education Lahore 54000, PAKISTAN 2 Department of Mathematics and Statistics
International Journal of Pure and Applied Mathematics Volume 109 No. 2 2016, 223-232 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v109i2.5
More informationSection Taylor and Maclaurin Series
Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power
More informationSOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS BISECTION METHOD
BISECTION METHOD If a function f(x) is continuous between a and b, and f(a) and f(b) are of opposite signs, then there exists at least one root between a and b. It is shown graphically as, Let f a be negative
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationA New Accelerated Third-Order Two-Step Iterative Method for Solving Nonlinear Equations
ISSN 4-5804 (Paper) ISSN 5-05 (Online) Vol.8, No.5, 018 A New Accelerated Third-Order Two-Step Iterative Method for Solving Nonlinear Equations Umair Khalid Qureshi Department of Basic Science & Related
More informationOptimization. Yuh-Jye Lee. March 21, Data Science and Machine Intelligence Lab National Chiao Tung University 1 / 29
Optimization Yuh-Jye Lee Data Science and Machine Intelligence Lab National Chiao Tung University March 21, 2017 1 / 29 You Have Learned (Unconstrained) Optimization in Your High School Let f (x) = ax
More informationMath 4329: Numerical Analysis Chapter 03: Newton s Method. Natasha S. Sharma, PhD
Mathematical question we are interested in numerically answering How to find the x-intercepts of a function f (x)? These x-intercepts are called the roots of the equation f (x) = 0. Notation: denote the
More informationA Two-step Iterative Method Free from Derivative for Solving Nonlinear Equations
Applied Mathematical Sciences, Vol. 8, 2014, no. 161, 8021-8027 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.49710 A Two-step Iterative Method Free from Derivative for Solving Nonlinear
More informationA Three-Step Iterative Method to Solve A Nonlinear Equation via an Undetermined Coefficient Method
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 14, Number 11 (018), pp. 145-1435 Research India Publications http://www.ripublication.com/gjpam.htm A Three-Step Iterative Method
More informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
More informationarxiv: v1 [math.na] 21 Jan 2015
NEW SIMULTANEOUS METHODS FOR FINDING ALL ZEROS OF A POLYNOMIAL JUN-SEOP SONG A, A COLLEGE OF MEDICINE, YONSEI UNIVERSITY, SEOUL, REPUBLIC OF KOREA arxiv:1501.05033v1 [math.na] 21 Jan 2015 Abstract. The
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 17, 2017 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationMATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N.
MATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of F (x) = 0, their advantages and disadvantages.
More informationTaylor and Maclaurin Series. Approximating functions using Polynomials.
Taylor and Maclaurin Series Approximating functions using Polynomials. Approximating f x = e x near x = 0 In order to approximate the function f x = e x near x = 0, we can use the tangent line (The Linear
More informationSimple Iteration, cont d
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 2 Notes These notes correspond to Section 1.2 in the text. Simple Iteration, cont d In general, nonlinear equations cannot be solved in a finite sequence
More informationA Family of Methods for Solving Nonlinear Equations Using Quadratic Interpolation
ELSEVIER An International Journal Available online at www.sciencedirect.com computers &.,=. = C o,..ct. mathematics with applications Computers and Mathematics with Applications 48 (2004) 709-714 www.elsevier.com/locate/camwa
More informationLecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2
More informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationTaylor and Maclaurin Series. Approximating functions using Polynomials.
Taylor and Maclaurin Series Approximating functions using Polynomials. Approximating f x = e x near x = 0 In order to approximate the function f x = e x near x = 0, we can use the tangent line (The Linear
More informationMath 113 (Calculus 2) Exam 4
Math 3 (Calculus ) Exam 4 November 0 November, 009 Sections 0, 3 7 Name Student ID Section Instructor In some cases a series may be seen to converge or diverge for more than one reason. For such problems
More informationQuadrature based Broyden-like method for systems of nonlinear equations
STATISTICS, OPTIMIZATION AND INFORMATION COMPUTING Stat., Optim. Inf. Comput., Vol. 6, March 2018, pp 130 138. Published online in International Academic Press (www.iapress.org) Quadrature based Broyden-like
More informationAnalysis II: Basic knowledge of real analysis: Part V, Power Series, Differentiation, and Taylor Series
.... Analysis II: Basic knowledge of real analysis: Part V, Power Series, Differentiation, and Taylor Series Kenichi Maruno Department of Mathematics, The University of Texas - Pan American March 4, 20
More informationMath and Numerical Methods Review
Math and Numerical Methods Review Michael Caracotsios, Ph.D. Clinical Associate Professor Chemical Engineering Department University of Illinois at Chicago Introduction In the study of chemical engineering
More informationModified Jarratt Method Without Memory With Twelfth-Order Convergence
Annals of the University of Craiova, Mathematics and Computer Science Series Volume 39(1), 2012, Pages 21 34 ISSN: 1223-6934 Modified Jarratt Method Without Memory With Twelfth-Order Convergence F. Soleymani,
More informationIMPROVED METHODS AND STARTING VALUES TO SOLVE THE MATRIX EQUATIONS X ± A X 1 A = I ITERATIVELY
MATHEMATICS OF COMPUTATION Volume 74, Number 249, Pages 263 278 S 0025-5718(04)01636-9 Article electronically published on January 27, 2004 IMPROVED METHODS AND STARTING VAUES TO SOVE THE MATRIX EQUATIONS
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationOutline. Math Numerical Analysis. Intermediate Value Theorem. Lecture Notes Zeros and Roots. Joseph M. Mahaffy,
Outline Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
More informationPractice problems from old exams for math 132 William H. Meeks III
Practice problems from old exams for math 32 William H. Meeks III Disclaimer: Your instructor covers far more materials that we can possibly fit into a four/five questions exams. These practice tests are
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationA Novel Computational Technique for Finding Simple Roots of Nonlinear Equations
Int. Journal of Math. Analysis Vol. 5 2011 no. 37 1813-1819 A Novel Computational Technique for Finding Simple Roots of Nonlinear Equations F. Soleymani 1 and B. S. Mousavi 2 Young Researchers Club Islamic
More informationMath Camp II. Calculus. Yiqing Xu. August 27, 2014 MIT
Math Camp II Calculus Yiqing Xu MIT August 27, 2014 1 Sequence and Limit 2 Derivatives 3 OLS Asymptotics 4 Integrals Sequence Definition A sequence {y n } = {y 1, y 2, y 3,..., y n } is an ordered set
More informationNonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems
Nonlinear Systems CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Nonlinear Systems 1 / 24 Part III: Nonlinear Problems Not all numerical problems
More informationPART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435
PART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435 Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu
More informationA new family of four-step fifteenth-order root-finding methods with high efficiency index
Computational Methods for Differential Equations http://cmde.tabrizu.ac.ir Vol. 3, No. 1, 2015, pp. 51-58 A new family of four-step fifteenth-order root-finding methods with high efficiency index Tahereh
More information8.3 Numerical Quadrature, Continued
8.3 Numerical Quadrature, Continued Ulrich Hoensch Friday, October 31, 008 Newton-Cotes Quadrature General Idea: to approximate the integral I (f ) of a function f : [a, b] R, use equally spaced nodes
More informationTHE SECANT METHOD. q(x) = a 0 + a 1 x. with
THE SECANT METHOD Newton s method was based on using the line tangent to the curve of y = f (x), with the point of tangency (x 0, f (x 0 )). When x 0 α, the graph of the tangent line is approximately the
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University
More information1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that
Chapter 4 Nonlinear equations 4.1 Root finding Consider the problem of solving any nonlinear relation g(x) = h(x) in the real variable x. We rephrase this problem as one of finding the zero (root) of a
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More information8.7 MacLaurin Polynomials
8.7 maclaurin polynomials 67 8.7 MacLaurin Polynomials In this chapter you have learned to find antiderivatives of a wide variety of elementary functions, but many more such functions fail to have an antiderivative
More information18.01 EXERCISES. Unit 3. Integration. 3A. Differentials, indefinite integration. 3A-1 Compute the differentials df(x) of the following functions.
8. EXERCISES Unit 3. Integration 3A. Differentials, indefinite integration 3A- Compute the differentials df(x) of the following functions. a) d(x 7 + sin ) b) d x c) d(x 8x + 6) d) d(e 3x sin x) e) Express
More informationSection 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series
Section 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series Power Series for Functions We can create a Power Series (or polynomial series) that can approximate a function around
More informationApplied Mathematics Letters. Combined bracketing methods for solving nonlinear equations
Applied Mathematics Letters 5 (01) 1755 1760 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Combined bracketing methods for
More informationCE 191: Civil and Environmental Engineering Systems Analysis. LEC 05 : Optimality Conditions
CE 191: Civil and Environmental Engineering Systems Analysis LEC : Optimality Conditions Professor Scott Moura Civil & Environmental Engineering University of California, Berkeley Fall 214 Prof. Moura
More informationMath 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
More informationAS PURE MATHS REVISION NOTES
AS PURE MATHS REVISION NOTES 1 SURDS A root such as 3 that cannot be written exactly as a fraction is IRRATIONAL An expression that involves irrational roots is in SURD FORM e.g. 2 3 3 + 2 and 3-2 are
More information80 Wyner PreCalculus Spring 2017
80 Wyner PreCalculus Spring 2017 CHAPTER NINE: DERIVATIVES Review May 16 Test May 23 Calculus begins with the study of rates of change, called derivatives. For example, the derivative of velocity is acceleration
More information1.1: The bisection method. September 2017
(1/11) 1.1: The bisection method Solving nonlinear equations MA385/530 Numerical Analysis September 2017 3 2 f(x)= x 2 2 x axis 1 0 1 x [0] =a x [2] =1 x [3] =1.5 x [1] =b 2 0.5 0 0.5 1 1.5 2 2.5 1 Solving
More informationSYSTEMS OF NONLINEAR EQUATIONS
SYSTEMS OF NONLINEAR EQUATIONS Widely used in the mathematical modeling of real world phenomena. We introduce some numerical methods for their solution. For better intuition, we examine systems of two
More informationMATH 1242 FINAL EXAM Spring,
MATH 242 FINAL EXAM Spring, 200 Part I (MULTIPLE CHOICE, NO CALCULATORS).. Find 2 4x3 dx. (a) 28 (b) 5 (c) 0 (d) 36 (e) 7 2. Find 2 cos t dt. (a) 2 sin t + C (b) 2 sin t + C (c) 2 cos t + C (d) 2 cos t
More informationTaylor Series. Math114. March 1, Department of Mathematics, University of Kentucky. Math114 Lecture 18 1/ 13
Taylor Series Math114 Department of Mathematics, University of Kentucky March 1, 2017 Math114 Lecture 18 1/ 13 Given a function, can we find a power series representation? Math114 Lecture 18 2/ 13 Given
More informationSolution of Algebric & Transcendental Equations
Page15 Solution of Algebric & Transcendental Equations Contents: o Introduction o Evaluation of Polynomials by Horner s Method o Methods of solving non linear equations o Bracketing Methods o Bisection
More informationSECTION A. f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes.
SECTION A 1. State the maximal domain and range of the function f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes. 2. By evaluating f(0),
More informationTAYLOR SERIES [SST 8.8]
TAYLOR SERIES [SST 8.8] TAYLOR SERIES: Every function f C (c R, c + R) has a unique Taylor series about x = c of the form: f (k) (c) f(x) = (x c) k = f(c) + f (c) (x c) + f (c) (x c) 2 + f (c) (x c) 3
More informationMATH 2053 Calculus I Review for the Final Exam
MATH 05 Calculus I Review for the Final Exam (x+ x) 9 x 9 1. Find the limit: lim x 0. x. Find the limit: lim x + x x (x ).. Find lim x (x 5) = L, find such that f(x) L < 0.01 whenever 0 < x
More information+ 1 for x > 2 (B) (E) (B) 2. (C) 1 (D) 2 (E) Nonexistent
dx = (A) 3 sin(3x ) + C 1. cos ( 3x) 1 (B) sin(3x ) + C 3 1 (C) sin(3x ) + C 3 (D) sin( 3x ) + C (E) 3 sin(3x ) + C 6 3 2x + 6x 2. lim 5 3 x 0 4x + 3x (A) 0 1 (B) 2 (C) 1 (D) 2 (E) Nonexistent is 2 x 3x
More informationlim4 4. By the definition of a limit, there is a positive real number such that if 0 x 2. The largest valid value of is
ACTM Regional Calculus Competition 017 Begin by removing the three tie breaker sheets at the end of the exam and writing your name on all three pages. Work the multiple-choice questions first, choosing
More informationChapter 4 Integration
Chapter 4 Integration SECTION 4.1 Antiderivatives and Indefinite Integration Calculus: Chapter 4 Section 4.1 Antiderivative A function F is an antiderivative of f on an interval I if F '( x) f ( x) for
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationA fourth order method for finding a simple root of univariate function
Bol. Soc. Paran. Mat. (3s.) v. 34 2 (2016): 197 211. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v34i1.24763 A fourth order method for finding a simple
More informationChapter 6. Nonlinear Equations. 6.1 The Problem of Nonlinear Root-finding. 6.2 Rate of Convergence
Chapter 6 Nonlinear Equations 6. The Problem of Nonlinear Root-finding In this module we consider the problem of using numerical techniques to find the roots of nonlinear equations, f () =. Initially we
More informationChapter 2. First-Order Differential Equations
Chapter 2 First-Order Differential Equations i Let M(x, y) + N(x, y) = 0 Some equations can be written in the form A(x) + B(y) = 0 DEFINITION 2.2. (Separable Equation) A first-order differential equation
More informationPHYS 410/555 Computational Physics Solution of Non Linear Equations (a.k.a. Root Finding) (Reference Numerical Recipes, 9.0, 9.1, 9.
PHYS 410/555 Computational Physics Solution of Non Linear Equations (a.k.a. Root Finding) (Reference Numerical Recipes, 9.0, 9.1, 9.4) We will consider two cases 1. f(x) = 0 1-dimensional 2. f(x) = 0 d-dimensional
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
More information5. Hand in the entire exam booklet and your computer score sheet.
WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test
More informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More informationMA 113 Calculus I Fall 2015 Exam 3 Tuesday, 17 November Multiple Choice Answers. Question
MA 11 Calculus I Fall 2015 Exam Tuesday, 17 November 2015 Name: Section: Last 4 digits of student ID #: This exam has ten multiple choice questions (five points each) and five free response questions (ten
More information