Papers
Topics
Authors
Recent
Search
2000 character limit reached

Accelerating non-local exchange in generalized optimized Schwarz methods

Published 5 Jan 2024 in math.NA and cs.NA | (2401.03073v1)

Abstract: The generalized optimised Schwarz method proposed in [Claeys & Parolin, 2022] is a variant of the Despr\'es algorithm for solving harmonic wave problems where transmission conditions are enforced by means of a non-local exchange operator. We introduce and analyse an acceleration technique that significantly reduces the cost of applying this exchange operator without deteriorating the precision and convergence speed of the overall domain decomposition algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (10)
  1. Some remarks on the Elman estimate for GMRES. SIAM J. Matrix Anal. Appl., 27(3):772–778, 2006.
  2. X. Claeys. Non-self adjoint impedance in Generalized Optimized Schwarz Methods, 2021. preprint arXiv:2108.03652, to appear in IMA J.Num.An.
  3. Nonlocal optimized Schwarz methods for time-harmonic electromagnetics. Adv. Comput. Math., 48(6):Paper No. 72, 36, 2022.
  4. X. Claeys and E. Parolin. Robust treatment of cross-points in Optimized Schwarz Methods. Numer. Math., 151(2):405–442, 2022.
  5. Non-local impedance operator for non-overlapping ddm for the helmholtz equation. In Domain Decomposition Methods in Science and Engineering XXVI, pages 725–733, Cham, 2022. Springer International Publishing.
  6. An introduction to domain decomposition methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2015. Algorithms, theory, and parallel implementation.
  7. J. Liesen and Z. Strakoš. Krylov subspace methods. Numerical Mathematics and Scientific Computation. Oxford University Press, Oxford, 2013. Principles and analysis.
  8. E. Parolin. Non-overlapping domain decomposition methods with non-local transmissionoperators for harmonic wave propagation problems. Theses, Institut Polytechnique de Paris, December 2020.
  9. Y. Saad. Iterative methods for sparse linear systems. Philadelphia, PA: SIAM Society for Industrial and Applied Mathematics, 2nd ed. edition, 2003.
  10. A. Toselli and O. Widlund. Domain decomposition methods—algorithms and theory, volume 34 of Springer Series in Computational Mathematics. Springer-Verlag, Berlin, 2005.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.