IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v240y2026icp403-422.html

A high accurate numerical framework for the solution of the vanishing-delay Volterra integro-differential equations via Legendre pseudo-spectral element approach

Author

Listed:
  • Yang, Yin
  • Yao, Pai
  • Tohidi, Emran

Abstract

In this study, we present a robust numerical framework for solving vanishing-delay Volterra integro-differential equations (VDVIDEs) using the Legendre pseudo-spectral element approach. Our first motivation stems from the limitations of traditional methods such as Runge–Kutta schemes when applied to linear vanishing-delay models. Building upon the robustness of pseudo-spectral element approaches, we extend the application to VDVIDEs and introduce a multi-step Legendre pseudo-spectral Galerkin method (MSLPSGM) to overcome issues related to long computational intervals and high oscillatory solutions. Our suggested approach provides upper bounds for estimating both the solution and its derivative, demonstrating a spectral rate of convergence as the length of sub-intervals decreases and the degree of approximations increases. Extensive numerical examples showcase the robustness and precision of the MSLPSGM in handling VDVIDEs with steep gradients and large computational intervals. The framework’s ability to maintain accuracy across various challenging scenarios underscores its potential as a powerful tool for solving complex integro-differential equations.

Suggested Citation

  • Yang, Yin & Yao, Pai & Tohidi, Emran, 2026. "A high accurate numerical framework for the solution of the vanishing-delay Volterra integro-differential equations via Legendre pseudo-spectral element approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 240(C), pages 403-422.
  • Handle: RePEc:eee:matcom:v:240:y:2026:i:c:p:403-422
    DOI: 10.1016/j.matcom.2025.07.030
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2025.07.030?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:240:y:2026:i:c:p:403-422. 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.