Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOne-stage explicit trigonometric integrators for effectively solving quasilinear wave equations
51
0
0.0
(
0
)
Added by
Bin Wang
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, one-stage explicit trigonometric integrators for solving quasilinear wave equations are formulated and studied. For solving wave equations, we first introduce trigonometric integrators as the semidiscretization in time and then consider a spectral Galerkin method for the discretization in space. We show that one-stage explicit trigonometric integrators in time have second-order convergence and the result is also true for the fullydiscrete scheme without requiring any CFL-type coupling of the discretization parameters. The results are proved by using energy techniques, which are widely applied in the numerical analysis of methods for partial differential equations.
rate research
Read More
We present a new numerical method for solving time dependent Maxwell equations, which is also suitable for general linear hyperbolic equations. It is based on an unstructured partitioning of the spacetime domain into tent-shaped regions that respect causality. Provided that an approximate solution is available at the tent bottom, the equation can be locally evolved up to the top of the tent. By mapping tents to a domain which is a tensor product of a spatial domain with a time interval, it is possible to construct a fully explicit scheme that advances the solution through unstructured meshes. This work highlights a difficulty that arises when standard explicit Runge Kutta schemes are used in this context and proposes an alternative structure-aware Taylor time-stepping technique. Thus explicit methods are constructed that allow variable time steps and local refinements without compromising high order accuracy in space and time. These Mapped Tent Pitching (MTP) schemes lead to highly parallel algorithms, which utilize modern computer architectures extremely well.
We provide a preliminary comparison of the dispersion properties, specifically the time-amplification factor, the scaled group velocity and the error in the phase speed of four spatiotemporal discretization schemes utilized for solving the one-dimensional (1D) linear advection diffusion reaction (ADR) equation: (a) An explicit (RK2) temporal integration combined with the Optimal Upwind Compact Scheme (or OUCS3) and the central difference scheme (CD2) for second order spatial discretization, (b) a fully implicit mid-point rule for time integration coupled with the OUCS3 and the Leles compact scheme for first and second order spatial discretization, respectively, (c) An implicit (mid-point rule)-explicit (RK2) or IMEX time integration blended with OUCS3 and Leles compact scheme (where the IMEX time integration follows the same ideology as introduced by Ascher et al.), and (d) the IMEX (mid-point/RK2) time integration melded with the New Combined Compact Difference scheme (or NCCD scheme). Analysis reveal the superior resolution features of the IMEX-NCCD scheme including an enhanced region of neutral stability (a region where the amplification factor is close to one), a diminished region of spurious propagation characteristics (or a region of negative group velocity) and a smaller region of nonzero phase speed error. The dispersion error of these numerical schemes through the role of q-waves is further investigated using the novel error propagation equation for the 1D linear ADR equation. Again, the in silico experiments divulge excellent Dispersion Relation Preservation (DRP) properties of the IMEX-NCCD scheme including minimal dissipation via implicit filtering and negligible unphysical oscillations (or Gibbs phenomena) on coarser grids.
This paper continues to study the explicit two-stage fourth-order accurate time discretiza- tions [5, 7]. By introducing variable weights, we propose a class of more general explicit one-step two-stage time discretizations, which are different from the existing methods, such as the Euler methods, Runge-Kutta methods, and multistage multiderivative methods etc. We study the absolute stability, the stability interval, and the intersection between the imaginary axis and the absolute stability region. Our results show that our two-stage time discretizations can be fourth-order accurate conditionally, the absolute stability region of the proposed methods with some special choices of the variable weights can be larger than that of the classical explicit fourth- or fifth-order Runge-Kutta method, and the interval of absolute stability can be almost twice as much as the latter. Several numerical experiments are carried out to demonstrate the performance and accuracy as well as the stability of our proposed methods
In this work, we design and investigate contrast-independent partially explicit time discretizations for wave equations in heterogeneous high-contrast media. We consider multiscale problems, where the spatial heterogeneities are at subgrid level and are not resolved. In our previous work, we have introduced contrast-independent partially explicit time discretizations and applied to parabolic equations. The main idea of contrast-independent partially explicit time discretization is to split the spatial space into two components: contrast dependent (fast) and contrast independent (slow) spaces defined via multiscale space decomposition. Using this decomposition, our goal is further appropriately to introduce time splitting such that the resulting scheme is stable and can guarantee contrast-independent discretization under some suitable (reasonable) conditions. In this paper, we propose contrast-independent partially explicitly scheme for wave equations. The splitting requires a careful design. We prove that the proposed splitting is unconditionally stable under some suitable conditions formulated for the second space (slow). This condition requires some type of non-contrast dependent space and is easier to satisfy in the slow space. We present numerical results and show that the proposed methods provide results similar to implicit methods with the time step that is independent of the contrast.
In this paper, we propose a $mu$-mode integrator for computing the solution of stiff evolution equations. The integrator is based on a d-dimensional splitting approach and uses exact (usually precomputed) one-dimensional matrix exponentials. We show that the action of the exponentials, i.e. the corresponding batched matrix-vector products, can be implemented efficiently on modern computer systems. We further explain how $mu$-mode products can be used to compute spectral transformations efficiently even if no fast transform is available. We illustrate the performance of the new integrator by solving three-dimensional linear and nonlinear Schrodinger equations, and we show that the $mu$-mode integrator can significantly outperform numerical methods well established in the field. We also discuss how to efficiently implement this integrator on both multi-core CPUs and GPUs. Finally, the numerical experiments show that using GPUs results in performance improvements between a factor of 10 and 20, depending on the problem.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
