An iterative substructuring algorithm for two-dimensional problems in H(curl)

From MaRDI portal





In this paper, the authors present an algorithm for two-dimensional problems in space \(H_0\)(curl;\(\Omega\)). This algorithm is based on domain decomposition, which is performed in terms of a coarse space and local subspaces associated with individual edges of the subdomains. The algorithm does not require overlapping subdomains and a good condition number can be established. Simple energy minimization is applied to the coarse space. Many numerical examples are presented aswell, and they confirm the theory and show the usefulness of the algorithm.




Cited in
(17)








This page was built for publication: An iterative substructuring algorithm for two-dimensional problems in H(curl)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903024)