Comparison of three unsupervised neural network models for first Painlevé Transcendent
Sequential quadratic programming
Sigmoid function
Benchmark (surveying)
DOI:
10.1007/s00521-014-1774-y
Publication Date:
2014-12-12T04:52:58Z
AUTHORS (5)
ABSTRACT
In this paper, a reliable soft computing framework is presented for the approximate solution of initial value problem (IVP) of first Painleve equation using three unsupervised neural network models optimized with sequential quadratic programming (SQP). These mathematical models are constructed in the form of feed-forward architecture including log-sigmoid, radial base and tan-sigmoid activation functions in the hidden layers. The optimization of designed parameters for each model is performed with SQP, an efficient constraint optimization problem-solving algorithm. The designed methodology is tested on the IVP, and comparative study is carried out with standard solution based on numerical and analytical solvers. The accuracy, convergence and effectiveness of the schemes are validated on the given benchmark problem by large number of simulations and their comprehensive analysis.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (46)
CITATIONS (30)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....