On the optimization of numerical dispersion and dissipation of finite difference scheme for linear advection equation

2016 ◽  
Vol 10 ◽  
pp. 2381-2389 ◽  
Author(s):  
G. V. Krivovichev ◽  
E. S. Marnopolskaya
Keyword(s):  
Finite Difference ◽  
Difference Scheme ◽  
Finite Difference Scheme ◽  
Numerical Dispersion ◽  
Advection Equation ◽  
Linear Advection Equation

A stability analysis for a generalized finite-difference scheme applied to the pure advection equation

2018 ◽  
Vol 147 ◽  
pp. 293-300 ◽  
Author(s):  
G. Tinoco-Guerrero ◽  
F.J. Domínguez-Mota ◽  
A. Gaona-Arias ◽  
M.L. Ruiz-Zavala ◽  
J.G. Tinoco-Ruiz
Keyword(s):  
Stability Analysis ◽  
Finite Difference ◽  
Difference Scheme ◽  
Finite Difference Scheme ◽  
Advection Equation

scholarly journals An Optimal Fourth-Order Finite Difference Scheme for the Helmholtz Equation Based on the Technique of Matched Interface Boundary

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Dongsheng Cheng ◽  
Jianjun Chen ◽  
Guangqing Long
Keyword(s):  
Finite Difference ◽  
Boundary Conditions ◽  
Difference Scheme ◽  
Helmholtz Equation ◽  
Fourth Order ◽  
Finite Difference Scheme ◽  
Weighted Average ◽  
Numerical Dispersion ◽  
Taylor Formula ◽  
Interface Boundary

In this paper, a new optimal fourth-order 21-point finite difference scheme is proposed to solve the 2D Helmholtz equation numerically, with the technique of matched interface boundary (MIB) utilized to treat boundary problems. For the approximation of Laplacian, two sets of fourth-order difference schemes are derived firstly based on the Taylor formula, with a total of 21 grid points involved. Then, a weighted combination of the two schemes is employed in order to reduce the numerical dispersion, and the weights are determined by minimizing the dispersion. Similarly, for the discretization of the zeroth-order derivative term, a weighted average of all the 21 points is implemented to obtain the fourth-order accuracy. The new scheme is noncompact; hence, it encounters great difficulties in dealing with the boundary conditions, which is crucial to the order of convergence. To tackle this issue, the matched interface boundary (MIB) method is employed and developed, which is originally used to accommodate free edges in the discrete singular convolution analysis. Convergence analysis and dispersion analysis are performed. Numerical examples are given for various boundary conditions, which show that new scheme delivers a fourth order of accuracy and is efficient in reducing the numerical dispersion as well.

scholarly journals A Robust Optimal Finite Difference Scheme for the Three-Dimensional Helmholtz Equation

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Dongsheng Cheng ◽  
Baowen Chen ◽  
Xiangling Chen
Keyword(s):  
Finite Difference ◽  
Difference Scheme ◽  
Helmholtz Equation ◽  
Finite Difference Scheme ◽  
Three Dimensional ◽  
Weighted Average ◽  
Least Square ◽  
Numerical Dispersion ◽  
Staggered Grid ◽  
Grid Points

We propose a robust optimal 27-point finite difference scheme for the Helmholtz equation in three-dimensional domain. In each direction, a special central difference scheme with 27 grid points is developed to approximate the second derivative operator. The 27 grid points are divided into four groups, and each group is involved in the difference scheme by the manner of weighted combination. As for the approximation of the zeroth-order term, we use the weighted average of all the 27 points, which are also divided into four groups. Finally, we obtain the optimal weights by minimizing the numerical dispersion with the least-square method. In comparison with the rotated difference scheme based on a staggered-grid method, the new scheme is simpler, more practical, and much more robust. It works efficiently even if the step sizes along different directions are not equal. However, rotated scheme fails in this situation. We also present the convergence analysis and dispersion analysis. Numerical examples demonstrate the effectiveness of the proposed scheme.

scholarly journals The convergence of a numerical method for total variation flow

2021 ◽  
Vol 15 ◽  
pp. 174830262110113
Author(s):  
Qianying Hong ◽  
Ming-jun Lai ◽  
Jingyue Wang
Keyword(s):  
Finite Difference ◽  
Difference Scheme ◽  
Numerical Method ◽  
Convergence Analysis ◽  
Total Variation ◽  
Iterative Algorithm ◽  
Finite Difference Scheme ◽  
Gradient Flow ◽  
Time Dependent ◽  
Total Variation Flow

We present a convergence analysis for a finite difference scheme for the time dependent partial different equation called gradient flow associated with the Rudin-Osher-Fetami model. We devise an iterative algorithm to compute the solution of the finite difference scheme and prove the convergence of the iterative algorithm. Finally computational experiments are shown to demonstrate the convergence of the finite difference scheme.

Sign in / Sign up

Export Citation Format

Share Document