Neumann-Neumann type domain decomposition of elliptic problems on metric graphs
<|reference_start|>Neumann-Neumann type domain decomposition of elliptic problems on metric graphs: In this paper 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 convergences to the finite element solution with a rate that is independent of the finite element mesh size. We show that the condition number of the Schur complement is also independent of the finite element mesh size. We provide an implementation and test it on various examples of interest and compare it to other preconditioners.<|reference_end|>
@article{kovács2024neumann-neumann,
    title={Neumann-Neumann type domain decomposition of elliptic problems on metric
  graphs},
    author={Mih'aly Kov'acs, Mih'aly Andr'as V'aghy},
    journal={arXiv preprint arXiv:2402.05707},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.05707},
    primaryClass={math.NA cs.NA}
}