This work presents the novel Leal-polynomials (LP) for the approximation of nonlinear differential equations of different kind. The main characteristic of LPs is that they satisfy multiple expansion points and… Click to show full abstract
This work presents the novel Leal-polynomials (LP) for the approximation of nonlinear differential equations of different kind. The main characteristic of LPs is that they satisfy multiple expansion points and its derivatives as a mechanism to replicate behaviour of the nonlinear problem, giving more accuracy within the region of interest. Therefore, the main contribution of this work is that LP satisfies the successive derivatives in some specific points, resulting more accurate polynomials than Taylor expansion does for the same degree of their respective polynomials. Such characteristic makes of LPs a handy and powerful tool to approximate different kind of differential equations including: singular problems, initial condition and boundary-valued problems, equations with discontinuities, coupled differential equations, high-order equations, among others. Additionally, we show how the process to obtain the polynomials is straightforward and simple to implement; generating a compact, and easy to compute, expression. Even more, we present the process to approximate Gelfand's equation, an equation of an isothermal reaction, a model for chronic myelogenous leukemia, Thomas-Fermi equation, and a high order nonlinear differential equations with discontinuities getting, as result, accurate, fast and compact approximate solutions. In addition, we present the computational convergence and error studies for LPs resulting convergent polynomials and error tendency to zero as the order of LPs increases for all study cases. Finally, a study of CPU time shows that LPs require a few nano-seconds to be evaluated, which makes them suitable for intensive computing applications.
               
Click one of the above tabs to view related content.