求解边值问题的周期扩展集成RBF网络

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
N. Mai-Duy , Y.T. Gu , K. Le-Cao , C.M.T. Tien
{"title":"求解边值问题的周期扩展集成RBF网络","authors":"N. Mai-Duy ,&nbsp;Y.T. Gu ,&nbsp;K. Le-Cao ,&nbsp;C.M.T. Tien","doi":"10.1016/j.asoc.2025.113238","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, the radial basis function networks (RBFNs) are trained to extend a non-periodic function to become a periodic one in a rectangular domain, from which Cartesian-grid-based partial-differential-equation (PDE) solvers can be applied. The networks are constructed through integration instead of the usual differentiation. The presence of the integration constants results in a higher dimension space in the hidden layer, which enhances the quality of approximation of the networks. In addition, the resulting integrated basis functions are applied to sinusoidal functions, which guarantees that the approximating function in the extended domain is naturally periodic. With the RBF width, amplitude and phase shift being adjustable parameters, the equations representing the networks are nonlinear and they can be solved by using the Levenberg–Marquardt method. Numerical experiments demonstrate that the iterative convergence is fast, the residual is low and the approximating function in the extension domain possesses a low level of fluctuation. The proposed networks are then utilised in conjunction with some high-order discretisation methods based on RBFs to enable the PDE in a non-rectangular domain to be solved in a rectangular one. The task of discretising a continuous spatial domain is very economical as a simple Cartesian grid can be used to represent the computational/extended domain. Linear and nonlinear problems are considered and the IRBF results are compared with the analytic solutions and numerical results produced by the finite difference and finite element methods. Numerical experiments demonstrate that the high-order discretisation methods are still able to produce their fast rates of convergence.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"177 ","pages":"Article 113238"},"PeriodicalIF":7.2000,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Integrated RBF networks for periodic extensions for solving boundary value problems\",\"authors\":\"N. Mai-Duy ,&nbsp;Y.T. Gu ,&nbsp;K. Le-Cao ,&nbsp;C.M.T. Tien\",\"doi\":\"10.1016/j.asoc.2025.113238\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, the radial basis function networks (RBFNs) are trained to extend a non-periodic function to become a periodic one in a rectangular domain, from which Cartesian-grid-based partial-differential-equation (PDE) solvers can be applied. The networks are constructed through integration instead of the usual differentiation. The presence of the integration constants results in a higher dimension space in the hidden layer, which enhances the quality of approximation of the networks. In addition, the resulting integrated basis functions are applied to sinusoidal functions, which guarantees that the approximating function in the extended domain is naturally periodic. With the RBF width, amplitude and phase shift being adjustable parameters, the equations representing the networks are nonlinear and they can be solved by using the Levenberg–Marquardt method. Numerical experiments demonstrate that the iterative convergence is fast, the residual is low and the approximating function in the extension domain possesses a low level of fluctuation. The proposed networks are then utilised in conjunction with some high-order discretisation methods based on RBFs to enable the PDE in a non-rectangular domain to be solved in a rectangular one. The task of discretising a continuous spatial domain is very economical as a simple Cartesian grid can be used to represent the computational/extended domain. Linear and nonlinear problems are considered and the IRBF results are compared with the analytic solutions and numerical results produced by the finite difference and finite element methods. Numerical experiments demonstrate that the high-order discretisation methods are still able to produce their fast rates of convergence.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"177 \",\"pages\":\"Article 113238\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625005496\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625005496","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文训练径向基函数网络(rbfn)在矩形域上将非周期函数扩展为周期函数,从而应用基于笛卡尔网格的偏微分方程(PDE)求解方法。网络是通过集成而不是通常的微分来构建的。积分常数的存在使得隐层具有更高的维空间,从而提高了网络的逼近质量。此外,将得到的积分基函数应用于正弦函数,保证了扩展域中的近似函数是自然周期的。由于RBF的宽度、幅值和相移是可调参数,因此网络方程是非线性的,可以用Levenberg-Marquardt方法求解。数值实验表明,该方法迭代收敛快,残差小,扩展域近似函数波动小。然后将所提出的网络与一些基于rbf的高阶离散化方法结合使用,使非矩形域的偏微分方程能够在矩形域中求解。离散连续空间域的任务是非常经济的,因为一个简单的笛卡尔网格可以用来表示计算/扩展域。考虑了线性和非线性问题,并将IRBF结果与有限差分法和有限元法的解析解和数值结果进行了比较。数值实验表明,高阶离散化方法仍然具有较快的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integrated RBF networks for periodic extensions for solving boundary value problems
In this paper, the radial basis function networks (RBFNs) are trained to extend a non-periodic function to become a periodic one in a rectangular domain, from which Cartesian-grid-based partial-differential-equation (PDE) solvers can be applied. The networks are constructed through integration instead of the usual differentiation. The presence of the integration constants results in a higher dimension space in the hidden layer, which enhances the quality of approximation of the networks. In addition, the resulting integrated basis functions are applied to sinusoidal functions, which guarantees that the approximating function in the extended domain is naturally periodic. With the RBF width, amplitude and phase shift being adjustable parameters, the equations representing the networks are nonlinear and they can be solved by using the Levenberg–Marquardt method. Numerical experiments demonstrate that the iterative convergence is fast, the residual is low and the approximating function in the extension domain possesses a low level of fluctuation. The proposed networks are then utilised in conjunction with some high-order discretisation methods based on RBFs to enable the PDE in a non-rectangular domain to be solved in a rectangular one. The task of discretising a continuous spatial domain is very economical as a simple Cartesian grid can be used to represent the computational/extended domain. Linear and nonlinear problems are considered and the IRBF results are compared with the analytic solutions and numerical results produced by the finite difference and finite element methods. Numerical experiments demonstrate that the high-order discretisation methods are still able to produce their fast rates of convergence.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信