Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A convergence study of multisubdomain Schwarz waveform relaxation for a class of nonlinear problems - MaRDI portal

Deprecated: Use of MediaWiki\Skin\SkinTemplate::injectLegacyMenusIntoPersonalTools was deprecated in Please make sure Skin option menus contains `user-menu` (and possibly `notifications`, `user-interface-preferences`, `user-page`) 1.46. [Called from MediaWiki\Skin\SkinTemplate::getPortletsTemplateData in /var/www/html/w/includes/Skin/SkinTemplate.php at line 691] in /var/www/html/w/includes/Debug/MWDebug.php on line 372

Deprecated: Use of QuickTemplate::(get/html/text/haveData) with parameter `personal_urls` was deprecated in MediaWiki Use content_navigation instead. [Called from MediaWiki\Skin\QuickTemplate::get in /var/www/html/w/includes/Skin/QuickTemplate.php at line 131] in /var/www/html/w/includes/Debug/MWDebug.php on line 372

A convergence study of multisubdomain Schwarz waveform relaxation for a class of nonlinear problems (Q1666139)

From MaRDI portal





scientific article; zbMATH DE number 6926790
Language Label Description Also known as
English
A convergence study of multisubdomain Schwarz waveform relaxation for a class of nonlinear problems
scientific article; zbMATH DE number 6926790

    Statements

    A convergence study of multisubdomain Schwarz waveform relaxation for a class of nonlinear problems (English)
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: Schwarz waveform relaxation (SWR) is a new type of domain decomposition methods, which is suited for solving time-dependent PDEs in parallel manner. The number of subdomains, namely, \(N\), has a significant influence on the convergence rate. For the representative nonlinear problem \(\partial_t u = \partial_{x x} u + f(u)\), convergence behavior of the algorithm in the two-subdomain case is well-understood. However, for the multisubdomain case (i.e., \(N \geq 3\)), the existing results can only predict convergence when \(f'(u) \leq 0 (\forall u \in \mathbb{R})\). Therefore, there is a gap between \(N \geq 3\) and \(f'(u) > 0\). In this paper, we try to finish this gap. Precisely, for a specified subdomain number \(N\), we find that there exists a quantity \(d_{\max}\) such that convergence of the algorithm on unbounded time domains is guaranteed if \(f'(u) \leq d_{\max} (\forall u \in \mathbb{R})\). The quantity \(d_{\max}\) depends on \(N\) and we present concise formula to calculate it. We show that the analysis is useful to study more complicated PDEs. Numerical results are provided to support the theoretical predictions.
    0 references

    Identifiers