Numerical similarity solution for a variable coefficient K(m, n) equation

Marios A. Christou, Nectarios C. Papanicolaou, Christodoulos Sophocleous

    Research output: Contribution to journalArticle

    Abstract

    A technique for finding numerical similarity solutions to an initial boundary value problem (IBVP) for generalized K(m, n) equations is described. The equation under consideration is nonlinear and has variable coefficients. The original problem is transformed with the aid of Lie symmetries to an initial value problem (IVP) for a nonlinear third-order ordinary differential equation. The existence and uniqueness of the solution are examined, and the problem is consequently solved with the aid of a finite-difference scheme for various values of the governing parameters. In lieu of an exact symbolic solution, the scheme is validated by comparing the numerical solutions with the approximate analytic solutions obtained with the aid of the method of successive approximations in their region of validity. The accuracy, efficiency, and consistency of the scheme are demonstrated. Numerical solutions to the original initial boundary value problem are constructed for selected parameter values with the aid of the transforms. The qualitative behavior of the solutions as a function of the governing parameters is analyzed, and it is found that the examined IBVPs for generalized K(m, n) equations with variable coefficients that are functions of time, do not admit solitary wave or compacton solutions.

    Original languageEnglish
    Pages (from-to)1098-1111
    Number of pages14
    JournalComputational and Applied Mathematics
    Volume37
    Issue number2
    DOIs
    Publication statusPublished - 1 May 2018

    Keywords

    • Finite-difference methods
    • K(m, n) equations
    • Lie symmetries
    • Nonlinear differential equations

    Fingerprint Dive into the research topics of 'Numerical similarity solution for a variable coefficient K(m, n) equation'. Together they form a unique fingerprint.

  • Cite this