ترغب بنشر مسار تعليمي؟ اضغط هنا

A Muntz-Collocation spectral method for weakly singular volterra integral equations

333   0   0.0 ( 0 )
 نشر من قبل Dianming Hou
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

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.



قيم البحث

اقرأ أيضاً

233 - I.V. Boykov , A.N. Tynda 2013
Weakly singular Volterra integral equations of the different types are considered. The construction of accuracy-optimal numerical methods for one-dimensional and multidimensional equations is discussed. Since this question is closely related with the optimal approximation problem, the orders of the Babenko and Kolmogorov (n-)widths of compact sets from some classes of functions have been evaluated. In conclusion we adduce some numerical illustrations for 2-D Volterra equations.
244 - Tomoaki Okayama 2013
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.
This paper presents a novel semi-analytical collocation method to solve multi-term variable-order time fractional partial differential equations (VOTFPDEs). In the proposed method it employs the Fourier series expansion for spatial discretization, wh ich transforms the original multi-term VOTFPDEs into a sequence of multi-term variable-order time fractional ordinary differential equations (VOTFODEs). Then these VOTFODEs can be solved by using the recent-developed backward substitution method. Several numerical examples verify the accuracy and efficiency of the proposed numerical approach in the solution of multi-term VOTFPDEs.
We propose and study numerically the implicit approximation in time of the Navier-Stokes equations by a Galerkin-collocation method in time combined with inf-sup stable finite element methods in space. The conceptual basis of the Galerkin-collocation approach is the establishment of a direct connection between the Galerkin method and the classical collocation methods, with the perspective of achieving the accuracy of the former with reduced computational costs in terms of less complex algebraic systems of the latter. Regularity of higher order in time of the discrete solution is ensured further. As an additional ingredient, we employ Nitsches method to impose all boundary conditions in weak form with the perspective that evolving domains become feasible in the future. We carefully compare the performance poroperties of the Galerkin-collocation approach with a standard continuous Galerkin-Petrov method using piecewise linear polynomials in time, that is algebraically equivalent to the popular Crank-Nicholson scheme. The condition number of the arising linear systems after Newton linearization as well as the reliable approximation of the drag and lift coefficient for laminar flow around a cylinder (DFG flow benchmark with $Re=100$) are investigated. The superiority of the Galerkin-collocation approach over the linear in time, continuous Galerkin-Petrov method is demonstrated therein.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا