hele-shaw.h

Go to the documentation of this file.

/** @file hele-shaw.h
 */
/**
# Hele-Shaw flow solver
 
Flows dominated by friction such as *Hele-Shaw flows* or flows in
porous media (*Darcy flows*) can be modelled as
\f[
\mathbf{u} = \beta\nabla p
\f]
with \f$p\f$ analogous to a pressure and where \f$\beta\f$ can be a function
of space and time. If the fluid is also incompressible, \f$p\f$ needs to
verify the Poisson equation
\f[
\nabla\cdot(\beta\nabla p) = \zeta
\f]
 
\f$\beta\f$ is often a function of the properties of the fluid such as its
composition, temperature and/or density etc... which also requires the
solution of advection--diffusion equations.
 
In the following we start from the advection solver and add the
definition of the velocity through the Poisson equation for the
pressure. This is very similar to what is done for the
[streamfunction--vorticity](navier-stokes/stream.h) Navier--Stokes
solver. */
 
#include "advection.h"
#include "poisson.h"
 
/**
We allocate the pressure \f$p\f$ and divergence field \f$\zeta\f$. The
\f$\beta\f$ coefficients need to be defined at face locations to
match the locations of the face pressure gradients (and the
face velocity components). These two sets of coefficients are
stored in a vector field. We also allocate space to store the
statistics of the Poisson solver. */
 
scalar p[], zeta[];
vector beta[];
mgstats mgp;
 
/**
We change the default gradient function (used for advection) to
minmod-limited (rather than the centered default). */
 
/** @brief Event: defaults (i = 0) */
void event_defaults (void) 
{
  gradient = minmod2;
}
 
/**
At every timestep, but after all the other events for this timestep
have been processed (the '`last`' keyword), we update the pressure
field \f$p\f$ by solving the Poisson equation with variable coefficient
\f$\beta\f$. */
 
/** @brief Event: pressure (i++, last) */
void event_pressure (void) 
{
  mgp = poisson (p, zeta, beta);
 
  /**
  We then update the velocity field by computing the face pressure
  gradients. */
 
  /* trash: u */;
  for (int _i = 0; _i < _N; _i++) /* foreach_face */
    u.x[] = beta.x[]*(p[] - p[-1])/Delta;
}