# Solving First-Order Differential Equations ofZ-Numbers’ Initial Value Using Radial Basic Function

Authors: Leila Qalehe; Mozhdeh Afshar Kermani; Tofigh Allahviranloo
Journal: International Journal of Differential Equations
 (2020)

---

## Abstract

In this paper, a method was proposed based on RBF for numerical solution of first-order differential equations with initial values that are valued byZ-numbers. The proposed method consists of two parts. The first part has stated the amount of limitation of the fragmentation solution, while the second part has described the assurance of the first part. The limitation section also has two parts. The first part has included the initial condition of the problem, while the second part has included the RBF network. The confidence interval was also considered as a function based on the probability function, which has calculated the confidence level of the first part (limitation). The RBF network or the radial-base grid network has three distinct layers: the input layer that is the set of elementary nodes (sensory units); the second layer is the hidden layers with high dimensions, in which the output layer that has responded to the network response and the activation patterns used in the input layer. The advantage of using RBF is that the use of this technique does not require sufficient information. It only relies on the domain and the boundary. In an example, we have showed that our proposed approach could approximate the problem with acceptable confidence.


---

## Body

## 1. Introduction

The emergence of a new concept of mathematics called fuzzy sets, the study of fuzzy differential equations, provides a suitable basis for mathematical modeling of real-world issues in which there is ambiguity or some uncertainty. For example, in Science and Engineering, many problems are limited to a set of fuzzy differential equations (FDE) through the process of mathematical modeling. As it is not simple to achieve an exact solution, numerical methods should be utilized [1–8]. One of these methods is the radial basis function (RBF) method.Generally, radial basis functions are methods, which are based on the location method for interpolation of discrete data while have a high convergence rate [9]. This method is one of the most widely used methods for approximating the functions in the theory of modern approximation [10].RBFs are first used by Broomhead and Lowe [11]. Much of its use is in the theory, design, and applications of RBF networks [12, 13]. In this paper [14], the use of regulation theory for this group of neural networks is presented as a way to enhance the generalization of the new data. In RBF methods, data are interpolated by linear combinations of functions of a function. This method has been very much considered due to high precision and flexibility versus problem geometry, dimensional independence, and ease of implementation. Today, RBFs are used in some cases such as estimation, modeling, prediction, and classification in various fields, including geosciences [15–19]. Besides, these methods are utilized to solve the numerical differential equations with partial derivatives [20]. The main advantage of numerical methods that use RBF is their nonnetwork characteristic. In nonnetworked methods, it is not necessary to produce a regular network in the domain of the problem, which, due to the high computational cost of network production, is the main advantage of these methods to finite difference methods and finite elements, and so on. The geometric feature used in the RBF approximation is the distance between points. The distance in each space dimension is easily calculated, resulting in higher dimensioning and does not increase the complexity of RBF methods. As stated above, a grid-independent grid function does not require a grid and in spite of our data connections between points; only spatial points are used. Thus, several studies have been used based on RBF to solve various equations. For instance, in [21], the radial function of RBF along with the time-dimensional discretization by the BKM boundary node method and the AEM analogue equation method to solve the time-dependent hyperbolic equations in [22] of RBF to solve time-dependent elliptic equations in [23] of RBF along with the MOL lines in the time dimension to solve the time-dependent nonlinear equations in [24] of RBF using the Kansa idea based on Hermitian interpolation for Fokker–Planck equation. In [25], RBF and quasi-spatial methods to solve the sin-Gordon equation are also used in [26] to use the RBF time-independent functions.As mentioned, the theory of fuzzy sets is a powerful method to model the uncertainties and processing ambiguity and information dependent on mathematical models. But, they need to be trusted to make this information useful. Human beings have a clear capacity to make rational decisions based on obscure, inaccurate, or incomplete information. Formalization of this capacity is at least somewhat difficult to predict. The author proposed a theorem, called aZ-number, which is a regular pair of fuzzy numbers A,B [27]. The first component, A is a limitation for values that have an uncertain variable X that has a value or a real value.The second component, B is a measure of reliability for the first component. Typically, A and B are described with natural disadvantages. For example, about 45 minutes, very sure. Yager used Z-number to calculate the waiting time for a bus [28]. Kang Wang used Z-number to make decisions in an ambiguous environment in 2012 [29]. Ezadi and Allahviranloo initially introduced the Z-based generalized neural network and then estimated the Z-based regression [30]. They also presented methods to rank the Z-numbers in 2017 and 2018 [31, 32]. Also, they, in 2019, introduced the Z-Advanced number process [1]. Further investigations have been carried out on Z-numbers by researchers [33–36]. However, a few studies have been conducted in the field of Z-differential equations [37].In this paper, we try to provide a numerical method to solve the differential equations with an initial value based onZ-numbers. In Section 2, basic concepts and theorems are presented as well. In Section 3, the network of generalized RBF, radial base functions, is introduced. In Section 4, a method for approximating first-order differential equations with a Z value based on the generalized RBF network is presented. In Section 5, numerical examples are presented and ultimately referenced.


## 2. Preliminaries

This section provides the necessary definitions and required theorems, which are used to propose the model.Definition 1.
(definition ofZ-number).
This valuation forZ according to proposal of Zadeh is observed as a restriction in x and is interpreted as follows [27]:(1)PyisAisB.
Indeed, it means thatRy:yisA⟶Possy=u=μAu.(2)PyisA=∫RμAuPyuduisB,where μA is the membership function of fuzzy set A and u is a part of y. Pyu is the probability density function of y, and Py=u is the probability function of y, where as we do not know the basic probability distribution. It is clear from this information that probability distribution function is itself a fuzzy number.Definition 2.
(parametric form ofZ-numbers).
Assuming thatZ∗ is set of Z−numbers, an arbitrary Z-number, Z=A,B∈Z∗, in the parametric form is represented by an ordered pair of functions:(3)Z=A¯r,A¯r,B,rϵ0,1,and its components satisfy the following requirements:(4)1.A¯r≤A¯rforrϵ0,1,2.A¯ris bounded left−continuous non−decreasing functions over0,1,3.A¯ris bounded left−continuous non−increasing functions over0,1,4.B=fA¯r,A¯r.Definition 3.
(normalZ−numbers).
Let us considerZ to be a Z−numbers, where Z=A,B. We say that Z is a normal Z-number if hB=1, where hB is the height of B [37].Definition 4.
(Z-number initial value problem (ZIVP)).
In real world, most of the phenomena are based on doubt and the information, which we have from various subjects such as economic, political, and physics , which have been evaluated according to verbal valuables. Here, we try to formulate and investigate the mentioned information to the initial value problem, while our initial data areZ-numbers. For instance, evaluate the population growth issue with the Z-number data (population growth, very high, usually) in the starting moment t0 and consider how is the information in the next time like in t1. For this purpose, first, we consider a ZIVP as (5), and then we study the existence and uniqueness condition of solution of this problem [37]. Assuming that Z∗ is set of Z-numbers, so, the general form of differential equation initial value based on Z−numbers is defined as follows:(5)x′t=ft,xt,xt0=x0∈Z∗,where t∈t0,T⊆R+, f is a continuous mapping from t0;T×Z∗ in to Z∗, x0is a Z-number in Z∗, and xt=Ax,Bx.
Supposex' is a Z-valuation; then, according to [28],(6)x′t=Ax′,Bx′,where Ax′ is a limitation for values and Bx′ is a measure of reliability for the first component, Ax′. For Ax′,Bx′, assuming there is a Hukuhara difference between Axt+h and Axt, we define(7)Ax′=limh⟶0Axt+h−hAxth,Bx′=px′tisAx′,where px′tisAx′ is the probability distribution function.


### 2.1. Gaussian Function Definition

The Gaussian function is a function of the form defined as(8)fx=λe−x−c2/2σ2,where λ, c, and σ are real constant coefficients and e is the Euler number. The shape of this function is symmetric that quickly drops to zero. The constant λ defines the height of the peak of the curve, c determines the location of the center of the peak, and σ is the standard deviation.


## 2.1. Gaussian Function Definition

The Gaussian function is a function of the form defined as(8)fx=λe−x−c2/2σ2,where λ, c, and σ are real constant coefficients and e is the Euler number. The shape of this function is symmetric that quickly drops to zero. The constant λ defines the height of the peak of the curve, c determines the location of the center of the peak, and σ is the standard deviation.


## 3. RBF Networks

The RBF networks , as shown in Figure1, are of the type of leading networks with an intermediate layer, first introduced by Broomhead and Low [11] (Figure 1). In this method, the transfer function in the intermediate layer of the Gaussian function and in the output layer of the transfer function is linear [38, 39]. Generally, the RBF network training is divided into two parts. The first part is primarily nonmonitoring-type learning. Using clustering methods, the parameters of the basic functions (centers and latitudes) are determined using input information, and in the second part, learning from type is monitored. The weights between the middle and the output layer are determined using slope reduction and linear regression methods. The intermediate neuron of RBF is connected to each of the input neurons with the weight parameters. These parameters are centers of neurons. The output of each intermediate neural is a function of the distance between the input vector X=x1,x2,…,xn and the radial center vector rj=r1j,r2j,…,rnj, which is calculated as follows:(9)δ=∑i=1nxi−rij.The average neuron output can be calculated in different ways. The main transfer function for this aim is the Gaussian function given as follows [39]:(10)ϕδi=e−λδi2.In this case,λ is a constant coefficient. Finally, outputs of the output layer are calculated from the following equation:(11)yk=∑j=1nvjkϕj.In this regard,wjk is the weight coefficient between j middle neurons and the k neuron of the output layer and ϕj, the output of j is the middle layer neuron. The results of the outcomes were evaluated using root mean square error statistics, RMSE, and determination coefficient R2. One of the important points in the RBF network is the choice of the type of transfer function, which is the responsibility of the modeling person. One of the important issues is the attention to the characteristics and statistical variables of the data. For example, if the RBF type is Gaussian, the width of the function is important, which should be chosen so that the distance between the data points is larger, and the dimension of the data is smaller. One of the other issues in designing RBF networks is the number of centers used in the middle layer. As the selection of these centers is directly related to the accuracy and complexity of the network, these centers should be chosen to balance the desired accuracy and complexity.


## 4. Solving First-Order Differential Equations ofZ-Numbers’ Initial Value Using Radial Basic Function (RBF)

AssumingZ∗ is the set of Z-numbers, the first-order differential equations of Z-numbers’ initial value are defined as follows:(12)x′tZ=ft,xtZ,xt0Z=x0∈Z∗.Equation (12) can be rewritten in the form of the parameter defined in [37]:(13)x′tZ=Ax′,Bx′,xt0Z=Ax0,Bx0,in which in (13), Ax′ is a fuzzy function and Bx′ is a real function. Ax0 and Bx0, respectively, have a certain fuzzy and a real amount, Ax′ and Ax0 have the role of limitation, and Bx′ and Bx0 have the role of reliability for x′t and xt0Z. Ax′ is introduced as follows:(14)Ax′=ft,x˜t.With the following parametric form,(15)Ax′r=A¯x′t=f¯t,x=Gt,x¯,x¯,x¯t0=x¯0,A′¯x′t=f¯t,x=Ft,x¯,x¯,x¯t0=x¯0,where .r is the symbol of r-cut, and(16)Gt,x¯,x¯=maxft,uu∈x¯,x¯,Ft,x¯,x¯=minft,uu∈x¯,x¯.Theorem 1.
ZIVP (12) has a unique Z-process solution.Proof.
Based on [27], relation (12) and relation (13) are equivalent. In (13), Ax′ is a fuzzy function, and it is introduced on relation (14). For each α-cut, relation (14) and relation (15) are equivalent. On the other hand, the fuzzy initial value problem in (15) has a unique solution (based on Theorem (3.2) in [40]). Similarly Bx'. Therefore, it is obvious that ZIVP (12) has a unique solution.
In the general process for obtaining the solution of equation (12) with nonnetworked physical domain methods, we present the problem as a set of scattered points in the domain. These points can be regular or irregular, but they must cover the entire domain in any case. We then approximate the unknown function at any point in the domain. In this way, we consider a base for the solution space and a solution as a linear combination of the base members. In this process, this solution is expanded in terms of base functions. Therefore, the coefficients of the basic sentences are unknown to us. These coefficients must hold in the equations. In the cases where basic radial functions for inwardness are used, the number of centers with the dimension of input data is considered equal in order to achieve high precision. In this paper, we propose a method using the RBF of the generalized RBF-based Z-based numbers in such a way that the initial condition of the main problem is to be established as follows:(17)xTtZ=AxTt,BxTt,in which, AxTx is a function with a fuzzy value and BxTx can depend on the type of the problem of function with the real or fuzzy value, in which we consider the function with the real value. The values of AxTx and BxTx, respectively, represent the limiting function and the confidence scale for xTtZ. With regard to the definition of the Z-number, the interpretation of (17) is described as follows.
IfxT is AxT, then possibility (xT is AxT) is BxT.
Here, we defineAxTx as follows (AxTx is a derivative function):(18)AxTt=AxTt0+t∑j=1nwjϕjt−r,which is a method that computes the approximate solution of the equation constraint section, taking into account the initial condition of the problem and is based on the generalized RBF network with fuzzy coefficients. Here, r is the same cut–r that is considered as the center of the RBF network, and ϕjt−rj is defined as follows:(19)ϕjt−rj=e−εt−rj2,where φ is a nonlinear function in the space R+⟶R, which refers to the transfer function. Some radial base transmission functions φ, in addition to the dependence of the distance function, depend on the factor (ε), which depends on the elongation and extension of the function, whose relation to the standard deviation of the normal distribution (σ) is as follows:(20)ε2=12σ2,in which the value of σ2 can be determined according to the type of problem. We also utilize the Gaussian radial base transfer function introduced in (15). Some other RBFs with their mathematical relations can be seen in Table 1; rj are neural network centers, and W is the matrix of the weight coefficients of the output from the intermediate layer to the output layer wj. There is a value with fuzzy-value. In fact, when the centers (points) r1,r2,…,rn are constant, the network is trained using the data to find the weight matrix. This process can be done in one form and by data, or by increasing the number of RBF cores, the weight function can be updated in several steps. Training operations begin by dividing the data into training and testing sets. After doing so, the number and position of the RBF centers and the transfer function φ are decided. Training with the implementation of the linear algebra in a system of equations is formed by weights and bias using a pair of input x and each output y.Table 1
Transition functions used in the radial base function (r=x−rj‖).
Function nameMathematical relationLinearϕr=rCubicϕr=r3Narrow pageϕr=r2lnrMakingϕr,ε=1/1+εrRobey inversionϕr,ε=1/1+εr2A few rebatesϕr,ε=1+εr2Multiple reversesϕr,ε=1/1+εr2Figure 1
RBF network diagram.Moreover,BxTx is a function that specifies the confidence level of the constraint section and is based on the exponential function that we define in terms of the initial condition of the problem in the form as follows:(21)BxTt=1−te−λAxT.Now, with respect to relations (17) and (21), we will have(22)xTtZ=AxTx,1−te−λy|AxT.AsAxT has a fuzzy value according to the Z value definition, it can be rewritten in the following form:(23)A¯xTt=x¯t0+t∑j=1nw¯jϕjt−rj,A¯xTt=x¯t0+t∑j=1nw¯jϕjt−rj.In this case, equation (22) can be rewritten in the following form:(24)BxTt=1−te−λA¯xTt−e−λA¯xTt.The value ofBxTt is also a fuzzy number, which must be computed.We now want to derive the derivative of the functionxTtZ i.e. xT′tZ for this purpose. We derive from the functions of (23), so we have(25)A′¯xTt=∑j=1nw¯jϕjt−rj+t∑j=1nw¯j∂ϕj∂tt−rj,A′¯xTt=∑j=1nw¯jϕjt−rj+t∑j=1nw¯j∂ϕj∂tt−rj.In this case,BxT′t is calculated as follows:(26)BxT′t=1−te−λ′y′|A′¯xTA′¯xT=1−te−λ′A′¯xTt−e−λ′A′¯xT.To optimize the weightsw¯j and w¯j, we use the minimization of the sum-squared error function:(27)e=min∑i=1nxT′tiZ−x′tiZ2⟶0.So, we define it as follows:(28)A¯e=min∑i=1nA′¯xTt−F2⟶0,A¯e=min∑i=1nA′¯xTt−G2⟶0,Bet=1−te−λ′y′|A¯eA¯e⟶1.It means that(29)min∑i=1ne−λ′A′¯xTt−e−λF2+e−λ′A′¯xTt−e−λG2⟶0.


### 4.1. The Numerical Modeling of the Grid Radial Base Function

The RBF algorithm is a function of the distance between the input and some fixed point called center; the functionφ is called a radial base function if φ (x) = φ (‖x‖). Therefore, this function φ can be applied to the vector in space Rn but is expressed only in the form of distance. This means that φ can be considered as a numerical function. In these discussions, the application of the Euclidean distance matrix is expressed using the function φ [41]:(30)EDM=x1−x1x1−x2…x1−xnx2−x1x2−x2…x2−xn⋮⋮⋮⋮xn−x1xn−x2…xn−xn,fx=a1ϕx−x1+⋯anϕx−xn,where f (x) is the estimator function, a1,…,an are the constant coefficients of the function, and ri,i=1,2,…,n are the same r-slices. To convert the numerical function φ to the φ matrix, we can use the formulas in the form ϕAij=ϕAij. The function φ is applied to the Euclidean distance matrix and is called the transfer matrix. When the type of transfer function is determined, by using the number n equation, on the input data xx1,x2,…,xn, we can obtain the coefficients a1,…,an:(31)a1ϕx1−x1+⋯anϕx1−xn=y1,a1ϕx2−x1+⋯anϕx2−xn=y2,⋮a1ϕxn−x1+⋯anϕxn−xn=ym.This set holds until vectorsxi≠xj, fori≠j and the matrix n × n derived from the set of equations, are inverse. In order to balance the complexity accuracy, we can use all the n data points in this model or that the number of k points, c1,…,ck, is considered for the RBF center, which is k≪n:(32)fnx=∑j=1najϕx−xj,fkx=∑j=1kajϕx−xj,with assuming the output multiplicity, the generalization function will be given, where α is the vector of coefficients and v is the coefficient matrix. The RBF network, slightly different from the display mode, is a layer of two mappings: first, the mapping space dimensions from Rnn to Rk and then mapped to the output layer Rm [42, 43]:(33)x⟶x−r1x−r2⋮x−rk⟶ϕx−r1x−r2⋮x−rk⟶wϕx−r1ϕx−r2⋮ϕx−rk=y1y2⋮ym,yhx=∑j=1kwjhϕjx−rj,where rj is considered for the RBF center, and in this paper, rj are cut-rj and wjh are output layer weights. In the design of RBF networks, in most cases, the number of central layer units is significantly less than the number of input data, but in the case of interpolation using a radial base function, the number of middle layer centers with dimensions is equivalent to the input data, and its inputs correspond to input data. In the cases where the transfer function is dependent on the variable, for example, the Gaussian function (also depends on the variable σ), and because in many models, it is assumed to be Gaussian (normal), the determination of the width of the function is important. Here, the width factor of the function controls the softness and elongation of the transfer function. When the width of the function is small, the related space and representation of the function are small as well. As a result, a large number of centers are needed for training. In contrast, the estimation accuracy decreases if the space is relevant and represents the broad function. In interpolation methods, it is common practice to use the radial base function to consider the width of all centers.


## 4.1. The Numerical Modeling of the Grid Radial Base Function

The RBF algorithm is a function of the distance between the input and some fixed point called center; the functionφ is called a radial base function if φ (x) = φ (‖x‖). Therefore, this function φ can be applied to the vector in space Rn but is expressed only in the form of distance. This means that φ can be considered as a numerical function. In these discussions, the application of the Euclidean distance matrix is expressed using the function φ [41]:(30)EDM=x1−x1x1−x2…x1−xnx2−x1x2−x2…x2−xn⋮⋮⋮⋮xn−x1xn−x2…xn−xn,fx=a1ϕx−x1+⋯anϕx−xn,where f (x) is the estimator function, a1,…,an are the constant coefficients of the function, and ri,i=1,2,…,n are the same r-slices. To convert the numerical function φ to the φ matrix, we can use the formulas in the form ϕAij=ϕAij. The function φ is applied to the Euclidean distance matrix and is called the transfer matrix. When the type of transfer function is determined, by using the number n equation, on the input data xx1,x2,…,xn, we can obtain the coefficients a1,…,an:(31)a1ϕx1−x1+⋯anϕx1−xn=y1,a1ϕx2−x1+⋯anϕx2−xn=y2,⋮a1ϕxn−x1+⋯anϕxn−xn=ym.This set holds until vectorsxi≠xj, fori≠j and the matrix n × n derived from the set of equations, are inverse. In order to balance the complexity accuracy, we can use all the n data points in this model or that the number of k points, c1,…,ck, is considered for the RBF center, which is k≪n:(32)fnx=∑j=1najϕx−xj,fkx=∑j=1kajϕx−xj,with assuming the output multiplicity, the generalization function will be given, where α is the vector of coefficients and v is the coefficient matrix. The RBF network, slightly different from the display mode, is a layer of two mappings: first, the mapping space dimensions from Rnn to Rk and then mapped to the output layer Rm [42, 43]:(33)x⟶x−r1x−r2⋮x−rk⟶ϕx−r1x−r2⋮x−rk⟶wϕx−r1ϕx−r2⋮ϕx−rk=y1y2⋮ym,yhx=∑j=1kwjhϕjx−rj,where rj is considered for the RBF center, and in this paper, rj are cut-rj and wjh are output layer weights. In the design of RBF networks, in most cases, the number of central layer units is significantly less than the number of input data, but in the case of interpolation using a radial base function, the number of middle layer centers with dimensions is equivalent to the input data, and its inputs correspond to input data. In the cases where the transfer function is dependent on the variable, for example, the Gaussian function (also depends on the variable σ), and because in many models, it is assumed to be Gaussian (normal), the determination of the width of the function is important. Here, the width factor of the function controls the softness and elongation of the transfer function. When the width of the function is small, the related space and representation of the function are small as well. As a result, a large number of centers are needed for training. In contrast, the estimation accuracy decreases if the space is relevant and represents the broad function. In interpolation methods, it is common practice to use the radial base function to consider the width of all centers.


## 5. Numerical Examples

In this section, to show the behavior and properties of this new method, we discuss the simulation results of one example. The simulation is conducted on Matlab12, and the objective function in (12) minimizer engaged is fminunc. The initial weights were randomly selected.Example 1.
Consider the following first-order FDE:(34)y′=yt,t∈0,1,y0=0.75+0.25r,1.125−0.125r.
The exact solution of the FDE is(35)y1=0.75+0.25re,1.125−0.125rer∈0,1.
Assume that the initial value based onZ-numbers is as follows:(36)y0=0.75+0.25r,1.125−0.125r,1.
In this case, differential equation (34) can be rewritten as follows:(37)y′=yt,t∈0,1,y0=0.75+0.25r,1.125−0.125r,1.
And assume that the exact solution of the ZDE is(38)y1,r=0.75+0.25re,1.125−0.125re,1−e−0.2160.75+0.25re−e−0.2161.125−0.125rer∈0,1.
Our proposed method is as follows:(39)yTt=A¯Tt,A¯Tt,BTt,where(40)A¯Tt=0.75+0.25r+t∑j=1nw¯jϕjt−rj,A¯Tt=1.125−0.125r+t∑j=1nw¯jϕjt−rj,BTt=1−te−λA¯Tt−e−λA¯T.
Comparison of the approximate solution with the RBF network training for 50 points and with a choice ofλ = 1 is shown in Table 2. The convergence of the neural network weights for each r-cut is shown in Figure 2. Comparison of the approximate method with the exact method is shown in Figure 3. The comparison of the confidence level of the actual answer and the approximate solution is shown in Figure 4.Table 2
Comparison of the exactZ and ZT approximated solutions for λ=1.
rA¯TtA¯tA¯TtA¯tBTtBt02.002.033.043.050.8740.8720.12.072.103.023.020.8850.8850.22.142.172.992.990.8990.8980.32.212.242.952.950.9110.9120.42.282.312.922.920.9250.9250.52.352.372.882.880.9370.9370.62.422.442.842.850.9500.9490.72.502.512.812.820.9620.9620.82.572.582.782.780.9750.9750.92.642.652.752.750.9870.98712.712.712.712.7111Figure 2
The convergence of the neural network weights for eachr-cut.Figure 3
The exact and computed solution for Example1. Yellow chart indicates real data and black chart indicates approximate data.Figure 4
Comparison of the confidence level of the actual answer and the approximate solution for Example1. Red color indicates confidence level in exact solution, and green color indicates confidence level in approximate solution.Example 2.
Consider the following first-order ZDE:(41)y′=3t2yt,t∈0,1,y0=0.5r,0.21−r+0.5,1.
The exact solution of the FDE is(42)y1=0.5re,0.21−r+0.5e,r∈0,1.
Assume that the initial value based onZ-numbers is as follows:(43)y0=0.5re,0.21−r+0.5,1.
In this case, differential equation (34) can be rewritten as follows:(44)y′=3t2yt,t∈0,1,y0=0.5r,0.21−r+0.5,1.
And assume that the exact solution of the ZDE is(45)y1,r=0.5re,0.21−r+0.5e,1−e−0.2160.5re−e−0.2160.21−r+0.5e,r∈0,1.
Our proposed method is as follows:(46)yTt=A¯Tt,A¯Tt,BTt,where(47)A¯Tt=0.5r+t∑j=1nw¯jϕjt−rj,0.21−r+0.5+t∑j=1nw¯jϕjt−rj,BTt=1−te−λA¯Tt−e−λA¯T.
Comparison of the approximate solution with the RBF network training for 50 points and with a choice ofλ = 1 is shown in Table 3. The convergence of the neural network weights for each r-cut is shown in Figure 5. The comparison of the approximate method with the exact method is shown in Figure 6. The comparison of the confidence level of the actual answer and the approximate solution is shown in Figure 7.Table 3
Comparison of the exactZ and ZT approximated solutions for λ=1.
rA¯TtA¯tA¯TtA¯tBTtBt0−0.00000000201.871.900.6870.6630.10.410.421.851.870.7690.7540.20.580.601.821.840.8040.7930.30.720741.791.810.8330.8240.40.830.851.761.780.8560.8480.50.930.961.721.740.8780.8730.61.021.051.681.900.8990.8660.71.111.131.641.650.9190.9160.81.191.211.581.600.9400.9370.91.271.281.511.530.9630.96011.341.351.341.3511Figure 5
The convergence of the neural network weights for eachr-cut for Example 2.Figure 6
The exact and computed solution for Example2. Red chart indicates real data, and blue chart indicated approximate data.Figure 7
Comparison of the confidence level of the actual answer and the approximate solution for Example2. Red color indicates confidence level exact solution and yellow color indicates confidence level approximate solution.


## 6. Concluding Remarks

In this paper, we proposed a new approach for solving first-order differential equations ofZ-numbers’ initial value under uncertainty using radial basic function under generalized H-differentiability. At first, the problem was divided into two parts: the first part of the limitation and the second part of the reliability of the first part. We employed the RBF method for finding upper and lower solutions of the equation of the problem limitation section. The main advantage of this approach is that the fuzzy equation was reduced to the problem of solving two systems of linear equations. Then, we use the information obtained of the proposed method of the first part to calculate the confidence level, and an exponential function was proposed to calculate the reliability of a function. The numerical investigation presented in this paper shows that excellent accuracy can be obtained even when few nodes are used in analysis. In contrast, many more nodes are needed to achieve relatively good accuracy in other methods. Numerical example is included to demonstrate the validity and applicability of the technique and is performed on a computer using a code written in Matlab. The method can be implemented for solving linear and nonlinear equations in higher dimensions.



---

*Source: 5924847-2020-05-26.xml*