Parallel multilevel preconditioners
In this paper, we shall report on some techniques for the development of preconditioners for the discrete systems which arise in the approximation of solutions to elliptic boundary value problems. Here we shall only state the resulting theorems. It has been demonstrated that preconditioned iteration techniques often lead to the most computationally effective algorithms for the solution of the large algebraic systems corresponding to boundary value problems in two and three dimensional Euclidean space. The use of preconditioned iteration will become even more important on computers with parallel architecture. This paper discusses an approach for developing completely parallel multilevel preconditioners. In order to illustrate the resulting algorithms, we shall describe the simplest application of the technique to a model elliptic problem.
- Research Organization:
- Brookhaven National Lab., Upton, NY (USA)
- Sponsoring Organization:
- USDOD; DOE/ER; National Science Foundation (NSF)
- DOE Contract Number:
- AC02-76CH00016
- OSTI ID:
- 6473411
- Report Number(s):
- BNL-45180; CONF-8807172-2; CONF-8903169-4; ON: DE91001121; CNN: DMS 84-05352
- Resource Relation:
- Conference: 10. Dundee conference on differential equations; 3. Society for Industrial and Applied Mathematics (SIAM) conference on domain decomposition methods, Dundee (UK); Houston, TX (USA), 4-8 Jul 1988; 20-22 Mar 1989
- Country of Publication:
- United States
- Language:
- English
Similar Records
The construction of preconditioners for elliptic problems by substructuring, IV
Construction of preconditioners for elliptic problems by substructuring. I