|
| | DTRProblem (bool verbose=true) |
| | Constructor for the DTRProblem class.
|
| |
| | DTRProblem (std::ofstream &dimension_time_file, bool verbose=true) |
| | Constructor for the DTRProblem class with a dimension-time file output stream.
|
| |
| void | run (unsigned int n_initial_refinements=3, unsigned int n_cycles=9) |
| | Compute the solution of the DTR problem.
|
| |
| double | compute_error (const VectorTools::NormType &norm_type) const |
| | Compute the error of the solution using the given norm type.
|
| |
| unsigned int | get_cells () const |
| | Get the number of global active cells in the triangulation.
|
| |
| unsigned int | get_dofs () const |
| | Get the number of degrees of freedom.
|
| |
| unsigned int | get_fe_degree () const |
| | Get the degree of the finite element.
|
| |
| | DTRProblem (bool verbose=true) |
| |
| | DTRProblem (std::ofstream &dimension_time_file, bool verbose=true) |
| |
| void | run (unsigned int n_initial_refinements=3, unsigned int n_cycles=9) |
| | Compute the solution of the ADR problem. It executes the setup, rhs assembly, solve, and output_results steps for the solution of the problem for a given number of times. The given number of initial refinements determines the number of cells in the mesh at the first solution as initial number of cells = dim^(initial_refinements-dim). The number of executed cycles is n_cycles - dim.
|
| |
| double | compute_error (const VectorTools::NormType &norm_type) const |
| |
| unsigned int | get_cells () const |
| |
| unsigned int | get_dofs () const |
| |
| unsigned int | get_fe_degree () const |
| |
template<int dim, int degree_finite_element = 2>
class DTR_mf::DTRProblem< dim, degree_finite_element >
The DTRProblem class represents the DTR problem and provides methods to solve it.
This class encapsulates the setup, assembly, solution, and output of the DTR problem.
- Template Parameters
-
| dim | The dimension of the problem. |
| degree_finite_element | The degree of the finite element used (default is 2). |
template<int dim, int degree_finite_element>
| void DTR_mf::DTRProblem< dim, degree_finite_element >::run |
( |
unsigned int | n_initial_refinements = 3, |
|
|
unsigned int | n_cycles = 9 ) |
Compute the solution of the DTR problem.
This method executes the setup, right-hand side assembly, solution, and output steps for the DTR problem for a given number of times. The number of initial refinements determines the number of cells in the mesh at the first solution, and the number of executed cycles determines the number of additional refinements performed.
- Parameters
-
| n_initial_refinements | The number of initial refinements to perform on the mesh. |
| n_cycles | The number of solutions to compute by adding a refinement at each iteration. |
template<int dim, int degree_finite_element = 2>
| void DTR_mf::DTRProblem< dim, degree_finite_element >::run |
( |
unsigned int | n_initial_refinements = 3, |
|
|
unsigned int | n_cycles = 9 ) |
Compute the solution of the ADR problem. It executes the setup, rhs assembly, solve, and output_results steps for the solution of the problem for a given number of times. The given number of initial refinements determines the number of cells in the mesh at the first solution as initial number of cells = dim^(initial_refinements-dim). The number of executed cycles is n_cycles - dim.
- Parameters
-
| n_initial_refinements | the number of initial refinements to perform on the mesh. |
| n_cycles | the number of solutions to compute adding a refinement at each iteration. |