The FDTD and DW recursions both compute time updates by forming fixed linear combinations of past state. As a result, each can be described in ``state-space form'' [452, Appendix G] by a constant matrix operator, the ``state transition matrix'', which multiplies the state vector at the current time to produce the state vector for the next time step. The FDTD operator propagates K variables while the DW operator propagates W variables. We may show equivalence by (1) defining a one-to-one transformation which will convert K variables to W variables or vice versa, and (2) showing that given any common initial state for both schemes, the state transition matrices compute the same next state in both cases.
The next section shows that the linear transformation from W to K variables,
From Fig.E.1, it is clear that the DW scheme preserves mapping Eq. (E.7) by definition. For the FDTD scheme, we expand the right-hand of Eq. (E.3) using Eq. (E.7) and verify that the left-hand side also satisfies the map, i.e., that holds:
Since the DW method propagates sampled (bandlimited) solutions to the ideal wave equation without error, it follows that the FDTD method does the same thing, despite the relatively crude approximations made in Eq. (E.2). In particular, it is known that the FDA introduces artificial damping when applied to first order partial derivatives arising in lumped, mass-spring systems .
The equivalence of the DW and FDTD state transitions extends readily to the DW mesh [520,450] which is essentially a lattice-work of DWs for simulating membranes and volumes. The equivalence is more important in higher dimensions because the FDTD formulation requires less computations per node than the DW approach in higher dimensions (see  for some quantitative comparisons).
Even in one dimension, the DW and finite-difference methods have unique advantages in particular situations , and as a result they are often combined together to form a hybrid traveling-wave/physical-variable simulation [354,355,223,124,123,225,265,33].