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:bsz:ch1-200801271 |
| Date | 17 September 2008 |
| Creators | Eibner, Tino |
| 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 ; 08-02 |
Page generated in 0.0021 seconds