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

Multi-time-step domain decomposition and coupling methods for nonlinear parabolic problems

Author

Listed:
  • Beneš, Michal
  • Kruis, Jaroslav

Abstract

In this paper we propose and examine a multi-time-step algorithm using a FETI-based domain decomposition method for nonlinear parabolic problems. The computational domain is divided into a set of smaller subdomains that may be integrated concurrently with their own time steps. The continuity condition at the interface is ensured employing local Lagrange multipliers. The equation of continuity of primary unknowns at the interface is written only at the so-called system time step. The subdomain problems are coupled together by requiring the Lagrange multipliers on the interface at the intermediate time steps to match a suitable interpolation of the values at the system time steps. This allows each subdomain to be solved with its own time step. The rigorous nonlinear stability is performed via the energy method. Several numerical examples will be solved to illustrate the overall performance of the proposed coupling method.

Suggested Citation

  • Beneš, Michal & Kruis, Jaroslav, 2018. "Multi-time-step domain decomposition and coupling methods for nonlinear parabolic problems," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 444-460.
    • Handle: RePEc:eee:apmaco:v:319:y:2018:i:c:p:444-460
    DOI: 10.1016/j.amc.2017.04.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317302783
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.04.026?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.

    References listed on IDEAS

    as
    1. Beneš, Michal & Nekvinda, Aleš & Yadav, Manoj Kumar, 2015. "Multi-time-step domain decomposition method with non-matching grids for parabolic problems," Applied Mathematics and Computation, Elsevier, vol. 267(C), pages 571-582.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Canuto, Claudio & Lo Giudice, Andrea, 2019. "A multi-timestep Robin–Robin domain decomposition method for time dependent advection-diffusion problems," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.

    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:319:y:2018:i:c:p:444-460. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.