• Keine Ergebnisse gefunden

Overlap bi-section

N/A
N/A
Protected

Academic year: 2022

Aktie "Overlap bi-section"

Copied!
8
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

2D Coupling Adaptive Finite Element Models: Problems and Ideas

DEKLIM project ‚PLASMA‘

2D self-adaptive FE atmospheric model, physics currently: shallow water equations components:

parallel mesh adaption time-step parallel linear solver

local error estimation

(2)

Changing grid

•extensive re-meshing at each time-step

(3)

Element bi-sectioning on the Sphere

• Space-Filling-Curve from mesh generator by bi-section refinement

SFC on the sphere SFC-partitioning

(4)

Coupling to a fixed grid model

partial overlap o(i,k) cell i, adaptive

cell k, fixed

(5)

Overlap bi-section

coarsening : o(i,k) = o(i_1,k) + o(i_2,k), known before refinement o(i_1,k) = α o(i,k) , 0<=α <1, unknown

o(i_2,k) = (1-α) o(i,k) refinement :

bi-section of cell i o1

o2

how to compute α ?

cell i_1 cell i_2

cell k, fixed

(6)

Overlap bi-section

• overlapping cells k with cell i are known α can be computed w/o searching cells

• k cells geometry is fixed

α can be computed w/o communication

• requires all k cells overlapping with coarsest mesh

(7)

Overlap computation

• precisely : by line-integration (SCRIP)

• roughly : by point-counting

(8)

Future Problems

• Coupling of adaptive levels in stacked model

requires extensive search down the hierarchy of coarse elements

Referenzen

ÄHNLICHE DOKUMENTE

In this paper, we therefore show how to solve the non-hydrostatic shallow water equations in parallel within the partial differential equation framework sam(oa) 2 by extending

➥ Topic areas: secure virtual machine, parallel computing, pattern recognition in sensor data, e-assessment,

➥ task parallelism: parallel code regions (sections) and explicit tasks (task). ➥ directives

Data type of the individual data elements Rank of source process in communicator. int MPI_Recv(void *buf, int count, MPI_Datatype dtype, int source, int tag,

➥ Storage of data in the cache and transfer between main memory and cache are performed using larger blocks.. ➥ reason: after a memory cell has been addressed, the subsequent cells

for all possible successor configurations c of conf : if configuration c has not been visited yet:. add the configuration c with predecessor conf to the set of visited

In a parallel contest, i.e., a competition between two contests with different settings, we also assume that the number and the distribution of total population are common

As the efficiency of the combined space-time parallelisation is the product of the parallel in space efficiency and the parallel in time efficiency, it is low for high numbers of