Numerical Solutions to the Wave Equation Flashcards

1
Q

What is used in complex wave solutions?

A

Numerical methods e.g. finite difference method

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

How is a finite difference method achieved?

A

Place a regular grid of points over the domain of interest

The solution to the wave equation will be obtained at the grid points

The continuous derivatives δ^2/ δt^2 and ∇^2 are replaced with the finite difference approximations

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

What is first-order accurate backward difference scheme?

A

by looking at f_j - f_ j -1 over Δx

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

What is first-order accurate central difference scheme?

A

f_j+1 - f_j -1 over Δx

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

What is first-order accurate forward difference scheme?

A

f_j+1 - f_j over Δx

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

How are finite difference schemes derived?

A

Via a Taylor series

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

What does the number of terms kept in the Taylor series define?

A

The accuracy of the scheme

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

What is Big-O notation?

A

O (Δx^n)
It is used to indicate truncation error

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

What is the error bound by?

A

const multiplied by Δx^n

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

What happens if Δx is reduced by a factor of 2?

A

The truncation error will reduce by a factor of 2^n

where n is equal to the order accurate e.g. if n = 1 it is first order

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

What is the finite difference scheme?

A

It incorporates an approximation to the space and time derivatives in the wave equation

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

How do we know when the finite difference scheme is accurate?

A

When it converges (doesn’t change any more) : we can gradually decrease Δx and Δt until the simulation result

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

Why does convergence work?

A

δ^2f(x)/ δx^2 = f(x - Δx) - 2f(x) + f(x + Δx) / Δx^2

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

What is the rule of thumb about the amount of grid points which ensure convergence?

A

10 - 20 grid points per wavelength (Δx = c_0 /PPW_max)

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

When does numerical dispersion occur?

A

When the finite difference approximation introduces a frequency-dependent sound speed (c(k)) (truncation error)

As the wave equation is built up from sum of plane waves with different frequencies, different components of wave will travel at different sound speeds, which changes the wave shape over time

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

What is one way of reducing numerical dispersion?

A

Use a higher order finite difference formulae

Reducing grid spacing (Δx) and time step (Δt)

17
Q

Why do numerical methods become unstable?

A

Due to the restriction on the size of the time step

18
Q

What is the CFL number?

A

CFL = c_0 Δt / Δx

19
Q

What is the stability condition for higher dimensions?

A

c_0 Δt / Δx <= 1/√D

D = number of dimensions (e.g 2 for 2D)

20
Q

What does the Lax’s equivalence theorem state?

A

That a numerical scheme will be convergent if it is also consistent and stable:

consistency (reduce to the continuous equations in the limit) + stability (doesn’t grow without bound) = convergence

21
Q

When are numerical methods used in medical physics?

A

Material properties are not uniform

Wave propagation is nonlinear

Acoustic absorption follows a frequency power law