Parallel point- and domain-oriented multilevel methods for elliptic PDE's on workstation networks

Griebel, Michael; Neunhoeffer, Tilman

doi:10.1016/0377-0427(95)00195-6

Cited by 5 publications

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A Particle-Partition of Unity Method-Part IV: Parallelization

Griebel

Schweitzer

2003

Lecture Notes in Computational Science and Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. In this sequel to [15,16] we focus on the efficient solution of the linear block-systems arising from a Galerkin discretization of an elliptic partial differential equation of second order with the partition of unity method (PUM). We present a cheap multilevel solver for partition of unity discretizations of any order. The shape functions of a PUM are products of piecewise rational partition of unity (PU) functions ϕ i with supp(ϕ i ) = ω i and higher order local approximation functions ψ n i (usually a local polynomial of degree ≤ p i ). Furthermore, they are non-interpolatory. In a multilevel approach we not only have to cope with non-interpolatory basis functions but also with a sequence of nonnested spaces due to the meshfree construction. Hence, injection or interpolatory interlevel transfer operators are not available for our multilevel PUM. Therefore, the remaining natural choice for the prolongation operators are L 2 -projections. Here, we exploit the partition of unity construction of the function spaces and a hierarchical construction of the PU itself to localize the corresponding projection problem. This significantly reduces the computational costs associated with the setup and the application of the interlevel transfer operators. The second main ingredient for our multilevel solver is the use of a block-smoother to treat the local approximation functions ψ n i for all n simultaneously. The results of our numerical experiments in two and three dimensions show that the convergence rate of the proposed multilevel solver is independent of the number of patches card({ω i }). The convergence rate is slightly dependent on the local approximation orders p i .

show abstract