اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدModified Iterated Crank-Nicolson Method with Improved Accuracy
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The iterated Crank-Nicolson (ICN) method is a successful numerical algorithm in numerical relativity for solving partial differential equations. The $theta$-ICN method is the extension of the original ICN method where $theta$ is the weight when averaging the predicted and corrected values. It has better stability when $theta$ is chosen to be larger than 0.5, but the accuracy is reduced since the $theta$-ICN method is second order accurate only when $theta$ = 0.5. In this paper, we propose two modified $theta$-ICN algorithms that have second order of convergence rate when $theta$ is not 0.5, based on two different ways to choose the weight $theta$. The first approach employs two geometrically averaged $theta$s in two iterations within one time step, and the second one uses arithmetically averaged $theta$s for two consecutive time steps while $theta$ remains the same in each time step. The stability and second order accuracy of our methods are verified using stability and truncation error analysis and are demonstrated by numerical examples on linear and semi-linear hyperbolic partial differential equations and Burgers equation.
قيم البحث
اقرأ أيضاً
The aim of this paper is to establish the convergence and error bounds to the fully discrete solution for a class of nonlinear systems of reaction-diffusion nonlocal type with moving boundaries, using a linearized Crank-Nicolson-Galerkin finite eleme
nt method with polynomial approximations of any degree. A coordinate transformation which fixes the boundaries is used. Some numerical tests to compare our Matlab code with some existing moving finite elements methods are investigated.
This paper investigates the inverse scattering problems using sampling methods with near field measurements. The near field measurements appear in two classical inverse scattering problems: the inverse scattering for obstacles and the interior invers
e scattering for cavities. We propose modified sampling methods to treat these two classical problems using near field measurements without making any asymptotic assumptions on the distance between the measurement surface and the scatterers. We provide theoretical justifications based on the factorization of the near field operator in both symmetric factorization case and non-symmetric factorization case. Furthermore, we introduce a data completion algorithm which allows us to apply the modified sampling methods to treat the limited-aperture inverse scattering problems. Finally numerical examples are provided to illustrate the modified sampling methods with both full- and limited- aperture near field measurements.
We study the Crank-Nicolson scheme for stochastic differential equations (SDEs) driven by multidimensional fractional Brownian motion $(B^{1}, dots, B^{m})$ with Hurst parameter $H in (frac 12,1)$. It is well-known that for ordinary differential equa
tions with proper conditions on the regularity of the coefficients, the Crank-Nicolson scheme achieves a convergence rate of $n^{-2}$, regardless of the dimension. In this paper we show that, due to the interactions between the driving processes $ B^{1}, dots, B^{m} $, the corresponding Crank-Nicolson scheme for $m$-dimensional SDEs has a slower rate than for the one-dimensional SDEs. Precisely, we shall prove that when $m=1$ and when the drift term is zero, the Crank-Nicolson scheme achieves the exact convergence rate $n^{-2H}$, while in the case $m=1$ and the drift term is non-zero, the exact rate turns out to be $n^{-frac12 -H}$. In the general case when $m>1$, the exact rate equals $n^{frac12 -2H}$. In all these cases the limiting distribution of the leading error is proved to satisfy some linear SDE driven by Brownian motions independent of the given fractional Brownian motions.
This paper reinforces numerical iterated integration developed by Muhammad--Mori in the following two points: 1) the approximation formula is modified so that it can achieve a better convergence rate in more general cases, and 2) explicit error bound
is given in a computable form for the modified formula. The formula works quite efficiently, especially if the integrand is of a product type. Numerical examples that confirm it are also presented.
In this paper, we discuss the nonlinear stability and convergence of a fully discrete Fourier pseudospectral method coupled with a specially designed second order time-stepping for the numerical solution of the good Boussinesq equation. Our analysis
improves the existing results presented in earlier literature in two ways. First, an $l_infty(0, T^*; H2)$ convergence for the solution and $l_infty(0, T^*; l_2)$ convergence for the time-derivative of the solution are obtained in this paper, instead of the $l_infty(0, T^*; l_2)$ convergence for the solution and the $l_infty(0, T^*; H^{-2})$ convergence for the time-derivative, given in [17]. In addition, the stability and convergence of this method is shown to be unconditional for the time step in terms of the spatial grid size, compared with a severe restriction time step restriction $Delta t leq Ch^2$ reported in [17].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
