Questions tagged [domain-decomposition]

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.

Filter by
Sorted by
Tagged with
4 votes
0 answers
119 views

How is the Alternating Schwarz Method used as a Preconditioner to a Krylov Method?

I am reading "Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations" (Smith 1996), and I am confused as to how the below Alternating Schwarz algorithm ...
Jared Frazier's user avatar
0 votes
0 answers
87 views

Why aren't mortar domain decomposition techniques used as much as schwarts type DD?

Schwartz type domain decomposition techniques require a transmission condition which can be hard to come by. Mortar type techniques enforce continuity with a Lagrange multiplier across domains. Are ...
CuteCompute's user avatar
1 vote
0 answers
154 views

Deconvolution of sinc function in spectrum calculation in FTS

In Fourier transform spectroscopy (FTS) I am calculating a broadband interferogram (e.m. frequency 190-300 GHz top-hat), then back-retrieving the spectrum by FT. Here in the figure, you can see the ...
Raizen's user avatar
  • 61
3 votes
1 answer
96 views

"Optimal" domain partitioning in domain decomposition algorithms

When solving a PDE numerically by domain decomposition methods, what is the "optimal way" to split the domain? Are there any results stating that a particular partition of the domain yields &...
user298455's user avatar
1 vote
1 answer
172 views

What is the difference between Adittive Schwarz as a preprocessor and a solver?

As we all know, the Additive Schwarz approach can be used as either solver or preconditioner, however, my question is, what is the difference between the two? In other words, how to use AS as solver, ...
zhanghaoyuan's user avatar
2 votes
1 answer
198 views

Partition mesh into predetermined submeshes

I have a mesh already partitioned into disjoint groups of cells. What I want to achieve is the following. Obtain the adjacency graph for the cell groups. Partition the mesh, i.e. generate submeshes ...
Zoltan Csati's user avatar
1 vote
1 answer
92 views

preconditioner for $u''(x)=\sin(x)$

I am interested in finding preconditioner to solve the problem for one dimensional problem $u''(x)=\sin(x), u(0)=u(1)=0$ using Dirichlet-Neumann method. The preconditioner $M$ coming from Dirichlet-...
420's user avatar
  • 41
1 vote
1 answer
32 views

can you give me some information of tools for load reblance

I want a tool for load rebalances. I have a distributed grid. Each process can handle a part of the global grid. Each process has a different node and I want to rebalance it. I want a tool that can ...
Xu Hui's user avatar
  • 323
1 vote
2 answers
135 views

Parallelisation strategies for mixed FE formulations

Mixed FE formulations with LBB-stable elements require two different meshes for the primary and the constraint variables, for example, displacement and pressure. With continuous approximation for the ...
Chenna K's user avatar
  • 914
1 vote
2 answers
460 views

Solve wave equation with discontinuous coefficients numerically?

I would like to solve the following equation $$\frac{\partial^2 y}{\partial t^2} - c^2(x,t)\frac{\partial^2 y}{\partial x^2}=0,$$ for $y=y(x,t)$ numerically. The wave speed, $c(x,t)$, is of the form $$...
Peanutlex's user avatar
  • 219
1 vote
1 answer
121 views

interface value on the error equation

https://www.jstor.org/stable/pdf/2157482.pdf, here I have a problem in last equation of (2.6) in section (2.1). When they are considering error equation on the interface $\Gamma$ they get $e_v^{(n)} = ...
420's user avatar
  • 41
0 votes
0 answers
86 views

fixed point iteration on DD method

I have to solve the the problem $u_t+\Delta^2u=f(u)$, where $f(u)$ is non-linear, using domain-decomposition method. My approach is first using fixed point iteration on mixed form i.e to say $u^{k+1}...
420's user avatar
  • 41
0 votes
1 answer
57 views

problem in interface operator

https://www.unige.ch/~gander/Preprints/42540.pdf. here I have a problem in section $4,$ of approximating the symbol $\sigma_i(k)$. My understanding is, to get back the operator $S_i$ we have to use ...
420's user avatar
  • 41
1 vote
0 answers
135 views

understanding Domain Decomposition with example

I am new in Domain Decomposition method. I am started to solve $-\Delta u = f$ in $\Omega$ and $u = 0$ on $\partial\Omega$. From that I get in $\Omega _1$ $$\begin{bmatrix}4&-1\\-1&4\end{...
420's user avatar
  • 41
1 vote
0 answers
267 views

Metis: how to use and tutorial recommendation

I am new to METIS and trying to use it in my fortran code. I read the manual online. But still, I am not sure about how to implement it my code. I tried the test cases in the graphs directory. For ...
shushi_piggy's user avatar
1 vote
1 answer
116 views

Partitioning SPD matrix with METIS to preserve block SPD-ness

I am using the METIS to partition a matrix and then using domain decomposition to solve the subdomains in parallel using the Restricted Additive Schwarz method. I am currently trying to solve some ...
Mathnoob's user avatar
  • 111
1 vote
1 answer
277 views

Efficient evaluation of $BQ^{-1}B^T$ (Domain Decomposition Implementation)

I have implemented a schur complement domain decomposition method for solving large scale problems in Matlab. It works well but I think there should be some alternative approaches to implement some ...
Mat123's user avatar
  • 111
1 vote
0 answers
102 views

overlapping additive schwarz [closed]

I am solving 1D laplace problem discretized with finite differences (3-point stencil). I would like to use additive Schwarz method in classical form: $U_{k+1}=U_{k}+M^{−1} r_k,$ where $r_k=F−A U_k$...
SmallElephant's user avatar
2 votes
2 answers
295 views

How to precondition FEM problems using domain decomposition?

Let's say that I have a FEM code which yields the following problem: $$ \mathbf{A}\mathbf{x} = \mathbf{b}. $$ In order to solve this more efficiently with an iterative method, I would like to ...
C. E.'s user avatar
  • 133
3 votes
0 answers
158 views

Alternating Schwarz does not converge without Dirichlet conditions on physical boundaries

Note: Thanks to comments, I realized that I have two problems, each which can be described more clearly on its own. This revised question covers the first. I would like to solve $$ -\Delta u - 1=0,\...
C. E.'s user avatar
  • 133
3 votes
1 answer
202 views

What is the global problem in the two-level additive Schwarz?

The two-level additive Schwarz method (additive Schwarz with a coarse space correction) is often written like this: $$ \mathbf{v} = \sum_{i=0}^N \mathbf{R}_i^T \mathbf{A}^{-1}_i\mathbf{R}_i\mathbf{w} $...
C. E.'s user avatar
  • 133
2 votes
0 answers
157 views

scalable parallel mesh/amr on unstructured grid

I am trying to code a scalable parallel AMR for unstructured grid. There seems to be three approaches for this a) Store some global grid info on each processor and partition with parmetis (The ...
danny's user avatar
  • 233
5 votes
2 answers
638 views

Direct solvers and domain decomposition for FEM

In the finite element method, in order to use MPI, we need to decompose the domain into sub-domains first. Then my question is whether we can solve each sub-domain using a direct solver? Of course, ...
user2196452's user avatar
5 votes
0 answers
127 views

Load balancing/partitioning with unknown weights

For a grid-based numerical simulation, I am looking for a load balancing/partitioning algorithm that not only distributes my grid elements, but also determines (approximates) their respective weights. ...
Michael Schlottke-Lakemper's user avatar
1 vote
0 answers
82 views

Non-overlaping Domain decomposition - assemble of Laplacian

I am dealing with following 2-dimensional problem in the unit square domain $S_2$ $$- \Delta u (x,y) = f \ \text{in} \ S_2, \hspace{1.5cm} u(x,y) = 0 \ \text{on} \ \partial S_2$$ where $f$ is ...
bla_bla_bla's user avatar
0 votes
1 answer
186 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 ...
沈照力's user avatar
5 votes
1 answer
160 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 ...
Jesse Chan's user avatar
  • 3,112
5 votes
0 answers
364 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 ill-...
Semih Ozmen's user avatar
3 votes
2 answers
299 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 ...
Tom's user avatar
  • 465
2 votes
1 answer
109 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 ...
Z. Shen's user avatar
  • 33
0 votes
1 answer
1k 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 ...
Nazi's user avatar
  • 5
6 votes
1 answer
256 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 ...
Jesse Chan's user avatar
  • 3,112
3 votes
1 answer
206 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 ...
rosa's user avatar
  • 293
11 votes
3 answers
1k 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 ...
midurad's user avatar
  • 111
5 votes
3 answers
973 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 ...
Daniel Shapero's user avatar
1 vote
0 answers
171 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 $f(x=0,t)...
Victor Liu's user avatar
  • 4,480
2 votes
2 answers
1k 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 volume....
Krzysztof Bzowski's user avatar
6 votes
1 answer
167 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 ...
shuhalo's user avatar
  • 3,660
19 votes
5 answers
3k 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.
Jungho Lee's user avatar
13 votes
3 answers
418 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, ...
Peter Brune's user avatar
  • 1,675