{"title":"求解边值问题的周期扩展集成RBF网络","authors":"N. Mai-Duy , Y.T. Gu , K. Le-Cao , 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 , Y.T. Gu , K. Le-Cao , 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}
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 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.