This paper is devoted to the fast solution of interface concentrated finite element
equations. The interface concentrated finite element schemes are constructed
on the basis of a non-overlapping domain decomposition where a conforming
boundary concentrated finite element approximation is used in every subdomain.
Similar to data-sparse boundary element domain decomposition methods
the total number of unknowns per subdomain behaves like $O((H/h)^{d−1})$,
where H, h, and d denote the usual scaling parameter of the subdomains, the
average discretization parameter of the subdomain boundaries, and the spatial
dimension, respectively. We propose and analyze primal and dual substructuring
iterative methods which asymptotically exhibit the same or at least almost
the same complexity as the number of unknowns. In particular, the so-called
All-Floating Finite Element Tearing and Interconnecting solvers are
highly parallel and very robust with respect to large coefficient jumps.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:ch1-200701990 |
| Date | 28 November 2007 |
| Creators | Beuchler, Sven, Eibner, Tino, Langer, Ulrich |
| Contributors | TU Chemnitz, Fakultät für Mathematik |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | application/pdf, text/plain, application/zip |
| Rights | Dokument ist für Print on Demand freigegeben |
| Relation | dcterms:isPartOf:Chemnitz Scientific Computing Preprints ; 07-04 |
Page generated in 0.0124 seconds