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

An improved meshless finite integration method for the time fractional diffusion and high order equations

Author

Listed:
  • Liu, Pengyuan
  • Lei, Min
  • Hon, Yiu-Chung

Abstract

In this paper, an Improved Finite Integration Method (IFIM) is developed for the numerical solution of time-fractional diffusion equations (TFDEs) and time fractional partial differential equations (TFPDEs) of the fourth order in space. For the temporal discretization, the Hadamard finite-part integral is employed and approximated using piecewise Quadratic Interpolation Polynomials (QIP), which exhibit superior accuracy compared to the classical first-order finite difference scheme (L1). For spatial discretization, a multilayer Modified Shifted Chebyshev Integration (M-SCI) scheme is explicitly constructed to compute high-order integration matrices analytically. This modification significantly improves computational performance in solving high-order spatial differential operators. Furthermore, the error estimates for the IFIM incorporating the QIP-M-SCI scheme are established in the context of TFDEs. Several numerical experiments are presented to verify the theoretical results and demonstrate the effectiveness of the proposed method. Comparative studies are conducted among three numerical schemes – L1-M-SCI, QIP-SCI, and QIP-M-SCI – highlighting the superior accuracy and efficiency of the IFIM with QIP-M-SCI in solving both TFDEs and TFPDEs.

Suggested Citation

  • Liu, Pengyuan & Lei, Min & Hon, Yiu-Chung, 2026. "An improved meshless finite integration method for the time fractional diffusion and high order equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 241(PA), pages 15-39.
    • Handle: RePEc:eee:matcom:v:241:y:2026:i:pa:p:15-39
    DOI: 10.1016/j.matcom.2025.08.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847542500357X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2025.08.014?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:241:y:2026:i:pa:p:15-39. 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.