A parallel algorithm design approach in which the data is divided into pieces and then computations are associated with the data. This contrasts to 'functional decomposition', in which tasks or computations are divided first, then data is associated to them.

learn more… | top users | synonyms

0
votes
1answer
50 views

how to partition a graph(matrix) into subdomains with different sizes

i am studying the solver for PageRank problems which drived from the web link graph. I have tried using METIS to divided the matrix into subdomains, but METIS can only produce subdomains with nearly ...
5
votes
1answer
106 views

Effect of subdomain topologies on overlapping additive Schwarz?

Is there a reference on the effect of subdomain topology on performance of the overlapping additive Schwarz method for (high order) finite elements? For example, taking subdomains to be vertex ...
3
votes
0answers
151 views

Is it possible to predict the null space of a structure from contributing elements null spaces?

I am trying to solve an almost incompressible problem with heterogeneous properties by domain decomposition. Solution with CG converges slowly or divergerces completely. My problem becomes ...
2
votes
2answers
82 views

Steklov-Poincaré operator for overlapping domain decomposition

For non-overlapping domain decomposition methods for elliptic problems there is an associated Steklov-Poincaré definite positive operator defined on the interface, allowing a direct computation of the ...
1
vote
1answer
45 views

why overlapping technique can accelerate the additive/multiplictive Schwarz

Overlapping technique can make each subdomain contain more nodes, and the overlapped subdomains are nonlonger disjoint, is it taking the average value of the multiple nodes as the result. After ...
0
votes
1answer
206 views

Domain Decomposition with PETSc

Does anyone have any experience on Domain Decomposition using PETSc library? I have used PETSc for creating my vectors and matrix within my C++ code. I also used KSP to solve the linear system. I ...
6
votes
1answer
124 views

Domain decomposition w/Lagrange multipliers

I'm looking at FEM discretizations of $$u_i - \Delta u_i = f$$ for $u_1, u_2$ on subdomains $\Omega_1, \Omega_2$ with interface $\Gamma$. A Neumann-Neumann transmission condition can be formulated by ...
2
votes
1answer
69 views

nonoverlapping domain decomposition

I solved a simple test example by overlapping domain decomposition. The problem domain is a rectangular that is decomposed to two domains. So the value on the intersection boundary is guessed at the ...
7
votes
3answers
454 views

Best Methodologies for Managing a Mesh in Parallel Finite Element Computation?

I am currently developing a domain decomposition method for the solution of the scattering problem. Basically I am solving a system of Helmholtz BVPs iteratively. I discretize the equations using ...
4
votes
3answers
442 views

implicit vs. explicit domain decomposition methods

I've been working on a finite element code on unstructured methods, which I've parallelized using the Schur complement method. Here's a summary of how I did it: Assign each triangle of the mesh to a ...
1
vote
0answers
134 views

Enforcing continuity conditions in pseudospectral domain decomposition methods for time dependent PDEs

I have a partial differential equation of the form $$ \frac{d}{dt}f(x,t) = \Theta(x) f(x,t) \qquad \Theta(x) \sim \left[\frac{d^2}{dx^2} + k^2(x)\right] $$ subject to $f(x,t=0) = f_0(x)$, and ...
2
votes
2answers
470 views

Mesh domain decompositions / mesh partitioning

I have some experience with mpmetis from METIS. It is pretty good software which offers unstructured mesh grid partitioning. But obtained results always minimize edgecuts or total communication ...
5
votes
1answer
88 views

Compability conditions in domain decomposition methods

Suppose we want to solve the Poisson equation $\Delta u = f$ on a domain $\Omega$ with Dirichlet boundary conditions. One possible way to do is by a domain decomposition method. There is a condition ...
10
votes
5answers
1k views

What is the advantage of multigrid over domain decomposition preconditioners, and vice versa?

This is mostly aimed for elliptic PDEs over convex domains, so that I can get a good overview of the two methods.
8
votes
3answers
198 views

In what application cases are additive preconditioning schemes superior to multiplicative ones?

In both domain decomposition (DD) and multigrid (MG) methods, one may compose the application of the block updates or coarse corrections as either additive or multiplicative. For pointwise solvers, ...