scholarly journals Schwarz Waveform Relaxation Algorithms with Nonlinear Transmission Conditions for Reaction-Diffusion Equations

Author(s):  
Filipa Caetano ◽  
Martin J. Gander ◽  
Laurence Halpern ◽  
Jérémie Szeftel
2010 ◽  
Vol 5 (3) ◽  
pp. 487-505 ◽  
Author(s):  
Filipa Caetano ◽  
◽  
Martin J. Gander ◽  
Laurence Halpern ◽  
Jérémie Szeftel ◽  
...  

2020 ◽  
Vol 20 (3) ◽  
pp. 397-417
Author(s):  
Mohammad Al-Khaleel ◽  
Shu-Lin Wu

AbstractThe Schwarz waveform relaxation (SWR) algorithms have many favorable properties and are extensively studied and investigated for solving time dependent problems mainly at a continuous level. In this paper, we consider a semi-discrete level analysis and we investigate the convergence behavior of what so-called semi-discrete SWR algorithms combined with discrete transmission conditions instead of the continuous ones. We shall target here the hyperbolic problems but not the parabolic problems that are usually considered by most of the researchers in general when investigating the properties of the SWR methods. We first present the classical overlapping semi-discrete SWR algorithms with different partitioning choices and show that they converge very slow. We then introduce optimal, optimized, and quasi optimized overlapping semi-discrete SWR algorithms using new transmission conditions also with different partitioning choices. We show that the new algorithms lead to a much better convergence through using discrete transmission conditions associated with the optimized SWR algorithms at the semi-discrete level. In the performed semi-discrete level analysis, we also demonstrate the fact that as the ratio between the overlap size and the spatial discretization size gets bigger, the convergence factor gets smaller which results in a better convergence. Numerical results and experiments are presented in order to confirm the theoretical aspects of the proposed algorithms and providing an evidence of their usefulness and their accuracy.


2013 ◽  
Vol 14 (3) ◽  
pp. 780-800 ◽  
Author(s):  
Shu-Lin Wu ◽  
Ting-Zhu Huang

AbstractSchwarz waveform relaxation (SWR) algorithm has been investigated deeply and widely for regular time dependent problems. But for time delay problems, complete analysis of the algorithm is rare. In this paper, by using the reaction diffusion equations with a constant discrete delay as the underlying model problem, we investigate the convergence behavior of the overlapping SWR algorithm with Robin transmission condition. The key point of using this transmission condition is to determine a free parameter as better as possible and it is shown that the best choice of the parameter is determined by the solution of a min-max problem, which is more complex than the one arising for regular problems without delay. We propose new notion to solve the min-max problem and obtain a quasi-optimized choice of the parameter, which is shown efficient to accelerate the convergence of the SWR algorithm. Numerical results are provided to validate the theoretical conclusions.


Author(s):  
Herbert Amann

Abstract Linear reaction–diffusion equations with inhomogeneous boundary and transmission conditions are shown to possess the property of maximal $$L_\mathrm{p}$$ L p  regularity. The new feature is the fact that the transmission interface is allowed to intersect the boundary of the domain transversally.


Sign in / Sign up

Export Citation Format

Share Document