Introduction In recent years, domain decomposition methods have been used extensively to efficiently solve boundary value problems for partial differential equations in complex{form domains. On the other hand, multilevel techniques on hierarchical data structures also have developed into an effective tool for the construction and analysis of fast solvers. But direct realization of multilevel techniques on a parallel computer system for the global problem in the original domain involves difficult communication problems. I this paper, we present and analyze a combination of these two approaches: domain decomposition and multilevel decomposition on hierarchical structures to design optimal preconditioning operators.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:ch1-199800815 |
Date | 30 October 1998 |
Creators | Nepomnyaschikh, S. V. |
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 |
Page generated in 0.0018 seconds