For simplicity, accordingly to most of the litterature, An integration scheme is defined between -1 and +1 Each scheme has a set of weights and associated positions.
Inherited by type_integ_1d_scheme_gl::t_integ_1d_gl_o2_scheme, type_integ_1d_scheme_gl::t_integ_1d_gl_o3_scheme, type_integ_1d_scheme_mp::t_integ_1d_mp_o2_scheme, type_integ_1d_scheme_simpson::t_integ_1d_simpson_o3_scheme, type_integ_2d_scheme_gl::t_integ_2d_gl_o2_scheme, and type_integ_2d_scheme_gl::t_integ_2d_gl_o3_scheme.
|
procedure, pass(self) | generic_init (self) |
| Init the data fields.
|
|
procedure(integ_scheme_init), deferred, pass(self) | init (self, n) |
|
procedure, pass(self) | apply (self, values) |
| Apply the integration scheme.
|
|
|
integer | size |
|
integer | the |
|
integer | of |
|
integer | scheme |
|
integer | dim |
|
integer | number |
|
integer | dimensions |
|
double precision, dimension(:), allocatable | weights |
| The weights In a vector form, whatever the dimension is weights has 'size'^dim elements.
|
|
double precision, dimension(:,:), allocatable | pos |
| The positions of the quadrature points pos[l,:] is the position of the l^th point l is going from 1 to 'size'^dim, starting in the Fortran ordering, ie. k(z), than j(y), than i(x) ; ie. when i changes the fastest pos has 'size'^dim * dim elements So that one can use 'reshape'.
|
|
◆ apply()
procedure, pass(self) type_integ_scheme::t_integ_scheme::apply |
( |
class(t_integ_scheme), intent(inout) | self, |
|
|
double precision, dimension(:), intent(in) | values ) |
- Precondition
- has to be initiated
◆ generic_init()
procedure, pass(self) type_integ_scheme::t_integ_scheme::generic_init |
( |
class(t_integ_scheme), intent(inout) | self | ) |
|
- Precondition
- selfdim and selfsize has to be set before!
The documentation for this type was generated from the following file:
- src/lib/discretization/node_level_schemes/integration/type_integ_scheme.f90