Next Article in Journal
Analysis of a Nonlinear ψ-Hilfer Fractional Integro-Differential Equation Describing Cantilever Beam Model with Nonlinear Boundary Conditions
Next Article in Special Issue
Analytical Study of Two Nonlinear Coupled Hybrid Systems Involving Generalized Hilfer Fractional Operators
Previous Article in Journal / Special Issue
A Deep Learning BiLSTM Encoding-Decoding Model for COVID-19 Pandemic Spread Forecasting
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Efficient Stochastic Numerical Computing Framework for the Nonlinear Higher Order Singular Models

by
Zulqurnain Sabir
1,
Hafiz Abdul Wahab
1,*,
Shumaila Javeed
2 and
Haci Mehmet Baskonus
3
1
Department of Mathematics and Statistics, Hazara University, Mansehra 21120, Pakistan
2
Department of Mathematics, COMSATS University Islamabad, Islamabad Campus, Park Road, Islamabad 45550, Pakistan
3
Department of Mathematics and Science Education, Faculty of Education, Harran University, Sanliurfa 63050, Turkey
*
Author to whom correspondence should be addressed.
Fractal Fract. 2021, 5(4), 176; https://doi.org/10.3390/fractalfract5040176
Submission received: 30 August 2021 / Revised: 13 October 2021 / Accepted: 19 October 2021 / Published: 20 October 2021

Abstract

:
The focus of the present study is to present a stochastic numerical computing framework based on Gudermannian neural networks (GNNs) together with the global and local search genetic algorithm (GA) and active-set approach (ASA), i.e., GNNs-GA-ASA. The designed computing framework GNNs-GA-ASA is tested for the higher order nonlinear singular differential model (HO-NSDM). Three different nonlinear singular variants based on the (HO-NSDM) have been solved by using the GNNs-GA-ASA and numerical solutions have been compared with the exact solutions to check the exactness of the designed scheme. The absolute errors have been performed to check the precision of the designed GNNs-GA-ASA scheme. Moreover, the aptitude of GNNs-GA-ASA is verified on precision, stability and convergence analysis, which are enhanced through efficiency, implication and dependability procedures with statistical data to solve the HO-NSDM.

1. Introduction

The research community has always taken keen interest in solving the singular nonlinear differential models. Various schemes have been presented to solve such models, which involve singularity. Few traditional schemes fail to solve the singular model, such as the Adams method, Milne predictor-corrector method, Runge–Kutta and Euler’s method, etc. However, few schemes solve the singular models, such as homotopy perturbation method, Adomian decomposition method, Bernoulli collocation method, spectral collocation method, quasi linearization scheme, homotopy analysis method and variation iteration method [1,2,3,4,5,6,7,8,9,10], but all these techniques solve the singular models by taking the approximate values close to zero. However, stochastic numerical heuristic/swarming techniques solve the singular models at exactly zero without approximating. There are not only singular nonlinear models that have been solved by using the stochastic numerical techniques, but also the delayed, prediction, fractional, functional and pantograph differential models have also been treated with the stochastic computing methods [11,12,13]. To mention the importance of the singular models, no one can deny their significance due to the variety of applications in fluid mechanics, relativity theory, dynamics of population evolution, pattern construction and chemical reactors [14,15,16,17].
An important and historical singular system is the Emden–Fowler model, discovered centuries ago by working on a spherical cloud of gas along with the classical thermodynamic law. Additional applications of the singular systems are catalytic diffusion reactions [18], isothermal gas spheres [19], density state of gaseous stars [20], stellar formulation [21], electromagnetic theory [22], quantum mechanics [23], oscillating magnetic fields [15] and mathematical physics [24]. The general form of this model is provided as:
y ( ) + ψ y ( ) + h ( ) g ( y ) = f ( ) , y ( 0 ) = a , y ( 0 ) = 0 .
where h ( ) and g ( y ) are the identified functions with input and solution y, respectively. ψ ≥ 1 represents the shape factor, h ( ) is the forcing function and a is used as a constant. The models (1) give different values for different values of g ( y ) , e.g., temperature deviation, interior polytrophic stars structure, radiative cooling, gas clouds and galaxy clusters modelling [14,15,16,17]. The model presented in system (1) becomes a Lane–Emden equation for h ( ) = 1 and is given as:
y ( ) + ψ y ( ) + g ( y ) = f ( ) , y ( 0 ) = a , y ( 0 ) = 0 .
In the above model, the factor g ( y ) = y m indicates the linearity or nonlinearity of the singular model. For m = 0 and 1, the above model is linear; for the rest of the values, the model has a nonlinear form. The aim of the study is to introduce a stochastic numerical computing framework based on Gudermannian neural networks (GNNs) together with the global and local search genetic algorithm (GA) and active-set approach (ASA), i.e., GNNs-GA-ASA. The designed computing framework GNNs-GA-ASA is tested for the higher order nonlinear singular differential model (HO-NSDM). The general form of the HO-NSDM is given as [25,26]:
y ( i v ) ( ) + ψ y ( ) + h ( ) g ( y ) = f ( ) , y ( 0 ) = a , y ( 0 ) = b , y ( 0 ) = c , y ( 0 ) = 0 .
The implementation of the GNNs-GA-ASA on the above higher order, singular and nonlinear model provides a useful platform to researchers. The stochastic solvers have been applied in diverse applications. Some prominent applications are functional differential systems [27,28], doubly singular nonlinear systems [29], prey-predator models [30], the Thomas–Fermi model [31], HIV infection models [32,33,34], periodic differential models [35] and fractional differential models [36]. Based on this evidence, we are interested in designing a platform based on the GNNs that has never been implanted before to solve the HO-NSDM. A few main and novel geographies of the designed GNNs-GA-ASA based on the comprehensive highlights are provided below.
The design of the GNNs-GA-ASA aims to solve models that involve singularity at the origin, nonlinearity and higher order.
  • The effective results of the HO-NSDM have been obtained based on the designed computing GNNs-GA-ASA.
  • It is clear to see that the overlapping of the attained results through GNNs-GA-ASA is noticed with exact or reference solutions, which demonstrate the viability and reliability of the computational GNNs-GA-ASA.
  • The practically accurate performances of the GNNs-GA-ASA are authenticated through the statistical valuations in different tables and figures of merit.
The design of GNNs-GA-ASA is debated in Section 2. Section 3 indicates the statistical procedures. Section 4 shows the result and discussions. The concluding remarks are provided in Section 5.

2. Methodology

In this section, the designed outlines are presented to solve the HO-NSDM, which is separated into two portions:
  • The descriptions of an objective fitness function that is constructed on the basis of a differential model and its initial conditions; and
  • The hybridization of GA-ASA is described to enhance the formulation of the fitness for HO-NSDM given in Equation (3).
The form of the layer structure, i.e., hidden, input and output ANNs layers with an activation Gudermannian function, are applied as an estimated continuous mapping. The designed systems are presented in the singular, higher order and nonlinear equations to formulate a merit function by summing the MSE for the differential model and the boundary/initial conditions. A merit function is optimized with the integrated strength of global/local techniques by manipulating the GA at the start and then fine tuning with the local and rapid search scheme ASA, i.e., GNN-GA-ASA.

2.1. ANNs Modeling by Using Gudermannian Function

The models based on ANNs with the activation Gudermannian function are introduced by the scientists to solve different systems that arise in many areas. The HO-NSDM has been solved by using the stochastic procedures by implementing the Log-sigmoid function as a neural network. The Gudermannian function has never been implemented nor explored to solve the HO-NSDM. Thus, we are interested in exploring Gudermannian neural networks for the research community to solve HO-NSDM. The hidden, input and output layer structure based on the feed-forward GNNs are applied to provide the continuous mapping solution form as:
y ^ ( ) = i = 1 n a i Q ( p i + q i ) ,
y ^ ( i v ) ( ) = i = 1 n a i Q ( i v ) ( p i + q i ) ,
where a i , p i and q i are ith components of a , p and q vectors, and m and n indicate the derivative order and neurons. The Gudermannian function Q ( ) = 2 tan 1 [ exp ( ) ] 1 2 π along with its mth derivatives work as an objective function presented in the Equations (6) and (7), respectively. The use of Gudermannian function in Equations (4) and (5) give the new mathematical form as:
y ^ ( ) = i = 1 n a i ( 2 tan 1 e ( p i + q i ) π 2 ) ,
y ^ ( ) = i = 1 n a i 2 p i e ( p i + q i ) 1 + e 2 ( p i + q i ) , y ^ ( ) = i = 1 n 2 a i ( 2 p i 2 e 3 ( p i + q i ) ( 1 + e 2 ( p i + q i ) ) 2 + p i 2 e ( p i + q i ) 1 + e 2 ( p i + q i ) ) , y ^ ( ) = i = 1 n 2 a i ( 8 p i 3 e 5 ( p i + q i ) ( 1 + e 2 ( p i + q i ) ) 3 8 p i 3 e 3 ( p i + q i ) ( 1 + e 2 ( p i + q i ) ) 2 + p i 3 e ( p i + q i ) 1 + e 2 ( p i + q i ) ) , y ^ ( i v ) ( ) = i = 1 n 2 a i ( 48 p i 4 e 7 ( p i + q i ) ( 1 + e 2 ( p i + q i ) ) 4 + 72 p i 4 e 5 ( p i + q i ) ( 1 + e 2 ( p i + q i ) ) 3 26 p i 4 e 3 ( p i + q i ) ( 1 + e 2 ( p i + q i ) ) 2 + p i 4 e ( p i + q i ) 1 + e 2 ( p i + q i ) ) .
For the solution of Equation (3), the GNNs models for y ^ , y ^ , y ^ , y ^ and y ^ ( i v ) are applied, as provided in Equation (7). The objective function in the sense of mean squared error (MSE) is given as:
ξ F = ξ F 1 + ξ F 2
ξ F 1 = 1 N i = 1 N ( y ^ ( i v ) i + k i 1 y ^ i + h i g ( y ^ i ) f i ) 2 ,
ξ F 2 = 1 4 ( ( y ^ 0 a ) 2 + ( y ^ 0 b ) 2 + ( y ^ 0 c ) 2 + ( y ^ 0 ) 2 ) ,
where ξ F 1 and ξ F 2 are the MSEs associated with the general form of Equation (3) and the related ICs, respectively. The terms N h = 1 , y ^ i = y ^ ( i ) , i = i h , g i = g ( y ) and f i = f ( y ) . A suitable optimization technique is assumed for the learning of W = [ a , p , q ], i.e., a weight vector, and the objective Function (8) tends to be zero.

2.2. Optimization Procedures: GA-SQP

The weights based on the GNNs are proficient by functioning the combined strength in terms of GAs along with ASA, i.e., GA-ASA. The graphical representations of the designed GNNs-GA-ASA to present the solution of HO-NSDM are illustrated in Figure 1.
Global search efficiency of the GA, introduced at the end of the 19th century by Holand, is explored to obtain the weight vector (W) using the GNNs in the existing investigation. The population’s formulation with participant outcomes, i.e., chromosomes or individuals in GA, is accomplished by applying the real numbers with some bounds in a determinate interval. GA has been pragmatic in numerous applications, including heterogeneous bin packing optimization [37], emergency logistics humanitarian preparation [38], second order singular models [39,40], wellhead back pressure control system [41], the electricity consumption modeling [42], image steganography [43], collaborative filtering recommender system [44] and manufacturing systems [45].
The optimization of the decision variables is performed initially through GNNs by using GA, and after adequate trials, the GA performance is considerably improved by using fine tuning with the suitable rapid local process by taking the global best GA values as a preliminary weight. Subsequently, an efficient ASA scheme is implemented for updating the parameters of the network. In recent decades, ASA has been applied in numerous areas, e.g., unconstrained minimax problems [46], linear MPC [47], water distribution model to control the flow [48], optimal control problem governed by partial differential equation [49], elastodynamic frictional contact problems [50] and constrained node-based shape optimization [51]. The procedural structure of the flow diagram using the proposed GNNs-GA-ASA is shown in Figure 1, and essential details are given in the pseudocode form through the optimization of GA-ASA in Table 1.

3. Performance Measures

The performance operators based on the mean absolute deviation (MAD), Nash Sutcliffe efficiency (NSE) and Theil’s inequality coefficient (TIC) are presented to solve the HO-NSDM. The mathematical formulae of these operators are provided as:
TIC = 1 n k = 1 n ( y k y ^ k ) 2 ( 1 n k = 1 n y k 2 + 1 n k = 1 n y ^ k 2 ) ,
MAD = 1 n k = 1 n | y k y ^ k | ,
NSE = { 1 k = 1 n ( y k y ^ k ) 2 k = 1 n ( y k y ¯ k ) 2 , y ¯ k = 1 n k = 1 n y k
ENSE = 1 - NSE .

4. Results and Discussions

In this section, the detailed results of solving the HO-NSDM for three different cases using the GNNs-GA-ASA are presented.
Problem 1.
Consider an HO-NSDM using an exponential function given as:
y ( i v ) + 3 y 96 ( 1 10 4 + 5 8 ) e 4 y = 0 , y ( 0 ) = 0 , y ( 0 ) = 0 , y ( 0 ) = 0 , y ( 0 ) = 0 .
The reference solution of the HO-NDSM is ln ( 1 + 4 ) and the objective function is given as:
ξ F = 1 N i = 1 N ( i y ^ ( i v ) + 3 y ^ 96 i ( 5 i 8 10 i 4 + 1 ) e 4 y ^ ) 2 + 1 4 ( ( y ^ 0 ) 2 + ( y ^ 0 ) 2 + ( y ^ 0 ) 2 + ( y ^ 0 ) 2 )
Problem 2.
Consider a highly nonlinear HO-NSDM using an exponential function given as:
y ( i v ) + 12 y + 36 2 y + 24 3 y + 60 ( 3 8 18 4 + 7 ) y 9 = 0 , y ( 0 ) = 1 , y ( 0 ) = 0 , y ( 0 ) = 0 , y ( 0 ) = 0 .
The reference solution of the HO-NDSM is ( 1 + 4 ) 1 2 and the objective function is given as:
ξ F = 1 N i = 1 N ( i 3 y ^ ( i v ) + 12 i 2 y ^ + 36 i y ^ + 24 y ^ + 60 i 3 ( 3 i 8 18 i 4 + 7 ) y ^ 9 ) 2 + 1 4 ( ( y ^ 0 1 ) 2 + ( y ^ 0 ) 2 + ( y ^ 0 ) 2 + ( y ^ 0 ) 2 )
Problem 3.
Consider a highly nonlinear HO-NSDM using an exponential function given as:
y ( i v ) + 4 y + 2 2 y 3 ( 12 8 53 4 + 12 ) y 15 = 0 , y ( 0 ) = 1 , y ( 0 ) = 0 , y ( 0 ) = 0 , y ( 0 ) = 0 .
The reference solution of the HO-NDSM is ( 1 + 4 ) 1 4 and the objective function is given as:
ξ F = 1 N i = 1 N ( i 2 y ^ ( i v ) + 4 i y ^ + 2 y ^ 3 i 2 ( 12 i 8 53 i 4 + 12 ) y ^ 15 ) 2 + 1 4 ( ( y ^ 0 1 ) 2 + ( y ^ 0 ) 2 + ( y ^ 0 ) 2 + ( y ^ 0 ) 2 ) .
The graphical representations of the design GNNs-GA-ASA for each problem of the HO-NSDM are provided in Figure 2, Figure 3, Figure 4 and Figure 5. The optimization performances of the designed method are provided for 30 independent executions using the hybrid combination of GA-ASA. Figure 2 indicates the weights set along with the result comparisons using the GA-ASA. It is observed that the obtained results overlapped with the exact solutions for each problem of the HO-NDSM. To find the resulting similarities, the AE performances based on the obtained and exact solutions are plotted in Figure 3. Figure 3a shows that the best values of the AE are found around 10−4 to 10−6 for Problem 1, 10−3 to 10−5 for Problem 2 and 10−4 to 10−5 for Problem 3. Figure 3b indicates the best values of the AE found around 10−8 to 10−10 for Problem 1, and 10−5 to 10−7 for Problems 2 and 3. Figure 3c authenticates the best values of the performance indices for each problem of the HO-NDSM. It is observed that the fitness values for Problem 1 are found at around 10−6 to 10−8, while the fitness values for Problems 2 and 3 are close to 10−6. The MAD and TIC values for each problem of the HO-NDSM are around 10−4 to 10−6 and 10−8 to 10−10. The ENSE performance for each problem are found around 10−7 to 10−8 for Problem 1, 10−6 to 10−7 for Problem 2 and 10−6 to 10−8 for Problem 3. The best values of FIT, MAD, TIC and ENSE found in appropriate ranges to solve each problem of the HO-NDSM.
The graphical illustrations of the statistical operators based on the fitness values, MAD, TIC and ENSE are drawn in Figure 4, Figure 5, Figure 6 and Figure 7 for each problem of the HO-NDSM. The convergence performance of ξ F , MAD, ENSE and TIC is obtained for 30 independent executions to solve each problem of the HO-NDSM. It is noticed that the FIT values, MAD performances, TIC measures and ENSE operators achieve satisfactory levels of accuracy and around 75% of the executions achieved an accurate level of precision based on the FIT, MAD, TIC and ENSE.
To find the reliability of GNNs-GA-ASA, the statistical performances for 30 implementations based on minimum (Min), Median (Med), Mean and semi-interquartile range (S.I.R) are presented to solve the HO-NDSM. The mathematical form of the S.I.R is 0.5 ( Q 1 Q 3 ) , and the Q 1 and Q 3 values represent the first and third quartiles. The Min, Med, Mean and S.I.R operatives are given in Table 2 for the HO-NDSM. The independent trials of the present GNNs-GA-ASA approach for Min error are called the best runs. One can observe that the suitable Min values are calculated at around 10−5 to 10−6 for each problem of the HO-NDSM. Likewise, the Mean values for each problem of the HO-NDSM are calculated at around 10−1 to 10−2, while the Med and S.I.R values for each problem of the HO-NDSM are found around 10−2 to 10−3. Table 3 shows the computational cost of GNNs-GA-ASA based on completing iterations, count of functions and executed time during the process to present the decision variables of the network.

5. Conclusions

The motivation of the current work was to examine the numerical outcomes of the nonlinear higher order singular system by operating the hybrid computing intelligent strength based on GNNs under the optimization of GAs along with ASA. Several major conclusions of the obtained performances are drawn:
  • A neuro-evolution was designed based on computing the GNNs-GA-ASA approach efficiently for the nonlinear higher order multi-singular differential systems.
  • The designed GNNs-GA-ASA is a suitable procedure to solve the stiff singular problems effectively.
  • The precision and accuracy of the GNN-GA-ASA was authenticated by comparing the obtained measures with the obtainable exact results to solve each variant of the HO-NSDM.
  • The performance achieved through the AE values for solving the HO-NSDM authenticated good measures at around 10−4 to 10−6 for Problem 1, 10−3 to 10−5 for Problem 2 and 10−4 to 10−5 for Problem 3.
  • The statistical assessments and analysis of 30 independent trials based on the GNNs-GA-ASA were implemented to establish the convergence and accuracy of the designed approach to solve three different variants of the HO-NSDM.
In the future, the presented GNNs-GA-ASA will be extended to solve the non-autonomous evolution equations [52,53,54].

Author Contributions

Conceptualization, Z.S. and H.A.W.; methodology, Z.S.; software, Z.S. and S.J.; validation, Z.S., H.A.W. and S.J.; formal analysis, Z.S. and S.J.; investigation, Z.S. and H.M.B.; resources, H.M.B.; data curation, Z.S.; writing—original draft preparation, Z.S., H.A.W. and S.J.; writing—review and editing, S.J. and H.M.B.; supervision, H.A.W. and H.M.B.; project administration, S.J.; funding acquisition, H.M.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Singh, R. A modified homotopy perturbation method for nonlinear singular Lane–Emden equations arising in various physical models. Int. J. Appl. Comput. Math. 2019, 5, 64. [Google Scholar] [CrossRef]
  2. Abdullah Alderremy, A.; Elzaki, T.M.; Chamekh, M. Modified Adomian decomposition method to solve generalized Emden–Fowler systems for singular IVP. Math. Probl. Eng. 2019, 2019, 6097095. [Google Scholar] [CrossRef]
  3. Adel, W.; Sabir, Z. Solving a new design of nonlinear second-order Lane–Emden pantograph delay differential model via Bernoulli collocation method. Eur. Phys. J. Plus 2020, 135, 427. [Google Scholar] [CrossRef]
  4. Sabir, Z.; Sakar, M.G.; Yeskindirova, M.; Saldir, O. Numerical investigations to design a novel model based on the fifth order system of Emden–Fowler equations. Theor. Appl. Mech. Lett. 2020, 10, 333–342. [Google Scholar] [CrossRef]
  5. Bender, C.M.; Milton, K.A.; Pinsky, S.S.; Simmons, L.M., Jr. A new perturbative approach to nonlinear problems. J. Math. Phys. 1989, 30, 1447–1455. [Google Scholar] [CrossRef]
  6. Shawagfeh, N.T. Non-perturbative approximate solution for Lane–Emden equation. J. Math. Phys. 1993, 34, 4364–4369. [Google Scholar] [CrossRef]
  7. Wazwaz, A.M. A new algorithm for solving differential equations of Lane–Emden type. Appl. Math. Comput. 2001, 118, 287–310. [Google Scholar] [CrossRef]
  8. Liao, S. A new analytic algorithm of Lane–Emden type equations. Appl. Math. Comput. 2003, 142, 1–16. [Google Scholar] [CrossRef]
  9. Parand, K.; Razzaghi, M. Rational Legendre approximation for solving some physical problems on semi-infinite intervals. Phys. Scr. 2004, 69, 353. [Google Scholar] [CrossRef]
  10. Nouh, M.I. Accelerated power series solution of polytropic and isothermal gas spheres. New Astron. 2004, 9, 467–473. [Google Scholar] [CrossRef]
  11. Guirao, J.L.; Sabir, Z.; Saeed, T. Design and numerical solutions of a novel third-order nonlinear Emden–Fowler delay differential model. Math. Probl. Eng. 2020, 2020, 7359242. [Google Scholar] [CrossRef]
  12. Sabir, Z.; Raja, M.A.Z.; Wahab, H.A.; Altamirano, G.C.; Zhang, Y.D.; Le, D.N. Integrated intelligence of neuro-evolution with sequential quadratic programming for second-order Lane–Emden pantograph models. Math. Comput. Simul. 2021, 188, 87–101. [Google Scholar] [CrossRef]
  13. Sabir, Z.; Raja, M.A.Z.; Guirao, J.L.; Saeed, T. Solution of novel multi-fractional multi-singular Lane–Emden model using the designed FMNEICS. Neural Comput. Appl. 2021, 2021, 1–16. [Google Scholar] [CrossRef]
  14. Lane, J.H. ART. IX.--On the Theoretical Temperature of the Sun; under the Hypothesis of a Gaseous Mass maintaining its Volume by its Internal Heat, and depending on the Laws of Gases as known to Terrestrial Experiment. Am. J. Sci. Arts 1870, 50, 57. [Google Scholar] [CrossRef]
  15. Wong, J.S. On the generalized Emden–Fowler equation. Siam Rev. 1975, 17, 339–360. [Google Scholar] [CrossRef]
  16. Yu, J.; Guo, Z. Boundary value problems of discrete generalized Emden-Fowler equation. Sci. China Ser. A Math. 2006, 49, 1303–1314. [Google Scholar] [CrossRef]
  17. Ghergu, M.; Rădulescu, V.D. Bifurcation and asymptotics for the Lane–Emden–Fowler equation. Comptes Rendus Math. 2003, 337, 259–264. [Google Scholar] [CrossRef]
  18. Rach, R.; Duan, J.S.; Wazwaz, A.M. Solving coupled Lane–Emden boundary value problems in catalytic diffusion reactions by the Adomian decomposition method. J. Math. Chem. 2014, 52, 255–267. [Google Scholar] [CrossRef]
  19. Boubaker, K.; Van Gorder, R.A. Application of the BPES to Lane–Emden equations governing polytropic and isothermal gas spheres. New Astron. 2012, 17, 565–569. [Google Scholar] [CrossRef]
  20. Luo, T.; Xin, Z.; Zeng, H. Nonlinear asymptotic stability of the Lane-Emden solutions for the viscous gaseous star problem with degenerate density dependent viscosities. Commun. Math. Phys. 2016, 347, 657–702. [Google Scholar] [CrossRef]
  21. Taghavi, A.; Pearce, S. A solution to the Lane–Emden equation in the theory of stellar structure utilizing the Tau method. Math. Methods Appl. Sci. 2013, 36, 1240–1247. [Google Scholar] [CrossRef]
  22. Khan, J.A.; Raja, M.A.Z.; Rashidi, M.M.; Syam, M.I.; Wazwaz, A.M. Nature-inspired computing approach for solving non-linear singular Emden–Fowler problem arising in electromagnetic theory. Connect. Sci. 2015, 27, 377–396. [Google Scholar] [CrossRef]
  23. Ramos, J.I. Linearization methods in classical and quantum mechanics. Comput. Phys. Commun. 2003, 153, 199–208. [Google Scholar] [CrossRef]
  24. Bhrawy, A.H.; Alofi, A.S.; Van Gorder, R.A. An Efficient Collocation Method for a Class of Boundary Value Problems Arising in Mathematical Physics and Geometry. In Abstract and Applied Analysis; Hindawi Publishing Corporation: New York, NY, USA, 2014; Volume 2014. [Google Scholar]
  25. Sabir, Z.; Raja, M.A.Z.; Guirao, J.L.; Shoaib, M. Integrated intelligent computing with neuro-swarming solver for multi-singular fourth-order nonlinear Emden–Fowler equation. Comput. Appl. Math. 2020, 39, 307. [Google Scholar] [CrossRef]
  26. Sabir, Z.; Saoud, S.; Raja, M.A.Z.; Wahab, H.A.; Arbi, A. Heuristic computing technique for numerical solutions of nonlinear fourth order Emden–Fowler equation. Math. Comput. Simul. 2020, 178, 534–548. [Google Scholar] [CrossRef]
  27. Sabir, Z.; Wahab, H.A.; Umar, M.; Erdoğan, F. Stochastic numerical approach for solving second order nonlinear singular functional differential equation. Appl. Math. Comput. 2019, 363, 124605. [Google Scholar] [CrossRef]
  28. Sabir, Z.; Raja, M.A.Z.; Umar, M.; Shoaib, M. Neuro-swarm intelligent computing to solve the second-order singular functional differential model. Eur. Phys. J. Plus 2020, 135, 474. [Google Scholar] [CrossRef]
  29. Raja, M.A.Z.; Mehmood, J.; Sabir, Z.; Nasab, A.K.; Manzar, M.A. Numerical solution of doubly singular nonlinear systems using neural networks-based integrated intelligent computing. Neural Comput. Appl. 2019, 31, 793–812. [Google Scholar] [CrossRef]
  30. Umar, M.; Sabir, Z.; Raja, M.A.Z. Intelligent computing for numerical treatment of nonlinear prey–predator models. Appl. Soft Comput. 2019, 80, 506–524. [Google Scholar] [CrossRef]
  31. Sabir, Z.; Manzar, M.A.; Raja, M.A.Z.; Sheraz, M.; Wazwaz, A.M. Neuro-heuristics for nonlinear singular Thomas-Fermi systems. Appl. Soft Comput. 2018, 65, 152–169. [Google Scholar] [CrossRef]
  32. Umar, M.; Sabir, Z.; Amin, F.; Guirao, J.L.; Raja, M.A.Z. Stochastic numerical technique for solving HIV infection model of CD4+ T cells. Eur. Phys. J. Plus 2020, 135, 403. [Google Scholar] [CrossRef]
  33. Umar, M.; Sabir, Z.; Raja, M.A.Z.; Aguilar, J.G.; Amin, F.; Shoaib, M. Neuro-swarm intelligent computing paradigm for nonlinear HIV infection model with CD4+ T-cells. Math. Comput. Simul. 2021, 188, 241–253. [Google Scholar] [CrossRef]
  34. Umar, M.; Sabir, Z.; Raja, M.A.Z.; Baskonus, H.M.; Yao, S.W.; Ilhan, E. A novel study of Morlet neural networks to solve the nonlinear HIV infection system of latently infected cells. Results Phys. 2021, 25, 104235. [Google Scholar] [CrossRef]
  35. Sabir, Z.; Raja, M.A.Z.; Guirao, J.L.; Shoaib, M. A neuro-swarming intelligence-based computing for second order singular periodic non-linear boundary value problems. Front. Phys. 2020, 8, 224. [Google Scholar] [CrossRef]
  36. Sabir, Z.; Raja, M.A.Z.; Guirao, J.L.; Shoaib, M. A novel design of fractional Meyer wavelet neural networks with application to the nonlinear singular fractional Lane-Emden systems. Alex. Eng. J. 2021, 60, 2641–2659. [Google Scholar] [CrossRef]
  37. Sridhar, R.; Chandrasekaran, M.; Sriramya, C.; Page, T. Optimization of Heterogeneous Bin Packing Using Adaptive Genetic Algorithm. In IOP Conference Series: Materials Science and Engineering; IOP Publishing: Chennai, India, 2017; Volume 183, p. 012026. [Google Scholar]
  38. Chang, F.S. Greedy-Search-based Multi-Objective Genetic Algorithm for Emergency Humanitarian Logistics Scheduling. Expert Syst. Appl. 2014, 41, 2947–2956. [Google Scholar]
  39. Sabir, Z.; Wahab, H.A.; Umar, M.; Sakar, M.G.; Raja, M.A.Z. Novel design of Morlet wavelet neural network for solving second order Lane–Emden equation. Math. Comput. Simul. 2020, 172, 1–14. [Google Scholar] [CrossRef]
  40. Sabir, Z.; Amin, F.; Pohl, D.; Guirao, J.L. Intelligence computing approach for solving second order system of Emden–Fowler model. J. Intell. Fuzzy Syst. 2020, 1–16, Preprint. [Google Scholar] [CrossRef]
  41. Liang, H.; Zou, J.; Zuo, K.; Khan, M.J. An improved genetic algorithm optimization fuzzy controller applied to the wellhead back pressure control system. Mech. Syst. Signal Process. 2020, 142, 106708. [Google Scholar] [CrossRef]
  42. Elias, I.; Rubio, J.D.J.; Martinez, D.I.; Vargas, T.M.; Garcia, V.; Mujica-Vargas, D.; Meda-Campaña, J.A.; Pacheco, J.; Gutierrez, G.J.; Zacarias, A. Genetic algorithm with radial basis mapping network for the electricity consumption modeling. Appl. Sci. 2020, 10, 4239. [Google Scholar] [CrossRef]
  43. Pramanik, S.; Singh, R.P.; Ghosh, R. Application of bi-orthogonal wavelet transform and genetic algorithm in image steganography. Multimed. Tools Appl. 2020, 79, 17463–17482. [Google Scholar] [CrossRef]
  44. Alhijawi, B.; Kilani, Y. A collaborative filtering recommender system using genetic algorithm. Inf. Process. Manag. 2020, 57, 102310. [Google Scholar] [CrossRef]
  45. Zan, X.; Wu, Z.; Guo, C.; Yu, Z. A Pareto-based genetic algorithm for multi-objective scheduling of automated manufacturing systems. Adv. Mech. Eng. 2020, 12, 1687814019885294. [Google Scholar] [CrossRef]
  46. Zhou, Z.; Yang, Q. An Active Set Smoothing Method for Solving Unconstrained Minimax Problems. Math. Probl. Eng. 2020, 2020, 9108150. [Google Scholar] [CrossRef]
  47. Arnström, D. On Complexity Certification of Active-Set QP Methods with Applications to Linear MPC. Ph.D. Thesis, Linköping University, LiU-Tryck, Linköping, Sweden, 2021. [Google Scholar]
  48. Piller, O.; Elhay, S.; Deuerlein, J.W.; Simpson, A.R. A content-based active-set method for pressure-dependent models of water distribution systems with flow controls. J. Water Resour. Plan. Manag. 2020, 146, 04020009. [Google Scholar] [CrossRef] [Green Version]
  49. Azizi, M.; Amir Fakhrian, M.; Araghi, M.A.F. A fuzzy system based active set algorithm for the numerical solution of the optimal control problem governed by partial differential equation. Eur. J. Control 2020, 54, 99–110. [Google Scholar] [CrossRef]
  50. Abide, S.; Barboteu, M.; Cherkaoui, S.; Danan, D.; Dumont, S. Inexact primal–dual active set method for solving elastodynamic frictional contact problems. Comput. Math. Appl. 2021, 82, 36–59. [Google Scholar] [CrossRef]
  51. Antonau, I.; Hojjat, M.; Bletzinger, K.U. Relaxed gradient projection algorithm for constrained node-based shape optimization. Struct. Multidiscip. Optim. 2021, 63, 1633–1651. [Google Scholar] [CrossRef]
  52. Chen, P.; Li, Y.; Zhang, X. Cauchy problem for stochastic non-autonomous evolution equations governed by noncompact evolution families. Discret. Contin. Dyn. Syst.-B 2021, 26, 1531. [Google Scholar]
  53. Chen, P. Periodic solutions to non-autonomous evolution equations with multi-delays. Discret. Contin. Dyn. Syst.-B 2021, 26, 2921. [Google Scholar]
  54. Chen, P.; Zhang, X. Non-autonomous stochastic evolution equations of parabolic type with nonlocal initial conditions. Discret. Contin. Dyn. Syst.-B 2021, 26, 4681. [Google Scholar] [CrossRef]
Figure 1. Framework of designed GNNs-GA-ASA methodology to solve the HO-NSDM.
Figure 1. Framework of designed GNNs-GA-ASA methodology to solve the HO-NSDM.
Fractalfract 05 00176 g001
Figure 2. Comparison of best weights and results for each problem of the HO-NSDM.
Figure 2. Comparison of best weights and results for each problem of the HO-NSDM.
Fractalfract 05 00176 g002
Figure 3. AE and performance indices for each problem of the HO-NSDM.
Figure 3. AE and performance indices for each problem of the HO-NSDM.
Fractalfract 05 00176 g003
Figure 4. Convergence performance of FIT for each problem of the HO-NSDM.
Figure 4. Convergence performance of FIT for each problem of the HO-NSDM.
Fractalfract 05 00176 g004
Figure 5. Convergence performance of MAD for each problem of the HO-NSDM.
Figure 5. Convergence performance of MAD for each problem of the HO-NSDM.
Fractalfract 05 00176 g005
Figure 6. Convergence performance of TIC for each problem of the HO-NSDM.
Figure 6. Convergence performance of TIC for each problem of the HO-NSDM.
Fractalfract 05 00176 g006
Figure 7. Convergence performance of ENSE for each problem of the HO-NSDM.
Figure 7. Convergence performance of ENSE for each problem of the HO-NSDM.
Fractalfract 05 00176 g007
Table 1. Optimization procedures-based GA-ASA to solve the HO-NSDM.
Table 1. Optimization procedures-based GA-ASA to solve the HO-NSDM.
start of GAs
    Inputs:
    The applicant solutions with real entries are equal to the unidentified parameters in GNNs as: W = [ a , p , q ], where a = [ a 1 , a 2 , a 3 , , a m ] , p = [ p 1 , p 2 , p 3 , , p m ] and q = [ q 1 , q 2 , q 3 , , q m ]
    Population: A Chromosomes set is designated as:
     P = [ W 1 , W 2 , W 3 , , W n ] t , W i = [ a i , p i , q i ]t
    Output: The ANNs based decision variables are optimized with GA as WBest-GA
    Initialization: Form W with real entries. Adjust W vector to set an initial population “P”. Adjust the “gaoptimset” and “GA” functions.
    Evaluation of Fitness: Evaluate the fitness ( ξ F ) of P for W with by using Equations (8) to (10)
    Termination: The procedure stops, if any below criteria are obtained.
  • Fitness { ξ F = 10−21}, ‘TolFun’ = ‘TolCon’ = 10−21
  • PopulationSize = 240, StallGenLimit = 100, Generations = 75,
  • Other values as default

    Then [store], when the following standards meet
    Ranking: Adjust W in P to observe the excellence of the fitness
    Reproduction:
  • Selection = [selection uniform].
  • Mutations = [mutation adaptfeasible].
  • Crossovers = [crossover heuristic].
  • Elitism = [Best ranked individuals in population P]

    Use the ‘ ξ F evaluation
    Storage: Save WBest-GA, ξ F , time, function counts and generation.
End of GA

ASA process Start
    Inputs: WBest-GA is the starting point
    Output: The GA-ASA best weights are indicated as WGA-ASA
    Initialize: Iterations, Bounded constraints and assignments.
    Terminate: Terminate the scheme, when
     ξ F ≤ 10−20, TolX ≤ 10−20, MaxFunEvals ≤ 260,000
    TolFun ≤ 10−19 & Iterations = 1200 obtains
    While (Terminate)
    Formulation of fitness
    For ξ F of W, the Equations (8) to (10) are used
    Modifications
    For ASA, invoke fmincon. Adjust W for each ASA generation. Compute ξ F , W again for Equations (8) to (10)
    Store
    Accumulate the WGA-ASA, function counts, ξ F , time and iterations for ASA trials.
Procedure of ASA End
Data Generations
Repeat the data 30 times for the GA-ASA to achieve a larger data-set using the optimization variables of GNNs to solve the HO-NSDM
Table 2. Statistical interpretations for each problem of the HO-NSDM.
Table 2. Statistical interpretations for each problem of the HO-NSDM.
Problem 1Problem 2Problem 3
MinMeanMedS.I.RMinMeanMedS.I.RMinMeanMedS.I.R
04.57 × 10−51.54 × 10−15.70 × 10−27.93 × 10−22.26 × 10−41.10 × 10−14.50 × 10−25.24 × 10−24.14 × 10−57.37 × 10−14.10 × 10−28.66 × 10−2
0.14.91 × 10−51.55 × 10−15.76 × 10−27.94 × 10−22.22 × 10−41.10 × 10−14.50 × 10−25.23 × 10−26.05 × 10−57.50 × 10−14.17 × 10−28.74 × 10−2
0.24.75 × 10−51.57 × 10−15.76 × 10−27.92 × 10−22.17 × 10−41.10 × 10−14.48 × 10−25.20 × 10−27.74 × 10−57.79 × 10−14.27 × 10−29.06 × 10−2
0.33.45 × 10−51.57 × 10−15.61 × 10−27.78 × 10−22.11 × 10−41.09 × 10−14.38 × 10−25.11 × 10−28.20 × 10−58.38 × 10−14.32 × 10−29.62 × 10−2
0.41.27 × 10−51.53 × 10−15.24 × 10−27.39 × 10−21.95 × 10−41.05 × 10−14.10 × 10−24.87 × 10−27.46 × 10−59.31 × 10−14.25 × 10−21.03 × 10−2
0.51.14× 10−61.44 × 10−14.51 × 10−26.59 × 10−21.63 × 10−49.81 × 10−23.53 × 10−24.38 × 10−25.55 × 10−51.06 × 10−13.95 × 10−21.10 × 10−2
0.63.17 × 10−51.28 × 10−13.26 × 10−25.31 × 10−21.09 × 10−48.65 × 10−22.58 × 10−23.57 × 10−22.31 × 10−51.21 × 10−13.34 × 10−21.23 × 10−2
0.77.46 × 10−51.02 × 10−11.35 × 10−23.33 × 10−23.55 × 10−56.98 × 10−21.25 × 10−22.39 × 10−22.34 × 10−51.40 × 10−12.33 × 10−21.36 × 10−2
0.81.04 × 10−47.77 × 10−21.38 × 10−29.44 × 10−35.43 × 10−55.18 × 10−23.65 × 10−36.85 × 10−35.21 × 10−51.61 × 10−18.77 × 10−31.52 × 10−2
0.91.94 × 10−47.87 × 10−24.21 × 10−22.72 × 10−21.52 × 10−44.77 × 10−21.92 × 10−29.68 × 10−31.59 × 10−41.86 × 10−11.45 × 10−21.69 × 10−2
12.75 × 10−41.04 × 10−17.48 × 10−25.06 × 10−22.53 × 10−45.55 × 10−23.77 × 10−22.24 × 10−22.48 × 10−42.13 × 10−13.48 × 10−21.87 × 10−2
Table 3. Complexity performances for each problem of the HO-NSDM.
Table 3. Complexity performances for each problem of the HO-NSDM.
ProblemIterationsExecuted TimeFunction Counts
MeanSTDMeanSTDMeanSTD
1113.292721.4676515050174,384.231,050.41
2105.228230.466361455.467271.3052162,386.445,633.09
3119.721214.0133115050185,438.218,692.24
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Sabir, Z.; Wahab, H.A.; Javeed, S.; Baskonus, H.M. An Efficient Stochastic Numerical Computing Framework for the Nonlinear Higher Order Singular Models. Fractal Fract. 2021, 5, 176. https://doi.org/10.3390/fractalfract5040176

AMA Style

Sabir Z, Wahab HA, Javeed S, Baskonus HM. An Efficient Stochastic Numerical Computing Framework for the Nonlinear Higher Order Singular Models. Fractal and Fractional. 2021; 5(4):176. https://doi.org/10.3390/fractalfract5040176

Chicago/Turabian Style

Sabir, Zulqurnain, Hafiz Abdul Wahab, Shumaila Javeed, and Haci Mehmet Baskonus. 2021. "An Efficient Stochastic Numerical Computing Framework for the Nonlinear Higher Order Singular Models" Fractal and Fractional 5, no. 4: 176. https://doi.org/10.3390/fractalfract5040176

Article Metrics

Back to TopTop