1) Introduction Flashcards

1
Q

Give the two definitons for a function to be continuous

A
  • Given a function f : D → R, where D ⊂ R, f is said to be continuous at a point c ∈ D if limx→c f (x) = f (c).
  • Given a function f : D → R, D ⊂ R, f is said to be continuous at a point c ∈ R if for any ϵ > 0 there exists δ > 0 such that |x −c| < δ ⇒ |f (x)− f (c)| < ϵ.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the Intermediate Value Theorem

A

If there is a function f that is continous on a closed set [a,b] and d is any number between f(a) and f(b), then there exists at least one number c in the interval [a,b] such that f(c) = d

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

When is a function differentiable

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

What is Taylor’s Theorem

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

What is the Mean Value Theorem

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

What is Rolle’s Theorem

A

Let f be continuous on [a,b] and differentiable on (a,b), and such that f (a) = f (b). Then there exists a number ξ ∈ (a,b) such that f’(ξ) = 0.

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

What are the two things to keep in mind when designing an algorithm

A
  1. Computational complexity: A measure of the time it takes for an algorithm to compute an approximation
  2. Computational Accuracy: A measure of the error between the approximation x- and the true solution x. It can be measured either through absolute error, or relative error
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are some sources of errors

A
  • Truncation Errors
  • Approximation Errors
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is Horner’s Algorithm

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

How many multiplications are required to evaluate a degree n polynomial naively and by Horner’s method

A
  • Naively: 1/2n(n+1) multiplcations
  • Horner’s Method: n multiplcations
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How do we describe big-O notation

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

What is absolute error and relative error

A

Absolute Error=∣x−x̄∣
Relative Error = ∣x−x̄∣ / ∣x∣
Where x̄ is an approximation of x

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

What is Machine Precision

A

Machine precision is an upper bound on the relative approximation error due to rounding in floating point arithmetic

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

What is Catastrophic Cancelation

A

When subtracting two closely valued approximations, each having low relative errors, results in an answer with a significantly high relative error

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