分数阶扩散方程半无界混合问题的解

研究了一维半无界分数阶扩散方程具有第三类非齐次边条件的混合问题．分别给出具有第三类齐次边条件的混合问题基本解以及具有零初始条件的混合问题基本解．最后得到分数阶扩散方程半无界混合问题的求解公式．     

非线性Klein-Gordon方程的广义Jacobi谱配置方法

构造非线性Klein-Gordon方程的广义Jacobi谱配置格式,并给出相应收敛性分析.文中的方法和技巧为设计和分析各类线性与非线性偏微分方程的谱配置格式提供了有效的框架.     

空间-时间分数阶对流扩散方程的数值解法

本文考虑一个空间-时间分数阶对流扩散方程.这个方程是将一般的对流扩散方程中的时间一阶导数用α(0＜α＜1)阶导数代替,空间二阶导数用β(1＜β＜2)阶导数代替.本文提出了一个隐式差分格式,验证了这个格式是无条件稳定的,并证明了它的收敛性,其收敛阶为O(ι h).最后给出了数值例子.     

时间分数阶扩散方程的一个新的高阶有限差分/谱逼近

研究时间分数阶扩散方程,结合时间方向的有限差分格式和空间方向的Legendre Collocation谱方法,构造了一个高阶稳定数值格式.数值算例表明该格式是无条件稳定和长时间稳定的,其收敛阶为O(△t3-α+N-m),其中△t,N和m分别是时间步长,空间多项式阶数以及精确解的正则度.     

变时间分数阶扩散方程的非一致时间网格有限差分方法

本文在非一致时间网格上,使用有限差分方法求解变时间分数阶扩散方程?α(x,t)u(x,t)/tα(x,t)-2u(x,t)/x2=f(x,t),0α(x,t)q≤1,证明了该方法在最大范数下的稳定性与收敛性,收敛阶为C(Δt2-q+h2).数值实例验证了理论分析的结果.     

时间分数阶扩散方程的数值解法

分数阶微分方程在许多应用科学上比整数阶微分方程更能准确地模拟自然现象.考虑时间分数阶扩散方程,将一阶的时间导数用分数阶导数α(0<α<1)替换,给出了一种计算有效的隐式差分格式,并证明了这个隐式差分格式是无条件稳定和无条件收敛的,最后用数值例子说明差分格式是有效的.     

一类分数阶多项延迟微分方程的Jacobi谱配置方法

本文利用Jacobi谱配置方法数值求解了一类分数阶多项延迟微分方程,并证明了该方法是收敛的,通过若干数值算例验证了相应的理论结果,结果表明Jacobi谱配置方法求解这类方程是非常高效的,同时也为这类分数阶延迟微分方程的数值求解提供了新的选择,对分数阶泛函方程的数值方法的研究有一定的指导意义.     

基于组合神经网络的时间分数阶扩散方程计算方法

该文首次采用一种组合神经网络的方法，求解了一维时间分数阶扩散方程.组合神经网络是由径向基函数（RBF）神经网络与幂激励前向神经网络相结合所构造出的一种新型网络结构.首先，利用该网络结构构造出符合时间分数阶扩散方程条件的数值求解格式，同时设置误差函数，使原问题转化为求解误差函数极小值问题；然后，结合神经网络模型中的梯度下降学习算法进行循环迭代，从而获得神经网络的最优权值以及各项最优参数，最终得到问题的数值解.数值算例验证了该方法的可行性、有效性和数值精度.该文工作为时间分数阶扩散方程的求解开辟了一条新的途径.     

非线性对流-扩散方程的多区域拟谱方法

提出了非线性对流-扩散方程的多区域拟谱方法．在每个子区间上,该格式整体上按Legendre－Galerkin方法形成,但对于非线性项采用在 Legendre/Chebyshev－Gauss-Lobatto点上的配置法处理．通过选取适当的基函数,使得系数矩阵稀疏,并且可以并行计算,提高运算效率．给出了该方法的稳定性和收敛性分析,获得了按L2-模的最佳误差估计．最后给出单区域和多区域方法的数值算例,并加以比较．     

变系数双侧空间回火分数阶对流-扩散方程的隐式中点法

针对带非线性源项的变系数双侧空间回火分数阶对流-扩散方程,采用隐式中点法离散一阶时间偏导数,中心差商公式离散对流项,用二阶回火加权移位差分算子逼近左、右Riemann-Liouville空间回火分数阶偏导数,构造了一类新的数值格式.证明了数值方法的稳定性和收敛性,且方法在时间和空间均为二阶收敛.数值试验验证了数值方法的理论分析结果.     

A Superconsistent Chebyshev Collocation Method for Second-Order Differential Operators

A standard way to approximate the model problem –u =f, with u(±1)=0, is to collocate the differential equation at the zeros of T _n : x _i , i=1,...,n–1, having denoted by T _n the nth Chebyshev polynomial. We introduce an alternative set of collocation nodes z _i , i=1,...,n–1, which will provide better numerical performances. The approximated solution is still computed at the nodes {x _i }, but the equation is required to be satisfied at the new nodes {z _i }, which are determined by asking an extra degree of consistency in the discretization of the differential operator.     

对流扩散方程有限混合分析格式

介绍了对流扩散方程的混合有限分析法 ,得出了求解对流扩散方程隐式格式、离散算子 ,并且证明了这些格式解的存在性 ,分析了格式的截断误差     

Shift-and-Invert Krylov Methods for Time-Fractional Wave Equations

The article deals with evolution problems involving time derivatives of fractional order α, with 1 < α ≤2. The solutions are expressed in terms of operator Mittag-Leffler functions. The action of such operator functions is approximated by rational Krylov methods whose convergence features are investigated.     

多维广义SRLW方程的Chebyshev拟谱方法分析

考虑了一类多维的广义对称正则长波(SRLW)方程的齐次初边值问题Chebyshev拟谱逼近,构造了全离散的Chebyshev拟谱格式,给出了这种格式近似解的收敛性和最优误差估计。     

Generalized Jacobi and Gauss-Seidel Methods for Solving Linear System of Equations

The Jacobi and Gauss-Seidel algorithms are among the stationary iterative methods for solving linear system of equations. They are now mostly used as precondition-ers for the popular iterative solvers. In this paper a generalization of these methods are proposed and their convergence properties are studied. Some numerical experiments are given to show the efficiency of the new methods.     

Rational Chebyshev collocation method for solving higher‐order linear ordinary differential equations

A collocation method to find an approximate solution of higher‐order linear ordinary differential equation with variable coefficients under the mixed conditions is proposed. This method is based on the rational Chebyshev (RC) Tau method and Taylor‐Chebyshev collocation methods. The solution is obtained in terms of RC functions. Also, illustrative examples are included to demonstrate the validity and applicability of the technique, and performed on the computer using a program written in maple9. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1130–1142, 2011     

Second-Derivative-Free Variant of the Chebyshev Method for Nonlinear Equations

In this paper, we introduce a numerical method for nonlinear equations, based on the Chebyshev third-order method, in which the second-derivative operator is replaced by a finite difference between first derivatives. We prove a semilocal convergence theorem which guarantees local convergence with R-order three under conditions similar to those of the Newton-Kantorovich theorem, assuming the Lipschitz continuity of the second derivative. In a subsequent theorem, the latter condition is replaced by the weaker assumption of Lipschitz continuity of the first derivative.     

Generalized Convolution for the Discrete Jacobi Transformation

We study the translation and the convolution associated to the discrete Jacobi transformation on complex sequences of slow and rapid growth. Also we establish new topological properties for these spaces of sequences. This revised version was published online in June 2006 with corrections to the Cover Date.