Training RBF neural networks for the solution of elliptic boundary value problems

https://doi.org/10.1016/j.camwa.2022.08.029Get rights and content

Abstract

We propose a radial basis function (RBF) neural network method for solving two- and three–dimensional second and fourth order elliptic boundary value problems (BVPs). The neural network in question is trained by minimizing a nonlinear least squares functional, thus determining the optimal values of the various RBF parameters involved. The functional minimization is carried out using standard MATLAB® software efficiently. Several numerical experiments are presented to demonstrate the efficacy of the proposed method.

Introduction

In recent decades, various meshless methods have been developed for solving boundary value problems (BVPs) in complicated geometries in two (2D) and three dimensions (3D). The main attraction of meshless methods is the simplicity of the solution process as no tedious domain or boundary discretization is required. Among all meshless methods, radial basis function collocation methods (RBFCMs) [4], [8], [18], [32] have become particularly popular. Traditionally, the radial basis function (RBF) centres are placed inside the domain. In [5], [25], however, the domain in which the RBF centres were placed was extended outside the domain of the BVP in question resulting in better performance of RBFCMs. In general, for elliptic partial differential equations (PDEs), in the RBFCM solution process both the PDE and the boundary conditions (BCs) are collocated at selected collocation points to form a linear system of equations Ax=b. Once the RBF weights x are determined by a linear solver, the approximate solution can be calculated anywhere in the domain. The above solution process seems simple and straightforward, but the determination of an appropriate value of the RBF shape parameter (or appropriate values in case shape parameters are varied), which greatly affects the accuracy of the approximation, is a challenge and needs to be addressed prior the RBFCM solution process.

In an alternative approach, RBF neural networks have, in recent years, been used extensively for function approximation and the solution of BVPs [1], [2], [3], [6], [7], [9], [10], [12], [13], [16], [17], [23], [26], [27], [30], see also [31, Sections 4.2-4.3] and [14, Section 5.3].

It is the purpose of this paper to use an RBF neural network method for the solution of second and fourth order BVPs in 2D and 3D. The formulation of the proposed method is motivated by the approach of Gorbachenko and his co-workers [1], [2], [3], [7], [10], [11], [12] and the training of the network is achieved by minimizing a nonlinear cost functional. The minimization is carried out using the MATLAB® optimization toolbox function lsqnonlin which is a nonlinear least–squares solver. In contrast to traditional RBFCMs in which the (troublesome) appropriate shape parameter value needs to be determined prior to the solution procedure, the proposed approach allows us to find the optimal locations of the RBF centres, shape parameter(s) values, and RBF centre weights simultaneously through the use of lsqnonlin. In the application of this function we provide the Jacobian of the corresponding nonlinear system which leads to substantial computational time savings enabling us to solve 3D problems in complex geometries efficiently and accurately.

The paper is organized as follows. In Section 2, we briefly describe how to use the nonlinear least-squares solver lsqnonlin. In Section 3, the formulation of the proposed neural network method for BVPs for second and fourth order PDEs is given. Four numerical examples in 2D and 3D with irregular or non–smooth domains are studied in Section 4, illustrating the effectiveness of the current approach. Finally, in Section 5, some conclusions and ideas for future work are provided.

Section snippets

Nonlinear minimization

As will be explained in the sequel, the satisfaction of the PDE and BCs of a second or fourth order BVP in 2D and 3D at a given set of sampling points by an RBF approximation yields systems of nonlinear equationsF(w):=[F1(w)F2(w)FM(w)]=0, in the N unknowns (w1,w2,,wN)T=w where, clearly, MN. The solution of system (2.1) may be recast as a nonlinear least squares minimization problem for the functionalS(w):=m=1MFm2, which we shall solve using the MATLAB® [28] optimization toolbox function

The problem

We first consider the BVP in R2 or R3 consisting of the PDELu=finΩ, subject to the BCBu=gonΩ, where in (3.1a) L is a second order elliptic operator and the operator B describes the BC.

The method

We shall now follow the approach of the key papers [7], [12]. In this case learning can be viewed as a regression problem and, more specifically, as an interpolation problem [14] which can be solved in a supervised fashion. The solution u of BVP (3.1a), (3.1b) is approximated by the RBF network [18]uN(x)=n=1NanΦ(

Numerical examples

We calculated the approximation uN at L test data points

in Ω from which we computed the maximum relative errorE=||uuN||,Ω||u||,Ω and the root mean square error E

We used the 2D and 3D Gaussian RBFsΦ(cn,rn)=ecnrn2, the derivatives of which required in the implementation of method are given in the Appendix.

The initial values of the shape parameters were uniformly distributed on an interval [dmin,dmax] using the formula (see [29])c0()=dmin+(dmaxdmin)(1)(N1),=1,,N. The

Conclusions

In this paper we approximate the solution of Poisson and biharmonic BVPs using an RBF neural network approach. We train the RBF neural network by minimizing a nonlinear cost functional, and this is carried out using the MATLAB® optimization toolbox function lsqnonlin. In extensive preliminary tests, we found that the Gaussian RBF is far superior to the multiquadric RBF (MQ) in terms of both accuracy and efficiency. As a result, we only present the results obtained using the Gaussian RBF. In

Acknowledgements

The second author gratefully acknowledges the financial support of the Ministry of Science and Technology (MOST), Taiwan, under the recruitment of visiting science and technology personnel with subsidies (109-2811-E-002-516 and 110-2811-E-002-518).

References (33)

  • S.A. Sarra et al.

    A random variable shape parameter strategy for radial basis function approximation methods

    Eng. Anal. Bound. Elem.

    (2009)
  • H. Zheng et al.

    A local radial basis function collocation method for band structure computation of 3D phononic crystals

    Appl. Math. Model.

    (2020)
  • M.M. Alqezweeni et al.

    Solution of partial differential equations on radial basis functions networks

    (2019)
  • M.M. Alqezweeni et al.

    Efficient solving of boundary value problems using radial basis function networks learned by trust region method

    Int. J. Math. Math. Sci.

    (2018)
  • V. Antonov et al.

    Unified approach to constructing the neural network models of real objects. Part 1

    Math. Methods Appl. Sci.

    (2018)
  • C.S. Chen et al.

    The method of particular solutions for solving certain partial differential equations

    Numer. Methods Partial Differ. Equ.

    (2012)
  • Cited by (0)

    View full text