اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTheoretical analysis of a Sinc-Nystrom method for Volterra integro-differential equations and its improvement
251
0
0.0
(
0
)
تأليف
Tomoaki Okayama
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A Sinc-Nystrom method for Volterra integro-differential equations was developed by Zarebnia in 2010. The method is quite efficient in the sense that exponential convergence can be obtained even if the given problem has endpoint singularity. However, its exponential convergence has not been proved theoretically. In addition, to implement the method, the regularity of the solution is required, although the solution is an unknown function in practice. This paper reinforces the method by presenting two theoretical results: 1) the regularity of the solution is analyzed, and 2) its convergence rate is rigorously analyzed. Moreover, this paper improves the method so that a much higher convergence rate can be attained, and theoretical results similar to those listed above are provided. Numerical comparisons are also provided.
قيم البحث
اقرأ أيضاً
The aim of the present paper is to introduce a new numerical method for solving nonlinear Volterra integro-differential equations involving delay. We apply trapezium rule to the integral involved in the equation. Further, Daftardar-Gejji and Jafari m
ethod (DGJ) is employed to solve the implicit equation. Existence-uniqueness theorem is derived for solutions of such equations and the error and convergence analysis of the proposed method is presented. We illustrate efficacy of the newly proposed method by constructing examples.
In this paper we introduce a numerical method for solving nonlinear Volterra integro-differential equations. In the first step, we apply implicit trapezium rule to discretize the integral in given equation. Further, the Daftardar-Gejji and Jafari tec
hnique (DJM) is used to find the unknown term on the right side. We derive existence-uniqueness theorem for such equations by using Lipschitz condition. We further present the error, convergence, stability and bifurcation analysis of the proposed method. We solve various types of equations using this method and compare the error with other numerical methods. It is observed that our method is more efficient than other numerical methods.
A Sinc-collocation method has been proposed by Stenger, and he also gave theoretical analysis of the method in the case of a `scalar equation. This paper extends the theoretical results to the case of a `system of equations. Furthermore, this paper p
roposes more efficient method by replacing the variable transformation employed in Stengers method. The efficiency is confirmed by both of theoretical analysis and numerical experiments. In addition to the existing and newly-proposed Sinc-collocation methods, this paper also gives similar theoretical results for Sinc-Nystr{o}m methods proposed by Nurmuhammad et al. From a viewpoint of the computational cost, it turns out that the newly-proposed Sinc-collocation method is the most efficient among those methods.
In this paper we propose and analyze a fractional Jacobi-collocation spectral method for the second kind Volterra integral equations (VIEs) with weakly singular kernel $(x-s)^{-mu},0<mu<1$. First we develop a family of fractional Jacobi polynomials,
along with basic approximation results for some weighted projection and interpolation operators defined in suitable weighted Sobolev spaces. Then we construct an efficient fractional Jacobi-collocation spectral method for the VIEs using the zeros of the new developed fractional Jacobi polynomial. A detailed convergence analysis is carried out to derive error estimates of the numerical solution in both $L^{infty}$- and weighted $L^{2}$-norms. The main novelty of the paper is that the proposed method is highly efficient for typical solutions that VIEs usually possess. Precisely, it is proved that the exponential convergence rate can be achieved for solutions which are smooth after the variable change $xrightarrow x^{1/lambda}$ for a suitable real number $lambda$. Finally a series of numerical examples are presented to demonstrate the efficiency of the method.
At present, deep learning based methods are being employed to resolve the computational challenges of high-dimensional partial differential equations (PDEs). But the computation of the high order derivatives of neural networks is costly, and high ord
er derivatives lack robustness for training purposes. We propose a novel approach to solving PDEs with high order derivatives by simultaneously approximating the function value and derivatives. We introduce intermediate variables to rewrite the PDEs into a system of low order differential equations as what is done in the local discontinuous Galerkin method. The intermediate variables and the solutions to the PDEs are simultaneously approximated by a multi-output deep neural network. By taking the residual of the system as a loss function, we can optimize the network parameters to approximate the solution. The whole process relies on low order derivatives. Numerous numerical examples are carried out to demonstrate that our local deep learning is efficient, robust, flexible, and is particularly well-suited for high-dimensional PDEs with high order derivatives.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
