Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFinite difference method for inhomogeneous fractional Dirichlet problem
202
0
0.0
(
0
)
Added by
Weihua Deng Professor
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We make the split of the integral fractional Laplacian as $(-Delta)^s u=(-Delta)(-Delta)^{s-1}u$, where $sin(0,frac{1}{2})cup(frac{1}{2},1)$. Based on this splitting, we respectively discretize the one- and two-dimensional integral fractional Laplacian with the inhomogeneous Dirichlet boundary condition and give the corresponding truncation errors with the help of the interpolation estimate. Moreover, the suitable corrections are proposed to guarantee the convergence in solving the inhomogeneous fractional Dirichlet problem and an $mathcal{O}(h^{1+alpha-2s})$ convergence rate is obtained when the solution $uin C^{1,alpha}(bar{Omega}^{delta}_{n})$, where $n$ is the dimension of the space, $alphain(max(0,2s-1),1]$, $delta$ is a fixed positive constant, and $h$ denotes mesh size. Finally, the performed numerical experiments confirm the theoretical results.
rate research
Read More
We study finite element approximations of the nonhomogeneous Dirichlet problem for the fractional Laplacian. Our approach is based on weak imposition of the Dirichlet condition and incorporating a nonlocal analogous of the normal derivative as a Lagrange multiplier in the formulation of the problem. In order to obtain convergence orders for our scheme, regularity estimates are developed, both for the solution and its nonlocal derivative. The method we propose requires that, as meshes are refined, the discrete problems be solved in a family of domains of growing diameter.
We propose a novel method to compute a finite difference stencil for Riesz derivative for artibitrary speed of convergence. This method is based on applying a pre-filter to the Grunwald-Letnikov type central difference stencil. The filter is obtained by solving for the inverse of a symmetric Vandemonde matrix and exploiting the relationship between the Taylors series coefficients and fast Fourier transform. The filter costs Oleft(N^{2}right) operations to evaluate for Oleft(h^{N}right) of convergence, where h is the sampling distance. The higher convergence speed should more than offset the overhead with the requirement of the number of nodal points for a desired error tolerance significantly reduced. The benefit of progressive generation of the stencil coefficients for adaptive grid size for dynamic problems with the Grunwald-Letnikov type difference scheme is also kept because of the application of filtering. The higher convergence rate is verified through numerical experiments.
Fourth-order differential equations play an important role in many applications in science and engineering. In this paper, we present a three-field mixed finite-element formulation for fourth-order problems, with a focus on the effective treatment of the different boundary conditions that arise naturally in a variational formulation. Our formulation is based on introducing the gradient of the solution as an explicit variable, constrained using a Lagrange multiplier. The essential boundary conditions are enforced weakly, using Nitsches method where required. As a result, the problem is rewritten as a saddle-point system, requiring analysis of the resulting finite-element discretization and the construction of optimal linear solvers. Here, we discuss the analysis of the well-posedness and accuracy of the finite-element formulation. Moreover, we develop monolithic multigrid solvers for the resulting linear systems. Two and three-dimensional numerical results are presented to demonstrate the accuracy of the discretization and efficiency of the multigrid solvers proposed.
This research was mainly conducted to explore the possibility of formulating an efficient algorithm to find roots of nonlinear equations without using the derivative of the function. The Weerakoon-Fernando method had been taken as the base in this project to find a new method without the derivative since Weerakoon-Fernando method gives 3rd order convergence. After several unsuccessful attempts we were able to formulate the Finite Difference Weerakoon-Fernando Method (FDWFM) presented here. We noticed that the FDWFM approaches the root faster than any other existing method in the absence of the derivatives as an example, the popular nonlinear equation solver such as secant method (order of convergence is 1.618) in the absence of the derivative. And the FDWFM had three function evaluations and secant method had two function evaluations. By implementing FDWFM on nonlinear equations with complex roots and also on systems of nonlinear equations, we received very encouraging results. When applying the FDWFM to systems of nonlinear equations, we resolved the involvement of the Jacobian problem by following the procedure in the Broydens method. The computational order of convergence of the FDWFM was close to 2.5 for all these cases. This will undoubtedly provide scientists the efficient numerical algorithm, that doesnt need the derivative of the function to solve nonlinear equations, that they were searching for over centuries.
In this article, a numerical scheme is introduced for solving the fractional partial differential equation (FPDE) arising from electromagnetic waves in dielectric media (EMWDM) by using an efficient class of finite difference methods. The numerical scheme is based on the Hermite formula. The Caputos fractional derivatives in time are discretized by a finite difference scheme of order $mathcal{O}(k^{(4-alpha)})$ & $mathcal{O}(k^{(4-beta)})$, $1<beta <alpha leq 2$. The stability and the convergence analysis of the proposed methods are given by a procedure similar to the standard von Neumann stability analysis under mild conditions. Also for FPDE, accuracy of order $mathcal{O}left( k^{(4-alpha)}+k^{(4-beta)}+h^2right) $ is investigated. Finally, several numerical experiments with different fractional-order derivatives are provided and compared with the exact solutions to illustrate the accuracy and efficiency of the scheme. A comparative numerical study is also done to demonstrate the efficiency of the proposed scheme.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
