.png){kind=icon}
Return
Chebyshev reproducing kernel method: application to two-point boundary value problems
.png){kind=icon}
OA
AI
DOI：10.1186/s13662-017-1089-2.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a new implementation of the reproducing kernel method is proposed in order to obtain the accurate numerical solution of two-point boundary value problems with Dirichlet boundary conditions. Based on reproducing kernel theory, reproducing kernel functions with polynomial form will be constructed in the reproducing kernel spaces spanned by the Chebyshev basis polynomials. Convergence analysis and an error estimation for the present method in L-W(2) space is also discussed. The numerical solutions obtained by this method are compared with the exact solutions. The results reveal that the proposed method is quite efficient and accurate.
Keywords:
two-point boundary value problem
Dirichlet boundary conditions
polynomial reproducing kernel
Chebyshev polynomials
convergence
error estimation
Journal
IF:
3.1
Papers:
4.8K
Citations:
7.4K
Organization
Cited Papers
ShareSaveApplication of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSaveShareSaveShareSave
View more