IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v227y2025icp511-526.html
   My bibliography  Save this article

An efficient recursive technique with Padé approximation for a kind of Lane–Emden type equations emerging in various physical phenomena

Author

Listed:
  • Jyoti,
  • Singh, Mandeep

Abstract

The study numerically examined a class of nonlinear singular differential problems known as the Lane–Emden differential equation, which emerges in numerous real-world situations. The primary goal of this work is to formulate a computationally efficient iterative technique for solving the nonlinear Lane–Emden initial value problems. The proposed approach is a hybrid of the homotopy perturbation method and the Padé approximation. The nonlinear singular Lane–Emden initial value problem (SLEIVP) is transformed into an equivalent recursive integral employing the Picard’s approach. To resolve the singularity and nonlinearity, the recursive integral equation is transformed into a system of integral equations by using the homotopy notion. Furthermore, to enhance the convergence rate of the technique, Padé approximation is taken into account. The convergence analysis for the proposed approach is also conducted. The present technique is tested on SLEIVPs and numerical findings are compared with the existing techniques, to demonstrate the accuracy, effectiveness and ease of use.

Suggested Citation

  • Jyoti, & Singh, Mandeep, 2025. "An efficient recursive technique with Padé approximation for a kind of Lane–Emden type equations emerging in various physical phenomena," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 227(C), pages 511-526.
  • Handle: RePEc:eee:matcom:v:227:y:2025:i:c:p:511-526
    DOI: 10.1016/j.matcom.2024.08.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424003355
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2024.08.025?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:227:y:2025:i:c:p:511-526. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.