Search

Abstract: This paper presents a new computational framework for the simulation of solid mechanics on general overlapping grids with adaptive mesh refinement (AMR). The approach, described here for time-dependent linear elasticity in two and three space dimensions, is motivated by considerations of accuracy, efficiency and flexibility. We consider two approaches for the numerical solution of the equations of linear elasticity on overlapping grids. In the first approach we solve the governing equations numerically as a second-order system (SOS) using a conservative finite-difference approximation. The second approach considers the equations written as a first-order system (FOS) and approximates them using a second-order characteristic-based (Godunov) finite-volume method. A principal aim of the paper is to present the first careful assessment of the accuracy and stability of these two representative schemes for the equations of linear elasticity on overlapping grids. This is done by first performing a stability analysis of analogous schemes for the first-order and second-order scalar wave equations on an overlapping grid. The analysis shows that non-dissipative approximations can have unstable modes with growth rates proportional to the inverse of the mesh spacing. This new result, which is relevant for the numerical solution of any type of wave propagation problem on overlapping grids, dictates the form of dissipation that is needed to stabilize the scheme. Numerical experiments show that the addition of the indicated form of dissipation and/or a separate filter step can be used to stabilize the SOS scheme. They also demonstrate that the upwinding inherent in the Godunov scheme, which provides dissipation of the appropriate form, stabilizes the FOS scheme. We then verify and compare the accuracy of the two schemes using the method of analytic solutions and using problems with known solutions. These latter problems provide useful benchmark solutions for time dependent elasticity. We also consider two problems in which exact solutions are not available, and use a posterior error estimates to assess the accuracy of the schemes. One of these two problems is additionally employed to demonstrate the use of dynamic AMR and its effectiveness for resolving elastic “shock” waves. Finally, results are presented that compare the computational performance of the two schemes. These demonstrate the speed and memory efficiency achieved by the use of structured overlapping grids and optimizations for Cartesian grids. [Copyright &y& Elsevier]

Abstract: In this follow up paper to our previous study in Bayona et al. (2011) , we present a new technique to compute the solution of PDEs with the multiquadric based RBF finite difference method (RBF-FD) using an optimal node dependent variable value of the shape parameter. This optimal value is chosen so that, to leading order, the local approximation error of the RBF-FD formulas is zero. In our previous paper (Bayona et al., 2011) we considered the case of an optimal (constant) value of the shape parameter for all the nodes. Our new results show that, if one allows the shape parameter to be different at each grid point of the domain, one may obtain very significant accuracy improvements with a simple and inexpensive numerical technique. We analyze the same examples studied in Bayona et al. (2011) , both with structured and unstructured grids, and compare our new results with those obtained previously. We also find that, if there are a significant number of nodes for which no optimal value of the shape parameter exists, then the improvement in accuracy deteriorates significantly. In those cases, we use generalized multiquadrics as RBFs and choose the exponent of the multiquadric at each node to assure the existence of an optimal variable shape parameter. [Copyright &y& Elsevier]

Abstract: A key idea in finite difference weighted essentially non-oscillatory (WENO) schemes is a combination of lower order fluxes to obtain a higher order approximation. The choice of the weight to each candidate stencil, which is a nonlinear function of the grid values, is crucial to the success of WENO schemes. For the system case, WENO schemes are based on local characteristic decompositions and flux splitting to avoid spurious oscillation. But the cost of computation of nonlinear weights and local characteristic decompositions is very high. In this paper, we investigate hybrid schemes of WENO schemes with high order up-wind linear schemes using different discontinuity indicators and explore the possibility in avoiding the local characteristic decompositions and the nonlinear weights for part of the procedure, hence reducing the cost but still maintaining non-oscillatory properties for problems with strong shocks. The idea is to identify discontinuity by an discontinuity indicator, then reconstruct numerical flux by WENO approximation in discontinuous regions and up-wind linear approximation in smooth regions. These indicators are mainly based on the troubled-cell indicators for discontinuous Galerkin (DG) method which are listed in the paper by Qiu and Shu (J. Qiu, C.-W. Shu, A comparison of troubled-cell indicators for Runge–Kutta discontinuous Galerkin methods using weighted essentially non-oscillatory limiters, SIAM Journal of Scientific Computing 27 (2005) 995–1013). The emphasis of the paper is on comparison of the performance of hybrid scheme using different indicators, with an objective of obtaining efficient and reliable indicators to obtain better performance of hybrid scheme to save computational cost. Detail numerical studies in one- and two-dimensional cases are performed, addressing the issues of efficiency (less CPU time and more accurate numerical solution), non-oscillatory property. [ABSTRACT FROM AUTHOR]

Abstract: The recently developed Flexible Local Approximation MEthod (FLAME) produces accurate difference schemes by replacing the usual Taylor expansion with Trefftz functions – local solutions of the underlying differential equation. This paper advances and casts in a general form a significant modification of FLAME proposed recently by Pinheiro and Webb: a least-squares fit instead of the exact match of the approximate solution at the stencil nodes. As a consequence of that, FLAME schemes can now be generated on irregular stencils with the number of nodes substantially greater than the number of approximating functions. The accuracy of the method is preserved but its robustness is improved. For demonstration, the paper presents a number of numerical examples in 2D and 3D: electrostatic (magnetostatic) particle interactions, scattering of electromagnetic (acoustic) waves, and wave propagation in a photonic crystal. The examples explore the role of the grid and stencil size, of the number of approximating functions, and of the irregularity of the stencils. [Copyright &y& Elsevier]

Abstract: A set of optimised boundary closure schemes is presented for use with compact central finite difference schemes in computational aeroacoustics (CAA) involving non-trivial boundaries. The boundary schemes are given in a form of non-central compact finite differences. They maintain fourth-order accuracy, a pentadiagonal matrix system and seven-point stencil which the main interior scheme employs. This paper introduces a new strategy to optimise the boundary schemes in the spectral domain and achieve the best resolution characteristics given a strict tolerance for the dispersion and dissipation errors. The boundary schemes are derived from sophisticated extrapolation of solutions outside the domain. The extrapolation functions are devised by combining polynomials and trigonometric series which contain extra control variables used to optimise the resolution characteristics. The differencing coefficients of the boundary schemes are determined in association with the existing coefficients of the interior scheme which is also optimised through an improved procedure in this paper. The accuracy of the proposed schemes is demonstrated by their application to CAA benchmark problems. [Copyright &y& Elsevier]

Abstract: In this paper we are aimed to solve the non-dissipative Degasperis–Procesi equation based on the formulation. To resolve the computational difficulty at the wave crest where the first-order derivative may diverge and the shockpeakon solution may form, the first-order spatial derivative term in the two-step equations will be approximated in a conservative form. The resulting equations will be approximated by the symplecticity-preserving time-stepping scheme and the spatial discretization scheme that can optimize the numerical wavenumber for the first-order spatial derivative term. This scheme will be developed in a three-point grid stencil with the accuracy order of seventh within the combined compact finite difference framework. Besides the validation of numerical accuracy, we will in particular address the discrete conservation of Hamiltonians even when peakon collides with antipeakon and generates, as a result, a shockpeakon. We will also demonstrate the capability of applying the proposed numerical method to sharply resolve some important features of the third-order dispersive DP equation. [Copyright &y& Elsevier]

Abstract: In this paper, we present the development of new explicit group relaxation methods which solve the two dimensional second order hyperbolic telegraph equation subject to specific initial and Dirichlet boundary conditions. The explicit group methods use small fixed group formulations derived from a combination of the rotated five-point finite difference approximation together with the centered five-point centered difference approximation on different grid spacings. The resulting schemes involve three levels finite difference approximations with second order accuracies. Analyses are presented to confirm the unconditional stability of the difference schemes. Numerical experimentations are also conducted to compare the new methods with some existing schemes. [Copyright &y& Elsevier]

Abstract: High-order compact finite difference scheme with operator splitting technique for solving two-dimensional time fractional diffusion equation is considered in this paper. A Grünwald–Letnikov approximation is used for the Riemann–Liouville time derivative, and the second order spatial derivatives are approximated by the compact finite differences to obtain a fully discrete implicit scheme. Alternating direction implicit (ADI) method is used to split the original problem into two separate one-dimensional problems. The local truncation error is analyzed and the stability is discussed by the Fourier method. The proposed scheme is suitable when the order of the time fractional derivative γ lies in the interval . A correction term is added to maintain high accuracy when . Numerical results are provided to verify the accuracy and efficiency of the proposed algorithm. [Copyright &y& Elsevier]

Abstract: In this paper, a compact finite difference scheme for the fractional sub-diffusion equations is derived. After a transformation of the original problem, the L1 discretization is applied for the time-fractional part and fourth-order accuracy compact approximation for the second-order space derivative. The unique solvability of the difference solution is discussed. The stability and convergence of the finite difference scheme in maximum norm are proved using the energy method, where a new inner product is introduced for the theoretical analysis. The technique is quite novel and different from previous analytical methods. Finally, a numerical example is provided to show the effectiveness and accuracy of the method. [ABSTRACT FROM AUTHOR]

Abstract: Fractional diffusion equations model phenomena exhibiting anomalous diffusion that can not be modeled accurately by the second-order diffusion equations. Because of the nonlocal property of fractional differential operators, the numerical methods have full coefficient matrices which require storage of O(N 2) and computational cost of O(N 3) where N is the number of grid points. In this paper we develop a fast finite difference method for fractional diffusion equations, which only requires storage of O(N) and computational cost of O(N log2 N) while retaining the same accuracy and approximation property as the regular finite difference method. Numerical experiments are presented to show the utility of the method. [ABSTRACT FROM AUTHOR]

Abstract: High-order compact finite difference scheme for solving one-dimensional fractional diffusion equation is considered in this paper. After approximating the second-order derivative with respect to space by the compact finite difference, we use the Grünwald–Letnikov discretization of the Riemann–Liouville derivative to obtain a fully discrete implicit scheme. We analyze the local truncation error and discuss the stability using the Fourier method, then we prove that the compact finite difference scheme converges with the spatial accuracy of fourth order using matrix analysis. Numerical results are provided to verify the accuracy and efficiency of the proposed algorithm. [Copyright &y& Elsevier]

Abstract: We prove a rate of convergence theorem for approximations to certain integrals over codimension one manifolds in . The type of manifold involved here is defined by the zero level set of a smooth mapping . Our approximations are based on the two finite difference methods for discretizing delta functions presented in . We included a convergence proof in that paper, but only proved rates of convergence in some greatly simplified situations. Numerical experiments indicated that our two methods were at least first and second order accurate, respectively. In this note we prove those empirical convergence rates for the two algorithms under fairly general hypotheses. [Copyright &y& Elsevier]

Abstract: In this paper we present a random walk model for approximating a Lévy–Feller advection–dispersion process, governed by the Lévy–Feller advection–dispersion differential equation (LFADE). We show that the random walk model converges to LFADE by use of a properly scaled transition to vanishing space and time steps. We propose an explicit finite difference approximation (EFDA) for LFADE, resulting from the Grünwald–Letnikov discretization of fractional derivatives. As a result of the interpretation of the random walk model, the stability and convergence of EFDA for LFADE in a bounded domain are discussed. Finally, some numerical examples are presented to show the application of the present technique. [Copyright &y& Elsevier]