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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
