_{1}

^{*}

A Krylov space based time domain method for wave propagation problems is introduced. The proposed method uses the Arnoldi algorithm to obtain broad-band frequency domain solutions. This method is especially advantageous in cases where slow convergence is observed when using traditional time domain methods. The efficiency of the method is examined in several test cases to show its fast convergence in such problems.

Wave equations can be generally solved using two categories of methods: time-domain and frequency-domain methods. Finite-difference time-domain (FDTD) methods have been widely adopted for solving different kinds of wave propagation problems. In these methods, the field is discretized into a series of uniform hexahedral volumes. The spatial derivatives are approximated with second-order central differences and the leapfrog method is used for temporal discretization [

The solution to linear wave equations can be approximated by linear combinations of sinusoidal waves at various frequencies, which leads to a frequency-domain formulation for different time-harmonic sources. The time-domain solution is of interest in this research for its capability of obtaining frequency domain solutions across a frequency range. Besides, in the time domain, the residual of the linear system is reduced several orders of magnitude, and requires much less search direction in a Krylov subspace [

The time domain methods, however, have been found to suffer from convergence problems for physical models that include locally resonant structures. Such structures may be the result of large material mismatches, or complex geometries. The convergence problems have also been a concern in structural optimizations such as the designs of metamaterials [

The purpose of this paper is to introduce a Krylov space based time domain approach for frequency domain solutions. The proposed algorithm is suitable for physical models where slow convergence is found with traditional time domain methods. Related research can be found in [

Wave propagations can be modeled by first order partial differential equations (PDEs) in general, which may be written as

∂ Q ∂ t + ∇ ⋅ F ( Q ) = 0 . (1)

In acoustics, the wave equations can be written in a non-conservative form, known as the linearized Euler equations

∂ p ∂ t + K e ∇ ⋅ u = 0 , (2)

∂ u ∂ t + 1 ρ e ∇ p = 0 , (3)

where p is the acoustic pressure, u is the velocity vector, K_{e} is the bulk modulus of compressibility of the material, and ρ_{e} is the density.

The wave propagation problems in this paper are modeled using a stabilized finite element formulation: Streamlined Upwind/Petrov Galerkin (SUPG) method [

Finite element methods typically start with formulating the equations using a weighted residual method, which can be cast in the form of

∫ Ω [ ϕ ] ( ∂ Q ∂ t + ∇ ⋅ F ) ∂ Ω = 0 , (4)

where ϕ is a weighting function. The temporal discretization of the governing equation is advanced by implementing a backward differentiation formula (BDF), and the fully discretized equation is solved with an implicit time marching approach (Newton’s method) so that the time-step size can be determined by accuracy considerations instead of stability limitations as in explicit methods.

While the time domain formulation can be used to obtain the frequency domain solution across a frequency range, the convergence of the frequency domain solution is not always as rapid as expected. Especially in physical problems where locally resonant structures exist, the solution procedure can easily take numerous time-marching steps before the errors are reduced to a tolerance.

To circumvent the problem of slow convergence in certain situations, the time domain method is reformulated with a Krylov space projection. Consider the fully discretized equations with BDF-1 scheme, the residual at time step j (t = jΔt) can be written as

R j = ∫ Ω [ ϕ ] ( Q j − Q j − 1 Δ t + ∇ ⋅ F ( Q j ) ) ∂ Ω . (5)

Since the equations are linear, the residual can be expressed as

R j = [ A ˜ ] Q j + [ B ˜ ] Q j − 1 , (6)

where

[ A ˜ ] = ∂ R j ∂ Q j (7)

and

[ B ˜ ] = ∂ R j ∂ Q j − 1 (8)

are the linearization matrices. Substitute this into the Newton’s step,

Q j = − [ A ˜ ] [ B ˜ ] Q j − 1 . (9)

Denote

[ M ] = − [ A ˜ ] [ B ˜ ] (10)

and use deduction, given an initial condition Q^{0}, for any given time j, the time dependent solution can be described as

Q j = [ M ] Q j − 1 , (11)

which indicates that the time domain solution forms a Krylov basis with the iterative matrix [M], such that

K n t = [ Q 0 [ M ] 1 Q 0 [ M ] 2 Q 0 ⋯ [ M ] n t − 1 Q 0 ] , (12)

where nt is the number of time steps. It also indicates that, the damping of the numerical error is strongly related to the eigenvalues of the matrix [M]; the closer the eigenvalues are to 1.0, the slower the convergence would be.

Since the frequency domain solutions are of interest, the Fourier transform can be applied to the time domain solutions. At each frequency point f_{k}, the discrete Fourier transform may be expressed as

Q ^ k = ∑ j = 1 n t Q j e − ι α k t Δ t , (13)

where ι^{2} = −1 and

α k = 2 π f k . (14)

Denote

ψ k j = e − ι α k t , (15)

and substitute Equation (11) into Equation (13), the frequency domain solutions may now be written as

Q ^ k = ∑ j = 1 n t [ M ] j − 1 Q 0 ψ k j − 1 Δ t . (16)

The initial condition Q^{0} can be projected into the eigen-space of matrix [M]. That is, it can be expressed as

Q 0 = ∑ i = 1 n n a i v i . (17)

where nn is the number of nodes (degree of freedom), v_{i} is the i^{th} eigenvector of [M], and a_{i} is the corresponding coefficient. Therefore the solution at time step j can be re-written as

Q j = ∑ i = 1 n n a i v i λ i j − 1 , (18)

then the frequency domain solution becomes

Q ^ k = ∑ j = 1 n t ∑ i = 1 n n a i v i λ i j − 1 ψ k j − 1 . (19)

Switch the sum operators,

Q ^ k = ∑ i = 1 n n a i v i ∑ j = 1 n t λ i j − 1 ψ k j − 1 , (20)

and this can be expressed as

Q ^ k = ∑ i = 1 n n a i v i w i , (21)

with

w i = ∑ j = 1 n t λ i j − 1 ψ k j − 1 = 1 − λ i n t ψ k n t 1 − λ i ψ k . (22)

The set of the eigenvalues and eigenvectors can be approximated by the Arnoldi algorithm [

Algorithm. A Krylov space-based time domain method for broadband frequency domain solutions

1) Use Q^{0} as the initial condition for time-domain method to get matrices [A] and [B] as in Equations (7-8).

2) Set i = 1, and set

q 1 = Q 0 ‖ Q 0 ‖ . (23)

and start the Arnoldi iteration. Store the q_{i} vectors in the [Q] matrix, and h_{j}_{,i} items in the [H] matrix.

3) Calculate

u i = M q i . (24)

4) Set j = 1.

5) Calculate

h j , i = q j H u i . (25)

u i = u i − h j , i q j (26)

6) If j = i, stop the inner loop; otherwise set j = j + 1 and go to step 5.

7) Calculate

h i + 1 , i = ‖ u i ‖ . (27)

8) If h_{i}_{+1,i} = 0, stop the Arnoldi iteration.

9) Calculate

q i + 1 = u i h i + 1 , i . (28)

10) If i = niter (the prescribed number of Arnoldi iteration), stop the Arnoldi iteration; otherwise set i = i + 1 and go to step 3.

11) Calculate the eigenvalues [Λ] and eigenvectors [V_{H}] of the Hessenberg matrix [H] obtained by the Arnoldi iteration, and the eigenvectors [V] of the [M] matrix is given by

[ V ] = [ Q ] − 1 [ V H ] (29)

12) Calculate the coefficients a_{i} by Equation (17).

13) Calculate the weight coefficients w_{i} by Equation (22).

14) Calculate the frequency domain solutions by Equation (21).

Since in some cases the time domain solution procedure starts by introducing an excitation such as a Gaussian pulse, an intermediate state Q^{0} after the excitation is completed, will be needed in order to proceed with the algorithm. In this case, one needs to calculate the frequency domain solutions before the intermediate state by Equation (13) and add it to the primitive frequency domain solution.

For physical problems which require a lot of iterations before the frequency domain solutions reach convergence, this algorithm is recommended. In fact, the eigenvalues in these problems are found to be close to 1.0, which can be effectively approximated by the Arnoldi algorithm since these eigenvalues are typically extremes in the eigensystems. The advantage of using this algorithm is that, the number of time steps nt can be chosen to be an arbitrary number, so that the number of iterations is reduced from nt to niter as is needed for the Arnoldi iteration.

An acoustic wave propagation case with artificial material properties is designed to examine the efficiency of the proposed algorithm. The geometry is shown in

Cases and material properties | ρ e 2 | K e 2 |
---|---|---|

Case 1 | 4000 ρ e 1 | 400000 K e 1 |

Case 2 | 400 ρ e 1 | 40000 K e 1 |

Case 3 | 40 ρ e 1 | 4000 K e 1 |

a. K_{e} is the bulk modulus of compressibility of the material, and ρ_{e} is the density. b. The superscripts represent the acoustic materials 1 (background) and 2 (inclusion).

The simulation is configured as initiating a Gaussian pulse in the left end, and sensors are used to collect information for use in the frequency domain solutions. In addition, periodic boundary conditions are applied to the upper and lower parts of the domain, and absorbing boundary conditions [

The frequency domain solutions for a sensor located in the center of the computational domain are used as the reference. Since the convergence of the solutions is of primary concern, only the frequency domain solutions after the completion of the Gaussian pulse are considered. It is shown in ^{−10} are 441,769 and 26,280, respectively. In comparison, in both cases the solutions converge to the level of 10^{−10} within 100 Arnoldi iterations with the proposed time domain-based broadband frequency domain algorithm, as shown in

It is seen from

promptly with time marching method, and the resonant frequency is not obvious, due to the fact that most of the vibrations are damped after the excitation is completed. In addition, the Arnoldi iteration is also able to reduce the error level for this case.

A Krylov space-based time domain method is introduced for broadband frequency domain solutions. This method is useful for dealing with physical models for which slow convergences are observed with traditional time marching methods. The efficiency of the method is examined in several test cases to show its fast convergence in such problems. An acoustic wave propagation problem is modeled with a stabilized finite element method. In the test cases, the proposed method uses less than 100 iterations before an error level is reached. This decrease is orders of magnitude less than the time-marching approach.

The author is currently an employee of Mentor, a Siemens Business. A portion of the work was performed while the author was working at the SimCenter of the University of Tennessee at Chattanooga. Supports from both sides were greatly appreciated.

Lin, W.Y. (2017) A Krylov Space-Based Finite Element Time Domain Method for Broadband Frequency Domain Solutions. Open Journal of Acous- tics, 7, 95-104. https://doi.org/10.4236/oja.2017.74009