In this paper we compare the performance, scalability, and robustness of different parallel algorithms for the numerical solution of nonlinear boundary value problems arising in the magnetic field computation and in solid mechanics. These problems are discretized by using the finite element method with triangular meshes and piecewise linear functions. The nonlinearity is handled by a nested Newton solver, and the linear systems of algebraic equations within each Newton step are solved by means of various iterative solvers, namely multigrid methods and conjugate gradient methods with preconditioners based on domain decomposition, multigrid, or BPX techniques, respectively. The basis of the implementation of all solvers is a non-overlapping domain decomposition data structure such that they are well-suited for parallel machines with MIMD architecture.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:17484 |
| Date | 30 October 1998 |
| Creators | Heise, B., Jung, M. |
| 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.002 seconds