Discontinuous Galerkin Library
#include "dg/algorithm.h"
|
Cell refinement around a given node. More...
Public Member Functions | |
RealEquidistRefinement (unsigned add_x, unsigned node, unsigned howmany=1) | |
Divide a number of cells left and right of a node into an equidistant number of new cells. More... | |
virtual RealEquidistRefinement * | clone () const |
Public Member Functions inherited from dg::aRealRefinement1d< real_type > | |
void | generate (const RealGrid1d< real_type > &g_old, thrust::host_vector< real_type > &weights, thrust::host_vector< real_type > &abscissas) const |
Generate the grid transformation. More... | |
unsigned | N_new (unsigned N_old, bc bcx) const |
the new number of cells More... | |
virtual aRealRefinement1d * | clone () const =0 |
virtual | ~aRealRefinement1d ()=default |
Additional Inherited Members | |
Protected Member Functions inherited from dg::aRealRefinement1d< real_type > | |
aRealRefinement1d ()=default | |
aRealRefinement1d (const aRealRefinement1d &src)=default | |
aRealRefinement1d & | operator= (const aRealRefinement1d &src)=default |
Cell refinement around a given node.
|
inline |
Divide a number of cells left and right of a node into an equidistant number of new cells.
There will be 2*howmany refined cells (each containing 1+add_x equidistant cells) at the end except if a corner node is given and the boundary condition is not periodic.
add_x | number of additional cells in the cells around the node |
node | the node around which to refine. We count nodes from 0 (left corner) to N (right corner). |
howmany | number of cells around a node to refine |
|
inlinevirtual |
Implements dg::aRealRefinement1d< real_type >.