Numerical solutions of systems of first-order, two-point BVPs based on the reproducing kernel algorithm

The aim of the present analysis is to implement a relatively recent computational algorithm, reproducing kernel Hilbert space, for obtaining the solutions of systems of first-order, two-point boundary value problems for ordinary differential equations. The reproducing kernel Hilbert space is constru...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Calcolo Jg. 55; H. 3; S. 1 - 28
1. Verfasser: Abu Arqub, Omar
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.09.2018
Springer Nature B.V
Schlagworte:
Algorithms
Boundary value problems
Computation
Computer simulation
Differential equations
Evolutionary algorithms
Hilbert space
Kernel functions
Mathematics
Mathematics and Statistics
Numerical Analysis
Numerical methods
Ordinary differential equations
Simulated annealing
Theory of Computation
Viability
Boundary value problems
34B15
Gram–Schmidt process
Reproducing kernel algorithm
34K28
47B32
Initial–final conditions
ISSN:0008-0624, 1126-5434
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The aim of the present analysis is to implement a relatively recent computational algorithm, reproducing kernel Hilbert space, for obtaining the solutions of systems of first-order, two-point boundary value problems for ordinary differential equations. The reproducing kernel Hilbert space is constructed in which the initial–final conditions of the systems are satisfied. Whilst, three smooth kernel functions are used throughout the evolution of the algorithm in order to obtain the required grid points. An efficient construction is given to obtain the numerical solutions for the systems together with an existence proof of the exact solutions based upon the reproducing kernel theory. In this approach, computational results of some numerical examples are presented to illustrate the viability, simplicity, and applicability of the algorithm developed. Finally, the utilized results show that the present algorithm and simulated annealing provide a good scheduling methodology to such systems compared with other numerical methods.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0008-0624
1126-5434
DOI:10.1007/s10092-018-0274-3