Coursework Requirements Numerical Methods. 1.Front Cover indicating that the coursework is about the numerical Solution of Equations. Include your name,

Slides:



Advertisements
Similar presentations
“Teach A Level Maths” Vol. 2: A2 Core Modules
Advertisements

“Teach A Level Maths” Vol. 2: A2 Core Modules
“Teach A Level Maths” Vol. 2: A2 Core Modules
Part 2 Chapter 6 Roots: Open Methods
Chapter 6: Roots: Open Methods
Lecture 5 Newton-Raphson Method
Part 2 Chapter 6 Roots: Open Methods
Roundoff and truncation errors
Scientific enquiry D1.1 You can come up with a testable hypothesis from an observation. D1.2 You can explain a hypothesis using your scientific knowledge.
Numeriska beräkningar i Naturvetenskap och Teknik 1.Solving equations.
A few words about convergence We have been looking at e a as our measure of convergence A more technical means of differentiating the speed of convergence.
APPLICATIONS OF DIFFERENTIATION Newton’s Method In this section, we will learn: How to solve high-degree equations using Newton’s method. APPLICATIONS.
A452 – Programming project – Mark Scheme
Chapter 3 Root Finding.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Solving Non-Linear Equations (Root Finding)
Chapter Representing Motion 2.
Introduction This chapter gives you several methods which can be used to solve complicated equations to given levels of accuracy These are similar to.
Math 3120 Differential Equations with Boundary Value Problems Chapter 2: First-Order Differential Equations Section 2-6: A Numerical Method.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
Newton's Method for Functions of Several Variables Joe Castle & Megan Grywalski.
Section 2.4 solving equations with variables on both sides of the equal sign. Day 1.
Lecture 6 Numerical Analysis. Solution of Non-Linear Equations Chapter 2.
“Teach A Level Maths” Vol. 2: A2 Core Modules
Solving equations numerically The sign - change rule If the function f(x) is continuous for an interval a  x  b of its domain, if f(a) and f(b) have.
Numerical Methods.
Iteration
Sign Change Re-cap Show that each of the following have a solution for x: 1.The intersection of (between 1.8 and 1.9) and 2.The intersection of(between.
CHAPTER 3 NUMERICAL METHODS
AUGUST 2. MATH 104 Calculus I Review of previous material…. …methods and applications of integration, differential equations ………..
Solving Non-Linear Equations (Root Finding)
AS Biology Completing your your coursework. Planning  This has already been completed.  Must be a clearly defined section of your final report – write.
4 Numerical Methods Root Finding Secant Method Modified Secant
–1 –5–4–3–2– Describe the continuity of the graph. Warm UP:
Linearization, Newton’s Method
SOLVING NONLINEAR EQUATIONS. SECANT METHOD MATH-415 Numerical Analysis 1.
Newton’s Method Problem: need to solve an equation of the form f(x)=0. Graphically, the solutions correspond to the points of intersection of the.
Iteration The solution lies between 0 and 1. e.g. To find integer bounds for we can sketch and  0 and 1 are the integer bounds. We often start by finding.
P2 Chapter 8 CIE Centre A-level Pure Maths © Adam Gibson.
Numerical Solution Of Equations
Rearranging the equation f(x)=0 into the form x=g(x)
CHAPTER 3 NUMERICAL METHODS
Numerical Methods Some example applications in C++
Gradient and Area Under Curve
Numerical Methods.
Using The Discriminant
FEASIBILITY STUDY Feasibility study is a means to check whether the proposed system is correct or not. The results of this study arte used to make decision.
Numerical Methods.
In the next example we’ll look at an equation which has 2 roots and the iteration produces a surprising result. The equation is . We’ll.
Trial and Improvement Objectives:
Chapter 6.
Solution of Equations by Iteration
Computers in Civil Engineering 53:081 Spring 2003
Roots of equations Class IX.
Copyright © Cengage Learning. All rights reserved.
KS4 Mathematics A6 Quadratic equations.
Copyright © Cengage Learning. All rights reserved.
Further Sequences and Series
Copyright © Cengage Learning. All rights reserved.
Section 4.8: Newton’s Method
ROOTS OF EQUATIONS.
Copyright © Cengage Learning. All rights reserved.
FP1: Chapter 2 Numerical Solutions of Equations
Chapter 6.
Copyright © Cengage Learning. All rights reserved.
MATH 1910 Chapter 3 Section 8 Newton’s Method.
Presentation transcript:

Coursework Requirements Numerical Methods

1.Front Cover indicating that the coursework is about the numerical Solution of Equations. Include your name, candidate number and centre number (12290) on every page as a footer 2.Aim 3.Introduction 4.Method 1 & Failure Case 5.Method 2 & Failure Case 6.Method 3 & Failure Case 7.Comparison of the 3 methods 8.Conclusion

1.Front Cover 2.Aim – State clearly that you are investigating (3) numerical methods of solving equations 3.Introduction 4.Method 1 & Failure Case 5.Method 2 & Failure Case 6.Method 3 & Failure Case 7.Comparison of the 3 methods 8.Conclusion

1.Front Cover 2.Aim 3.Introduction – here you summarise the contents and give an overview of the main ideas. Although this is the first section that is read, it is the last section that you should write. 4.Method 1 & Failure Case 5.Method 2 & Failure Case 6.Method 3 & Failure Case 7.Comparison of the 3 methods 8.Conclusion

1.Front Cover 2.Aim 3.Introduction 4.Method 1 & Failure Case – Explain the change of sign and decimal search method, showing full calculations and demonstrate an example of this method failing 5.Method 2 & Failure Case 6.Method 3 & Failure Case 7.Comparison of the 3 methods 8.Conclusion Use short, precise sentences, correct notation and terminology

Recommendation: Horizontal tables will save you space

You need to manipulate the graph so that the roots are not visible to 1dp

In effect, what you are doing is looking at ever greater detail … Looking at the root between 1 and 2 Looking at the root between 1.2 and 1.3

In effect, what you are doing is looking at ever greater detail … Looking at the root between 1.27 and 1.28 Looking at the root between 1.2 and 1.3 (error 0.05) Looking at the root between and 1.275

Marking  Calculations for finding one root to 5dp  Graphical illustration + statement of error bounds (± )  Case study of an illustrated example where the method fails (and reasons for this) Total : 3 marks

1.Front Cover 2.Aim 3.Introduction 4.Method 1 & Failure Case 5.Method 2 & Failure Case – Explain the fixed point iteration g(x) method, showing full calculations and demonstrate an example of this method failing 6.Method 3 & Failure Case 7.Comparison of the 3 methods 8.Conclusion

If the results are divergent you need to find another formula … Start with estimating a root

Illustrate this convergence with a staircase diagram

Staircase diagram showing convergence (1,1) (1,0.6667) (0.6667,0.6667) (0.6667,0.432)

Case 1Case 2 This method of finding the root will only be successful if … The gradient g ’( x ) of the point near your root is between -1 and +1 Now you should read your notes and extend this because you need to discuss the magnitude of g’( x ) at the end of each section

Make sure you have 5 graphs: a. f ( x ) showing intersection of y = f ( x ) and y = 0 … roots b. f ( x ) and intersection of y = g ( x ) and y = x … movement of roots c.Convergent case (staircase diagram) d.Divergent case (spider web diagram) e.Tangent at the intersections

Marking  Rearrangement of equation and calculation of root  Graphical illustration of convergence, magnitude of g ’( x ) discussed  Case study showing failure to converge using the same equation  Graphical illustration of divergence, magnitude of g ’( x ) discussed Total : 4 marks

1.Front Cover 2.Aim 3.Introduction 4.Method 1 & Failure Case 5.Method 2 & Failure Case 6.Method 3 & Failure Case – Explain the Newton-Raphson method, showing full calculations and demonstrate an example of this method failing 7.Comparison of the 3 methods 8.Conclusion

Method 3 : Newton-Raphson Iteration Pages 8-10, 14 &15 Start the search at the closest integer to the root: x 0 = 2 Draw a tangent to the curve at this point x 1 = intersection of the tangent and the x axis x 1 = We can calculate this point using the formula:

Starting point where x 0 = 2 This can be confirmed on Autograph for the curve y = x 3 − 5 x +4.2

x 0 is the starting value x 1 is the intersection of the tangent and the x axis x 2 is the intersection of the second tangent with the x axis

Failure: When f ‘( x ) = 0 If the tangent to the curve does not intersect the x axis, a new estimate of the root cannot be found.

Marking  Calculation of one root  Calculations of ALL roots  Graphical illustration for 1 root  Error bounds for 1 root  Case study showing where this method fails and graphical illustration of failure Total : 5 marks

1.Front Cover 2.Aim 3.Introduction 4.Method 1 & Failure Case 5.Method 2 & Failure Case 6.Method 3 & Failure Case 7a Compare the 3 methods in terms of how efficiently the calculations work on the same root with the same accuracy 7b Compare the 3 methods in terms of speed of convergence and ease of use of the hardware and software. 8. Conclusion

1.Front Cover 2.Aim 3.Introduction 4.Method 1 & Failure Case 5.Method 2 & Failure Case 6.Method 3 & Failure Case 7.Comparison of the 3 methods 8.Conclusion – summarise the information in an accurate and comprehensive manner