Neumann-Neumann type domain decomposition of elliptic problems on metric graphs
Mihály Kovács (Pázmány Péter Catholic University and Budapest University of Technology and Economics and Chalmers University of Technology)
Abstract: We develop a Neumann-Neumann type domain decomposition method for elliptic problems on metric graphs. We describe the iteration in the continuous and discrete setting and rewrite the latter as a preconditioner for the Schur complement system. Then we formulate the discrete iteration as an abstract additive Schwarz iteration and prove that it converges to the finite element solution with a rate that is independent of the finite element mesh size. We also show that the condition number of the Schur complement is bounded uniformly with respect to the finite element mesh size. We discuss various numerical examples of interest and compare the Neumann-Neumann method to other preconditioners.
This research was partially funded by the Hungarian National Research, Development and Innovation Office (NKFIH) through Grant no. K-145934.
numerical analysis
Audience: researchers in the discipline
( paper )
Series comments: Online streaming via zoom on exceptional cases if requested. Please contact the organizers at the latest Monday 11:45.
| Organizers: | David Cohen*, Annika Lang* |
| *contact for this listing |