Lagrange Operational Matrix Methods to Lane–Emden, Riccati’s and Bessel’s Equations

Abstract

The current study is presented to develop two approaches and methodologies to find the numerical solution of linear and non-linear initial value problems such as Lane–Emden type equation, Riccati’s equation and Bessel’s equation of order zero based on approximation. The function approximations (scheme-I and scheme-II) are presented to find the numerical solutions of linear and non-linear initial value problems by using Gauss Legendre roots as node points and random node points in the domain [0, 1]. In the scheme-I, the roots of Legendre polynomial are used as node points for Lagrange polynomials and in scheme-II, we have taken random node points in the domain [0, 1] and orthogonalize the resulting Lagrange polynomials using Gram–Schmidt orthogonalization process. Firstly, we have introduced the function approximations by using generating interpolating scaling functions (ISF) and orthonormal Lagrangian basis functions (OLBF) over the space \(L^{2}[0,1]\) then we have constructed the operational matrices of integration and product operational matrices based on newly designed approximations namely ISF and OLBF. These operational matrices convert given linear and non-linear initial value problems into the associated system of algebraic equations. Finally, we have established error bounds (Lemmas 1, 2) of both scheme-I and scheme-II including the function approximations. The efficiency of the proposed schemes has been confirmed with several test examples including numerical stability. So, the schemes are simple, efficient and produces very accurate numerical results in considerably small number of basis functions and hence reduces computational effort.