The Interpolated Rectilinear Scheme

for constants , and which satisfy the constraints

for consistency with the wave equation. If , we get the standard rectilinear scheme, and if , we get a rectilinear scheme operating on a grid of spacing , which is rotated by 45 degrees with respect to that of the standard scheme. This general form was put forth in [157], and the free parameter may be adjusted to give a less directionally-dependent numerical phase velocity; it may thus be used in conjunction with frequency-warping methods for reducing dispersion error. In general, the interpolated scheme cannot be decomposed into mutually exclusive subschemes.

It is possible to examine the stability of this method as in the previous case. We again have an amplification polynomial equation of the form of (A.5), with

and thus

Note that is

The global maximum of is non-positive (and thus condition (A.8) is satisfied) only if . The global minimum of , over this range of will then be

and the stability bound on will be

It is interesting to look at the interpolated scheme from a waveguide mesh point of view (see Chapter 4 for details). At each grid point we will have a nine-port parallel scattering junction; four connections are made to neighboring points to the north, south, east and west, through a unit-delay bidirectional delay line of admittance , four more connections are made to the points to the north-east, south-east, north-west and south-west using waveguides of admittance , and there will be a self-loop of admittance . If the junction voltage is written as , then the difference scheme corresponding to this waveguide mesh will be exactly (A.15), with

where the junction admittance (assumed positive) will be given by

The passivity condition will then be a condition on the positivity of , and . From the previous discussion, we already require , so this ensures that . Requiring is equivalent to requiring ; from the first of constraints (A.16), this is true only for . Requiring is equivalent to requiring finally, from the second of constraints (A.16), that

(for passivity) |

The difference between the constraints for stability from (A.17) and the passivity constraint above is striking; these bounds are graphed in Figure A.3.

Finally, we mention that the computational and add densities for this scheme will be, in general,

over the range of allowed by the stability constraint (A.17). For the scheme at the passivity bound (for , with ), we have

We recall that for or , at the stability limit, we again have the standard rectilinear scheme, for which a grid decomposition is possible; this was discussed in the previous section.