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

Double fast algorithm for solving time-space fractional diffusion problems with spectral fractional Laplacian

Author

Listed:
  • Yang, Yi
  • Huang, Jin

Abstract

This paper presents an efficient and concise double fast algorithm to solve high dimensional time-space fractional diffusion problems with spectral fractional Laplacian. We first establish semi-discrete scheme of time-space fractional diffusion equation, which uses linear finite element or fourth-order compact difference method combining with matrix transfer technique to approximate spectral fractional Laplacian. Then we introduce a fast time-stepping L1 scheme for time discretization. The proposed scheme can exactly evaluate fractional power of matrix and perform matrix-vector multiplication at per time level by using discrete sine transform, which doesn't need to resort to any iteration method and can significantly reduce computation cost and memory requirement. Further, we address stability and convergence analyses of full discrete scheme based on fast time-stepping L1 scheme on graded time mesh. Our error analysis shows that the choice of graded mesh factor ω=(2−α)/α shall give an optimal temporal convergence O(N−(2−α)) with N denoting the number of time mesh. Finally, ample numerical examples are delivered to illustrate our theoretical analysis and the efficiency of the suggested scheme.

Suggested Citation

  • Yang, Yi & Huang, Jin, 2024. "Double fast algorithm for solving time-space fractional diffusion problems with spectral fractional Laplacian," Applied Mathematics and Computation, Elsevier, vol. 475(C).
  • Handle: RePEc:eee:apmaco:v:475:y:2024:i:c:s0096300324001875
    DOI: 10.1016/j.amc.2024.128715
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2024.128715?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:475:y:2024:i:c:s0096300324001875. 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.