IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v494y2025ics0096300325000116.html
   My bibliography  Save this article

Convergence analysis of an efficient multistep pseudo-spectral continuous Galerkin approach for solving Volterra integro-differential equations

Author

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

Abstract

In this research article, we apply the multistep pseudo-spectral continuous Galerkin approach for solving the first-order Volterra integro-differential equations by the aid of the orthogonal Legendre polynomials. This approach is a recursive scheme that the accuracy of the numerical solution at the present subinterval depends on the numerical solutions at the previous subintervals. Convergence analysis of the suggested numerical approach is discussed via using an important auxiliary problem. Extensive numerical test problems with high oscillating analytical solutions, exact solutions with steep gradients, and long time computational intervals are considered and both of the h-version and p-version convergence rates are examined experimentally. Finally, the conclusions regarding the presented approach and the considered model are provided and we point out to some other models that can be solved numerically via this efficient and robust method.

Suggested Citation

  • Yang, Yin & Yao, Pai & Tohidi, Emran, 2025. "Convergence analysis of an efficient multistep pseudo-spectral continuous Galerkin approach for solving Volterra integro-differential equations," Applied Mathematics and Computation, Elsevier, vol. 494(C).
  • Handle: RePEc:eee:apmaco:v:494:y:2025:i:c:s0096300325000116
    DOI: 10.1016/j.amc.2025.129284
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2025.129284?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:apmaco:v:494:y:2025:i:c:s0096300325000116. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.