4.1. Time-integration for the second order systems#
Applying a method of lines approach described in Section 2.2 to the acoustic, elastic and electromagnetic time-domain wave problems (with possibly added damping or some variant of not entirely reflecting boundary) leads to a semi-discrete problem of the form (denoting the time derivative by a dot)
where \(\mathbf u\in C^2([0,T];\mathbb R^N)\) and \(N\in\mathbb N\) is the dimension of the discrete space. The matrices \(\mathbf M,\mathbf C,\mathbf K\in\mathbb R^{N\times N}\) are the discrete mass-, damping- and stiffness matrix and \(\mathbf f\in C([0,T];\mathbb R^N)\)
Energy conservation#
The semi-discrete system (4.1) conserves the discrete energy:
(Discrete energy conservation)
Let \(\mathbf u\) solve (4.1) with symmetric matrices \(\mathbf M, \mathbf C, \mathbf K\). Then
In particular, if there are no external sources (\(\mathbf f =0\)) and damping (\(\mathbf C = 0\)), the discrete energy \(\mathbf E\) is conserved over time.
Proof. Multiplying (4.1) by \(\dot{\mathbf u}^\top\) from the left yields
Since for any symmetric matrix \(\mathbf A\) and vector function \(\mathbf g\in C^1([0,T];\mathbb R^N)\)
the claim follows.
Usually the matrices \(\mathbf M,\mathbf C,\mathbf K\) are assume to be positive (semi-)definite. Then it follows that the energy \(\mathbf E\) is always non-negative.
For the time integration of wave problems one usually tries to preserve energy.
The Newmark \(\beta-\)method#
For the given time interval \([0,T]\) for \(T>0\) we want to approximate the solution \(\mathbf u\) to (4.1) at \(M+1\) discrete timesteps \(t_j=j\tau\) for \(j=0,\ldots,M\), \(\tau = T/M\). We write \(\mathbf u_j\) for the approximation of \(\mathbf u(t_j)\) (and use similar notation for the derivatives).
Assuming sufficient regularity we have by the mean value theorem that for a fixed \(j\) there exist \(\xi_1,\xi_2\in[t_j,t_{j+1}]\) such that
Approximating \(\ddot{\mathbf u}(\xi_1),\ddot{\mathbf u}(\xi_2)\) by convex combinations of the approximated values \(\dot{\mathbf u}_j,\dot{\mathbf u}_{j+1}\), i.e., for fixed \(\gamma,2\beta\in [0,1]\)
leads to the discrete approximations
Additionally approximating \({\mathbf u}(t_{j+1})\approx{\mathbf u}_{j+1}\), \(\dot{\mathbf u}(t_{j+1})\approx\dot{\mathbf u}_{j+1}\), \(\ddot{\mathbf u}(t_{j+1})\approx\ddot{\mathbf u}_{j+1}\) in (4.1) yields the third equation
to close the linear system for the unknowns \(\mathbf u_{j+1},\dot{\mathbf u}_{j+1},\ddot{\mathbf u}_{j+1}\) for given values for \(\mathbf u_{j},\dot{\mathbf u}_{j},\ddot{\mathbf u}_{j}\). Note that the initial data is given by
The Newmark \(\beta\)-method is well-defined by the discrete approximations (4.2), the underlying system of ODE’s for each time step (4.3) and the initial conditions (4.4). In this general form a \(3N\times 3N\) system would have to be solved in each time-step. In practice this is never done explicitely since there exist various ways to equivalently rewrite it. In fact, the following Theorem gives one general way to compute the single steps.
Let \(\mathbf M\) be positive definite and \(\mathbf C,\mathbf K\) be positive semi-definite. Then the Newmark method is well defined for all \(\tau>0\), \(\alpha,2\beta\in[0,1]\) and initial data \(\mathbf u^0,\mathbf v^0\in\mathbb R^N\). Each step requires one application of the inverse of the matrix \(\mathbf S:=\mathbf M+\tau\gamma\mathbf C+\tau^2\beta\mathbf K\) and vector operations (additions, multiplications by scalars).
Proof. Inserting (4.2) into (4.3) yields and collecting all terms containing \(\ddot{\mathbf u}_{n+1}\) on the left hand side yields
Now the method can be written in matrix form
with
The system above can be solved by backwards elimination where merely in the process of computing \(\ddot{\mathbf u}_{j+1}\) the inverse of the matrix \(\mathbf S:=\mathbf M+\tau\gamma\mathbf C+\tau^2\beta\mathbf K\) has to be applied, all other operations are vector operations. Clearly the matrix \(\mathbf S\) is positive definite for all parameters \(\tau,\gamma,\beta\) and thus regular.
Stability of the Newmark method#
Let \(\mathbf u_j, \dot{\mathbf u}_j, \ddot{\mathbf u}_j\) for \(j=0,\ldots, M\) be the discrete Newmark approximations for given \(\tau,\beta,\gamma\) and \(\mathbf C = 0,\mathbf f=0\). Then
with
Proof. We start with the change of the energy \(\mathbf E(\mathbf u_j)\) for a given \(j\in\mathbb N\). Due to symmetry of \(\mathbf M\) and \(\mathbf K\) we have
For the increments of \(\dot{\mathbf u}_j\), \(\mathbf u_j\) we obtain
Eliminating the increments of \(\dot{\mathbf u}_j\), \(\mathbf u_j\) in (4.5) we obtain
since the first part vanishes due to (4.3). Using again (4.3) and the same reasoning as in the beginning we have
which gives
Since again
we obtain
which concludes the proof.
The quantity \(E^{\tau,\beta,\gamma}_j\) is always positive for non-zero \(\mathbf u_j,\dot{\mathbf u}_j\) if the matrix \(\mathbf K_{\tau,\beta,\gamma}\) is positive semi-definite. In this case we call \(E^{\tau,\beta,\gamma}_j\) the discrete energy at timestep \(j\). The matrix \(\mathbf K_{\tau,\beta,\gamma}\) is certainly positive semi-definite if \(\beta\geq \gamma/2\), for any \(\tau>0\).
Theorem 4.3 shows that the discrete energy is preserved if \(\gamma=1/2\). Moreover, the discrete energy \(E^{\tau,\beta,\gamma}_j\) coincides with the Energy \(\mathbf E(\mathbf u_j)\) iff \(\beta=\gamma/2\).
We discuss some specific choices of \(\gamma,\beta\) in more detail:
The midpoint rule time stepping \(\beta = 1/4, \gamma = 1/2\)#
Choosing \(\beta = 1/4, \gamma = 1/2\) Theorem 4.3 yields \(E_j^{\tau,\beta,\gamma} = \mathbf E(\mathbf u_j)\) and \(E^{\tau,\beta,\gamma}_{j+1}-E^{\tau,\beta,\gamma}_j=0\), i.e., the discrete energy is exact and conserved.
Straighforward computations show that the obtained method is equivalent to the method from Section 2.3 and given by the algorithm
with \(\mathbf S = \mathbf M+\frac{\tau}{2}\mathbf C+\frac{\tau^2}{4}\mathbf K\).
The explicit (Verlet) method \(\beta = 0\), \(\gamma\geq 1/2\)#
for \(\mathbf C=0\) the matrix \(\mathbf S\) which has to be inverted reduces to \(\mathbf M\). Thus the method is called explicit.
The explicit scheme for \(\gamma = 1/2\) and \(\mathbf C,\mathbf f = 0\) is given by
which can be rewritten by
Energy conservation#
Moreover, let \(\phi_n,\lambda_n\) be the normalized eigenpairs of
Then we have
Expanding \(\mathbf u_j\) with respect to the basis \(\phi_n\) leads to
and due to the orthogonality of the eigenvectors we have
Thus
for all \(\mathbf u_j\) if
where \(\lambda_{\mathrm {max}}\) is the maximal eigenvalue of (4.8). The condition (4.9) is called CFL condition and yields conditional stability of the explicit scheme, depending on the chosen time-step \(\tau\).