Continuing the previous work in the preprint 97-11 done for the 2D-approach in this paper we describe the Yserentant preconditioned conjugate gradient method as well as the BPX-preconditioned cg-iteration fastly solving 3D-elliptic boundary value problems on unstructured quasi uniform grids. These artificially constructed hierarchical methods have optimal computational costs. In the case of the sequential computing several numerical examples demonstrate their efficiency not depending on the finite element types used for the discretiziation of the original potential problem. Moreover, implementing the methods in parallel first results are given.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200501021 |
| Date | 09 September 2005 |
| Creators | Globisch, Gerhard |
| Contributors | TU Chemnitz, SFB 393 |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | application/pdf, application/postscript, text/plain, application/zip |
| Source | Preprintreihe des Chemnitzer SFB 393; Preprint SFB393/97-11 |
Page generated in 0.0019 seconds