The exponential refinement around a node. More...

Inheritance diagram for dg::RealExponentialRefinement< real_type >:

Public Member Functions
	RealExponentialRefinement (unsigned add_x, unsigned node)
	Construct exponential refinement. More...

virtual RealExponentialRefinement *	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

Detailed Description

template<class real_type>
struct dg::RealExponentialRefinement< real_type >

The exponential refinement around a node.

Constructor & Destructor Documentation

template<class real_type >

dg::RealExponentialRefinement< real_type >::RealExponentialRefinement	(	unsigned	add_x,
		unsigned	node
	)

inline

Construct exponential refinement.

There will be two refined cells at the end except if a corner node is given and the boundary condition is not periodic.

Parameters

add_x	number of additional cells in the cells node-1 and node. Every new additional cell divides the cell closest to the node in half.
node	The cells node-1 and node will be refined. We count nodes from 0 (left corner) to N (right corner).

template<class real_type >

virtual RealExponentialRefinement * dg::RealExponentialRefinement< real_type >::clone ( ) const

inlinevirtual

The documentation for this struct was generated from the following file: