ME 2016 Exam 2

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/74

encourage image

There's no tags or description

Looks like no tags are added yet.

75 Terms

1
New cards

Polynomial Interpolation

determining the nth order polynomial that fits n+1 data points

2
New cards

general form of nth order polynomial

fn(x) = a0 + a1x +a2x²

3
New cards

How many nth order polynomials fit n+1 data points

one but there are a number of mathematical formats in which the polynomial can be expressed

4
New cards

Newton Divided Difference

fn(x) = b0 + b1(x-xo) + b2(x-xo)(x-x1) ….

5
New cards

Newton Divided Difference zeroth coefficient

b0 = f(x0)

6
New cards

Newton Divided Difference 1st coefficient

b1 = f(x1) - f(x0) / (x1-x0)

7
New cards

Newton Divided Difference 2nd coefficient

b2 = ( (f(x2) - f(x1) /(x2-x1)) - b1) / (x2-x0)

8
New cards

When to use Newton interpolating polynomial

when the order of the polynomial is unknown

9
New cards

Use to use Lagrange interpolating polynomial

the order of the polynomial is known

10
New cards

spline interpolation

determining n low order piecewise polynomials through n+1 data points

11
New cards

Why use splines over polynomial interpolation

polynomial interpolation can lead to wild oscillations for high order polynomials or when function of interest has local, abrupt changes

12
New cards

how many knots in spline interpolation

n+1

13
New cards

how many intervals in spline interpolation

n

14
New cards

linear spline formula without solved coefficients

Si(x) = ai + bi(x-xi)

15
New cards

quadratic spline formula without solved coefficients

Si(x) = ai + bi(x-xi) + ci(x-xi)²

16
New cards

linear spline coefficients

ai = fi , bi = (fi+1 - fi)/ (xi+1 - xi)

17
New cards

Disadvantages of linear spline

non-smooth, discontinuous, 1st derivative

18
New cards

Quadratic and Cubic splines impose

higher order smoothness conditions, in addition to the continuity conditions of linear

19
New cards

How many conditions for linear splines

2n

20
New cards

How many conditions for quadratic splines

3n

21
New cards

How many conditions for cubic splines

4n

22
New cards

Spline conditions on function values consist of

function values of adjacent polynomials must be equal at interior knots and first and last polynomials must pass through exterior knots (2n conditions)

23
New cards

function values of adjacent polynomials must be equal at interior knots number of conditions

2(n-1)

24
New cards

first and last polynomials must pass through exterior knots number of conditions

2 conditions

25
New cards

function values of adjacent polynomials must be equal at interior knots condition formulas

Si-1(xi) = f(xi) and Si(xi) = f(xi)

26
New cards

first and last polynomials must pass through exterior knots formulas

So(xo) = f(xo) and Sn-1(xn) = f(xn)

27
New cards

Spline conditions at first derivative at interior knots number of conditions

n-1

28
New cards

Spline conditions at first derivative at interior knots formula

S’i-1(xi) = S’i(x)

29
New cards

Spline conditions at second derivative at interior knots number of conditions

n-1

30
New cards

Spline conditions at second derivative at interior knots formula

S’’i-1(xi) = S’’i(xi)

31
New cards

After first derivative conditions how many more conditions needed for quadratic spline

1

32
New cards

After second derivative conditions how many more conditions needed for cubic spline

2

33
New cards

Natural end conditions

S0’’(xo) = S’’n-1(xn) = 0

34
New cards

Clamped end conditions

S’o(xo) = f’(xo) , S’n-1(xn) = f’(xn)

35
New cards

not-a-knot end conditions

S’’’o(x1) = S’’’1(x1) , S’’’n-2 (xn-1) = S’’’n-1(xn-1)

36
New cards

Newton-Cotes integration formulas

replace a complicated function or tabulate values with an approximating function that is easy to integrate

37
New cards

Newton-Cotes Trapezoid Rule integration formula

(b-a) * f(a)+f(b)/2

38
New cards

Trapezoid Rule error indicates

it is exact for linear function

39
New cards

Multi-application trapezoid rule

divide integration interval into number of segments, apply trapezoid rule to each segment, and then sum them

40
New cards

Multi-application trapezoid rule formula

knowt flashcard image
41
New cards

Multi-application trapezoid rule error

as number of segments doubles error reduced by 1/4

<p>as number of segments doubles error reduced by 1/4</p>
42
New cards

For multi application trapezoid error at some point as the number of segments increase

roundoff error may intrude

43
New cards

Using trapezoid rule is good for

individual applications of nicely behaved functions

44
New cards

For high accuracy multi-application trapezoid rule

can be expensive

45
New cards

Simpsons 1/3 rule requires

an additional point midway between a and b

46
New cards

Simpsons 1/3 rule uses what type of polynomial

2nd-order

47
New cards

Simpsons 1/3 formula

(b-a) * (f(x0) + 4f(x1) + f(x2))/6

<p>(b-a) * (f(x0) + 4f(x1) + f(x2))/6</p>
48
New cards

Simpsons 1/3 error indicates it is

exact for any cubic polynomial

49
New cards

Multi-application Simpsons 1/3 requires

an even number of segments

50
New cards

Multi-application Simpsons 1/3 formula

knowt flashcard image
51
New cards

Multi-application Simpsons 1/3 error

as number of segments is doubled error reduced by 1/16

<p>as number of segments is doubled error reduced by 1/16</p>
52
New cards

Romberg Integration

combine multiple low order estimates to achieve a higher order estimate of the integral

53
New cards

Adaptive Quadrature

Able to generate more efficient estimate with adaptive stepsize

54
New cards

Gauss Quadrature

An improved estimate can come from strategically choosing evaluation point away from end points

55
New cards

n point Gauss-Legendre formula takes the form

I = c0*f(xo) + c1*f(x1) + …+ cn-1*f(n-1)

<p>I = c0*f(xo) + c1*f(x1) + …+ cn-1*f(n-1)</p>
56
New cards

differential equation

an equation composed of an unknown function and its derivative

57
New cards

An ODE is a differential equation with

one independent variable

58
New cards

In an IVP all

auxiliary conditions are specified at the same value as the independent variable

59
New cards

Eulers method

approximate slope in the interval as the slope of xi

60
New cards

Eulers formula

yi+1 = yi + f(xi,yi)h

<p>yi+1 = yi + f(xi,yi)h</p>
61
New cards

Order of Euler’s method global truncation error

O(h), as we halve stepsize error reduces by half

62
New cards

Heun’s method

approximate slope as average over interval

63
New cards

Heun’s method formula

yi+1 = yi + (f(xi,yi) + f(xi+1, y0i+1) )/2 * h

<p>yi+1 = yi + (f(xi,yi) + f(xi+1, y0i+1) )/2 * h</p>
64
New cards

Eulers method reminiscent of

forward finite difference

65
New cards

Heuns method reminiscent of

center finite difference

66
New cards

Heun’s method error is of order

O(h²), as we halve stepsize we quater error

67
New cards

Midpoint method

uses an approximate slope at midpoint of interval

68
New cards

Midpoint method formula

yi+1 = yi + f(xi+1/2, y0 i+1/2) *h

<p>yi+1 = yi + f(xi+1/2, y0 i+1/2) *h</p>
69
New cards

Midpoint method reminiscent of

centered finite difference

70
New cards

Midpoint method order of error

O(h²), as we halve the stepsize we quarter the error

71
New cards

Runge-Kutta method uses an

increment function to represent slope over interval

72
New cards

Increment function form

a1k1 + a2k2 … ankn

73
New cards

When using Runge-Kutta method for low order methods

n dictates the order of the method

74
New cards

3rd order RK error

O(hÂł), when stepsize half error reduces by 1/9

75
New cards

4th order RK error

O(h^4), when stepsize half error reduces by 1/16