Solution of Equations Flashcards

1
Q

What determines if two points have a root between them?

A

Plug in the values and log 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)

(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