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

Splitting methods for solution decomposition in nonstationary problems

Author

Listed:
  • Efendiev, Yalchin
  • Vabishchevich, Petr N.

Abstract

In approximating solutions of nonstationary problems, various approaches are used to compute the solution at a new time level from a number of simpler (sub-)problems. Among these approaches are splitting methods. Standard splitting schemes are based on one or another additive splitting of the operator into “simpler” operators that are more convenient/easier for the computer implementation and use inhomogeneous (explicitly-implicit) time approximations. In this paper, a new class of splitting schemes is proposed that is characterized by an additive representation of the solution instead of the operator corresponding to the problem (called problem operator). A specific feature of the proposed splitting is that the resulting coupled equations for individual solution components consist of the time derivatives of the solution components. The proposed approaches are motivated by various applications, including multiscale methods, domain decomposition, and so on, where spatially local problems are solved and used to compute the solution. Unconditionally stable splitting schemes are constructed for a first-order evolution equation, which is considered in a finite-dimensional Hilbert space. In our splitting algorithms, we consider the decomposition of both the main operator of the system and the operator at the time derivative. Our goal is to provide a general framework that combines temporal splitting algorithms and spatial decomposition and its analysis. Applications of the framework will be studied separately.

Suggested Citation

  • Efendiev, Yalchin & Vabishchevich, Petr N., 2021. "Splitting methods for solution decomposition in nonstationary problems," Applied Mathematics and Computation, Elsevier, vol. 397(C).
  • Handle: RePEc:eee:apmaco:v:397:y:2021:i:c:s0096300320307384
    DOI: 10.1016/j.amc.2020.125785
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2020.125785?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:397:y:2021:i:c:s0096300320307384. 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.