Skip to content

Latest commit

 

History

History
49 lines (34 loc) · 1.37 KB

File metadata and controls

49 lines (34 loc) · 1.37 KB
title Growing Mesh
permalink tutorials-growing-mesh.html
keywords python, remeshing
summary The growing mesh case is a showcase example of two solvers which grow their mesh at predefined points in time.

{% note %} Get the case files of this tutorial. Read how in the tutorials introduction. {% endnote %}

Setup

The problem consists of a unit-square uniformly discretized by 768 x 768 nodes. Running in parallel is only allowed for 1, 4, 9, or 16 ranks. The unit square is partitioned equally among the ranks of a solver.

The mesh starts with 2 nodes in z direction and at a given frequency, 2 nodes are added to the mesh, changing only the load per rank, not the partitioning.

Configuration

preCICE configuration (image generated using the precice-config-visualizer):

preCICE configuration visualization

Available solvers

There are two solvers that define the same mesh:

  • A who runs first
  • B who runs second

Running the Simulation

Pass the amount of ranks to the run script of the solvers. Not passing a number, runs the simulation on a single rank. To run both on a two rank each, use:

cd A
./run.sh 2

and

cd B
./run.sh 2