Numerical methods Flashcards

(29 cards)

1
Q

Method of Bisection

A

This method takes two points which straddle the root and then find the midpoint of these values. Then compare this with a and b to find the closer values which straddle the root. Repeat this to a suitable accuracy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

False Position

A

Uses two points which straddle the solution
Equation : C = (af(b) - bf(a)) / (f(b) - f(a))
This equation provides a better approximation to the solution
f(c) is compared to f(a) and f(b) in order to straddle the root more precisely

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Fixed Point Iteration

A

Rearrange f(x) = 0 to x = g(x)
This can then be repeated to approximate the root

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Fixed Point Iteration - Cobweb When?

A

g’(value) < 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Fixed Point Iteration - Cobweb Converge When?

A

-1 < g’(value) < 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Fixed Point Iteration - Cobweb Diverge When?

A

g’(value) < -1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Fixed Point Iteration - Staircase When?

A

g’(value) > 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Fixed Point Iteration - Staircase Converge When?

A

0 < g’(value) < 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Fixed Point Iteration - Staircase Diverge When?

A

g’(value) > 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Def - Order of Convergence

A

Describes the pattern of how quickly an iterative method approaches a solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Def - Rate of Convergence

A

Describes the actual speed of convergence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Order of Convergence - Bisection

A

1 (Linear)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Order of Convergence - False Position

A

1 (Linear)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Order of Convergence - Newton-Raphson

A

2 (Quadratic)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Order of Convergence - Secant

A

Approximately 1.618

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Order of Convergence - Fixed Point Iteration

17
Q

Rate of Convergence - Bisection

A

Relatively slow as halves each time

18
Q

Rate of Convergence - False Position

A

Similar to Bisection

19
Q

Rate of Convergence - Newton-Raphson

A

The error is roughly squared in each iteration so has faster convergence compared to linear methods

20
Q

Rate of Convergence - Secant

A

Slower than Newton-Raphson but faster than Linear methods

21
Q

Rate of Convergence - Fixed Point Iteration

A

Slow - error decreases by a constant factor each iteration

22
Q

First Order Convergence

A

The ratios of differences between successive approximations is equal to k (constant)

23
Q

Midpoint Rule Conversion and order method

A

Convergence of approximations is first order
Second order method - error is proportional to h^2 so ratio between successive errors is 1/4

24
Q

Trapezium Rule Conversion and order method

A

Convergence of approximations is first order
Second order method - error is proportional to h^2 so ratio between successive errors is 1/4

25
Simpsons Rule Conversion and order method
Convergence of approximations is first order Fourth order method - error is proportional to h^4 so ratio between successive errors is 1/16
26
Best Midpoint
(4M(2n) - M(n)) / 3
27
Best Trapezium
(4T(2n) - T(n)) / 3
28
Best Simpson's
(16S(2n) - S(n)) / 15
29
Lagrange's Polynomial
f(x) = f0(x - x1)(x - x2)/(x0 - x1)(x0 - x2) + f1(x-x0)(x-x2)/(x1-x0)(x1-x0)