Next Article in Journal
An OpenCL-Based FPGA Accelerator for Faster R-CNN
Next Article in Special Issue
LMI-Based Delayed Output Feedback Controller Design for a Class of Fractional-Order Neutral-Type Delay Systems Using Guaranteed Cost Control Approach
Previous Article in Journal
On the Genuine Relevance of the Data-Driven Signal Decomposition-Based Multiscale Permutation Entropy
Previous Article in Special Issue
Fractional Survival Functional Entropy of Engineering Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Determination of an Extremal in Two-Dimensional Variational Problems Based on the RBF Collocation Method

by
Ahmad Golbabai
*,
Nima Safaei
and
Mahboubeh Molavi-Arabshahi
School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846-13114, Iran
*
Author to whom correspondence should be addressed.
Entropy 2022, 24(10), 1345; https://doi.org/10.3390/e24101345
Submission received: 22 June 2022 / Revised: 26 July 2022 / Accepted: 28 July 2022 / Published: 23 September 2022

Abstract

:
This paper introduces a direct method derived from the global radial basis function (RBF) interpolation over arbitrary collocation nodes occurring in variational problems involving functionals that depend on functions of a number of independent variables. This technique parameterizes solutions with an arbitrary RBF and transforms the two-dimensional variational problem (2DVP) into a constrained optimization problem via arbitrary collocation nodes. The advantage of this method lies in its flexibility in selecting between different RBFs for the interpolation and parameterizing a wide range of arbitrary nodal points. Arbitrary collocation points for the center of the RBFs are applied in order to reduce the constrained variation problem into one of a constrained optimization. The Lagrange multiplier technique is used to transform the optimization problem into an algebraic equation system. Three numerical examples indicate the high efficiency and accuracy of the proposed technique.

1. Introduction

The purpose of the calculus of variations is to find functionals achieving the extremal (maximum or minimum) value. The direct approaches convert the variational problems (VPs) into a mathematical programming problem. Schechter [1] adopted the direct scheme of Galerkin and Ritz to approximate VPs. The authors of [2,3,4,5,6,7] introduced the Walsh series method, Legendre wavelets technique, Legendre polynomials, Laguerre polynomials, Chebyshev series and differential transformation method, respectively. Yousefi and Dehghan [8] applied the He’s variational iteration technique to simulate variational problems. Recently, Golbabai and Saeedi [9] used a meshless method to approximate VPs arising from a dynamic investment model.
In this paper, we introduce a numerical approach for approximating the two-dimensional variational problem (2DVP) for functionals depending on the function of several independent variables in the following form:
J [ z ( x , y ) ] = Ω F ( x , y , z ( x , y ) , x z ( x , y ) , y z ( x , y ) ) d x d y ,
in which x and y are the independent variables of which z ( x , y ) is a continuous function with continuous partial derivatives x z ( x , y ) , y z ( x , y ) with respect to x and y, respectively. The symbol Ω = [ x α , x β ] × [ y α , y β ] represents the area of the fixed region in the xy plane.
In this work, we introduce the radial basis function (RBF) collocation method to simulate 2DVPs for functionals depending on the function of several independent variables. The presented strategy parameterizes the solutions with arbitrary global RBFs (GRBFs) and transforms the 2DVP into a constrained optimization problem by means of arbitrary collocation nodes. One may select the interpolation function from the family of GRBFs, such as the multiquadric (MQ), Gaussian (GA), inverse multiquadric (IMQ), etc., functions. A major benefit of the RBF method is its arbitrary discretization. The proposed technique does not require a node grid for discretizing and provides a higher level of flexibility in selecting the collocation points. By means of the Legendre–Gauss–Lobatto (LGL) quadrature and the method of Lagrange multipliers, the problem is reduced to an algebraic equation system. After solving the algebraic equations, the unknown coefficients can be obtained.
The layout of the current paper is organized as follows: Section 2 introduces some properties of RBFs. Section 3 uses the RBF collocation method to solve variational problems for functionals depending on the function of several independent variables. Section 4 presents three numerical examples illustrating the accuracy of the RBF collocation method. Finally, Section 5 contains the concluding remarks.

2. Properties of RBFs

RBFs are very powerful mathematical tools and deserve special attention in the field of computational science. Hardy [10] first introduced the RBFs interpolation to approximate two-dimensional geographical surfaces based on scattered data. Later, Kansa [11,12] first adopted the MQ-RBF collocation technique to approximate PDEs of parabolic, elliptic and hyperbolic types. Recently, Golbabai et al. [13,14] used an RBF collocation technique for a nonlinear models. The meshfree RBF method is used in both local and global forms. Some authors have tried localized-RBF-based strategies, such as the localized-RBF-generated FD (RBF-FD) [15,16,17,18,19,20,21,22,23,24] and the RBF partition of unity (RBF-PU) [25,26,27,28,29,30,31,32,33,34,35].
Let ( x k , y k ) , k = 1 , , N be a given set of distinct centers. The approximation of a function F ( x , y ) using RBFs may be written as a linear combination
F ( x , y ) = k = 1 N a k ϕ k ( x , y ) = k = 1 N a k ϕ ( ( x , y ) ( x k , y k ) ) ,
in which ( x , y ) ( x k , y k ) = ( x x k ) 2 + ( y y k ) 2 , ( x k , y k ) are centers and a k are unknown coefficients for k = 1 , , N . Table 1 and Figure 1 illustrate some RBFs mathematically and graphically, respectively, where r = ( x , y ) ( x k , y k ) and . denote the Euclidean norm and c is a positive shape (SP) which controls the width (flatness) of the basis function.
Suppose that z ( x k , y k ) , k = 1 , , N is a finite set of distinct nodal points. The unknown coefficients { a k } k = 1 N are determined so that F ( x k , y k ) = z k for k = 1 , , N , which results in the linear system as follows
A a 1 a 2 a N = z 1 z 2 z N ,
where the entries of the matrix A are A i j = ϕ ( ( x i , y i ) ( x j , y j ) ) , i , j = 1 , , N [36,37]. Since we choose ϕ to have global support, this method causes a dense matrix A . The matrix A has been proven to be positive definite for distinct interpolation nodes. Micchelli [38] proved that the matrix A was positive definite for GA, IMQ and TPS RBF and conditionally positive definite for the MQ RBF method.

2.1. SP Strategies

The selection of the SP has a considerable effect on the stability and accuracy of an RBF method. There are different methods to select SPs. The most common are computing errors with distinct SPs and selecting the best one. SPs are categorized into two classes: constant and variable SPs.

2.1.1. Constant SPs

Constant SPs can be considered by Hardy and Franke’s formulas as follows:
  • Hardy’s SP [10]
    c = 1 0.815 d , d = 1 N i = 1 N d i ,
    in which N and d i represent the total number of centers and the distance from the ith center to the nearest neighbor, respectively.
  • Franke’s SP [39]
    c = N 1.25 D ,
    in which N and D denote the total number of centers and the diameter of the smallest circle encompassing all the center locations, respectively.

2.1.2. Variable SPs

A variable SP approach utilizes a different SP value at every center. This facilitates obtaining a different entry in the RBF matrices, leading to a lower condition number. Here, we list a number of variable SPs:
  • Exponentially SP (ESP) [11]
    c j = c min 2 c max 2 c min 2 j 1 N 1 1 2 , j = 1 , , N
  • Sinusoidal SP (SSP) [40]
    c j = c min + c max c min sin ( j 1 ) π 2 ( N 1 ) , j = 1 , , N
  • Linear SP (LSP) [12]
    c j = c min + c max c min N j , j = 1 , , N
  • Random SP (RSP) [41]
    c j = c min + c max c min N r a n d ( 1 , N ) , j = 1 , , N
    where c max and c min represent the maximum and minimum of c j ’s, respectively.

3. Numerical Solution of the Model

This section uses the RBF collocation technique to simulate variational problems for functionals depending on a function of several independent variables based on interpolating (GRBFs) over arbitrary collocation nodes. Let us find the extremal values of the following functional,
J [ z ( x , y ) ] = Ω F ( x , y , z ( x , y ) , x z ( x , y ) , y z ( x , y ) ) d x d y ,
with the given boundary conditions (BCs) of the form
z ( x , y ) = g ( x , y ) , ( x , y ) Ω .
In order to provide a framework with a higher flexibility, different groups of collocation points, containing nodes with equal and unequal spacing, could be arbitrarily selected for the discretization. For instance, a set of Chebyshev–Gauss (CG), Gauss–Legendre (GL), Gauss–Lobatto (GLO), Gauss–Laguerre (GLA), Legendre–Gauss–Lobatto (LGL) and Chebyshev–Gauss–Lobatto (CGL) points can be chosen as a set of unequally spaced orthogonal points to approximate the desired model [42,43]. Now, we consider the following 2DVP for functionals depending on the function of several independent variables of Equations (9) and (10). The solution z ( x , y ) is approximated using RBFs as
z ( x , y ) z N , M ( x , y ) = i = 1 N j = 1 M a i j ϕ ( ( x , y ) ( x i , y i ) ) = i = 1 N j = 1 M a i j ϕ i j ( x , y ) ,
where z N , M ( x , y ) denotes the RBF interpolation of z ( x , y ) . Furthermore, ϕ i j ( x , y ) = ϕ ( ( x , y ) ( x i , y j ) ) denotes an RBF and a i j represent the RBF weights related to z N , M ( x , y ) .
Theorem 1.
Let z N , M ( x , y ) = i = 1 N j = 1 M a i j ϕ i j ( x , y ) and ϕ ( r ) = e c r 2 , then there exist partial derivatives with respect to x and y as follows:
x z N , M ( x , y ) = i = 1 N j = 1 M 2 c a i j ( x x i ) ϕ i j ( x , y ) ,
y z N , M ( x , y ) = i = 1 N j = 1 M 2 c a i j ( y y j ) ϕ i j ( x , y ) .
Proof. 
According to the definition of RBFs, r = ( x , y ) ( x i , y j ) = ( x x i ) 2 + ( y y j ) 2 1 2 , then the chain rule implies
x ϕ ( r ) = d d r ϕ ( r ) x r ( x , y ) = 2 c r ϕ ( r ) ( x x i ) ( x x i ) 2 + ( y y j ) 2 1 2
= 2 c ( x x i ) ϕ ( r ) .
Now, we obtain the partial derivative of z N , M ( x , y ) with respect to x,
x z N , M ( x , y ) = i = 1 N j = 1 M a i j x ϕ i j ( x , y ) = i = 1 N j = 1 M 2 c a i j ( x x i ) ϕ i j ( x , y ) .
Subsequently, we can obtain the partial derivative of z N , M ( x , y ) with respect to y. □
Theorem 2.
Let z N , M ( x , y ) = i = 1 N j = 1 M a i j ϕ i j ( x , y ) and ϕ ( r ) = c 2 + r 2 , then there exist partial derivatives with respect to x and y as follows:
x z N , M ( x , y ) = i = 1 N j = 1 M a i j ( x x i ) ( ϕ i j ( x , y ) ) 1 ,
y z N , M ( x , y ) = i = 1 N j = 1 M a i j ( y y j ) ( ϕ i j ( x , y ) ) 1 .
Proof. 
According to the definition of RBFs, r = ( x , y ) ( x i , y j ) = ( x x i ) 2 + ( y y j ) 2 1 2 . Then, the chain rule implies
x ϕ ( r ) = d d r ϕ ( r ) x r ( x , y ) = r ( ϕ ( r ) ) 1 ( x x i ) ( x x i ) 2 + ( y y j ) 2 1 2
= ( x x i ) ( ϕ ( r ) ) 1 .
Now, we obtain the partial derivative of z N , M ( x , y ) with respect to x,
x z N , M ( x , y ) = i = 1 N j = 1 M a i j x ϕ i j ( x , y ) = i = 1 N j = 1 M a i j ( x x i ) ( ϕ i j ( x , y ) ) 1 .
Correspondingly, we can achieve the partial derivative of z N , M ( x , y ) with respect to y.  □
Now, by substituting Equation (11) and the partial derivatives obtained from Theorem 1 or Theorem 2 in Equations (9) and (10), we have
y α y β x α x β F ( x , y , z ( x , y ) , x z ( x , y ) , y z ( x , y ) ) d x d y = y α y β x α x β F ( x , y , i = 1 N j = 1 M a i j
ϕ i j ( x , y ) , i = 1 N j = 1 M a i j x ϕ i j ( x , y ) , i = 1 N j = 1 M a i j y ϕ i j ( x , y ) ) d x d y .
i = 1 N j = 1 M a i j ϕ i j ( x , y ) = g ( x , y ) , ( x , y ) Ω
By applying LGL quadrature, we can approximate Equation (16) as follows,
y α y β x α x β F ( x , y , i = 1 N j = 1 M a i j ϕ i j ( x , y ) , i = 1 N j = 1 M a i j x ϕ i j ( x , y ) , i = 1 N j = 1 M a i j y ϕ i j ( x , y ) ) d x d y ,
= ( y β y α ) 2 ( x β x α ) 2 k 1 = 1 N k 2 = 1 M F ( x k 1 , y k 2 , i = 1 N j = 1 M a i j ϕ i j ( x k 1 , y k 2 ) , i = 1 N j = 1 M a i j x ϕ i j ( x k 1 , y k 2 ) ,
i = 1 N j = 1 M a i j y ϕ i j ( x k 1 , y k 2 ) ) ,
in which x k 1 = x β x α 2 t k + x β + x α 2 and y k 2 = y β y α 2 t k + y β + y α 2 , t k denote the nodes LGL and w k 1 , w k 2 represent the LGL weights associated with LGL nodes t k [ 1 , 1 ] , described as
w k = 2 ( N 1 ) N P N 1 ( t k ) 2 k = 1 , , M ,
in which P N 1 denotes a Legendre polynomial of degree N 1 [44] and x i represent the RBF centers.
Finally, the constrained variational problem for functionals depending on the function of several independent variables of Equations (9) and (10) reduces to a constrained optimization problem
J ( a ) = ( y β y α ) 2 ( x β x α ) 2 k 1 = 1 N k 2 = 1 M F ( x k 1 , y k 2 , i = 1 N j = 1 M a i j ϕ i j ( x k 1 , y k 2 ) , i = 1 N j = 1 M a i j
x ϕ i j ( x k 1 , y k 2 ) , i = 1 N j = 1 M a i j y ϕ i j ( x k 1 , y k 2 ) ) ,
subject to
i = 1 N j = 1 M a i j ϕ i j ( x , y ) = g ( x , y ) , ( x , y ) Ω .
To solve the optimization problem of Equations (19) and (20), we adopt a Lagrange multipliers scheme and transform the problem into the following unconstrained optimization problem, so that,
J ( a ) = J ( a ) + λ i = 1 N j = 1 M a i j ϕ i j ( x , y ) g ( x , y ) .
where λ is the Lagrange multiplier related to the BCs. The unknown coefficients a i j , i = 1 , , N , j = 1 , , M can be determined after solving the system as follows:
J ( a ) a i j = 0 , i = 1 , , N , j = 1 , , M ,
J ( a ) λ = 0 .

4. Numerical Experiments

This section considers three 2DVPs involving functionals that depend on functions of more than one independent variable to demonstrate the effectiveness of the presented technique. The numerical results indicate the advantages of this approach over the upwind technique, variational iteration scheme and other numerical techniques. In three test problems, different values of the SP and the data centers including uniform and Chebyshev nodes were adopted to show the advantage of the proposed strategy. For this aim, we defined the L and L rms norm errors to assess the efficiency and accuracy as:
L = max 1 i , j N , M z ( x i , y j ) z N , M ( x i , y j ) , L rms = 1 N + M i = 1 N j = 1 M z ( x i , y j ) z N , M ( x i , y j ) 2 ,
where z ( x i , y j ) and z N , M ( x i , y j ) represent the exact and approximate solutions, respectively. Figure 2 shows the uniformly distributed and Chebyshev nodes. All numerical simulations were done by using MATLAB R2013b on a computer system having a configuration with 4.00 GB of RAM.
Example 1.
Let us consider the following 2DVP of finding the extremal of the functional
J [ z ( x , y ) ] = 0 1 0 1 z x 2 z y 2 d x d y ,
with the BCs
z ( x , 0 ) = sin ( π x ) , z ( 0 , y ) = 0 , z ( 1 , y ) = 0 .
The exact solution of this problem is z ( x , y ) = sin ( π x ) cos ( π y ) .
Table 2 lists the L and L rms error norms for several values of c with the uniform and Chebyshev nodes. In view of Table 2, we see that the accuracy of the numerical solution for uniform nodes is significantly better than that for Chebyshev nodes. Moreover, Table 3 shows the exact and approximate values of z 4 , 4 ( x , y ) based on the proposed method. Figure 3 displays the exact and approximate solutions as well as the numerical errors with uniform and Chebyshev nodes at c = 10 2 and N x × N y = 31 × 31 . Finally, Figure 4 represents the behavior of the numerical errors for constant and variable SPs.
Example 2.
Consider the following 2DVP
J [ z ( x , y ) ] = 0 1 0 1 2 z 2 + z z x + 1 2 ( z y ) 2 d x d y ,
with the BCs
z ( x , 0 ) = 0 , z ( 0 , y ) = 0 , z ( 1 , y ) = 0 ,
so that exact solution is as:
z ( x , y ) = sin ( π 2 x ) sin ( 2 y ) .
Table 4 compares the L and L rms error norms with uniform and Chebyshev nodes at different values of c and global data centers. Figure 5 shows the exact and approximate solutions as well as the numerical errors with uniform and Chebyshev nodes at c = 10 2 , N x × N y = 25 × 25 . Finally, Figure 6 displays the behavior of the numerical errors for constant and variable SPs.
Example 3.
Finally, we consider the following 2DVP
J [ z ( x , y ) ] = 0 1 0 1 z 2 + ( z x ) 2 + z x z y + ( z y ) 2 d x d y ,
with the BCs
z ( x , 0 ) = e x , z ( 0 , y ) = e y , z ( 1 , y ) = e y 1 ,
so that the exact solution has the following form:
z ( x , y ) = e x e y .
Table 5 compares the L and L rms error norms with uniform and Chebyshev nodes at different values of SPs, c and global data centers. Figure 7 shows the exact and approximate solutions as well as the numerical errors with uniform and Chebyshev nodes at c = 10 2 , N x × N y = 31 × 31 . Finally, Figure 8 displays the behavior of the numerical errors for constant and variable SPs with N x × N y = 31 × 31 .

5. Final Remarks

Variational problems with multiple integrals occur in various applications. This paper studied the RBF collocation scheme to solve the 2DVP containing functionals that depend on the function of more than one independent variable. Moreover, this method was extended to problems of higher dimensions. The main aim of this work was to present an RBF collocation technique that did not need mesh generation to estimate the solution of 2DVP. Combining the RBF collocation technique with the Legendre–Gauss–Lobatto quadrature reduces the 2DVP to an algebraic equation system. A variable shape parameter approach was introduced for the accuracy and stability of the RBF technique. Finally, numerical experiments validated the efficiency of the presented method.

Author Contributions

Data curation, M.M.-A.; Formal analysis, A.G.; Funding acquisition, N.S.; Methodology, N.S. and M.M.-A.; Project administration, A.G.; Resources, N.S.; Writing—original draft, A.G.; Writing—review & editing, N.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not Applicable.

Acknowledgments

The authors are thankful to the referees for their valuable comments and constructive suggestions towards the improvement of the original paper.

Conflicts of Interest

The authors declare no competing interests.

References

  1. Schechter, R.S. The Variational Method in Engineering; McGraw-Hill: New York, NY, USA, 1967. [Google Scholar]
  2. Chen, C.; Hsiao, C. A Walsh series direct method for solving variational problems. J. Frankl. Inst. 1975, 300, 265–280. [Google Scholar] [CrossRef]
  3. Razzaghi, M.; Yousefi, S. Legendre wavelets direct method for variational problems. Math. Comput. Simul. 2000, 53, 185–192. [Google Scholar] [CrossRef]
  4. Chang, R.; Wang, M. Shifted Legendre direct method for variational problems. J. Optim. Theory Appl. 1983, 39, 299–307. [Google Scholar] [CrossRef]
  5. Hwang, C.; Shih, Y. Laguerre series direct method for variational problems. J. Optim. Theory Appl. 1983, 39, 143–149. [Google Scholar] [CrossRef]
  6. Horng, I.R.; Chou, J.H. Shifted Chebyshev direct method for solving variational problems. Int. J. Syst. Sci. 1985, 16, 855–861. [Google Scholar] [CrossRef]
  7. Saadatmandi, A.; Abdolahi-Niasar, T. An analytic study on the Euler-Lagrange equation arising in calculus of variations. Comput. Methods Differ. Equ. 2014, 2, 140–152. [Google Scholar]
  8. Yousefi, S.A.; Dehghan, M. The use of He’s variational iteration method for solving variational problems. Int. J. Comput. Math. 2010, 87, 1299–1314. [Google Scholar] [CrossRef]
  9. Golbabai, A.; Saeedi, A. An investigation of radial basis function approximation methods with application in dynamic investment model. Iran. J. Sci. Technol. 2015, 39, 221. [Google Scholar]
  10. Hardy, R.L. Multiquadric equations of topography and other irregular surfaces. J. Geophys. Res. 1971, 76, 1905–1915. [Google Scholar] [CrossRef]
  11. Kansa, E.J. Multiquadrics—A scattered data approximation scheme with applications to computational fluid-dynamics—I surface approximations and partial derivative estimates. Comput. Math. Appl. 1990, 19, 127–145. [Google Scholar] [CrossRef]
  12. Kansa, E.J. Multiquadrics—A scattered data approximation scheme with applications to computational fluid-dynamics—II solutions to parabolic, hyperbolic and elliptic partial differential equations. Comput. Math. Appl. 1990, 19, 147–161. [Google Scholar] [CrossRef]
  13. Nikan, O.; Golbabai, A.; Nikazad, T. Solitary wave solution of the nonlinear KdV-Benjamin-Bona-Mahony-Burgers model via two meshless methods. Eur. Phys. J. Plus 2019, 134, 1–14. [Google Scholar] [CrossRef]
  14. Golbabai, A.; Safdari-Vaighani, A. Collocation methods based on radial basis functions for the coupled Klein–Gordon–Schrödinger equations. Electron. Trans. Numer. Anal. 2012, 39, 22–31. [Google Scholar]
  15. Nikan, O.; Molavi-Arabshai, S.M.; Jafari, H. Numerical simulation of the nonlinear fractional regularized long-wave model arising in ion acoustic plasma waves. Discret. Contin. Dyn. Syst. S 2021, 14, 3685. [Google Scholar] [CrossRef]
  16. Can, N.H.; Nikan, O.; Rasoulizadeh, M.N.; Jafari, H.; Gasimov, Y.S. Numerical computation of the time non-linear fractional generalized equal width model arising in shallow water channel. Therm. Sci. 2020, 24, 49–58. [Google Scholar] [CrossRef]
  17. Avazzadeh, Z.; Nikan, O.; Machado, J.A.T. Solitary wave solutions of the generalized Rosenau-KdV-RLW equation. Mathematics 2020, 8, 1601. [Google Scholar] [CrossRef]
  18. Nikan, O.; Avazzadeh, Z.; Machado, J.T. A local stabilized approach for approximating the modified time-fractional diffusion problem arising in heat and mass transfer. J. Adv. Res. 2021, 32, 45–60. [Google Scholar] [CrossRef]
  19. Rasoulizadeh, M.; Ebadi, M.; Avazzadeh, Z.; Nikan, O. An efficient local meshless method for the equal width equation in fluid mechanics. Eng. Anal. Bound. Elem. 2021, 131, 258–268. [Google Scholar] [CrossRef]
  20. Nikan, O.; Avazzadeh, Z.; Machado, J.T. An efficient local meshless approach for solving nonlinear time-fractional fourth-order diffusion model. J. King Saud Univ. Sci. 2021, 33, 101243. [Google Scholar] [CrossRef]
  21. Nikan, O.; Avazzadeh, Z.; Machado, J.T. Numerical study of the nonlinear anomalous reaction-subdiffusion process arising in the electroanalytical chemistry. J. Comput. Sci. 2021, 53, 101394. [Google Scholar] [CrossRef]
  22. Nikan, O.; Avazzadeh, Z. An improved localized radial basis-pseudospectral method for solving fractional reaction–subdiffusion problem. Results Phys. 2021, 23, 104048. [Google Scholar] [CrossRef]
  23. Rasoulizadeh, M.; Nikan, O.; Avazzadeh, Z. The impact of LRBF-FD on the solutions of the nonlinear regularized long wave equation. Math. Sci. 2021, 15, 365–376. [Google Scholar] [CrossRef]
  24. Nikan, O.; Avazzadeh, Z.; Machado, J.T. Numerical approximation of the nonlinear time-fractional telegraph equation arising in neutron transport. Commun. Nonlinear Sci. Numer. Simul. 2021, 99, 105755. [Google Scholar] [CrossRef]
  25. Nikan, O.; Avazzadeh, Z.; Machado, J.T. Numerical simulation of a degenerate parabolic problem occurring in the spatial diffusion of biological population. Chaos Solit. Fractals 2021, 151, 111220. [Google Scholar] [CrossRef]
  26. Nikan, O.; Avazzadeh, Z. An efficient localized meshless technique for approximating nonlinear sinh-Gordon equation arising in surface theory. Eng. Anal. Bound. Elem. 2021, 130, 268–285. [Google Scholar] [CrossRef]
  27. Nikan, O.; Avazzadeh, Z.; Rasoulizadeh, M. Soliton solutions of the nonlinear sine-Gordon model with Neumann boundary conditions arising in crystal dislocation theory. Nonlinear Dyn. 2021, 106, 783–813. [Google Scholar] [CrossRef]
  28. Nikan, O.; Avazzadeh, Z. A localisation technique based on radial basis function partition of unity for solving Sobolev equation arising in fluid dynamics. Appl. Math. Comput. 2021, 401, 126063. [Google Scholar] [CrossRef]
  29. Nikan, O.; Avazzadeh, Z.; Rasoulizadeh, M. Soliton wave solutions of nonlinear mathematical models in elastic rods and bistable surfaces. Eng. Anal. Bound. Elem. 2022, 143, 14–27. [Google Scholar] [CrossRef]
  30. Nikan, O.; Avazzadeh, Z.; Machado, J.T. Numerical treatment of microscale heat transfer processes arising in thin films of metals. Int. Commun. Heat Mass Transf. 2022, 132, 105892. [Google Scholar] [CrossRef]
  31. Nikan, O.; Avazzadeh, Z. Coupling of the Crank–Nicolson scheme and localized meshless technique for viscoelastic wave model in fluid flow. J. Comput. Appl. Math. 2021, 398, 113695. [Google Scholar] [CrossRef]
  32. Nikan, O.; Avazzadeh, Z. A locally stabilized radial basis function partition of unity technique for the sine–Gordon system in nonlinear optics. Math. Comput. Simul. 2022, 199, 394–413. [Google Scholar] [CrossRef]
  33. Nikan, O.; Avazzadeh, Z.; Machado, J.; Rasoulizadeh, M. An accurate localized meshfree collocation technique for the telegraph equation in propagation of electrical signals. Eng. Comput. 2022, 1–18. [Google Scholar] [CrossRef]
  34. Nikan, O.; Avazzadeh, Z.; Machado, J.T. Numerical approach for modeling fractional heat conduction in porous medium with the generalized Cattaneo model. Appl. Math. Model. 2021, 100, 107–124. [Google Scholar] [CrossRef]
  35. Nikan, O.; Avazzadeh, Z. Numerical simulation of fractional evolution model arising in viscoelastic mechanics. Appl. Numer. Math. 2021, 169, 303–320. [Google Scholar] [CrossRef]
  36. Buhmann, M.D. Radial Basis Functions: Theory and Implementations; Cambridge University Press: Cambridge, UK, 2003; Volume 12. [Google Scholar]
  37. Wendland, H. Scattered Data Approximation; Cambridge University Press: Cambridge, UK, 2005. [Google Scholar]
  38. Micchelli, C.A. Interpolation of scattered data: Distance matrices and conditionally positive definite functions. In Approximation Theory and Spline Functions; Springer: Berlin/Heidelberg, Germany, 1984; pp. 143–145. [Google Scholar]
  39. Franke, R. A Critical Comparison of Some Methods for Interpolation of Scattered Data; Technical Report; Naval Postgraduate School: Monterey, CA, USA, 1979. [Google Scholar]
  40. Golbabai, A.; Rabiei, H. A meshfree method based on radial basis functions for the eigenvalues of transient Stokes equations. Eng. Anal. Bound. Elem. 2012, 36, 1555–1559. [Google Scholar] [CrossRef]
  41. Sarra, S.A.; Sturgill, D. A random variable shape parameter strategy for radial basis function approximation methods. Eng. Anal. Bound. Elem. 2009, 33, 1239–1245. [Google Scholar] [CrossRef]
  42. Mirinejad, H.; Inanc, T. An RBF collocation method for solving optimal control problems. Robot. Auton. Syst. 2017, 87, 219–225. [Google Scholar] [CrossRef]
  43. Rad, J.A.; Kazem, S.; Parand, K. Radial basis functions approach on optimal control problems: A numerical investigation. J. Vib. Control 2014, 20, 1394–1416. [Google Scholar] [CrossRef]
  44. Canuto, C.; Hussaini, M.Y.; Quarteroni, A.; Zang, T.A. Spectral Methods: Fundamentals in Single Domains; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
Figure 1. Illustration of some RBFs.
Figure 1. Illustration of some RBFs.
Entropy 24 01345 g001
Figure 2. Illustration of the uniformly distributed and Chebyshev nodes.
Figure 2. Illustration of the uniformly distributed and Chebyshev nodes.
Entropy 24 01345 g002
Figure 3. The behavior of exact and approximate solutions as well as numerical errors with c = 10 2 and N = 31 × 31 in Example 1.
Figure 3. The behavior of exact and approximate solutions as well as numerical errors with c = 10 2 and N = 31 × 31 in Example 1.
Entropy 24 01345 g003
Figure 4. The behavior of numerical errors for constant and variable SPs with N = 31 × 31 in Example 1.
Figure 4. The behavior of numerical errors for constant and variable SPs with N = 31 × 31 in Example 1.
Entropy 24 01345 g004
Figure 5. The behavior of exact and approximate solutions as well as numerical errors with c = 10 2 , N = 25 × 25 in Example 2.
Figure 5. The behavior of exact and approximate solutions as well as numerical errors with c = 10 2 , N = 25 × 25 in Example 2.
Entropy 24 01345 g005
Figure 6. The behavior of numerical errors for constant and variable SPs with N = 31 × 31 in Example 2.
Figure 6. The behavior of numerical errors for constant and variable SPs with N = 31 × 31 in Example 2.
Entropy 24 01345 g006
Figure 7. The behavior of exact and approximate solutions as well as numerical errors with c = 10 2 and N = 31 × 31 in Example 3.
Figure 7. The behavior of exact and approximate solutions as well as numerical errors with c = 10 2 and N = 31 × 31 in Example 3.
Entropy 24 01345 g007
Figure 8. The behavior of numerical errors for constant and variable SPs with N = 31 × 31 in Example 3.
Figure 8. The behavior of numerical errors for constant and variable SPs with N = 31 × 31 in Example 3.
Entropy 24 01345 g008
Table 1. Mathematical form of some RBFs, ( r = ( x , y ) ( x i , y j ) , c > 0 ).
Table 1. Mathematical form of some RBFs, ( r = ( x , y ) ( x i , y j ) , c > 0 ).
Name ϕ ( r )
Inverse quadratic (IQ) ϕ ( r ) = 1 r 2 + c 2
Multiquadric (MQ) ϕ ( r ) = ( c 2 + r 2 ) 1 / 2
Gaussian (GA) ϕ ( r ) = e c r 2
Inverse multiquadric (IMQ) ϕ ( r ) = ( c 2 + r 2 ) 1 / 2
Table 2. The L and L rms error norms for several values of c with the uniform and Chebyshev nodes in Example (1).
Table 2. The L and L rms error norms for several values of c with the uniform and Chebyshev nodes in Example (1).
N x × N y Uniform NodesChebyshev Nodes
9 × 9 19 × 19 9 × 9 19 × 19
c = 10 3 L 5.2139 × 10 2 1.6732 × 10 2 2.7502 × 10 1 9.2447 × 10 2
L rms 1.7494 × 10 2 5.6905 × 10 3 6.2467 × 10 2 2.3076 × 10 2
c = 10 2 L 3.4685 × 10 2 8.1158 × 10 3 1.0786 × 10 1 3.3077 × 10 1
L rms 1.1058 × 10 2 2.1701 × 10 3 2.9463 × 10 2 5.7194 × 10 2
c = 10 1 L 1.2334 × 10 2 3.2135 × 10 2 3.7442 × 10 2 7.4346 × 10 3
L rms 4.0420 × 10 3 5.7063 × 10 3 9.5542 × 10 3 2.2650 × 10 3
Table 3. The approximate and exact values of z 4 , 4 ( x , y ) .
Table 3. The approximate and exact values of z 4 , 4 ( x , y ) .
xyExact SolutionApproximate Solution
0.000.000.0000000000000001.637090463191271 × 10 11
0.250.0000000000000004.547473508864641 × 10 12
0.750.0000000000000000.000000000000000
1.000.0000000000000005.456968210637569 × 10 12
0.250.000.7071067811865480.707106781194852
0.250.5000000000000000.501532990779197
0.75−0.500000000000000−0.497730229812078
1.00−0.707106781186548−0.707120813167421
0.750.000.7071067811865480.707106781186667
0.250.5000000000000000.501530239744170
0.75−0.500000000000000−0.497733125168452
1.00−0.707106781186548−0.707092753664256
1.000.001.224646799147353 × 10 16 9.094947017729282 × 10 12
0.258.659560562354929 × 10 17 0.000000000000000
0.75−8.659560562354932 × 10 17 0.000000000000000
1.00−1.224646799147353 × 10 16 −3.637978807091713 × 10 12
Table 4. The L and L rms error norms for several values of c with the uniform and Chebyshev nodes in Example 2.
Table 4. The L and L rms error norms for several values of c with the uniform and Chebyshev nodes in Example 2.
N x × N y Uniform NodesChebyshev Nodes
9 × 9 19 × 19 9 × 9 19 × 19
c = 10 3 L 2.7079 × 10 2 9.1132 × 10 3 5.8468 × 10 2 2.3114 × 10 2
L rms 9.6056 × 10 3 3.0467 × 10 3 2.1192 × 10 2 7.9968 × 10 3
c = 10 2 L 2.6386 × 10 2 2.0016 × 10 2 3.7585 × 10 2 2.6196 × 10 2
L rms 8.7035 × 10 3 3.7800 × 10 3 1.4882 × 10 2 5.4219 × 10 3
c = 10 1 L 5.5040 × 10 2 7.0839 × 10 2 4.1096 × 10 3 8.9954 × 10 3
L rms 1.4043 × 10 2 1.5971 × 10 2 1.1637 × 10 3 2.5894 × 10 3
Table 5. The L and L rms error norms for several values of c with the uniform and Chebyshev nodes in Example 3.
Table 5. The L and L rms error norms for several values of c with the uniform and Chebyshev nodes in Example 3.
N x × N y Uniform NodesChebyshev Nodes
9 × 9 19 × 19 9 × 9 19 × 19
c = 10 3 L 3.0765 × 10 1 3.0979 × 10 1 3.2145 × 10 1 3.1490 × 10 1
L rms 1.0002 × 10 1 9.5446 × 10 2 1.0244 × 10 1 9.8804 × 10 2
c = 10 2 L 3.0461 × 10 1 3.0830 × 10 1 3.1653 × 10 1 3.1073 × 10 1
L rms 9.8675 × 10 2 9.4906 × 10 2 1.0027 × 10 1 9.7411 × 10 2
c = 10 1 L 3.0142 × 10 1 3.0895 × 10 1 3.0630 × 10 1 3.0885 × 10 1
L rms 9.7024 × 10 2 9.4884 × 10 2 9.7018 × 10 2 9.6816 × 10 2
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Golbabai, A.; Safaei, N.; Molavi-Arabshahi, M. Determination of an Extremal in Two-Dimensional Variational Problems Based on the RBF Collocation Method. Entropy 2022, 24, 1345. https://doi.org/10.3390/e24101345

AMA Style

Golbabai A, Safaei N, Molavi-Arabshahi M. Determination of an Extremal in Two-Dimensional Variational Problems Based on the RBF Collocation Method. Entropy. 2022; 24(10):1345. https://doi.org/10.3390/e24101345

Chicago/Turabian Style

Golbabai, Ahmad, Nima Safaei, and Mahboubeh Molavi-Arabshahi. 2022. "Determination of an Extremal in Two-Dimensional Variational Problems Based on the RBF Collocation Method" Entropy 24, no. 10: 1345. https://doi.org/10.3390/e24101345

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop