An efficient computational method for linear fifth-order two-point boundary value problems

Abstract

In this paper, we present a new algorithm to solve general linear fifth-order boundary value problems (BVPs) in the reproducing kernel space $W_2^6[a,b]$. Representation of the exact solution is given in the reproducing kernel space. Its approximate solution is obtained by truncating the $n$-term of the exact solution. Some examples are displayed to demonstrate the computational efficiency of the method.