带弱奇异核的第二类Fredholm积分方程数值解法比较

针对带有弱奇异核的第二类Fredholm积分方程数值解法问题,介绍了两种方法.一种方法是泰勒级数展开法;另一种方法是将弱奇异核通过迭代变为连续核,再用L¹空间中的离散化方法求其数值解,且通过对具体算例作图分析,从而得出L1空间中的离散化方法求其数值解,且通过对具体算例作图分析,从而得出L¹空间中离散化方法更好.     

L~1空间中直接离散法求解弱奇异积分方程特征值的探讨

在L~1空间中讨论弱奇异积分方程的特征值问题.利用弱奇异积分算子为紧算子,便可以对其直接进行离散化算法求出特征值.并将直接离散的方法与以往的迭代后离散的方法用实例通过Matlab作图进行对比,说明直接进行离散的方法更佳.     

L~1空间中带弱奇异核的第二类Fredholm积分方程的数值解法

在L¹空间中,研究带弱奇异核的第二类Fredholm积分方程.将弱奇异核转换成连续核,给出了一种数值求解的算法,并举出具体算例.     

L~1空间中第二类Fredholm积分方程数值解法比较

在L~1空间中讨论第二类Fredholm积分方程,利用连续核函数的连续性质,用核函数的均值点值对积分方程进行离散化,并将算法与以往的离散化方法用实例通过Matlab作图进行比较,说明新算法的优越性.     

三维弱奇异积分算子的紧性

本文讨论了三维弱奇异核积分算子K:■其中■0α3,■是Ω×Ω上的连续函数.证明了当0α3时,K是从L~1(Ω)空间到L~1(Ω)空间中的紧算子.     

带弱奇异核非线性积分微分方程的有限元分析

讨论了带弱奇异核的非线性抛物积分微分方程的Hermite型各向异性矩形元逼近.在各向异性网格下导出了关于Riesz投影的L~2和H~1模的误差估计.在半离散和向后欧拉全离散格式下,基于Riesz投影的性质并利用平均值技巧,分别得到了L~2模意义下的最优误差估计.     

一种直接间断Galerkin方法的误差分析

提出一种求解非线性扩散方程的直接间断Galerkin方法.在空间离散上,采用Stirling插值公式构造了一种含有高阶导数项的数值流;在时间离散上,采用通常的Runge-Kutta方法.在理论上,证明了由这种直接间断Galerkin方法得到的计算格式是非线性稳定的,相应数值解不仅具有最优的能量误差估计,而且具有最优的L~2误差估计.数值实验验证了方法的有效性.     

一类具有弱奇异核的偏积分微分方程的Chebyshev小波数值方法（英文）

本文提出一种基于第四类Chebyshev小波配置法,求解了一类具有弱奇异核的偏积分微分方程数值解.利用第四类移位Chebyshev多项式,在Riemann-Liouville分数阶积分意义下,导出Chebyshev的分数次积分公式.通过利用分数次积分公式和二维的第四类Chebyshev小波结合配置法,将具有弱奇异核的偏积分微分方程转化为代数方程组求解.给出了第四类Chebyshev小波的收敛性分析.数值例子证明了本文方法的有效性.     

解二阶抛物型方程组的再生核函数法

建立了二阶抛物型方程组的一种新数值方法-再生核函数法.利用再生核函数,直接给出了每个离散时间层上近似解的显式表达式,由显式表达式可实现完全并行计算;用能量估计法证明了格式的稳定性及二阶收敛性;给出了一些数值结果.     

带Hilbert核奇异积分的数值求积及应用

本文给出了带Ｈｉｌｂｅｒｔ核奇异积分的几种数值求积分式，证明了它们的一致收敛性，把它们应用于常系数带Ｈｉｌｂｅｒｔ核的奇异积分方程可获得的逼近解，而且在输入函数晚一般的假定下，证明了这些解的唯一存在性收敛性。     

Exact solution of a class of fractional integro‐differential equations with the weakly singular kernel based on a new fractional reproducing kernel space

In this paper, we construct a new fractional weighted reproducing kernel space, which is the minimum space containing the exact solution. The closed form of the reproducing kernel is obtained. Using this fractional reproducing kernel space, a class of fractional integro‐differential equations with a weakly singular kernel is solved. The error estimation is given. The final numerical experiments demonstrate the correctness of the theory and the effectiveness of the method.     

Error Bounds for Low-Rank Approximations of the First Exponential Integral Kernel

A hierarchical matrix is an efficient data-sparse representation of a matrix, especially useful for large dimensional problems. It consists of low-rank subblocks leading to low memory requirements as well as inexpensive computational costs. In this work, we discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. The operator is of convolution type, it is defined through the first exponential-integral function and, hence, it is weakly singular. We develop analytical expressions for the approximate degenerate kernels and deduce error upper bounds for these approximations. Some computational results illustrating the efficiency and robustness of the approach are presented.     

The exact solution of a class of Volterra integral equation with weakly singular kernel

In this paper, the weakly singular Volterra integral equations with an infinite set of solutions are investigated. Among the set of solutions only one particular solution is smooth and all others are singular at the origin. The numerical solutions of this class of equations have been a difficult topic to analyze and have received much previous investigation. The aim of this paper is to present a numerical technique for giving the approximate solution to the only smooth solution based on reproducing kernel theory. Applying weighted integral, we provide a new definition for reproducing kernel space and obtain reproducing kernel function. Using the good properties of reproducing kernel function, the only smooth solution is exactly expressed in the form of series. The n-term approximate solution is obtained by truncating the series. Meanwhile, we prove that the derivative of approximation converges to the derivative of exact solution uniformly. The final numerical examples compared with other methods show that the method is efficient.     

Optimal space–time adaptive wavelet methods for degenerate parabolic PDEs

We analyze parabolic PDEs with certain type of weakly singular or degenerate time-dependent coefficients and prove existence and uniqueness of weak solutions in an appropriate sense. A localization of the PDEs to a bounded spatial domain is justified. For the numerical solution a space?Ctime wavelet discretization is employed. An optimality result for the iterative solution of the arising systems can be obtained. Finally, applications to fractional Brownian motion models in option pricing are presented.     

Reproducing kernel method of solving singular integral equation with cosecant kernel

In the paper, a reproducing kernel method of solving singular integral equations (SIE) with cosecant kernel is proposed. For solving SIE, difficulties lie in its singular term. In order to remove singular term of SIE, an equivalent transformation is made. Compared with known investigations, its advantages are that the representation of exact solution is obtained in a reproducing kernel Hilbert space and accuracy in numerical computation is higher. On the other hand, the representation of reproducing kernel becomes simple by improving the definition of traditional inner product and requirements for image space of operators are weakened comparing with traditional reproducing kernel method. The final numerical experiments illustrate the method is efficient.     

An L refined projection approximate solution of the radiation transfer equation in stellar atmospheres

This paper deals with the numerical approximation of the solution of a weakly singular integral equation of the second kind which appears in Astrophysics. The reference space is the complex Banach space of Lebesgue integrable functions on a bounded interval whose amplitude represents the optical thickness of the atmosphere. The kernel of the integral operator is defined through the first exponential-integral function and depends on the albedo of the media. The numerical approximation is based on a sequence of piecewise constant projections along the common annihilator of the corresponding local means. In order to produce high precision solutions without solving large scale linear systems, we develop an iterative refinement technique of a low order approximation. For this scheme, parallelization of matrix computations is suitable.     

Solving singular second order three-point boundary value problems using reproducing kernel Hilbert space method

This paper investigates the numerical solutions of singular second order three-point boundary value problems using reproducing kernel Hilbert space method. It is a relatively new analytical technique. The solution obtained by using the method takes the form of a convergent series with easily computable components. However, the reproducing kernel Hilbert space method cannot be used directly to solve a singular second order three-point boundary value problem, so we convert it into an equivalent integro-differential equation, which can be solved using reproducing kernel Hilbert space method. Four numerical examples are given to demonstrate the efficiency of the present method. The numerical results demonstrate that the method is quite accurate and efficient for singular second order three-point boundary value problems.     

Numerical solution for a sub-diffusion equation with a smooth kernel

In this paper we study the numerical solution of an initial value problem of a sub-diffusion type. For the time discretization we apply the discontinuous Galerkin method and we use continuous piecewise finite elements for the space discretization. Optimal order convergence rates of our numerical solution have been shown. We compare our theoretical error bounds with the results of numerical computations. We also present some numerical results showing the super-convergence rates of the proposed method.     

B‐spline solution of fractional integro partial differential equation with a weakly singular kernel

The main objective of the paper is to find the approximate solution of fractional integro partial differential equation with a weakly singular kernel. Integro partial differential equation (IPDE) appears in the study of viscoelastic phenomena. Cubic B‐spline collocation method is employed for fractional IPDE. The developed scheme for finding the solution of the considered problem is based on finite difference method and collocation method. Caputo fractional derivative is used for time fractional derivative of order α, . The given problem is discretized in both time and space directions. Backward Euler formula is used for temporal discretization. Collocation method is used for spatial discretization. The developed scheme is proved to be stable and convergent with respect to time. Approximate solutions are examined to check the precision and effectiveness of the presented method.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1565–1581, 2017     

Using Sinc-collocation method for solving weakly singular Fredholm integral equations of the first kind

In this paper, Sinc-collocation method is used to approximate the solution of weakly singular nonlinear Fredholm integral equations of the first kind. Some of the important advantages of this method are rate of convergence of an approximate solution and simplicity for performing even in the presence of singularities. The convergence analysis of the proposed method is proved by preparing the theorems which show the errors decay exponentially and guarantee the applicability of that. Finally, several numerical examples are considered to show the capabilities, validity, and accuracy of the numerical scheme.