8from .kernels
import create_abstract_solver_declarations
9from .kernels
import create_abstract_solver_definitions
10from .kernels
import create_solver_declarations
11from .kernels
import create_solver_definitions
12from .kernels
import create_rusanov_kernel_definitions
13from .kernels
import create_compute_Riemann_kernel_for_Rusanov_dsl
14from .kernels
import create_compute_time_step_size_for_fixed_time_stepping_with_subcycling
16from .kernels
import SolverVariant
17from .kernels
import KernelVariant
20from exahype2.solvers.kernels
import create_abstract_solver_user_declarations_for_fixed_time_stepping
21from exahype2.solvers.kernels
import create_abstract_solver_user_definitions_for_fixed_time_stepping
28 name, patch_size, unknowns, auxiliary_variables, min_volume_h, max_volume_h, time_step_size,
29 flux=PDETerms.User_Defined_Implementation,
30 ncp=PDETerms.None_Implementation,
31 eigenvalues=PDETerms.User_Defined_Implementation,
32 boundary_conditions=PDETerms.User_Defined_Implementation,
33 refinement_criterion=PDETerms.Empty_Implementation,
34 initial_conditions=PDETerms.User_Defined_Implementation,
35 source_term=PDETerms.None_Implementation,
36 plot_grid_properties=False,
37 interpolate_linearly_in_time=True,
38 pde_terms_without_state=False, overlap=1
42 This is the normalised time step size w.r.t. the coarsest admissible h value. If
43 the code employs AMR on top of it and refines further, it will automatically
44 downscale the time step size accordingly. So hand in a valid time step size w.r.t.
49 super(SubcyclingFixedTimeStepWithEnclaveTasking,self).
__init__(name,
57 pde_terms_without_state,
58 kernel_namespace=
"rusanov")
73 eigenvalues=eigenvalues,
74 boundary_conditions=boundary_conditions,
75 refinement_criterion=refinement_criterion,
76 initial_conditions=initial_conditions,
77 source_term=source_term)
83 boundary_conditions=None,refinement_criterion=None,initial_conditions=None,source_term=None,
84 memory_location = None,
85 use_split_loop = False,
86 additional_action_set_includes = "",
87 additional_user_includes = ""
90 If you pass in User_Defined, then the generator will create C++ stubs
91 that you have to befill manually. If you pass in None_Implementation, it
92 will create nop, i.e., no implementation or defaults. Any other string
93 is copied 1:1 into the implementation. If you pass in None, then the
94 set value so far won't be overwritten.
96 Please note that not all options are supported by all solvers.
98 This routine should be the very last invoked by the constructor.
105 create_rusanov_kernel_definitions()
111 compute_max_eigenvalue_of_next_time_step =
False,
112 solver_variant = SolverVariant.WithVirtualFunctions,
113 kernel_variant = KernelVariant.PatchWiseAoS
120 compute_max_eigenvalue_of_next_time_step =
False,
121 solver_variant = SolverVariant.Stateless,
122 kernel_variant = KernelVariant.PatchWiseAoS
129 compute_max_eigenvalue_of_next_time_step =
False,
130 solver_variant = SolverVariant.Stateless,
131 kernel_variant = KernelVariant.PatchWiseAoS
138 compute_max_eigenvalue_of_next_time_step =
False,
139 solver_variant = SolverVariant.Accelerator,
140 kernel_variant = KernelVariant.PatchWiseAoS
154 super(SubcyclingFixedTimeStepWithEnclaveTasking,self).
set_implementation(boundary_conditions, refinement_criterion, initial_conditions, memory_location, use_split_loop, additional_action_set_includes, additional_user_includes)
159 The actual action sets all are created by the superclass. So nothing
160 is to be done here. But we want to reset the actual updates and
161 projection, and these only happen if we are allowed to update
166 update_cell_guard =
"::exahype2::runTimeStepOnCell( fineGridCell" + self.
_name_name +
"CellLabel, fineGridFaces" + self.
_name_name +
"FaceLabel, repositories::getMinTimeStamp())"
179 return super(SubcyclingFixedTimeStepWithEnclaveTasking, self).user_action_set_includes +
"""
180#include "exahype2/TimeStepping.h"
181#include "kernels/rusanov.h"
Enclave tasking variant of the Finite Volume scheme.
_fused_compute_kernel_call_stateless_cpu
set_implementation(self, boundary_conditions, refinement_criterion, initial_conditions, memory_location, use_split_loop, additional_action_set_includes, additional_user_includes)
If you pass in User_Defined, then the generator will create C++ stubs that you have to befill manuall...
_fused_compute_kernel_call_stateless_gpu
_abstract_solver_user_declarations
_solver_user_declarations
_source_term_implementation
_compute_new_time_step_size
_start_time_step_implementation
_eigenvalues_implementation
_compute_kernel_call_stateless
_finish_time_step_implementation
_abstract_solver_user_definitions
create_action_sets(self)
The actual action sets all are created by the superclass.
_Riemann_solver_namespace
_abstract_solver_user_declarations
_start_time_step_implementation
_solver_user_declarations
create_data_structures(self)
This routine does not really add new data, but it heavily tailors when data are stored,...
_fused_compute_kernel_call_stateless_gpu
_source_term_implementation
_compute_new_time_step_size
set_implementation(self, flux=None, ncp=None, eigenvalues=None, boundary_conditions=None, refinement_criterion=None, initial_conditions=None, source_term=None, memory_location=None, use_split_loop=False, additional_action_set_includes="", additional_user_includes="")
If you pass in User_Defined, then the generator will create C++ stubs that you have to befill manuall...
_eigenvalues_implementation
_finish_time_step_implementation
user_action_set_includes(self)
Add further includes to this property, if your action sets require some additional routines from othe...
_fused_compute_kernel_call_stateless_cpu
_interpolate_linearly_in_time
_compute_kernel_call_stateless
_abstract_solver_user_definitions
__init__(self, name, patch_size, unknowns, auxiliary_variables, min_volume_h, max_volume_h, time_step_size, flux=PDETerms.User_Defined_Implementation, ncp=PDETerms.None_Implementation, eigenvalues=PDETerms.User_Defined_Implementation, boundary_conditions=PDETerms.User_Defined_Implementation, refinement_criterion=PDETerms.Empty_Implementation, initial_conditions=PDETerms.User_Defined_Implementation, source_term=PDETerms.None_Implementation, plot_grid_properties=False, interpolate_linearly_in_time=True, pde_terms_without_state=False, overlap=1)
time_step_size: Float This is the normalised time step size w.r.t.