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

The low-rank tensor-train finite difference method for three-dimensional parabolic equations

Author

Listed:
  • Manzini, Gianmarco
  • Sorgente, Tommaso

Abstract

This paper presents a numerical framework for the low-rank approximation of the solution to three-dimensional parabolic problems. The key contribution of this work is the tensorization process based on a tensor-train reformulation of the second-order accurate finite difference method. We advance the solution in time by combining the finite difference method with an explicit and implicit Euler method and with the Crank–Nicolson method. We solve the linear system arising at each time step from the implicit and semi-implicit time-marching schemes through a matrix-free preconditioned conjugate gradient (PCG) method, appositely designed to exploit the separation of variables induced by the tensor-train format. We assess the performance of our method through extensive numerical experimentation, demonstrating that the tensor-train design offers a robust and highly efficient alternative to the traditional approach. Indeed, the usage of this type of representation leads to massive time and memory savings while guaranteeing almost identical accuracy with respect to the traditional one. These features make the method particularly suitable to tackle challenging high-dimensional problems.

Suggested Citation

  • Manzini, Gianmarco & Sorgente, Tommaso, 2026. "The low-rank tensor-train finite difference method for three-dimensional parabolic equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 241(PA), pages 591-616.
  • Handle: RePEc:eee:matcom:v:241:y:2026:i:pa:p:591-616
    DOI: 10.1016/j.matcom.2025.08.027
    as

    Download full text from publisher

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

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