Dirichlet-Neumann and Neumann-Neumann waveform relaxation for the wave equation

From MaRDI portal
Publication:2815040

DOI10.1007/978-3-319-18827-0_51zbMATH Open1339.65165arXiv1402.4285OpenAlexW3200125714MaRDI QIDQ2815040FDOQ2815040


Authors: Martin J. Gander, Felix Kwok, Bankim C. Mandal Edit this on Wikidata


Publication date: 23 June 2016

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Abstract: We present a Waveform Relaxation (WR) version of the Dirichlet-Neumann and Neumann-Neumann algorithms for the wave equation in space time. Each method is based on a non-overlapping spatial domain decomposition, and the iteration involves subdomain solves in space time with corresponding interface condition, followed by a correction step. Using a Laplace transform argument, for a particular relaxation parameter, we prove convergence of both algorithms in a finite number of steps for finite time intervals. The number of steps depends on the size of the subdomains and the time window length on which the algorithms are employed. We illustrate the performance of the algorithms with numerical results, and also show a comparison with classical and optimized Schwarz WR methods.


Full work available at URL: https://arxiv.org/abs/1402.4285




Recommendations



Cites Work


Cited In (14)





This page was built for publication: Dirichlet-Neumann and Neumann-Neumann waveform relaxation for the wave equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815040)