TestPoissonProblem< ELEMENT > Class Template Reference

Poisson problem on rotatable, refineable cubic brick mesh. More...

+ Inheritance diagram for TestPoissonProblem< ELEMENT >:

Public Member Functions

 TestPoissonProblem (const unsigned &angle, const unsigned &rotated_element, PoissonEquations< 3 >::PoissonSourceFctPt source_fct_pt)
 
 ~TestPoissonProblem ()
 Destructor: close trace file. More...
 
RotatableRefineableCubicMesh< ELEMENT > * mesh_pt ()
 
void impose_specific_refinement (const unsigned &nrefine)
 Impose specific refinement on mesh (up to nrefine refinements) More...
 
void actions_after_newton_solve ()
 Update the problem specs after solve (empty) More...
 
void actions_before_newton_solve ()
 
void doc_solution (DocInfo &doc_info)
 Doc the solution. More...
 
 TestPoissonProblem (const unsigned &angle, PoissonEquations< 3 >::PoissonSourceFctPt source_fct_pt)
 Constructor: Pass pointer to source function. More...
 
 ~TestPoissonProblem ()
 Destructor: Empty. More...
 
TestRefineableCubicMesh< ELEMENT > * mesh_pt ()
 
void actions_after_newton_solve ()
 Update the problem specs after solve (empty) More...
 
void actions_before_newton_solve ()
 
void doc_solution (DocInfo &doc_info)
 Doc the solution. More...
 
- Public Member Functions inherited from oomph::Problem
virtual void debug_hook_fct (const unsigned &i)
 
void set_analytic_dparameter (double *const &parameter_pt)
 
void unset_analytic_dparameter (double *const &parameter_pt)
 
bool is_dparameter_calculated_analytically (double *const &parameter_pt)
 
void set_analytic_hessian_products ()
 
void unset_analytic_hessian_products ()
 
bool are_hessian_products_calculated_analytically ()
 
void set_pinned_values_to_zero ()
 
bool distributed () const
 
virtual void actions_before_adapt ()
 
virtual void actions_after_adapt ()
 Actions that are to be performed after a mesh adaptation. More...
 
OomphCommunicator * communicator_pt ()
 access function to the oomph-lib communicator More...
 
const OomphCommunicator * communicator_pt () const
 access function to the oomph-lib communicator, const version More...
 
 Problem ()
 
 Problem (const Problem &dummy)=delete
 Broken copy constructor. More...
 
void operator= (const Problem &)=delete
 Broken assignment operator. More...
 
virtual ~Problem ()
 Virtual destructor to clean up memory. More...
 
Mesh *& mesh_pt ()
 Return a pointer to the global mesh. More...
 
Mesh *const & mesh_pt () const
 Return a pointer to the global mesh (const version) More...
 
Mesh *& mesh_pt (const unsigned &imesh)
 
Mesh *const & mesh_pt (const unsigned &imesh) const
 Return a pointer to the i-th submesh (const version) More...
 
unsigned nsub_mesh () const
 Return number of submeshes. More...
 
unsigned add_sub_mesh (Mesh *const &mesh_pt)
 
void flush_sub_meshes ()
 
void build_global_mesh ()
 
void rebuild_global_mesh ()
 
LinearSolver *& linear_solver_pt ()
 Return a pointer to the linear solver object. More...
 
LinearSolver *const & linear_solver_pt () const
 Return a pointer to the linear solver object (const version) More...
 
LinearSolver *& mass_matrix_solver_for_explicit_timestepper_pt ()
 
LinearSolver * mass_matrix_solver_for_explicit_timestepper_pt () const
 
EigenSolver *& eigen_solver_pt ()
 Return a pointer to the eigen solver object. More...
 
EigenSolver *const & eigen_solver_pt () const
 Return a pointer to the eigen solver object (const version) More...
 
Time *& time_pt ()
 Return a pointer to the global time object. More...
 
Time * time_pt () const
 Return a pointer to the global time object (const version). More...
 
double & time ()
 Return the current value of continuous time. More...
 
double time () const
 Return the current value of continuous time (const version) More...
 
TimeStepper *& time_stepper_pt ()
 
const TimeStepper * time_stepper_pt () const
 
TimeStepper *& time_stepper_pt (const unsigned &i)
 Return a pointer to the i-th timestepper. More...
 
ExplicitTimeStepper *& explicit_time_stepper_pt ()
 Return a pointer to the explicit timestepper. More...
 
unsigned long set_timestepper_for_all_data (TimeStepper *const &time_stepper_pt, const bool &preserve_existing_data=false)
 
virtual void shift_time_values ()
 Shift all values along to prepare for next timestep. More...
 
AssemblyHandler *& assembly_handler_pt ()
 Return a pointer to the assembly handler object. More...
 
AssemblyHandler *const & assembly_handler_pt () const
 Return a pointer to the assembly handler object (const version) More...
 
double & minimum_dt ()
 Access function to min timestep in adaptive timestepping. More...
 
double & maximum_dt ()
 Access function to max timestep in adaptive timestepping. More...
 
unsigned & max_newton_iterations ()
 Access function to max Newton iterations before giving up. More...
 
void problem_is_nonlinear (const bool &prob_lin)
 Access function to Problem_is_nonlinear. More...
 
double & max_residuals ()
 
bool & time_adaptive_newton_crash_on_solve_fail ()
 Access function for Time_adaptive_newton_crash_on_solve_fail. More...
 
double & newton_solver_tolerance ()
 
void add_time_stepper_pt (TimeStepper *const &time_stepper_pt)
 
void set_explicit_time_stepper_pt (ExplicitTimeStepper *const &explicit_time_stepper_pt)
 
void initialise_dt (const double &dt)
 
void initialise_dt (const Vector< double > &dt)
 
Data *& global_data_pt (const unsigned &i)
 Return a pointer to the the i-th global data object. More...
 
void add_global_data (Data *const &global_data_pt)
 
void flush_global_data ()
 
LinearAlgebraDistribution *const & dof_distribution_pt () const
 Return the pointer to the dof distribution (read-only) More...
 
unsigned long ndof () const
 Return the number of dofs. More...
 
unsigned ntime_stepper () const
 Return the number of time steppers. More...
 
unsigned nglobal_data () const
 Return the number of global data values. More...
 
unsigned self_test ()
 Self-test: Check meshes and global data. Return 0 for OK. More...
 
void enable_store_local_dof_pt_in_elements ()
 
void disable_store_local_dof_pt_in_elements ()
 
unsigned long assign_eqn_numbers (const bool &assign_local_eqn_numbers=true)
 
void describe_dofs (std::ostream &out= *(oomph_info.stream_pt())) const
 
void enable_discontinuous_formulation ()
 
void disable_discontinuous_formulation ()
 
void get_dofs (DoubleVector &dofs) const
 
void get_dofs (const unsigned &t, DoubleVector &dofs) const
 Return vector of the t'th history value of all dofs. More...
 
void set_dofs (const DoubleVector &dofs)
 Set the values of the dofs. More...
 
void set_dofs (const unsigned &t, DoubleVector &dofs)
 Set the history values of the dofs. More...
 
void set_dofs (const unsigned &t, Vector< double * > &dof_pt)
 
void add_to_dofs (const double &lambda, const DoubleVector &increment_dofs)
 Add lambda x incremenet_dofs[l] to the l-th dof. More...
 
double * global_dof_pt (const unsigned &i)
 
double & dof (const unsigned &i)
 i-th dof in the problem More...
 
double dof (const unsigned &i) const
 i-th dof in the problem (const version) More...
 
double *& dof_pt (const unsigned &i)
 Pointer to i-th dof in the problem. More...
 
double * dof_pt (const unsigned &i) const
 Pointer to i-th dof in the problem (const version) More...
 
virtual void get_inverse_mass_matrix_times_residuals (DoubleVector &Mres)
 
virtual void get_dvaluesdt (DoubleVector &f)
 
virtual void get_residuals (DoubleVector &residuals)
 Get the total residuals Vector for the problem. More...
 
virtual void get_jacobian (DoubleVector &residuals, DenseDoubleMatrix &jacobian)
 
virtual void get_jacobian (DoubleVector &residuals, CRDoubleMatrix &jacobian)
 
virtual void get_jacobian (DoubleVector &residuals, CCDoubleMatrix &jacobian)
 
virtual void get_jacobian (DoubleVector &residuals, SumOfMatrices &jacobian)
 
void get_fd_jacobian (DoubleVector &residuals, DenseMatrix< double > &jacobian)
 Get the full Jacobian by finite differencing. More...
 
void get_derivative_wrt_global_parameter (double *const &parameter_pt, DoubleVector &result)
 
void get_hessian_vector_products (DoubleVectorWithHaloEntries const &Y, Vector< DoubleVectorWithHaloEntries > const &C, Vector< DoubleVectorWithHaloEntries > &product)
 
void solve_eigenproblem (const unsigned &n_eval, Vector< std::complex< double >> &eigenvalue, Vector< DoubleVector > &eigenvector, const bool &steady=true)
 Solve the eigenproblem. More...
 
void solve_eigenproblem (const unsigned &n_eval, Vector< std::complex< double >> &eigenvalue, const bool &steady=true)
 
virtual void get_eigenproblem_matrices (CRDoubleMatrix &mass_matrix, CRDoubleMatrix &main_matrix, const double &shift=0.0)
 
void assign_eigenvector_to_dofs (DoubleVector &eigenvector)
 Assign the eigenvector passed to the function to the dofs. More...
 
void add_eigenvector_to_dofs (const double &epsilon, const DoubleVector &eigenvector)
 
void store_current_dof_values ()
 Store the current values of the degrees of freedom. More...
 
void restore_dof_values ()
 Restore the stored values of the degrees of freedom. More...
 
void enable_jacobian_reuse ()
 
void disable_jacobian_reuse ()
 Disable recycling of Jacobian in Newton iteration. More...
 
bool jacobian_reuse_is_enabled ()
 Is recycling of Jacobian in Newton iteration enabled? More...
 
bool & use_predictor_values_as_initial_guess ()
 
void newton_solve ()
 Use Newton method to solve the problem. More...
 
void enable_globally_convergent_newton_method ()
 enable globally convergent Newton method More...
 
void disable_globally_convergent_newton_method ()
 disable globally convergent Newton method More...
 
void newton_solve (unsigned const &max_adapt)
 
void steady_newton_solve (unsigned const &max_adapt=0)
 
void copy (Problem *orig_problem_pt)
 
virtual Problem * make_copy ()
 
virtual void read (std::ifstream &restart_file, bool &unsteady_restart)
 
virtual void read (std::ifstream &restart_file)
 
virtual void dump (std::ofstream &dump_file) const
 
void dump (const std::string &dump_file_name) const
 
void delete_all_external_storage ()
 
virtual void symmetrise_eigenfunction_for_adaptive_pitchfork_tracking ()
 
double * bifurcation_parameter_pt () const
 
void get_bifurcation_eigenfunction (Vector< DoubleVector > &eigenfunction)
 
void activate_fold_tracking (double *const &parameter_pt, const bool &block_solve=true)
 
void activate_bifurcation_tracking (double *const &parameter_pt, const DoubleVector &eigenvector, const bool &block_solve=true)
 
void activate_bifurcation_tracking (double *const &parameter_pt, const DoubleVector &eigenvector, const DoubleVector &normalisation, const bool &block_solve=true)
 
void activate_pitchfork_tracking (double *const &parameter_pt, const DoubleVector &symmetry_vector, const bool &block_solve=true)
 
void activate_hopf_tracking (double *const &parameter_pt, const bool &block_solve=true)
 
void activate_hopf_tracking (double *const &parameter_pt, const double &omega, const DoubleVector &null_real, const DoubleVector &null_imag, const bool &block_solve=true)
 
void deactivate_bifurcation_tracking ()
 
void reset_assembly_handler_to_default ()
 Reset the system to the standard non-augemented state. More...
 
double arc_length_step_solve (double *const &parameter_pt, const double &ds, const unsigned &max_adapt=0)
 
double arc_length_step_solve (Data *const &data_pt, const unsigned &data_index, const double &ds, const unsigned &max_adapt=0)
 
void reset_arc_length_parameters ()
 
int & sign_of_jacobian ()
 
void explicit_timestep (const double &dt, const bool &shift_values=true)
 Take an explicit timestep of size dt. More...
 
void unsteady_newton_solve (const double &dt)
 
void unsteady_newton_solve (const double &dt, const bool &shift_values)
 
void unsteady_newton_solve (const double &dt, const unsigned &max_adapt, const bool &first, const bool &shift=true)
 
double doubly_adaptive_unsteady_newton_solve (const double &dt, const double &epsilon, const unsigned &max_adapt, const bool &first, const bool &shift=true)
 
double doubly_adaptive_unsteady_newton_solve (const double &dt, const double &epsilon, const unsigned &max_adapt, const unsigned &suppress_resolve_after_spatial_adapt_flag, const bool &first, const bool &shift=true)
 
double adaptive_unsteady_newton_solve (const double &dt_desired, const double &epsilon)
 
double adaptive_unsteady_newton_solve (const double &dt_desired, const double &epsilon, const bool &shift_values)
 
void assign_initial_values_impulsive ()
 
void assign_initial_values_impulsive (const double &dt)
 
void calculate_predictions ()
 Calculate predictions. More...
 
void enable_mass_matrix_reuse ()
 
void disable_mass_matrix_reuse ()
 
bool mass_matrix_reuse_is_enabled ()
 Return whether the mass matrix is being reused. More...
 
void refine_uniformly (const Vector< unsigned > &nrefine_for_mesh)
 
void refine_uniformly (const Vector< unsigned > &nrefine_for_mesh, DocInfo &doc_info)
 
void refine_uniformly_and_prune (const Vector< unsigned > &nrefine_for_mesh)
 
void refine_uniformly_and_prune (const Vector< unsigned > &nrefine_for_mesh, DocInfo &doc_info)
 
void refine_uniformly (DocInfo &doc_info)
 
void refine_uniformly_and_prune (DocInfo &doc_info)
 
void refine_uniformly ()
 
void refine_uniformly (const unsigned &i_mesh, DocInfo &doc_info)
 Do uniform refinement for submesh i_mesh with documentation. More...
 
void refine_uniformly (const unsigned &i_mesh)
 Do uniform refinement for submesh i_mesh without documentation. More...
 
void p_refine_uniformly (const Vector< unsigned > &nrefine_for_mesh)
 
void p_refine_uniformly (const Vector< unsigned > &nrefine_for_mesh, DocInfo &doc_info)
 
void p_refine_uniformly_and_prune (const Vector< unsigned > &nrefine_for_mesh)
 
void p_refine_uniformly_and_prune (const Vector< unsigned > &nrefine_for_mesh, DocInfo &doc_info)
 
void p_refine_uniformly (DocInfo &doc_info)
 
void p_refine_uniformly_and_prune (DocInfo &doc_info)
 
void p_refine_uniformly ()
 
void p_refine_uniformly (const unsigned &i_mesh, DocInfo &doc_info)
 Do uniform p-refinement for submesh i_mesh with documentation. More...
 
void p_refine_uniformly (const unsigned &i_mesh)
 Do uniform p-refinement for submesh i_mesh without documentation. More...
 
void refine_selected_elements (const Vector< unsigned > &elements_to_be_refined)
 
void refine_selected_elements (const Vector< RefineableElement * > &elements_to_be_refined_pt)
 
void refine_selected_elements (const unsigned &i_mesh, const Vector< unsigned > &elements_to_be_refined)
 
void refine_selected_elements (const unsigned &i_mesh, const Vector< RefineableElement * > &elements_to_be_refined_pt)
 
void refine_selected_elements (const Vector< Vector< unsigned >> &elements_to_be_refined)
 
void refine_selected_elements (const Vector< Vector< RefineableElement * >> &elements_to_be_refined_pt)
 
void p_refine_selected_elements (const Vector< unsigned > &elements_to_be_refined)
 
void p_refine_selected_elements (const Vector< PRefineableElement * > &elements_to_be_refined_pt)
 
void p_refine_selected_elements (const unsigned &i_mesh, const Vector< unsigned > &elements_to_be_refined)
 
void p_refine_selected_elements (const unsigned &i_mesh, const Vector< PRefineableElement * > &elements_to_be_refined_pt)
 
void p_refine_selected_elements (const Vector< Vector< unsigned >> &elements_to_be_refined)
 
void p_refine_selected_elements (const Vector< Vector< PRefineableElement * >> &elements_to_be_refined_pt)
 
unsigned unrefine_uniformly ()
 
unsigned unrefine_uniformly (const unsigned &i_mesh)
 
void p_unrefine_uniformly (DocInfo &doc_info)
 
void p_unrefine_uniformly (const unsigned &i_mesh, DocInfo &doc_info)
 Do uniform p-unrefinement for submesh i_mesh without documentation. More...
 
void adapt (unsigned &n_refined, unsigned &n_unrefined)
 
void adapt ()
 
void p_adapt (unsigned &n_refined, unsigned &n_unrefined)
 
void p_adapt ()
 
void adapt_based_on_error_estimates (unsigned &n_refined, unsigned &n_unrefined, Vector< Vector< double >> &elemental_error)
 
void adapt_based_on_error_estimates (Vector< Vector< double >> &elemental_error)
 
void get_all_error_estimates (Vector< Vector< double >> &elemental_error)
 
void doc_errors (DocInfo &doc_info)
 Get max and min error for all elements in submeshes. More...
 
void doc_errors ()
 Get max and min error for all elements in submeshes. More...
 
void enable_info_in_newton_solve ()
 
void disable_info_in_newton_solve ()
 Disable the output of information when in the newton solver. More...
 
- Public Member Functions inherited from oomph::ExplicitTimeSteppableObject
 ExplicitTimeSteppableObject ()
 Empty constructor. More...
 
 ExplicitTimeSteppableObject (const ExplicitTimeSteppableObject &)=delete
 Broken copy constructor. More...
 
void operator= (const ExplicitTimeSteppableObject &)=delete
 Broken assignment operator. More...
 
virtual ~ExplicitTimeSteppableObject ()
 Empty destructor. More...
 
virtual void actions_before_explicit_stage ()
 
virtual void actions_after_explicit_stage ()
 

Private Attributes

PoissonEquations< 3 >::PoissonSourceFctPt Source_fct_pt
 Pointer to source function. More...
 
ofstream Trace_file
 Trace file. More...
 

Additional Inherited Members

- Public Types inherited from oomph::Problem
typedef void(* SpatialErrorEstimatorFctPt) (Mesh *&mesh_pt, Vector< double > &elemental_error)
 Function pointer for spatial error estimator. More...
 
typedef void(* SpatialErrorEstimatorWithDocFctPt) (Mesh *&mesh_pt, Vector< double > &elemental_error, DocInfo &doc_info)
 Function pointer for spatial error estimator with doc. More...
 
- Public Attributes inherited from oomph::Problem
bool Shut_up_in_newton_solve
 
- Static Public Attributes inherited from oomph::Problem
static bool Suppress_warning_about_actions_before_read_unstructured_meshes
 
- Protected Types inherited from oomph::Problem
enum  Assembly_method {
  Perform_assembly_using_vectors_of_pairs , Perform_assembly_using_two_vectors , Perform_assembly_using_maps , Perform_assembly_using_lists ,
  Perform_assembly_using_two_arrays
}
 Enumerated flags to determine which sparse assembly method is used. More...
 
- Protected Member Functions inherited from oomph::Problem
unsigned setup_element_count_per_dof ()
 
virtual void sparse_assemble_row_or_column_compressed (Vector< int * > &column_or_row_index, Vector< int * > &row_or_column_start, Vector< double * > &value, Vector< unsigned > &nnz, Vector< double * > &residual, bool compressed_row_flag)
 
virtual void actions_before_newton_convergence_check ()
 
virtual void actions_before_newton_step ()
 
virtual void actions_after_newton_step ()
 
virtual void actions_before_implicit_timestep ()
 
virtual void actions_after_implicit_timestep ()
 
virtual void actions_after_implicit_timestep_and_error_estimation ()
 
virtual void actions_before_explicit_timestep ()
 Actions that should be performed before each explicit time step. More...
 
virtual void actions_after_explicit_timestep ()
 Actions that should be performed after each explicit time step. More...
 
virtual void actions_before_read_unstructured_meshes ()
 
virtual void actions_after_read_unstructured_meshes ()
 
virtual void actions_after_change_in_global_parameter (double *const &parameter_pt)
 
virtual void actions_after_change_in_bifurcation_parameter ()
 
virtual void actions_after_parameter_increase (double *const &parameter_pt)
 
double & dof_derivative (const unsigned &i)
 
double & dof_current (const unsigned &i)
 
virtual void set_initial_condition ()
 
virtual double global_temporal_error_norm ()
 
unsigned newton_solve_continuation (double *const &parameter_pt)
 
unsigned newton_solve_continuation (double *const &parameter_pt, DoubleVector &z)
 
void calculate_continuation_derivatives (double *const &parameter_pt)
 
void calculate_continuation_derivatives (const DoubleVector &z)
 
void calculate_continuation_derivatives_fd (double *const &parameter_pt)
 
bool does_pointer_correspond_to_problem_data (double *const &parameter_pt)
 
void set_consistent_pinned_values_for_continuation ()
 
- Protected Attributes inherited from oomph::Problem
Vector< Problem * > Copy_of_problem_pt
 
std::map< double *, bool > Calculate_dparameter_analytic
 
bool Calculate_hessian_products_analytic
 
LinearAlgebraDistribution * Dof_distribution_pt
 
Vector< double * > Dof_pt
 Vector of pointers to dofs. More...
 
DoubleVectorWithHaloEntries Element_count_per_dof
 
double Relaxation_factor
 
double Newton_solver_tolerance
 
unsigned Max_newton_iterations
 Maximum number of Newton iterations. More...
 
unsigned Nnewton_iter_taken
 
Vector< double > Max_res
 Maximum residuals at start and after each newton iteration. More...
 
double Max_residuals
 
bool Time_adaptive_newton_crash_on_solve_fail
 
bool Jacobian_reuse_is_enabled
 Is re-use of Jacobian in Newton iteration enabled? Default: false. More...
 
bool Jacobian_has_been_computed
 
bool Problem_is_nonlinear
 
bool Pause_at_end_of_sparse_assembly
 
bool Doc_time_in_distribute
 
unsigned Sparse_assembly_method
 
unsigned Sparse_assemble_with_arrays_initial_allocation
 
unsigned Sparse_assemble_with_arrays_allocation_increment
 
Vector< Vector< unsigned > > Sparse_assemble_with_arrays_previous_allocation
 
double Numerical_zero_for_sparse_assembly
 
double FD_step_used_in_get_hessian_vector_products
 
bool Mass_matrix_reuse_is_enabled
 
bool Mass_matrix_has_been_computed
 
bool Discontinuous_element_formulation
 
double Minimum_dt
 Minimum desired dt: if dt falls below this value, exit. More...
 
double Maximum_dt
 Maximum desired dt. More...
 
double DTSF_max_increase
 
double DTSF_min_decrease
 
double Minimum_dt_but_still_proceed
 
bool Scale_arc_length
 Boolean to control whether arc-length should be scaled. More...
 
double Desired_proportion_of_arc_length
 Proportion of the arc-length to taken by the parameter. More...
 
double Theta_squared
 
int Sign_of_jacobian
 Storage for the sign of the global Jacobian. More...
 
double Continuation_direction
 
double Parameter_derivative
 Storage for the derivative of the global parameter wrt arc-length. More...
 
double Parameter_current
 Storage for the present value of the global parameter. More...
 
bool Use_continuation_timestepper
 Boolean to control original or new storage of dof stuff. More...
 
unsigned Dof_derivative_offset
 
unsigned Dof_current_offset
 
Vector< double > Dof_derivative
 Storage for the derivative of the problem variables wrt arc-length. More...
 
Vector< double > Dof_current
 Storage for the present values of the variables. More...
 
double Ds_current
 Storage for the current step value. More...
 
unsigned Desired_newton_iterations_ds
 
double Minimum_ds
 Minimum desired value of arc-length. More...
 
bool Bifurcation_detection
 Boolean to control bifurcation detection via determinant of Jacobian. More...
 
bool Bisect_to_find_bifurcation
 Boolean to control wheter bisection is used to located bifurcation. More...
 
bool First_jacobian_sign_change
 Boolean to indicate whether a sign change has occured in the Jacobian. More...
 
bool Arc_length_step_taken
 Boolean to indicate whether an arc-length step has been taken. More...
 
bool Use_finite_differences_for_continuation_derivatives
 
OomphCommunicator * Communicator_pt
 The communicator for this problem. More...
 
bool Always_take_one_newton_step
 
double Timestep_reduction_factor_after_nonconvergence
 
bool Keep_temporal_error_below_tolerance
 
- Static Protected Attributes inherited from oomph::Problem
static ContinuationStorageScheme Continuation_time_stepper
 Storage for the single static continuation timestorage object. More...
 

Detailed Description

template<class ELEMENT>
class TestPoissonProblem< ELEMENT >

Poisson problem on rotatable, refineable cubic brick mesh.

Poisson problem in refineable eighth of a sphere mesh.

///////////////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////

Constructor & Destructor Documentation

◆ TestPoissonProblem() [1/2]

template<class ELEMENT >
TestPoissonProblem< ELEMENT >::TestPoissonProblem ( const unsigned &  angle,
const unsigned &  rotated_element,
PoissonEquations< 3 >::PoissonSourceFctPt  source_fct_pt 
)

Constructor: Pass index of rotation, number of rotated element, and pointer to source function.

◆ ~TestPoissonProblem() [1/2]

template<class ELEMENT >
TestPoissonProblem< ELEMENT >::~TestPoissonProblem ( )
inline

Destructor: close trace file.

541  {
542  Trace_file.close();
543  }
ofstream Trace_file
Trace file.
Definition: octree_test.cc:592

References oomph::Problem_Parameter::Trace_file.

◆ TestPoissonProblem() [2/2]

template<class ELEMENT >
TestPoissonProblem< ELEMENT >::TestPoissonProblem ( const unsigned &  angle,
PoissonEquations< 3 >::PoissonSourceFctPt  source_fct_pt 
)

Constructor: Pass pointer to source function.

◆ ~TestPoissonProblem() [2/2]

template<class ELEMENT >
TestPoissonProblem< ELEMENT >::~TestPoissonProblem ( )
inline

Destructor: Empty.

691 {}

Member Function Documentation

◆ actions_after_newton_solve() [1/2]

template<class ELEMENT >
void TestPoissonProblem< ELEMENT >::actions_after_newton_solve ( )
inlinevirtual

Update the problem specs after solve (empty)

Reimplemented from oomph::Problem.

557 {}

◆ actions_after_newton_solve() [2/2]

template<class ELEMENT >
void TestPoissonProblem< ELEMENT >::actions_after_newton_solve ( )
inlinevirtual

Update the problem specs after solve (empty)

Reimplemented from oomph::Problem.

701 {}

◆ actions_before_newton_solve() [1/2]

template<class ELEMENT >
void TestPoissonProblem< ELEMENT >::actions_before_newton_solve ( )
inlinevirtual

Update the problem specs before solve: Set Dirchlet boundary conditions from exact solution.

Reimplemented from oomph::Problem.

562  {
563  //Loop over the boundaries
564  unsigned num_bound = mesh_pt()->nboundary();
565  for(unsigned ibound=0;ibound<num_bound;ibound++)
566  {
567  // Loop over the nodes on boundary
568  unsigned num_nod=mesh_pt()->nboundary_node(ibound);
569  for (unsigned inod=0;inod<num_nod;inod++)
570  {
571  Node* nod_pt=mesh_pt()->boundary_node_pt(ibound,inod);
572  double u;
573  Vector<double> x(3);
574  x[0]=nod_pt->x(0);
575  x[1]=nod_pt->x(1);
576  x[2]=nod_pt->x(2);
578  nod_pt->set_value(0,u);
579  }
580  }
581  }
RotatableRefineableCubicMesh< ELEMENT > * mesh_pt()
Definition: octree_test.cc:547
void set_value(const unsigned &i, const double &value_)
Definition: nodes.h:271
Definition: nodes.h:906
double & x(const unsigned &i)
Return the i-th nodal coordinate.
Definition: nodes.h:1060
void get_exact_u(const Vector< double > &x, Vector< double > &u)
Exact solution as a Vector.
Definition: extrude_with_macro_element_representation.cc:206
list x
Definition: plotDoE.py:28

References TanhSolnForPoisson::get_exact_u(), oomph::Data::set_value(), plotDoE::x, and oomph::Node::x().

◆ actions_before_newton_solve() [2/2]

template<class ELEMENT >
void TestPoissonProblem< ELEMENT >::actions_before_newton_solve ( )
inlinevirtual

Update the problem specs before solve: Set Dirchlet boundary conditions from exact solution.

Reimplemented from oomph::Problem.

706  {
707  //Loop over the boundaries
708  unsigned num_bound = mesh_pt()->nboundary();
709  for(unsigned ibound=0;ibound<num_bound;ibound++)
710  {
711  // Loop over the nodes on boundary
712  unsigned num_nod=mesh_pt()->nboundary_node(ibound);
713  for (unsigned inod=0;inod<num_nod;inod++)
714  {
715  Node* nod_pt=mesh_pt()->boundary_node_pt(ibound,inod);
716  double u;
717  Vector<double> x(3);
718  x[0]=nod_pt->x(0);
719  x[1]=nod_pt->x(1);
720  x[2]=nod_pt->x(2);
722  nod_pt->set_value(0,u);
723  }
724  }
725  }

References TanhSolnForPoisson::get_exact_u(), oomph::Data::set_value(), plotDoE::x, and oomph::Node::x().

◆ doc_solution() [1/2]

template<class ELEMENT >
void TestPoissonProblem< ELEMENT >::doc_solution ( DocInfo &  doc_info)

Doc the solution.

849 {
850  ofstream some_file,some_file2;
851  char filename[100];
852 
853 
854 
855  unsigned success_flag=0;
856 
857  // Check for repeated nodes in mesh
858  if (mesh_pt()->check_for_repeated_nodes()!=0) success_flag=1;
859 
860  // Do octree self test
861  if (dynamic_cast<OcTreeForest*>(mesh_pt()->forest_pt())->self_test()!=0)
862  {
863  success_flag=1;
864  }
865 
866  // Doc success flag to trace file
867  Trace_file << success_flag << std::endl;
868 
869 
870  // Limited output if run as self test
871  if ((CommandLineArgs::Argc==1)||(doc_info.number()==0))
872  {
873  // Number of plot points
874  unsigned npts;
875  npts=5;
876 
877  // Doc orientation of the root elements
878  sprintf(filename,"%s/orientation%i.dat",doc_info.directory().c_str(),
879  doc_info.number());
880  some_file.open(filename);
881 
882  sprintf(filename,"%s/root_elements%i.dat",doc_info.directory().c_str(),
883  doc_info.number());
884  some_file2.open(filename);
885 
886  // Loop over octree roots to display orientation
887  Vector<double> s(3);
888  Vector<double> x_centre(3),x_end(3);
889  unsigned ntree=mesh_pt()->forest_pt()->ntree();
890  for (unsigned i=0;i<ntree;i++)
891  {
892  RefineableQElement<3>* el_pt=
893  dynamic_cast<RefineableQElement<3>*>(
894  mesh_pt()->forest_pt()->tree_pt(i)->object_pt());
895 
896  // Centre of element
897  s[0]=0.0;
898  s[1]=0.0;
899  s[2]=0.0;
900  el_pt->interpolated_x(s,x_centre);
901 
902 
903  // End of "up" in element
904  s[0]=0.0;
905  s[1]=1.0;
906  s[2]=0.0;
907  el_pt->interpolated_x(s,x_end);
908 
909  some_file << "ZONE I=1, C=\"RED\"" << std::endl;
910  some_file << x_centre[0] << " "
911  << x_centre[1] << " "
912  << x_centre[2] << " "
913  << x_end[0]-x_centre[0] << " "
914  << x_end[1]-x_centre[1] << " "
915  << x_end[2]-x_centre[2] << " " << std::endl;
916 
917  // End of "right" in element
918  s[0]=1.0;
919  s[1]=0.0;
920  s[2]=0.0;
921  el_pt->interpolated_x(s,x_end);
922 
923  some_file << "ZONE I=1, C=\"GREEN\"" << std::endl;
924  some_file << x_centre[0] << " "
925  << x_centre[1] << " "
926  << x_centre[2] << " "
927  << x_end[0]-x_centre[0] << " "
928  << x_end[1]-x_centre[1] << " "
929  << x_end[2]-x_centre[2] << " " << std::endl;
930 
931  el_pt->output_corners(some_file2,"BLUE");
932  }
933  some_file.close();
934  some_file2.close();
935 
936  // Doc neighbours
937  doc_info.enable_doc();
938  mesh_pt()->forest_pt()->check_all_neighbours(doc_info);
939 
940 
941  // Output solution
942  //-----------------
943  //mesh_pt()->sort_elements();
944  sprintf(filename,"%s/soln%i.dat",doc_info.directory().c_str(),
945  doc_info.number());
946  some_file.open(filename);
947  mesh_pt()->output(some_file,npts);
948  some_file.close();
949 
950  }
951 
952 } // end of doc
int i
Definition: BiCGSTAB_step_by_step.cpp:9
void enable_doc()
Enable documentation.
Definition: oomph_utilities.h:536
std::string directory() const
Output directory.
Definition: oomph_utilities.h:524
unsigned & number()
Number used (e.g.) for labeling output files.
Definition: oomph_utilities.h:554
virtual double interpolated_x(const Vector< double > &s, const unsigned &i) const
Return FE interpolated coordinate x[i] at local coordinate s.
Definition: elements.cc:3962
Definition: octree.h:928
unsigned self_test()
Self-test: Check meshes and global data. Return 0 for OK.
Definition: problem.cc:13276
Definition: refineable_brick_element.h:68
void output_corners(std::ostream &outfile, const std::string &colour) const
Print corner nodes, use colour.
Definition: refineable_brick_element.cc:40
RealScalar s
Definition: level1_cplx_impl.h:130
string filename
Definition: MergeRestartFiles.py:39
int Argc
Number of arguments + 1.
Definition: oomph_utilities.cc:407

References oomph::CommandLineArgs::Argc, oomph::DocInfo::directory(), oomph::DocInfo::enable_doc(), MergeRestartFiles::filename, i, oomph::FiniteElement::interpolated_x(), oomph::DocInfo::number(), oomph::RefineableQElement< 3 >::output_corners(), s, oomph::self_test(), and oomph::Problem_Parameter::Trace_file.

◆ doc_solution() [2/2]

template<class ELEMENT >
void TestPoissonProblem< ELEMENT >::doc_solution ( DocInfo &  doc_info)

Doc the solution.

◆ impose_specific_refinement()

template<class ELEMENT >
void TestPoissonProblem< ELEMENT >::impose_specific_refinement ( const unsigned &  nrefine)

Impose specific refinement on mesh (up to nrefine refinements)

Impose a specific refinement pattern with up to 3 non-uniform refinements that produces all sorts of neighbours. Triply refined next to unrefined, double refined next to triply refined etc.

686 {
687 
688  // First four block elements get triply refined
689  set<RefineableElement*> triply_refined_el_pt;
690  if (nrefine>2)
691  {
692  triply_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
693  mesh_pt()->element_pt(7)));
694  triply_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
695  mesh_pt()->element_pt(8)));
696  triply_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
697  mesh_pt()->element_pt(16)));
698  triply_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
699  mesh_pt()->element_pt(17)));
700  }
701 
702 
703  // First four block elements get doubly refined
704  set<RefineableElement*> doubly_refined_el_pt;
705  if (nrefine>1)
706  {
707  doubly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
708  mesh_pt()->element_pt(0)));
709  doubly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
710  mesh_pt()->element_pt(1)));
711  doubly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
712  mesh_pt()->element_pt(3)));
713  doubly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
714  mesh_pt()->element_pt(4)));
715  }
716 
717 
718  // Next four block elements get singly refined
719  set<RefineableElement*> singly_refined_el_pt;
720  singly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
721  mesh_pt()->element_pt(2)));
722  singly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
723  mesh_pt()->element_pt(5)));
724  singly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
725  mesh_pt()->element_pt(11)));
726  singly_refined_el_pt.insert(dynamic_cast<RefineableElement*>(
727  mesh_pt()->element_pt(14)));
728 
729  // Loop over refinement levels
730  Vector<RefineableElement*> ref_el_pt;
731  for (unsigned i=0;i<nrefine;i++)
732  {
733 
734  // Form Vector of elements that have to be refined
735  ref_el_pt.resize(0);
736  typedef set<RefineableElement*>::iterator IT;
737 
738  // Triple refinement
739  for (IT it=triply_refined_el_pt.begin();
740  it!=triply_refined_el_pt.end();
741  ++it)
742  {
743  ref_el_pt.push_back(*it);
744  }
745 
746 
747  // Double refinement
748  if (i<2)
749  {
750  for (IT it=doubly_refined_el_pt.begin();
751  it!=doubly_refined_el_pt.end();
752  ++it)
753  {
754  ref_el_pt.push_back(*it);
755  }
756  }
757 
758  // Only add singly refined ones during first round
759  if (i==0)
760  {
761  for (IT it=singly_refined_el_pt.begin();
762  it!=singly_refined_el_pt.end();
763  ++it)
764  {
765  ref_el_pt.push_back(*it);
766  }
767 
768  // Add central element
769  ref_el_pt.push_back(dynamic_cast<RefineableElement*>(
770  mesh_pt()->element_pt(13)));
771  }
772 
773  // Total number of elements to be refined at least once
774  unsigned n_total=ref_el_pt.size();
775 
776 
777  // Refine these elements
778  refine_selected_elements(ref_el_pt);
779 
780 
781  // Now that they've been refined, remove them from the set
782  // of elements that have to be refined next time but add
783  // their sons instead
784  Vector<RefineableQElement<3>*> aux_el_pt;
785  for (IT it=triply_refined_el_pt.begin();
786  it!=triply_refined_el_pt.end();
787  ++it)
788  {
789  aux_el_pt.push_back(dynamic_cast<RefineableQElement<3>*>(*it));
790  }
791 
792  unsigned nr=aux_el_pt.size();
793  for (unsigned ii=0;ii<nr;ii++)
794  {
795  // Add sons
796  for (unsigned s=0;s<8;s++)
797  {
798  triply_refined_el_pt.insert(aux_el_pt[ii]->octree_pt()->
799  son_pt(s)->object_pt());
800  }
801  // Remove element itself
802  triply_refined_el_pt.erase(aux_el_pt[ii]);
803  }
804 
805 
806 
807  if (i<2)
808  {
809 
810  // Now that they've been refined, remove them from the set
811  // of elements that have to be refined next time but add
812  // their sons instead
813  aux_el_pt.resize(0);
814  for (IT it=doubly_refined_el_pt.begin();
815  it!=doubly_refined_el_pt.end();
816  ++it)
817  {
818  aux_el_pt.push_back(dynamic_cast<RefineableQElement<3>*>(*it));
819  }
820 
821  nr=aux_el_pt.size();
822  for (unsigned ii=0;ii<nr;ii++)
823  {
824  // Add sons
825  for (unsigned s=0;s<8;s++)
826  {
827  doubly_refined_el_pt.insert(aux_el_pt[ii]->octree_pt()->
828  son_pt(s)->object_pt());
829  }
830  // Remove element itself
831  doubly_refined_el_pt.erase(aux_el_pt[ii]);
832  }
833  // Finally: Last son in central element
834  doubly_refined_el_pt.insert(dynamic_cast<RefineableQElement<3>*>(
835  ref_el_pt[n_total-1])->octree_pt()->
836  son_pt(7)->object_pt());
837  }
838  }
839 }
void refine_selected_elements(const Vector< unsigned > &elements_to_be_refined)
Definition: problem.cc:14898
Definition: refineable_elements.h:97

References i, and s.

◆ mesh_pt() [1/2]

template<class ELEMENT >
RotatableRefineableCubicMesh<ELEMENT>* TestPoissonProblem< ELEMENT >::mesh_pt ( )
inline

Overload generic access function by one that returns a pointer to the specific mesh

548  {
549  return dynamic_cast<RotatableRefineableCubicMesh<ELEMENT>*>(
550  Problem::mesh_pt());
551  }
Definition: octree_test.cc:392

References oomph::Problem::mesh_pt().

◆ mesh_pt() [2/2]

template<class ELEMENT >
TestRefineableCubicMesh<ELEMENT>* TestPoissonProblem< ELEMENT >::mesh_pt ( )
inline

Overload generic access function by one that returns a pointer to the specific mesh

696  {
697  return dynamic_cast<TestRefineableCubicMesh<ELEMENT>*>(Problem::mesh_pt());
698  }
Definition: tree_3d.cc:552

References oomph::Problem::mesh_pt().

Member Data Documentation

◆ Source_fct_pt

template<class ELEMENT >
PoissonEquations< 3 >::PoissonSourceFctPt TestPoissonProblem< ELEMENT >::Source_fct_pt
private

Pointer to source function.

◆ Trace_file

template<class ELEMENT >
ofstream TestPoissonProblem< ELEMENT >::Trace_file
private

Trace file.


The documentation for this class was generated from the following files: