Volume 14, Issue 3
Quasi-optimized Overlapping Schwarz Waveform Relaxation Algorithm for PDEs with Time-delay

Shu-Lin Wu & Ting-Zhu Huang

Commun. Comput. Phys., 14 (2013), pp. 780-800.

Published online: 2013-09

Preview Full PDF 97 519
Export citation
  • Abstract

Schwarzwaveformrelaxation(SWR)algorithmhasbeeninvestigateddeeply 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.


  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • References
  • Hide All
    View All

@Article{CiCP-14-780, author = {Shu-Lin Wu and Ting-Zhu Huang}, title = {Quasi-optimized Overlapping Schwarz Waveform Relaxation Algorithm for PDEs with Time-delay}, journal = {Communications in Computational Physics}, year = {2013}, volume = {14}, number = {3}, pages = {780--800}, abstract = {

Schwarzwaveformrelaxation(SWR)algorithmhasbeeninvestigateddeeply 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.


}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.100312.071112a}, url = {http://global-sci.org/intro/article_detail/cicp/7181.html} }
Copy to clipboard
The citation has been copied to your clipboard