8from .kernels
import create_compute_Riemann_kernel_for_Rusanov
9from .kernels
import create_abstract_solver_declarations
10from .kernels
import create_abstract_solver_definitions
11from .kernels
import create_solver_declarations
12from .kernels
import create_solver_definitions
14from .kernels
import SolverVariant
15from .kernels
import KernelVariant
22 name, patch_size, unknowns, auxiliary_variables, min_volume_h, max_volume_h, time_step_relaxation,
23 flux=PDETerms.User_Defined_Implementation,
24 ncp=PDETerms.None_Implementation,
25 eigenvalues=PDETerms.User_Defined_Implementation,
26 boundary_conditions=PDETerms.User_Defined_Implementation,
27 refinement_criterion=PDETerms.Empty_Implementation,
28 initial_conditions=PDETerms.User_Defined_Implementation,
29 source_term=PDETerms.None_Implementation,
30 plot_grid_properties=False,
31 pde_terms_without_state=False, overlap=1
33 super(GlobalAdaptiveTimeStep,self).
__init__(name,
41 pde_terms_without_state,
42 kernel_namespace=
"rusanov")
54 eigenvalues=eigenvalues,
55 boundary_conditions=boundary_conditions,
56 refinement_criterion=refinement_criterion,
57 initial_conditions=initial_conditions,
58 source_term=source_term)
64 boundary_conditions=None,refinement_criterion=None,initial_conditions=None,source_term=None,
65 memory_location = None,
66 use_split_loop = False,
67 additional_action_set_includes = "",
68 additional_user_includes = ""
71 If you pass in User_Defined, then the generator will create C++ stubs
72 that you have to befill manually. If you pass in None_Implementation, it
73 will create nop, i.e., no implementation or defaults. Any other string
74 is copied 1:1 into the implementation. If you pass in None, then the
75 set value so far won't be overwritten.
77 Please note that not all options are supported by all solvers.
79 This routine should be the very last invoked by the constructor.
90 compute_max_eigenvalue_of_next_time_step =
True,
91 solver_variant = SolverVariant.WithVirtualFunctions,
92 kernel_variant = KernelVariant.PatchWiseAoS
99 compute_max_eigenvalue_of_next_time_step =
True,
100 solver_variant = SolverVariant.Stateless,
101 kernel_variant = KernelVariant.PatchWiseAoS
121 super(GlobalAdaptiveTimeStep,self).
set_implementation(boundary_conditions, refinement_criterion, initial_conditions, memory_location, use_split_loop, additional_action_set_includes, additional_user_includes)
126 return super(GlobalAdaptiveTimeStep, self).user_action_set_includes +
"""
127#include "exahype2/fv/rusanov/rusanov.h"
Code snippet generator for fixed time stepping in the Runge-Kutta schemes.
_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
_constructor_implementation
_finish_time_step_implementation
_abstract_solver_user_definitions
Probably the simplest solver you could think off.
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...
_abstract_solver_user_declarations
_compute_new_time_step_size
_constructor_implementation
_start_time_step_implementation
_source_term_implementation
_compute_kernel_call_stateless
_finish_time_step_implementation
_solver_user_declarations
_eigenvalues_implementation
__init__(self, name, patch_size, unknowns, auxiliary_variables, min_volume_h, max_volume_h, time_step_relaxation, 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, pde_terms_without_state=False, overlap=1)
Instantiate a generic FV scheme with an overlap of 1.
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...
_abstract_solver_user_definitions
user_action_set_includes(self)
Add further includes to this property, if your action sets require some additional routines from othe...