COURSE: NUMERICAL ANALYSIS. LESSON: Methods for Solving Non-Linear Equations
|
|
- Aubrie Davis
- 6 years ago
- Views:
Transcription
1 COURSE: NUMERICAL ANALYSIS LESSON: Methods for Solving Non-Linear Equations Lesson Developer: RAJNI ARORA COLLEGE/DEPARTMENT: Department of Mathematics, University of Delhi Page No. 1
2 Contents 1. LEARNING OUTCOMES PRELIMINARIES INTRODUCTION DIRECT METHOD ITERATIVE METHOD... 4 Definition 3.3. CONVERGENCE... 5 Definition 3.4. RATE OF CONVERGENCE... 5 Definition 3.5. ORDER OF CONVERGENCE SOLUTIONS OF NON LINEAR EQUATIONS FIXED POINT ITERATION METHOD Geometrical Interpretation... 7 Problem ORDER OF COVERGENCE OF FIXED POINT ITERATION METHOD NEWTON RAPHSON METHOD GEOMETRICAL INTERPRETATION DERIVATION PROBLEM PROBLEM ORDER OF CONVERGENCE OF NEWTON RAPHSON METHOD SECANT METHOD GEOMETRICAL INTERPRETATION DERIVATION PROBLEM ORDER OF COVERGENCE OF SECANT METHOD REGULA FALSI METHOD GEOMETRICAL INTERPRETATION Problem ORDER OF COVERGENCE OF REGULA FALSI METHOD BISECTION METHOD GEOMETRICAL INTERPRETATION Problem SUMMARY EXERCISES REFERENCES Institute of Lifelong Learning, University of Delhi Page No. 2
3 1. LEARNING OUTCOMES We believe that after going through this chapter, the reader will become familiar with various methods for approximating roots of linear as well as non linear equations and will be able to analyze which method is better, in terms of computation effort as well as order of convergence. 2. PRELIMINARIES Definition 2.1. Linear Equation An equation in the form is called a linear equation where unknowns coefficients. For example,,. have power 1 and have constant Definition 2.2. Non Linear Equation An equation in the form is called a non linear equation if it is not linear. For example,. Definition 2.3. Solutions/Roots of an Equation Consider the equation, where is a real valued function. A number is called a solution/root of this equation, if. Theorem 2.4. Taylor s Theorem with Lagrange s Formula for Remainder Let has continuous derivatives on for some, let. Then there exists a point between and such that where. Theorem 2.5. (A special case of Taylor s theorem: Mean Value Theorem) If is continuous on and if exists on, then for and in, there exists a point between and such that Theorem 2.6. (A special case of Mean value theorem: Rolle s Theorem) If is continuous on and if exists on, and if, then for some in. Theorem 2.7. If be a sequence of real numbers such that Institute of Lifelong Learning, University of Delhi Page No. 3
4 Theorem 2.8. (Intermediate value Theorem) If is a continuous function on some interval and be a number such that, then a number exists such that. Theorem 2.9. (Corollary to Intermediate value Theorem) If is a continuous function on some interval and, then the equation has atleast one real root or an odd number of real roots in the interval. 3. INTRODUCTION From an early age, we are dealing with equations of various types, for example, linear equations of the type, whose root is given by the expression (provided ), quadratic equations of the type, whose root is given by the formula (provided ). However, there are no direct formulae for finding roots of general third or higher order polynomial equations. Neither are there any direct formulae for finding roots of non linear equations of the type. Our aim in this chapter is to introduce and discuss methods for finding roots of equations of this kind. There are two types of methods for finding roots of equations, one of which is Direct Method, with which we are familiar and other one is Iterative Method, which is our main focus in this chapter DIRECT METHOD These methods give the exact value of the roots in a finite number of steps. These give all the roots at the same time. For example, in linear and quadratic equations we are able to find roots directly ITERATIVE METHOD These methods are based on the idea of successive approximation, i.e. given a recursion formula, we start with one or more initial approximations of the root and obtain a sequence of approximations or iterates, say The method gives one root at a time. which in the limit converges to the root. For example, to solve quadratic equation ( ), although we have a direct method for finding roots, we may obtain the following three iterative methods: (i) Then, the recursion formula can be written as Institute of Lifelong Learning, University of Delhi Page No. 4
5 (ii) This formula is called iterative method. Then, the iterative method becomes (iii) Then, the iterative method becomes Using initial approximation, we can calculate the value of from any of the above iterative methods. Again, using and same iterative method, we calculate. We continue following these steps till tolerance). becomes less than permissible error (error Now, the question arises, which of these iterative methods is the best suitable method? For this, we discuss the concept of convergence and in later sections obtain conditions to ensure convergence of such methods. Definition 3.3. CONVERGENCE A sequence of iterates converges to the root of equation, if In case where it is not possible to find root, we attempt to find an approximate root such that either or where are two consecutive iterates and is the prescribed error tolerance. The convergence of the sequence of iterates to the root of the given equation depends on the rearrangement and the choice of the initial approximation. Definition 3.4. RATE OF CONVERGENCE Let be a sequence of iterates that converges to. If there exists a sequence that converges to zero and a positive constant, independent of, such that Institute of Lifelong Learning, University of Delhi Page No. 5
6 for all sufficiently large values of, then is said to converge to with the rate of convergence O, called big-o of. If converges to with rate of convergence O, we express it as +O(.The big-o term provides a reference for how quickly error approaches zero. For example, a sequence with rate of convergence O converges more slowly than a sequence with rate of convergence O( which in turn converges more slowly than a sequence with rate of convergence O( ). For example, consider the sequences of iterates and both converging to 1. Observe that and In both the cases whereas the rates of convergence are O and O respectively. The sequence converges to zero faster than and hence the sequence approaches to 1 faster than. Definition 3.5. ORDER OF CONVERGENCE We say that an iterative method has order of convergence, if is the largest such positive real number for which where = denotes the error in iterate and is called asymptotic error constant and usually depends on derivatives of at. We also say that the method is of order if the above condition is satisfied. Order of convergence examines the relationship between successive errors which measures the effectiveness with which each iteration reduces the approximation error. 4. SOLUTIONS OF NON LINEAR EQUATIONS 4.1. FIXED POINT ITERATION METHOD Consider the equation. As discussed in section 3, it can be rewritten in the form It has been shown in section 3 that this representation is not unique. However, the choice of function is based on the fulfilment of the condition, where are iterates otherwise the sequence of iterates will not converge to the root. Then the iterative method is given by Institute of Lifelong Learning, University of Delhi Page No. 6
7 Geometrical Interpretation We first convert the problem of finding root of to solving. can be written as coupled equation. We try to find the point of intersection of line and curve. Starting with initial iterate, where the distance AB between is large. Using the iterative method, and with the fulfilment of condition we obtain next iterate and observe that this distance has now reduced. This distance further gets reduced on each successive iteration and moving along a spiral path, we approach towards the point of intersection and hence the root. In some cases, we may observe that the successive iterates approach the root along staircase path. A B Note: If initial approximation is not given, then we take two numbers and such that Then the root lies between and. Now, take if is nearer to zero compared to or take if is nearer to zero compared to. In this iterative method, one needs to be a little careful while choosing initial approximation. We check and not, since and are entirely different curves and we aim at finding root of. Problem Find positive root of method. using the fixed point iteration Solution. Let Institute of Lifelong Learning, University of Delhi Page No. 7
8 So, we may choose either 1 or 2 as initial approximation. Let. Now, to apply fixed point iteration method, we first convert in the form. The possible representations could be 1., This is not suitable since is not defined. 2., This form also is not suitable since is not defined. 3., Let s choose. (Observe that and are entirely different functions) Then, by using fixed point iteration method, For Now, Condition is satisfied. So we proceed to next step Then, and =0.3912<1 Continuing this way, we get and = and = Institute of Lifelong Learning, University of Delhi Page No. 8
9 and = and = and = and = Hence, the required root is ORDER OF COVERGENCE OF FIXED POINT ITERATION METHOD We show that the fixed point iteration method has linear order of convergence. Let the iterative method be defined as Suppose that the sequence of iterates converges to the value so that, in the limiting case, ( ) gives Subtracting ( ) from ( ), we get Now if error at ( +1) th and th stage is defined as Then, the relation ( ) gives Consider. Expanding about the point with the help of Taylor series expansion Now relation ( ) gives us Neglecting the terms of order, and terms of higher order, the relation ( ) provides us, =0,1,2,..., =0,1,2,..., =0,1,2,... Then the sequence of iterates converge to the root if which holds if (by using Theorem 2.7) and hence the order of convergence of the method is one with asymptotic error constant. Institute of Lifelong Learning, University of Delhi Page No. 9
10 Algorithm GIVEN, INITIAL APPROXIMATION AND PERMISSIBLE ERROR GIVEN =NUMBER OF ITERATIONS Define FOR =0 TO COMPUTE IF and < SOLUTION= ELSE STOP END IF STATEMENT STOP ITERATIONS END FOR LOOP 4.2. NEWTON RAPHSON METHOD Consider the equation, where is a real valued function, continuous together with its first and second derivatives within a certain interval. Let Then the Newton Raphson method is given by the following iterative formula be the initial iterate., provided GEOMETRICAL INTERPRETATION The idea is to approximate roots by using tangents. Let initial approximation be Consider the graph of. Draw tangent line at the point (. The point where tangent line meets the -axis is the second iterate point (. Now, draw tangent at the and repeat this process to obtain next iterate and hence by following this process the sequence of iterates is obatined. Institute of Lifelong Learning, University of Delhi Page No. 10
11 ( ( ( DERIVATION Derivation of the method is based on the steps discussed in its geometrical representation. Let be an approximate root/initial iterate of the equation and let tangent line drawn at ( to the curve meets -axis at. Then the equation of segment of tangent line joining ( and ( is given by The above equation is simplified to obtain Now taking as next iterate and assuming tangent line to the curve at ( meets - axis at. Equation of segment of tangent line joining ( and ( gives next iterate The generalisation of this process is given by the following formula The condition is necessary or otherwise tangent line will become parallel to - axis and then no roots can be found using Newton Raphson method. PROBLEM Perform four iterations of the Newton Raphson method to find the root of the non linear equation. SOLUTION. Institute of Lifelong Learning, University of Delhi Page No. 11
12 Let Choose. Now, The required root is (approx) PROBLEM Find an iterative formula to compute the reciprocal of a natural number. SOLUTION. Let Let Using Newton Raphson formula Institute of Lifelong Learning, University of Delhi Page No. 12
13 So, the required iterative formula is ORDER OF CONVERGENCE OF NEWTON RAPHSON METHOD The Newton Raphson method for solving is given by Let be the exact root of, such that Let the errors at th and ( +1) th stage be defined as, Then,, Substituting the values of and in ( ), we get Expanding and about by Taylor series and using ( ), we get Substituting the values of and in ( ) Institute of Lifelong Learning, University of Delhi Page No. 13
14 Neglecting the terms of and higher order terms, we obtain Now, is a constant. So, let. Then, we have Hence, the order of convergence of the Newton Raphson Method is 2. Algorithm GIVEN, INITIAL APPROXIMATION AND PERMISSIBLE GIVEN =NUMBER OF ITERATIONS FIND FOR =0 TO COMPUTE IF < SOLUTION= STOP ITERATIONS END IF STATEMENT END FOR LOOP 4.3. SECANT METHOD Consider the equation, where is a real valued function. If and are two approximations to the root of such that, then the next approximation to the root is given by the secant method: This method is also called chord method. It is a two point iteration method. Institute of Lifelong Learning, University of Delhi Page No. 14
15 GEOMETRICAL INTERPRETATION ( ( ( 0 Unlike use of tangents in the case of Newton Raphson method, we will make use of secants in this method. Given two initial approximations and, draw secant passing through the points ( and (. The point where this secant meets the -axis is the next iterate. Now, again draw secant passing through the points ( and (, the point where it meets the -axis gives the next iterate. Hence by repeating this process the sequence of iterates converging to the root is obtained DERIVATION The secant method can be derived very easily by following the ideas illustrated in derivation of Newton Raphson method. Let, be initial approximations to the equation. Then the equation of secant passing trough ( and ( is given by Let, this secant meets the -axis at, so point satisfies this equation. Then we have By eliminating, we obtain Similarly, we can obtain next iterate Generalising this process to obtain the following formula Institute of Lifelong Learning, University of Delhi Page No. 15
16 PROBLEM Determine the root of the equation method. by using secant SOLUTION. Let Taking the initial approximations as and. Using the secant method, next approximation can be obtained as and Next, and Similarly, Therefore, the required root is (approx) ORDER OF COVERGENCE OF SECANT METHOD The secant method for solving the equation is given by Let be the exact root of, such that Let the errors at th th and ( +1) th stage be defined as Institute of Lifelong Learning, University of Delhi Page No. 16
17 , Then,, Substituting the values of and in ( ), we get Expanding and about by Taylor series, we have Using these relations, we obtain and Substituting the values in ( ), and using, we obtain Neglecting the higher order terms and taking, we get Now, we determine such that Replacing by, Institute of Lifelong Learning, University of Delhi Page No. 17
18 Substituting these values in ( ) Comparing the like powers of on both sides, we get which gives, positive root. Hence,. Since, order of convergence can never be negative, we take (approx) is the order of convergence of secant method. Algorithm GIVEN, INITIAL APPROXIMATIONS, AND PERMISSIBLE ERROR GIVEN =NUMBER OF ITERATIONS FOR =1 TO COMPUTE IF < SOLUTION= STOP ITERATIONS END IF STATEMENT END FOR LOOP 4.4. REGULA FALSI METHOD Regula Falsi method is also known as False position method or Method of False position. Consider the equation, where is a real valued function. If and are two approximations to the root of such that, then the next approximation to the root is given by the regula falsi method: Regula falsi method becomes secant method if the condition is dropped. The advantage of this method over secant method is that it is based on intermediate value theorem which guarantees the existence of root whereas secant method does not guarantee. Institute of Lifelong Learning, University of Delhi Page No. 18
19 GEOMETRICAL INTERPRETATION ( 0 ( ( Given two initial approximations and, such that, draw chord joining the points ( and (. The point where this chord meets the -axis is the next iterate. Now observe that in the particular figure chosen. So, we draw a chord joining the points ( and (, the point where it meets the - axis gives the next iterate.had it been, we would have drawn chord joining ( and (. Hence in this method, we not only use chords or secants but also make use of intermediate value theorem at every step. Note: Reader can now compare and analyze that the derivation of regula falsi method is almost same as the derivation of secant method. Problem Solve for the root lying between 2 and 4 by regula falsi method. Solution. Let and, such that So, by applying regula falsi method, and Observe that, so root lies between and. Now, Institute of Lifelong Learning, University of Delhi Page No. 19
20 and Now,, so root lies between and. Proceeding this way, we obtain So, approximated root is ORDER OF COVERGENCE OF REGULA FALSI METHOD We consider a particular case of regula falsi method: which can be rewritten as Let be the exact root of, such that Let the errors at th and ( +1) th stage be defined as,, similarly, Then, Substituting the values of, and in ( ), we get, Expanding and about by Taylor series, we have Institute of Lifelong Learning, University of Delhi Page No. 20
21 Substituting the values in ( ), and using, we obtain Neglecting the higher order terms, we get Taking Therefore, the method has linear order of convergence. Algorithm GIVEN, INITIAL APPROXIMATIONS, AND PERMISSIBLE ERROR GIVEN =NUMBER OF ITERATIONS FOR =1 TO COMPUTE IF < UPDATE and ELSE UPDATE and END IF STATEMENT IF < SOLUTION= STOP ITERATIONS END IF STATEMENT END FOR LOOP Institute of Lifelong Learning, University of Delhi Page No. 21
22 4.5. BISECTION METHOD This method is based on the repeated application of the intermediate value theorem. The Bisection method involves the following steps: 1) Let interval which contains the root of be given 2) Bisect at the point 3) Calculate and If take, else if take. So, now interval also contains the root. 4) Bisect at the point and by repeating step 3 obtain interval. We continue this process and obtain a nested sequence of intervals containing root:..., such that after repeating the process times, we either find a root or find the interval of length which contains the root. 5) Take mid-point of this last interval as the derived approximation to the root GEOMETRICAL INTERPRETATION We give geometrical interpretation of bisection method with the help of an illustration. Problem Solve with the help of bisection method. Solution. Let Hence, root lies between 2 and 3. (Using this information, we draw the following intuitive figure) =2 =3 Step 1. Take. Step 2. and Institute of Lifelong Learning, University of Delhi Page No. 22
23 Step 3. and. So root lies between 2.5 and 3. Take. =2 =2.5 =3 Step 4. Again, let s repeat steps 2 and 3. and So, root lies between 2.5 and Take =2 =2.5 =2.75 =3 Again and So, root lies between and Take =2 =2.625 =3 So, proceeding in this way, the interval containing root is shrinking and we are gradually approaching towards the root. Institute of Lifelong Learning, University of Delhi Page No. 23
24 . So,. So,. So,. So,. So,. So,. So,. So, We stop iterations here, since and are identical upto third decimal place. The root lies in interval and it can be chosen as Result If a root of lies in the interval, then the minimum number of iterations required for the convergence when the permissible error is is Proof: If the root of lies in the interval, then after n bisections the length of the interval which contains the root is. Therefore, the minimum number of iterations with determined from the relation, as the permissible error may be Taking log on both sides, Institute of Lifelong Learning, University of Delhi Page No. 24
25 Algorithm GIVEN, INITIAL INTERVAL AND PERMISSIBLE ERROR GIVEN =NUMBER OF ITERATIONS FOR =0 TO COMPUTE IF < UPDATE and ELSE UPDATE and END IF STATEMENT IF < SOLUTION= STOP ITERATIONS END IF STATEMENT END FOR LOOP SOLUTION= END IF END FOR 5. SUMMARY In this chapter, we discussed five methods for solving non linear equations register their order of convergence in the following table, we Method Order of convergence Fixed point iteration method 1 Newton Raphson method 2 Secant method 1.61 Regula falsi method 1 Bisection method 1 We have also provided geometrical interpretations and algorithms for each of the above methods. Clearly, order of convergence of Newton Raphson method is the highest which makes it the most desirable method but it requires derivative of the function, hence adding an additional step to its algorithm. Moreover, faster convergence in Newton Raphson Institute of Lifelong Learning, University of Delhi Page No. 25
26 method is possible if has large value otherwise computation of the root either becomes slow or impossible. If vanishes at some point, it becomes impossible to find next iterate. Next, we discussed secant method and regula falsi method which are based on secants and hence no derivatives are required. Order of convergence of secant method is higher than regula falsi method, so secant method seems like more promising method. However, in certain cases where permissible error is chosen such that the difference between two successive iterations is small, then the secant may become parallel to -axis and thus, no further iterations can be done, whereas, regula falsi method is based on intermediate value theorem which guarantees the existence of solution. Bisection method is based on repeated application of intermediate value theorem which without any additional condition guarantees the existence of a root. 6. EXERCISES 1. Compute and also determine the corresponding rate of convergence. 2. The errors of successive iterates obtained while approximating using two different methods are registered in the following table. Estimate the order of convergence of each method. Error Method I Method II Find a positive root of and by using each of the following methods: Newton Raphson method, Bisection method, Secant method, Regula falsi method, Fixed point iteration method. (Ans.1.856,0.567) 4. The equation has one root near which is to be computed by the iteration method is an integer. (a) Determine which value of will give the fastest convergence. (b) Using the value of, perform three iterations and calculate. (Ans. ; 4.223) 5. By applying Newton Raphson method to the function. Prove that If, where, show that Institute of Lifelong Learning, University of Delhi Page No. 26
27 7. REFERENCES [1] S Salleh, A Y Zomaya and S A bakar, Computing for Numerical Methods using Visual C++, Wiley Interscience, [2] K E Atkinson, An Introduction to Numerical Analysis, John Wiley & Sons, Second edition. [3] M K Jain, S R K Iyengar and R K Jain, Numerical Methods (Problems and Solutions), New Age International Publishers, Revised second edition. [4] M K Jain, S R K Jain, R K Jain, Numerical Methods for Scientific and Engineering Computation, New Age International Publishers, Fifth Edition, [5] B Bradie, A Friendly Introduction to Numerical Analysis, Pearson education, India, Institute of Lifelong Learning, University of Delhi Page No. 27
Today s class. Roots of equation Finish up incremental search Open methods. Numerical Methods, Fall 2011 Lecture 5. Prof. Jinbo Bi CSE, UConn
Today s class Roots of equation Finish up incremental search Open methods 1 False Position Method Although the interval [a,b] where the root becomes iteratively closer with the false position method, unlike
More informationf( x ), or a solution to the equation f( x) 0. You are already familiar with ways of solving
The Bisection Method and Newton s Method. If f( x ) a function, then a number r for which f( r) 0 is called a zero or a root of the function f( x ), or a solution to the equation f( x) 0. You are already
More informationspecified or may be difficult to handle, we often have a tabulated data
Interpolation Introduction In many practical situations, for a function which either may not be explicitly specified or may be difficult to handle, we often have a tabulated data where and for In such
More informationReals 1. Floating-point numbers and their properties. Pitfalls of numeric computation. Horner's method. Bisection. Newton's method.
Reals 1 13 Reals Floating-point numbers and their properties. Pitfalls of numeric computation. Horner's method. Bisection. Newton's method. 13.1 Floating-point numbers Real numbers, those declared to be
More informationInternational Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationAn interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s.
Using Monte Carlo to Estimate π using Buffon s Needle Problem An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Here s the problem (in a simplified form). Suppose
More information5.5 Newton s Approximation Method
498CHAPTER 5. USING DERIVATIVES TO ANALYZE FUNCTIONS; FURTHER APPLICATIONS 4 3 y = x 4 3 f(x) = x cosx y = cosx 3 3 x = cosx x cosx = 0 Figure 5.: Figure showing the existence of a solution of x = cos
More informationThe Bisection Method versus Newton s Method in Maple (Classic Version for Windows)
The Bisection Method versus (Classic Version for Windows) Author: Barbara Forrest Contact: baforres@uwaterloo.ca Copyrighted/NOT FOR RESALE version 1.1 Contents 1 Objectives for this Lab i 2 Approximate
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationGraphing Functions. 0, < x < 0 1, 0 x < is defined everywhere on R but has a jump discontinuity at x = 0. h(x) =
Graphing Functions Section. of your tetbook is devoted to reviewing a series of steps that you can use to develop a reasonable graph of a function. Here is my version of a list of things to check. You
More informationCS321 Introduction To Numerical Methods
CS3 Introduction To Numerical Methods Fuhua (Frank) Cheng Department of Computer Science University of Kentucky Lexington KY 456-46 - - Table of Contents Errors and Number Representations 3 Error Types
More information1. Use the Trapezium Rule with five ordinates to find an approximate value for the integral
1. Use the Trapezium Rule with five ordinates to find an approximate value for the integral Show your working and give your answer correct to three decimal places. 2 2.5 3 3.5 4 When When When When When
More informationNUMERICAL METHODS, NM (4776) AS
NUMERICAL METHODS, NM (4776) AS Objectives To provide students with an understanding that many mathematical problems cannot be solved analytically but require numerical methods. To develop a repertoire
More informationGraphing Polynomial Functions: The Leading Coefficient Test and End Behavior: For an n th n. degree polynomial function a 0, 0, then
Graphing Polynomial Functions: The Leading Coefficient Test and End Behavior: For an n th n n 1 degree polynomial function a 0, n If n is even and an 0, then f x a x a x a x a with n n 1 1 0 x If n is
More informationLecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10
Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful
More informationCURVE SKETCHING EXAM QUESTIONS
CURVE SKETCHING EXAM QUESTIONS Question 1 (**) a) Express f ( x ) in the form ( ) 2 f x = x + 6x + 10, x R. f ( x) = ( x + a) 2 + b, where a and b are integers. b) Describe geometrically the transformations
More informationThursday 14 June 2012 Morning
Thursday 4 June 202 Morning A2 GCE MATHEMATICS 4726 Further Pure Mathematics 2 QUESTION PAPER *47325062* Candidates answer on the Printed Answer Book. OCR supplied materials: Printed Answer Book 4726 List
More information(Part - 1) P. Sam Johnson. April 14, Numerical Solution of. Ordinary Differential Equations. (Part - 1) Sam Johnson. NIT Karnataka.
P. April 14, 2015 1/51 Overview We discuss the following important methods of solving ordinary differential equations of first / second order. Picard s method of successive approximations (Method of successive
More informationChapter - 2 Complexity of Algorithms for Iterative Solution of Non-Linear Equations
Chapter - Compleity of Algorithms for Iterative Solution of Non-Linear Equations Compleity of Algorithms for Iterative... 19 CHAPTER - Compleity of Algorithms for Iterative Solution of Non-Linear Equations.1
More information1 Review of Functions Symmetry of Functions; Even and Odd Combinations of Functions... 42
Contents 0.1 Basic Facts...................................... 8 0.2 Factoring Formulas.................................. 9 1 Review of Functions 15 1.1 Functions.......................................
More information2 Computation with Floating-Point Numbers
2 Computation with Floating-Point Numbers 2.1 Floating-Point Representation The notion of real numbers in mathematics is convenient for hand computations and formula manipulations. However, real numbers
More informationComputers in Engineering Root Finding Michael A. Hawker
Computers in Engineering COMP 208 Root Finding Michael A. Hawker Root Finding Many applications involve finding the roots of a function f(x). That is, we want to find a value or values for x such that
More information1 MATH 253 LECTURE NOTES for FRIDAY SEPT. 23,1988: edited March 26, 2013.
1 MATH 253 LECTURE NOTES for FRIDAY SEPT. 23,1988: edited March 26, 2013. TANGENTS Suppose that Apple Computers notices that every time they raise (or lower) the price of a $5,000 Mac II by $100, the number
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationFunctions. Edexcel GCE. Core Mathematics C3
Edexcel GCE Core Mathematics C Functions Materials required for examination Mathematical Formulae (Green) Items included with question papers Nil Advice to Candidates You must ensure that your answers
More informationThis blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?
Intersecting Circles This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? This is a problem that a programmer might have to solve, for example,
More information2 Computation with Floating-Point Numbers
2 Computation with Floating-Point Numbers 2.1 Floating-Point Representation The notion of real numbers in mathematics is convenient for hand computations and formula manipulations. However, real numbers
More informationMathematics Background
Finding Area and Distance Students work in this Unit develops a fundamentally important relationship connecting geometry and algebra: the Pythagorean Theorem. The presentation of ideas in the Unit reflects
More information3.9 LINEAR APPROXIMATION AND THE DERIVATIVE
158 Chapter Three SHORT-CUTS TO DIFFERENTIATION 39 LINEAR APPROXIMATION AND THE DERIVATIVE The Tangent Line Approximation When we zoom in on the graph of a differentiable function, it looks like a straight
More informationWorksheet A GRAPHS OF FUNCTIONS
C GRAPHS F FUNCTINS Worksheet A Sketch and label each pair of graphs on the same set of aes showing the coordinates of any points where the graphs intersect. Write down the equations of any asymptotes.
More informationYear 8 Mathematics Curriculum Map
Year 8 Mathematics Curriculum Map Topic Algebra 1 & 2 Number 1 Title (Levels of Exercise) Objectives Sequences *To generate sequences using term-to-term and position-to-term rule. (5-6) Quadratic Sequences
More informationPublic Key Cryptosystem Based on Numerical Methods
Global Journal of Pure and Applied Mathematics. ISSN 0973-178 Volume 13, Number 7 (17), pp. 310-3112 Research India Publications http://www.ripublication.com Public Key Cryptosystem Based on Numerical
More informationDOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA
Chapter 1 : BioMath: Transformation of Graphs Use the results in part (a) to identify the vertex of the parabola. c. Find a vertical line on your graph paper so that when you fold the paper, the left portion
More informationCore Mathematics 1 Graphs of Functions
Regent College Maths Department Core Mathematics 1 Graphs of Functions Graphs of Functions September 2011 C1 Note Graphs of functions; sketching curves defined by simple equations. Here are some curves
More informationHonors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1
Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1
More informationChapter III.C Analysis of The Second Derivative Draft Version 4/19/14 Martin Flashman 2005
Chapter III.C Analysis of The Second Derivative Draft Version 4/19/14 Martin Flashman 2005 In this section we will develop applications of the second derivative that explain more graphical features of
More informationChapter 12: Quadratic and Cubic Graphs
Chapter 12: Quadratic and Cubic Graphs Section 12.1 Quadratic Graphs x 2 + 2 a 2 + 2a - 6 r r 2 x 2 5x + 8 2y 2 + 9y + 2 All the above equations contain a squared number. They are therefore called quadratic
More information1.00 Lecture 25. Root Finding
1.00 Lecture 25 Numerical Methods: Root Finding Reading for next time: Big Java: section 19.4 Root Finding Two cases: One dimensional function: f(x)= 0 Systems of equations (F(X)= 0), where X and 0 are
More informationa 2 + 2a - 6 r r 2 To draw quadratic graphs, we shall be using the method we used for drawing the straight line graphs.
Chapter 12: Section 12.1 Quadratic Graphs x 2 + 2 a 2 + 2a - 6 r r 2 x 2 5x + 8 2 2 + 9 + 2 All the above equations contain a squared number. The are therefore called quadratic expressions or quadratic
More informationdt Acceleration is the derivative of velocity with respect to time. If a body's position at time t is S = f(t), the body's acceleration at time t is
APPLICATIN F DERIVATIVE INTRDUCTIN In this section we eamine some applications in which derivatives are used to represent and interpret the rates at which things change in the world around us. Let S be
More informationTrig Functions, Equations & Identities May a. [2 marks] Let. For what values of x does Markscheme (M1)
Trig Functions, Equations & Identities May 2008-2014 1a. Let. For what values of x does () 1b. [5 marks] not exist? Simplify the expression. EITHER OR [5 marks] 2a. 1 In the triangle ABC,, AB = BC + 1.
More informationGeometric Constructions
HISTORY OF MATHEMATICS Spring 2005 Geometric Constructions Notes, activities, assignment; #3 in a series. Note: I m not giving a specific due date for this somewhat vague assignment. The idea is that it
More information1
Zeros&asymptotes Example 1 In an early version of this activity I began with a sequence of simple examples (parabolas and cubics) working gradually up to the main idea. But now I think the best strategy
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 informationCecil Jones Academy Mathematics Fundamentals
Year 10 Fundamentals Core Knowledge Unit 1 Unit 2 Estimate with powers and roots Calculate with powers and roots Explore the impact of rounding Investigate similar triangles Explore trigonometry in right-angled
More informationLesson 20: Four Interesting Transformations of Functions
Student Outcomes Students apply their understanding of transformations of functions and their graphs to piecewise functions. Lesson Notes In Lessons 17 19 students study translations and scalings of functions
More informationDEPARTMENT - Mathematics. Coding: N Number. A Algebra. G&M Geometry and Measure. S Statistics. P - Probability. R&P Ratio and Proportion
DEPARTMENT - Mathematics Coding: N Number A Algebra G&M Geometry and Measure S Statistics P - Probability R&P Ratio and Proportion YEAR 7 YEAR 8 N1 Integers A 1 Simplifying G&M1 2D Shapes N2 Decimals S1
More informationSpring 2: Circles, Pythagoras and prisms Circumference of a circle, area of a circle, Pythagoras s theorem, prisms and cylinders, Errors and bounds.
Subject: Mathematics Year 9 Overview Gamma Key content knowledge and skills Autumn 1: Indices and standard form, expressions and formulae Indices, calculations and estimates, more indices, standard form,
More informationUnit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers
Contents STRAND B: Number Theory Unit 7 Number System and Bases Student Text Contents Section 7. Number System 7.2 Binary Numbers 7.3 Adding and Subtracting Binary Numbers 7.4 Multiplying Binary Numbers
More informationMastery. PRECALCULUS Student Learning Targets
PRECALCULUS Student Learning Targets Big Idea: Sequences and Series 1. I can describe a sequence as a function where the domain is the set of natural numbers. Connections (Pictures, Vocabulary, Definitions,
More informationThe transition: Each student passes half his store of candies to the right. students with an odd number of candies eat one.
Kate s problem: The students are distributed around a circular table The teacher distributes candies to all the students, so that each student has an even number of candies The transition: Each student
More information1.1 - Functions, Domain, and Range
1.1 - Functions, Domain, and Range Lesson Outline Section 1: Difference between relations and functions Section 2: Use the vertical line test to check if it is a relation or a function Section 3: Domain
More informationdemonstrate an understanding of the exponent rules of multiplication and division, and apply them to simplify expressions Number Sense and Algebra
MPM 1D - Grade Nine Academic Mathematics This guide has been organized in alignment with the 2005 Ontario Mathematics Curriculum. Each of the specific curriculum expectations are cross-referenced to the
More information3.7. Vertex and tangent
3.7. Vertex and tangent Example 1. At the right we have drawn the graph of the cubic polynomial f(x) = x 2 (3 x). Notice how the structure of the graph matches the form of the algebraic expression. The
More informationNotice there are vertical asymptotes whenever y = sin x = 0 (such as x = 0).
1 of 7 10/1/2004 6.4 GRAPHS OF THE OTHER CIRCULAR 6.4 GRAPHS OF THE OTHER CIRCULAR Graphs of the Cosecant and Secant Functions Graphs of the Tangent and Cotangent Functions Addition of Ordinates Graphs
More informationNoncrossing Trees and Noncrossing Graphs
Noncrossing Trees and Noncrossing Graphs William Y. C. Chen and Sherry H. F. Yan 2 Center for Combinatorics, LPMC, Nanai University, 30007 Tianjin, P.R. China chen@nanai.edu.cn, 2 huifangyan@eyou.com Mathematics
More informationMATHS METHODS QUADRATICS REVIEW. A reminder of some of the laws of expansion, which in reverse are a quick reference for rules of factorisation
MATHS METHODS QUADRATICS REVIEW LAWS OF EXPANSION A reminder of some of the laws of expansion, which in reverse are a quick reference for rules of factorisation a) b) c) d) e) FACTORISING Exercise 4A Q6ace,7acegi
More informationIntroduction to C++ Introduction to C++ Week 6 Dr Alex Martin 2013 Slide 1
Introduction to C++ Introduction to C++ Week 6 Dr Alex Martin 2013 Slide 1 Numerical Integration Methods The Trapezoidal Rule If one has an arbitrary function f(x) to be integrated over the region [a,b]
More informationC3 Numerical methods
Verulam School C3 Numerical methods 138 min 108 marks 1. (a) The diagram shows the curve y =. The region R, shaded in the diagram, is bounded by the curve and by the lines x = 1, x = 5 and y = 0. The region
More informationP1 REVISION EXERCISE: 1
P1 REVISION EXERCISE: 1 1. Solve the simultaneous equations: x + y = x +y = 11. For what values of p does the equation px +4x +(p 3) = 0 have equal roots? 3. Solve the equation 3 x 1 =7. Give your answer
More informationChislehurst and Sidcup Grammar School Mathematics Department Year 9 Programme of Study
Chislehurst and Sidcup Grammar School Mathematics Department Year 9 Programme of Study Timings Topics Autumn Term - 1 st half (7 weeks - 21 lessons) 1. Algebra 1: Expressions, Formulae, Equations and Inequalities
More informationA.1 Numbers, Sets and Arithmetic
522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,
More informationChapter 3 Limits and Derivative Concepts
Chapter 3 Limits and Derivative Concepts 1. Average Rate of Change 2. Using Tables to Investigate Limits 3. Symbolic Limits and the Derivative Definition 4. Graphical Derivatives 5. Numerical Derivatives
More informationTo be a grade 1 I need to
To be a grade 1 I need to Order positive and negative integers Understand addition and subtraction of whole numbers and decimals Apply the four operations in correct order to integers and proper fractions
More informationGeometric approximation of curves and singularities of secant maps Ghosh, Sunayana
University of Groningen Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish
More informationUNIT P1: PURE MATHEMATICS 1 QUADRATICS
QUADRATICS Candidates should able to: carr out the process of completing the square for a quadratic polnomial, and use this form, e.g. to locate the vertex of the graph of or to sketch the graph; find
More informationList of NEW Maths content
List of NEW Maths content Our brand new Maths content for the new Maths GCSE (9-1) consists of 212 chapters broken up into 37 titles and 4 topic areas (Algebra, Geometry & Measures, Number and Statistics).
More informationSOME PROPERTIES OF TRIGONOMETRIC FUNCTIONS. 5! x7 7! + = 6! + = 4! x6
SOME PROPERTIES OF TRIGONOMETRIC FUNCTIONS PO-LAM YUNG We defined earlier the sine cosine by the following series: sin x = x x3 3! + x5 5! x7 7! + = k=0 cos x = 1 x! + x4 4! x6 6! + = k=0 ( 1) k x k+1
More informationFinal Exam Review Algebra Semester 1
Final Exam Review Algebra 015-016 Semester 1 Name: Module 1 Find the inverse of each function. 1. f x 10 4x. g x 15x 10 Use compositions to check if the two functions are inverses. 3. s x 7 x and t(x)
More information9-1 GCSE Maths. GCSE Mathematics has a Foundation tier (Grades 1 5) and a Higher tier (Grades 4 9).
9-1 GCSE Maths GCSE Mathematics has a Foundation tier (Grades 1 5) and a Higher tier (Grades 4 9). In each tier, there are three exams taken at the end of Year 11. Any topic may be assessed on each of
More informationNumerical Integration
Numerical Integration Numerical Integration is the process of computing the value of a definite integral, when the values of the integrand function, are given at some tabular points. As in the case of
More informationYEAR 10- Mathematics Term 1 plan
Week YEAR 10- Mathematics Term 1 plan 2016-2017 Course Objectives 1 The number system To understand and use 4 rules and order of operation. To understand and use Recurring decimals. Add subtract multiply
More informationIntroduction to numerical algorithms
Introduction to numerical algorithms Given an algebraic equation or formula, we may want to approximate the value, and while in calculus, we deal with equations or formulas that are well defined at each
More informationChapter 4. Trigonometric Functions. 4.6 Graphs of Other. Copyright 2014, 2010, 2007 Pearson Education, Inc.
Chapter 4 Trigonometric Functions 4.6 Graphs of Other Trigonometric Functions Copyright 2014, 2010, 2007 Pearson Education, Inc. 1 Objectives: Understand the graph of y = tan x. Graph variations of y =
More information2.4. Rates of Change and Tangent Lines. Copyright 2007 Pearson Education, Inc. Publishing as Pearson Prentice Hall
2.4 Rates of Change and Tangent Lines Copyright 2007 Pearson Education, Inc. Publishing as Pearson Prentice Hall What you ll learn about Average Rates of Change Tangent to a Curve Slope of a Curve Normal
More informationYear 7 to 11 Mathematics Curriculum Overview
Year 7 to 11 Mathematics Curriculum Overview Mathematics Department Vision: A mathematician at Bournville is not defined through prior attainment. At Bournville they are someone who through practice and
More information1.00 Lecture 19. Numerical Methods: Root Finding
1.00 Lecture 19 Numerical Methods: Root Finding short int Remember Java Data Types Type byte long float double char boolean Size (bits) 8 16 32 64 32 64 16 1-128 to 127-32,768 to 32,767-2,147,483,648 to
More informationA-SSE.1.1, A-SSE.1.2-
Putnam County Schools Curriculum Map Algebra 1 2016-2017 Module: 4 Quadratic and Exponential Functions Instructional Window: January 9-February 17 Assessment Window: February 20 March 3 MAFS Standards
More informationMEI STRUCTURED MATHEMATICS. MEI conference University of Hertfordshire June C3 COURSEWORK
MEI STRUCTURED MATHEMATICS MEI conference University of Hertfordshire June 29 2009 C3 COURSEWORK What is this coursework designed to do and how do we prepare students for it? Presenter: Val Hanrahan The
More informationAP Calculus BC Course Description
AP Calculus BC Course Description COURSE OUTLINE: The following topics define the AP Calculus BC course as it is taught over three trimesters, each consisting of twelve week grading periods. Limits and
More informationLos Angeles Unified School District. Mathematics Grade 6
Mathematics Grade GRADE MATHEMATICS STANDARDS Number Sense 9.* Compare and order positive and negative fractions, decimals, and mixed numbers and place them on a number line..* Interpret and use ratios
More information2.4. A LIBRARY OF PARENT FUNCTIONS
2.4. A LIBRARY OF PARENT FUNCTIONS 1 What You Should Learn Identify and graph linear and squaring functions. Identify and graph cubic, square root, and reciprocal function. Identify and graph step and
More informationChapter 1. Linear Equations and Straight Lines. 2 of 71. Copyright 2014, 2010, 2007 Pearson Education, Inc.
Chapter 1 Linear Equations and Straight Lines 2 of 71 Outline 1.1 Coordinate Systems and Graphs 1.4 The Slope of a Straight Line 1.3 The Intersection Point of a Pair of Lines 1.2 Linear Inequalities 1.5
More informationMaximizing an interpolating quadratic
Week 11: Monday, Apr 9 Maximizing an interpolating quadratic Suppose that a function f is evaluated on a reasonably fine, uniform mesh {x i } n i=0 with spacing h = x i+1 x i. How can we find any local
More informationContents. Hilary Term. Summary of Numerical Analysis for this term. Sources of error in numerical calculation. Solving Problems
Contents Hilary Term 1 Root Finding 4 11 Bracketing and Bisection 5 111 Finding the root numerically 5 112 Pseudo BRACKET code 7 113 Drawbacks 8 114 Tips for success with Bracketing & Bisection 9 115 Virtues
More informationMathematics GCSE 9-1 Curriculum Planner (3 Year Course)
Mathematics GCSE 9-1 Curriculum Planner (3 Year Course) Year 9 Week 1 2 3 4 5 6 7 8 HT 9 1 0 Chapter 1 Calculations Chapter 2 Expressions Ch 1, 2 Test Chapter 3 Angles, polygons Chapter 3 11 12 13 14 15
More informationModule 4 : Solving Linear Algebraic Equations Section 11 Appendix C: Steepest Descent / Gradient Search Method
Module 4 : Solving Linear Algebraic Equations Section 11 Appendix C: Steepest Descent / Gradient Search Method 11 Appendix C: Steepest Descent / Gradient Search Method In the module on Problem Discretization
More informationFigure 2.1: A bipartite graph.
Matching problems The dance-class problem. A group of boys and girls, with just as many boys as girls, want to dance together; hence, they have to be matched in couples. Each boy prefers to dance with
More informationMathematics (www.tiwariacademy.com)
() Miscellaneous Exercise on Chapter 10 Question 1: Find the values of k for which the line is (a) Parallel to the x-axis, (b) Parallel to the y-axis, (c) Passing through the origin. Answer 1: The given
More informationObjectives and Homework List
MAC 1140 Objectives and Homework List Each objective covered in MAC1140 is listed below. Along with each objective is the homework list used with MyMathLab (MML) and a list to use with the text (if you
More information1.00 Lecture 19. Packaging Functions in Objects
1.00 Lecture 19 Numerical Methods: Root Finding Packaging Functions in Objects Consider writing method that finds root of function or evaluates a function, e.g., f(x)= 0 on some interval [a, b], or find
More informationAQA GCSE Maths - Higher Self-Assessment Checklist
AQA GCSE Maths - Higher Self-Assessment Checklist Number 1 Use place value when calculating with decimals. 1 Order positive and negative integers and decimals using the symbols =,, , and. 1 Round to
More informationslope rise run Definition of Slope
The Slope of a Line Mathematicians have developed a useful measure of the steepness of a line, called the slope of the line. Slope compares the vertical change (the rise) to the horizontal change (the
More informationFOUNDATION HIGHER. F Autumn 1, Yr 9 Autumn 2, Yr 9 Spring 1, Yr 9 Spring 2, Yr 9 Summer 1, Yr 9 Summer 2, Yr 9
Year: 9 GCSE Mathematics FOUNDATION F Autumn 1, Yr 9 Autumn 2, Yr 9 Spring 1, Yr 9 Spring 2, Yr 9 Summer 1, Yr 9 Summer 2, Yr 9 HIGHER Integers and place value Decimals Indices, powers and roots Factors,multiples
More informationMathematics Year 9-11 Skills and Knowledge Checklist. Name: Class: Set : Premier Date Year 9 MEG :
Personal targets to help me achieve my grade : AFL Sheet Number 1 : Standard Form, Decimals, Fractions and Percentages Standard Form I can write a number as a product of it s prime factors I can use the
More informationCalculus I Review Handout 1.3 Introduction to Calculus - Limits. by Kevin M. Chevalier
Calculus I Review Handout 1.3 Introduction to Calculus - Limits by Kevin M. Chevalier We are now going to dive into Calculus I as we take a look at the it process. While precalculus covered more static
More informationBasic Properties The Definition of Catalan Numbers
1 Basic Properties 1.1. The Definition of Catalan Numbers There are many equivalent ways to define Catalan numbers. In fact, the main focus of this monograph is the myriad combinatorial interpretations
More informationCIRCLE. Circle is a collection of all points in a plane which are equidistant from a fixed point.
CIRCLE Circle is a collection of all points in a plane which are equidistant from a fixed point. The fixed point is called as the centre and the constant distance is called as the radius. Parts of a Circle
More informationRemember Java Data Types
1.00 Lecture 19 October 24, 2005 Numerical Methods: Root Finding Remember Java Data Types Size Type (bits) Range byte 8-128 to 127 short 16-32,768 to 32,767 int 32-2,147,483,648 to 2,147,483,647 long 64-9,223,372,036,854,775,808L
More informationEXERCISE SET 10.2 MATD 0390 DUE DATE: INSTRUCTOR
EXERCISE SET 10. STUDENT MATD 090 DUE DATE: INSTRUCTOR You have studied the method known as "completing the square" to solve quadratic equations. Another use for this method is in transforming the equation
More information