Systems of grid equations that approximate elliptic boundary value problems on locally modified grids are considered. The triangulation, which approximates the boundary with second order of accuracy, is generated from an initial uniform triangulation by shifting nodes near the boundary according to special rules. This "locally modified" grid possesses several significant features: this triangulation has a regular structure, the generation of the triangulation is rather fast, this construction allows to use multilevel preconditioning (BPX-like) methods. The proposed iterative methods for solving elliptic boundary value problems approximately are based on two approaches: The fictitious space method, i.e. the reduction of the original problem to a problem in an auxiliary (fictitious) space, and the multilevel decomposition method, i.e. the construction of preconditioners by decomposing functions on hierarchical grids. The convergence rate of the corresponding iterative process with the preconditioner obtained is independent of the mesh size. The construction of the grid and the preconditioning operator for the three dimensional problem can be done in the same way.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:18607 |
| Date | 11 September 2006 |
| Creators | Jung, Michael, Matsokin, Aleksandr M., Nepomnyaschikh, Sergey V., Tkachov, Yu. A. |
| 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 |
| Source | Preprintreihe des Chemnitzer SFB 393, 05-14 |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.002 seconds