Mai-Duy N, Tran-Cong T
Faculty of Engineering and Surveying, University of Southern Queensland, Toowoomba, Australia.
Neural Netw. 2001 Mar;14(2):185-99. doi: 10.1016/s0893-6080(00)00095-2.
This paper presents mesh-free procedures for solving linear differential equations (ODEs and elliptic PDEs) based on multiquadric (MQ) radial basis function networks (RBFNs). Based on our study of approximation of function and its derivatives using RBFNs that was reported in an earlier paper (Mai-Duy, N. & Tran-Cong, T. (1999). Approximation of function and its derivatives using radial basis function networks. Neural networks, submitted), new RBFN approximation procedures are developed in this paper for solving DEs, which can also be classified into two types: a direct (DRBFN) and an indirect (IRBFN) RBFN procedure. In the present procedures, the width of the RBFs is the only adjustable parameter according to a(i) = betad(i), where d(i) is the distance from the ith centre to the nearest centre. The IRBFN method is more accurate than the DRBFN one and experience so far shows that beta can be chosen in the range 7 < or = beta 10 for the former. Different combinations of RBF centres and collocation points (uniformly and randomly distributed) are tested on both regularly and irregularly shaped domains. The results for a 1D Poisson's equation show that the DRBFN and the IRBFN procedures achieve a norm of error of at least O(1.0 x 10(-4)) and O(1.0 x 10(-8)), respectively, with a centre density of 50. Similarly, the results for a 2D Poisson's equation show that the DRBFN and the IRBFN procedures achieve a norm of error of at least O(1.0 x 10(-3)) and O(1.0 x10(-6)) respectively, with a centre density of 12 X 12.
本文提出了基于多二次(MQ)径向基函数网络(RBFN)求解线性微分方程(常微分方程和椭圆型偏微分方程)的无网格方法。基于我们在早期一篇论文(Mai-Duy, N. & Tran-Cong, T. (1999). Approximation of function and its derivatives using radial basis function networks. Neural networks, submitted)中对使用RBFN逼近函数及其导数的研究,本文开发了用于求解微分方程的新RBFN逼近方法,这些方法也可分为两类:直接(DRBFN)和间接(IRBFN)RBFN方法。在当前方法中,径向基函数的宽度是唯一的可调参数,其根据a(i) = betad(i)确定,其中d(i)是第i个中心到最近中心的距离。IRBFN方法比DRBFN方法更精确,到目前为止的经验表明,对于前者,β可在7≤β≤10的范围内选择。在规则和不规则形状的区域上测试了RBF中心和配置点(均匀和随机分布)的不同组合。一维泊松方程的结果表明,DRBFN和IRBFN方法在中心密度为50时,分别实现了至少O(1.0 x 10(-4))和O(1.0 x 10(-8))的误差范数。同样,二维泊松方程的结果表明,DRBFN和IRBFN方法在中心密度为12×12时,分别实现了至少O(1.0 x 10(-3))和O(1.0 x 10(-6))的误差范数。