Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Fast Summation Method for Oscillatory Lattice Sums
76
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We present a fast summation method for lattice sums of the type which arise when solving wave scattering problems with periodic boundary conditions. While there are a variety of effective algorithms in the literature for such calculations, the approach presented here is new and leads to a rigorous analysis of Woods anomalies. These arise when illuminating a grating at specific combinations of the angle of incidence and the frequency of the wave, for which the lattice sums diverge. They were discovered by Wood in 1902 as singularities in the spectral response. The primary tools in our approach are the Euler-Maclaurin formula and a steepest descent argument. The resulting algorithm has super-algebraic convergence and requires only milliseconds of CPU time.
rate research
Read More
We study convergence of 3D lattice sums via expanding spheres. It is well-known that, in contrast to summation via expanding cubes, the expanding spheres method may lead to formally divergent series (this will be so e.g. for the classical NaCl-Madelung constant). In the present paper we prove that these series remain convergent in Cesaro sense. For the case of second order Cesaro summation, we present an elementary proof of convergence and the proof for first order Cesaro summation is more involved and is based on the Riemann localization for multi-dimensional Fourier series.
A high-order quasi-conservative discontinuous Galerkin (DG) method is proposed for the numerical simulation of compressible multi-component flows. A distinct feature of the method is a predictor-corrector strategy to define the grid velocity. A Lagrangian mesh is first computed based on the flow velocity and then used as an initial mesh in a moving mesh method (the moving mesh partial differential equation or MMPDE method ) to improve its quality. The fluid dynamic equations are discretized in the direct arbitrary Lagrangian-Eulerian framework using DG elements and the non-oscillatory kinetic flux while the species equation is discretized using a quasi-conservative DG scheme to avoid numerical oscillations near material interfaces. A selection of one- and two-dimensional examples are presented to verify the convergence order and the constant-pressure-velocity preservation property of the method. They also demonstrate that the incorporation of the Lagrangian meshing with the MMPDE moving mesh method works well to concentrate mesh points in regions of shocks and material interfaces.
This study suggests a fast computational method for crack propagation, which is based on the extended finite element method (X-FEM). It is well known that the X-FEM might be the most popular numerical method for crack propagation. However, with the increase of complexity of the given problem, the size of FE model and the number of iterative steps are increased correspondingly. To improve the efficiency of X-FEM, an efficient computational method termed decomposed updating reanalysis (DUR) method is suggested. For most of X-FEM simulation procedures, the change of each iterative step is small and it will only lead a local change of stiffness matrix. Therefore, the DUR method is proposed to predict the modified response by only calculating the changed part of equilibrium equations. Compared with other fast computational methods, the distinctive characteristic of the proposed method is to update the modified stiffness matrix with a local updating strategy, which only the changed part of stiffness matrix needs to be updated. To verify the performance of the DUR method, several typical numerical examples have been analyzed and the results demonstrate that this method is a highly efficient method with high accuracy.
Approximation of interacting kernels by sum of Gaussians (SOG) is frequently required in many applications of scientific and engineering computing in order to construct efficient algorithms for kernel summation or convolution problems. In this paper, we propose a kernel-independent SOG method by introducing the de la Vallee-Poussin sum and Chebyshev polynomials. The SOG works for general interacting kernels and the lower bound of Gaussian bandwidths is tunable and thus the Gaussians can be easily summed by fast Gaussian algorithms. The number of Gaussians can be further reduced via the model reduction based on the balanced truncation based on the square root method. Numerical results on the accuracy and model reduction efficiency show attractive performance of the proposed method.
We develop an energy-based finite difference method for the wave equation in second order form. The spatial discretization satisfies a summation-by-parts (SBP) property. With boundary conditions and material interface conditions imposed weakly by the simultaneous-approximation-term (SAT) method, we derive energy estimates for the semi-discretization. In addition, error estimates are derived by the normal mode analysis. The energy-based discretization does not use any mesh-dependent parameter, even in the presence of Dirichlet boundary conditions and material interfaces. Furthermore, similar to upwind discontinuous Galerkin methods, numerical dissipation can be added to the discretization through the boundary conditions. We present numerical experiments that verify convergence and robustness of the proposed method.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
