Name
Abstract | ||
|---|---|---|
In this paper, a flexible mesh refinement strategy for the approximation of solutions of elliptic boundary value problems is considered. The main purpose of the paper is the development of preconditioners for the resulting discrete system of algebraic equations. These techniques lead to efficient computational procedures in serial as well as parallel computing environments. The preconditioners are based on overlapping domain decomposition and involve solving (or preconditioning) subproblems on regular subregions. It is proven that the iteration schemes converge to the discrete solution at a rate which is independent of the mesh parameters in the case of two spatial dimensions. The estimates proved for the iterative convergence rate in three dimensions are somewhat weaker. The results of numerical experiments illustrating the theory are also presented. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1137/0913021 | SIAM Journal on Scientific Computing |
Keywords | Field | DocType |
2ND-ORDER ELLIPTIC EQUATION,DOMAIN DECOMPOSITION,OVERLAPPING DOMAIN DECOMPOSITION,LOCAL MESH REFINEMENT,PARTIAL REFINEMENT,OVERLAPPING SCHWARZ METHODS,PRECONDITIONERS | Boundary value problem,Mathematical optimization,Local mesh refinement,Algebraic equation,Rate of convergence,Domain decomposition methods,Mathematics,Discrete system | Journal |
Volume | Issue | ISSN |
13 | 1 | 0196-5204 |
Citations | PageRank | References |
3 | 1.60 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| JAMES H. BRAMBLE | 1 | 400 | 89.70 |
| Richard E. Ewing | 2 | 252 | 45.87 |
| Rossen R. Parashkevov | 3 | 3 | 1.60 |
| Joseph E. Pasciak | 4 | 507 | 118.54 |