Solution of Equations Flashcards

1
Q

What determines if two points have a root between them?

A

Plug in the values and look for a sign change as it means the graph crosses the x axis and therefore has a root

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

What assumptions does the substitution method for determining roots make?

A

Relies on the graph being continuous and it not being a repeated root

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

How many roots are there between two points above or below the x axis?

A

Even number of roots

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

What are straddle points?

A

Straddle points are two points between which lies a root

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

How should a table be laid out for iterative interval bisection?

A

Iteration
Lower Bound
Sign
Upper Bound
Sign
Median
Sign

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

When does an iterative interval bisection table stop?

A

When a value for the root can be estimated to the given decimal places

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

What is a recurrence relation?

A

Recurrence relation is a type of iteration when the next term is generated by using the previous term

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

What is the difference between a convergent and divergent sequence?

A

Convergent sequences tend towards a limit
Divergent sequences do not

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

What is a fixed point?

A

A root of a function is a fixed point since it always gives a fixed value

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

How can recurrence relations be used to estimate a root?

A

When x = g(x) and x0 is chosen to create a convergent recurrence relation, the iteration approaches the root of the function

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

What determines whether a function is convergent?

A

-1 < g’(x0) < 1

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

What determines whether a function is divergent?

A

g’(x0) < -1

1 < g’(x0)

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

What determines whether a function is cobweb?

A

g’(x0) < 0

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

What determines whether a function is staircase?

A

0 < g’(x0)

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

What other name are cobweb functions known by? Why?

A

Cobweb functions are known as oscillating functions as they jump past the root and then behind it

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

What must be the case for a recurrence relation to estimate the root?

A

Gradient of function between -1 and 1
x0 is close to the root

17
Q

What is relaxation?

A

Relaxation is used on fixed point iteration to accelerate convergence or convert divergent sequences to convergent sequences

18
Q

What is the formula for relaxation?

A

x is a root of g(x)
y is given

(1-y)x + y g(x)

19
Q

Why is x = g(x) used?

A

x = g(x) is used to allow comparison to y = x

20
Q

What is the iterative formula for Newton Raphson’s Process?

A

xn+1 = xn - f(xn) / f ‘ (xn)

21
Q

Why may Newton Raphson’s Process fail?

A

Initial value not close to root
Roots are close to stationary point
Graph is not defined for all real numbers
Graph is discontinuous

22
Q

What method is used if the Newton Raphson’s Process fails?

A

Secant Method

23
Q

What is the formula for the method of false position?

A

c = af(b) - bf(a) / f(b) - f(a)

Where a is the value with a lower ‘x’
b is the value with a higher ‘x’

24
Q

How does the Secant and Newton-Raphson method differ?

A

Secant method uses lines that intersect last 2 points and x intercept
Newton-Raphson uses tangent to curve and x intercept

25
Q

How does Secant and False Position Method differ?

A

False position requires sign change
False position always converges
Secant is faster
Secant requires two previous values

26
Q

How does interval bisection work?

A

Find median of two straddle points and narrow down straddle points by replacing one with the median depending on function value’s sign

27
Q

How does fixed point iteration work?

A

Starting point is x value
Plugged into function to produce y value
y=x means y value becomes x value
X value is plugged into the function
This narrows down the straddle points

28
Q

How does Newton-Raphson Method work?

A

Tangent to function is drawn for given x value
The x intercept becomes the new x value

29
Q

How does Secant Method work?

A

Line is drawn between the current and past point
X intercept value becomes x value for next point on the function