A new class of implicit high-order non-oscillatory time integration schemes is introduced in a method-of-lines framework. These schemes can be used in conjunction with an appropriate spatial discretization scheme for the numerical solution of time dependent conservation equations. The main concept behind these schemes is that the order of accuracy in time is dropped locally in regions where the time evolution of the solution is not smooth. By doing this, an attempt is made at locally satisfying monotonicity conditions, while maintaining a high order of accuracy in most of the solution domain. When a linear high order time integration scheme is used along with a high order spatial discretization, enforcement of monotonicity imposes severe time-step restrictions. We propose to apply limiters to these time-integration schemes, thus making them non-linear. When these new schemes are used with high order spatial discretizations, solutions remain non-oscillatory for much larger time-steps as compared to linear time integration schemes. Numerical results obtained on scalar conservation equations and systems of conservation equations are highly promising.

In E & Liu (SIAM J Numer. Anal., 1995), we studied convergence and the structure of the error for several projection methods when the spatial variable was kept continuous (we call this the semi-discrete case). In this paper, we address similar questions for the fully discrete case when the spatial variables are discretized using a staggered grid. We prove that the numerical solution in velocity has full accuracy up to the boundary, despite the fact that there are numerical boundary layers present in the semi-discrete solutions.

In this paper, we propose an unfitted Nitsche's method for computing wave modes in topological materials. The proposed method is based on Nitsche's technique to study the performance-enhanced topological materials which have strongly heterogeneous structures (e.g., the refractive index is piecewise constant with high contrasts). For periodic bulk materials, we use Floquet-Bloch theory and solve an eigenvalue problem on a torus with unfitted meshes. For the materials with a line defect, a sufficiently large domain with zero boundary conditions is used to compute the localized eigenfunctions corresponding to the edge modes. The interfaces are handled by Nitsche's method on an unfitted uniform mesh. We prove the proposed methods converge optimally, and present numerical examples to validate the theoretical results and demonstrate the capability of simulating topological materials.

We present a uniformly accurate finite difference method and establish rigorously its uniform error bounds for the Zakharov system (ZS) with a dimensionless parameter 0 < ε ≤ 1, which is inversely proportional to the speed of sound. In the subsonic limit regime, i.e., 0 < ε << 1, the solution propagates highly oscillatory waves and/or rapid outgoing initial layers due to the perturbation of the wave operator in the ZS and/or the incompatibility of the initial data, which is characterized by two parameters α ≥ 0 and β ≥ −1. Specifically, the solution propagates waves with wavelength of O(ε) and O(1) in time and space, respectively, and amplitude at O(ε^{min{2,α,1+β}}). This high oscillation of the solution in time brings significant difficulties in designing numerical methods and establishing their error bounds, especially in the subsonic limit regime. A uniformly accurate finite difference method is proposed by reformulating the ZS into an asymptotic consistent formulation and adopting an integral approximation of the oscillatory term. By applying the energy method and using the limiting equation via a nonlinear Schr ̈odinger equation with an oscillatory potential, we rigorously establish two independent error bounds at O(h^2 + τ^2/ε) and O(h^2 + τ^2 + τε^{α^∗} + ε^{1+α^∗}), respectively, with h the mesh size, τ the time step and α^∗ = min{1, α, 1 + β}. Thus we obtain error bounds at O(h^2 + τ^{4/3}) and O(h^2 + τ^{1+α^∗/(2+α^∗)}) for well-prepared (α^∗ = 1) and ill-prepared (0 ≤ α^∗ < 1) initial data, respectively, which are uniform in both space and time for 0 < ε ≤ 1 and optimal at the second order in space. Other techniques in the analysis include the cut-off technique for treating the nonlinearity and inverse estimates to bound the numerical solution. Numerical results are reported to demonstrate our error bounds.

The problem is concerned about computing virtual coordinates for greedy routing in a wireless ad hoc network. Consider a set of wireless nodes S densely deployed inside a geometric domain R2. Nodes within communication range can directly communicate with each other. We ask whether one can compute a set of virtual coordinates for S such that greedy routing has guaranteed delivery. In particular, each node forwards the message to the neighbor whose distance to the destination, computed under the virtual coordinates and some metric function d, is the smallest. If such a neighbor can always be found, greedy routing successfully delivers the message to the destination. The problem can be phrased as finding a greedy embedding of S in some geometric space, such that greedy routing always succeeds. In the setting of this entry, we assume that the nodes are a dense sample of the domain such that