• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

Numerical Methods coursework

Extracts from this document...


Numerical Methods Coursework

Numerical Integration

The Problem

Integration means finding the area underneath a particular region of a function. At my current knowledge of maths I am not able to integrate various functions. Therefore I am going to use knowledge of numerical methods to produce an approximation to an area which does not have an analytic solution.

In my coursework I will integrate the function:


The graph below shows the graph of the function.


The red arrow determines the region between 0.25 and 1.25, which then leads to the integral:


I can not solve this problem using the knowledge of C1 and C2, because I am not able to integrate cos(x) yet. Due to this I suggest that this problem will be appropriate for numerical solution.

The Approximation Rules

To solve this problem, I am going to use knowledge of numerical integration studied in the “Numerical Methods” textbook. The approximate methods of definite integrals may be determined by numerical integration using:

1. The Trapezium Rule:

The Trapezium Rule divides the area underneath the curve into trapeziums. We can then use the formula image45.png (where a, b are the bases and h is the height of the trapezium) to estimate the area.


...read more.








Error Analysis

Because all three rules are just estimates, there is always an error involved. In this section I will give an estimate of how much error there is in my solution of the problem.

Firstly I want to refer to my graph of my function on page 1. The section of the curve is concave that means that the Trapezium Rule gives an overestimate and the Midpoint Rule gives an underestimate. For that reason the estimates of the Trapezium Rule are decreasing and they will reach the solution from above. On the other side the Midpoint Rule estimates are increasing and they will reach the solution from below.

Error in the Trapezium Rule

In the Trapezium Rule the error is proportional to h2. We add a constant k so that:


In general, if image41.png is the absolute error in image33.png then there is a constant (k) so that:


Where h is the strip width corresponding to n strips.

So the Trapezium Rule with 2n strips has a strip width of image43.png, such that:


That shows that halving h or doubling n will reduce the error by a factor of 0.25.

Therefore the “error multiplier” is 0.25.

...read more.


This can be proved by looking on the diagram below.




The distance between image50.png and image51.png is 4 times smaller than the distance between image52.png and image53.png, where X represents the actual solution. To get the next distance between image51.png and image55.png we multiply the “multiplier” 0.25 with the distance between image50.png and image51.png.

This development leads to improved solution by extrapolation, as stated in the “Formula Application” section.

Error in my solution

The error gets smaller the more strips are used as shown above. Therefore:



T2, M2


T4, M4


T8, M8


T4096, M4096











 My solution to the integral image63.png is: 0.885909(6 decimal places)

The solution refers to:        T4096=        0.885909120684554

M4096=        0.885909049759261

S256=        0.885909075135303

The fact that the Trapezium Rule and the Midpoint Rule give the same solution till the sixth decimal place guaranties that my solution is valid. Simpson’s Rule, the weighted average, proves the solution as well.

Therefore: My solution is proved by 3 different rules.

I can say with guarantee that there is an error involved, because all three rules are just approximation rules. But I can say that my solution is not far away from the actual solution as the error for the rules with 4096 stripes is very small (actual value stated in the “Error Analysis” section).

...read more.

This student written piece of work is one of many that can be found in our AS and A Level Core & Pure Mathematics section.

Found what you're looking for?

  • Start learning 29% faster today
  • 150,000+ documents available
  • Just £6.99 a month

Not the one? Search for your essay title...
  • Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

See related essaysSee related essays

Related AS and A Level Core & Pure Mathematics essays

  1. Marked by a teacher

    The Gradient Function

    5 star(s)

    3(x+h)� - x� = 3(x� +3x�h + 3h�x+h�) -3x� = 3h(3x� +3hx + h�) = x + h - x h h 3(3x� +3hx + h�) = 9x� + 9hx +3h� = 9x�* - "h" limits to 0. axn value gradient function x3 3x2 2x3 6x2 3x3 9x2 This pattern

  2. Methods of Advanced Mathematics (C3) Coursework.

    -0.04277 -2.493 -0.02912 -2.492 -0.01548 -2.491 -0.00186 -2.49 0.011751 Newton-Raphson xn f(xn) f'(xn) xn+1 -2 5 7 -2.714285714 -2.71428571 -3.425655977 17.10204082 -2.513978861 -2.51397886 -0.318677638 13.96026914 -2.49115139 -2.49115139 -0.003918158 13.61750575 -2.490863661 -2.49086366 -6.18691E-07 13.61320533 -2.490863615 The Newton raphson method shows the route to be -2.490863615 ?

  1. The open box problem

    x x 12 15-2x x 15-2x 12 Again I use the same equation as before but this time I replace 12 with 15. So the equation will be V= x(15-2x)^2 . I will now construct tables and two graphs to again show the maximum volume and x.

  2. Borders Coursework

    8 27 64 125 +7 +19 +37 +61 +12 +18 +24 +6 +6 General equation for Cubic sequences: an3 + bn2 + cn + d To find 'a' in the formula: a= 3rd difference in sequence 3rd difference in cubic sequence So: 8/6 = 4/3 =1?

  1. C3 Coursework: Numerical Methods

    This is illustrated by the graph below. This graph shows the equation of the line y=x�+10x�+4.8x+0.576 The roots appear to be between -1 and 0. By taking increments of 0.1 between -1 and 0 it will be possible to use decimal search to attempt to look for a change in sign.

  2. Solving Equations. Three numerical methods are discussed in this investigation. There are advantages and ...

    Method of Bisection: n a f(a) b f(b) c f(c) error 1 0 1 1 -0.5 0.5 0.3125 0.5 2 0.5 0.3125 1 -0.5 0.75 -0.1015625 0.25 3 0.5 0.3125 0.75 -0.1015625 0.625 0.106445313 0.125 4 0.625 0.106445313 0.75 -0.1015625 0.6875 0.002319336 0.0625 5 0.6875 0.002319336 0.75 -0.1015625 0.71875 -0.049697876

  1. MEI numerical Methods

    To use fix point iteration we do rearrange f(x) = 0, to G(x) = x. We then do G(x1), and so on; this is called a recurrence relation. By doing this, most of the time the sequence gets closer to the final answer thus it converges.

  2. C3 COURSEWORK - comparing methods of solving functions

    22 0.876 -0.02565 23 0.877 -0.01809 The root lies between 0.879 and 0.880 24 0.878 -0.01051 25 0.879 -0.00293 26 0.8791 -0.00217 27 0.8792 -0.00141 28 0.8793 -0.00065 29 0.87931 -0.00057 30 0.87932 -0.0005 31 0.87933 -0.00042 The root lies between 0.8793 and 0.8794 32 0.87934 -0.00034 33 0.87935 -0.00027

  • Over 160,000 pieces
    of student written work
  • Annotated by
    experienced teachers
  • Ideas and feedback to
    improve your own work