Search arXivSearch

arXiv · 1604.04685

Uniform error bounds of a finite difference method for the Zakharov system in the subsonic limit regime via an asymptotic consistent formulation

Abstract

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<\varepsilon\le 1$, which is inversely proportional to the speed of sound. In the subsonic limit regime, i.e., $0<\varepsilon\ll 1$, the solution propagates highly oscillatory waves and/or rapid outgoing initial layers due to the perturbation of the wave operator in ZS and/or the incompatibility of the initial data which is characterized by two nonnegative parameters $α$ and $β$. Specifically, the solution propagates waves with $O(\varepsilon)$- and $O(1)$-wavelength in time and space, respectively, and amplitude at $O(\varepsilon^{\min\{2,α,1+β\}})$ and $O(\varepsilon^α)$ for well-prepared ($α\ge1$) and ill-prepared ($0\le α<1$) initial data, respectively. 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 ZS into an asymptotic consistent formulation and adopting an integral approximation of the oscillatory term. By adapting the energy method and using the limiting equation via a nonlinear Schrödinger equation with an oscillatory potential, we rigorously establish two independent error bounds and obtain error bounds at $O(h^2+τ^{4/3})$ and $O(h^2+τ^{1+\fracα{2+α}})$ for well-prepared and ill-prepared initial data, respectively, which are uniform in both space and time for $0<\varepsilon\le 1$ and optimal at the second order in space. Numerical results are reported to demonstrate that our error bounds are sharp.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Weizhu Bao, Chunmei Su. 2016-04-16. Uniform error bounds of a finite difference method for the Zakharov system in the subsonic limit regime via an asymptotic consistent formulation. https://doi.org/10.1137/16m1178112

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA