RETRACTED ARTICLE: Solutions of Bagley–Torvik and Painlevé equations of fractional order using iterative reproducing kernel algorithm with error estimates

This paper presents iterative reproducing kernel algorithm for obtaining the numerical solutions of Bagley–Torvik and Painlevé equations of fractional order. The representation of the exact and the numerical solutions is given in the W ^ 2 3 0 , 1 , W 2 3 0 , 1 , and W 2 1 0 , 1 inner product spaces...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Neural computing & applications Ročník 29; číslo 5; s. 1465 - 1479
Hlavní autori: Abu Arqub, Omar, Maayah, Banan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Springer London 01.03.2018
Springer Nature B.V
Predmet:
Artificial Intelligence
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Data Mining and Knowledge Discovery
Image Processing and Computer Vision
Original Article
Probability and Statistics in Computer Science
Bagley–Torvik equation
34B15
35F10
Reproducing kernel algorithm
Fourier series expansion
Painlevé equation
47B32
Fractional-order derivative
34A08
ISSN:0941-0643, 1433-3058
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper presents iterative reproducing kernel algorithm for obtaining the numerical solutions of Bagley–Torvik and Painlevé equations of fractional order. The representation of the exact and the numerical solutions is given in the W ^ 2 3 0 , 1 , W 2 3 0 , 1 , and W 2 1 0 , 1 inner product spaces. The computation of the required grid points is relying on the R ^ t 3 s , R t 3 s , and R t 1 s reproducing kernel functions. An efficient construction is given to obtain the numerical solutions for the equations together with an existence proof of the exact solutions based upon the reproducing kernel theory. Numerical solutions of such fractional equations are acquired by interrupting the n -term of the exact solutions. In this approach, numerical examples were analyzed to illustrate the design procedure and confirm the performance of the proposed algorithm in the form of tabulate data, numerical comparisons, and graphical results. Finally, the utilized results show the significant improvement in the algorithm while saving the convergence accuracy and time.
Bibliografia:ObjectType-Correction/Retraction-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-016-2484-4