In this paper we consider the well-known BPX-preconditioner in
conjunction with adaptive FEM. We present an algorithm which enables
us to compute the preconditioner with optimal complexity by a total of
only O(DoF) additional memory. Furthermore, we show how to combine
the BPX-preconditioner with an overlapping Additive-Schwarz-preconditioner
to obtain a preconditioner for finite element spaces with
arbitrary polynomial degree distributions. Numerical examples
illustrate the efficiency of the algorithms.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:18971 |
Date | 17 September 2008 |
Creators | Eibner, Tino |
Publisher | Technische Universität Chemnitz |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | doc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0022 seconds