mpi/distribution/hp_adaptive_poisson/two_d_poisson_hp_adapt.cc File Reference

#include "generic.h"
#include "poisson.h"
#include "meshes/simple_rectangular_quadmesh.h"

Classes
class	SimpleRefineableRectangularQuadMesh< ELEMENT >
class	RefineableTwoDPoissonProblem< ELEMENT >

Namespaces
	TanhSolnForPoisson
	Namespace for exact solution for Poisson equation with "sharp step".

Functions
void	TanhSolnForPoisson::get_exact_u (const Vector< double > &x, Vector< double > &u)
	Exact solution as a Vector. More...
void	TanhSolnForPoisson::get_exact_gradient (const Vector< double > &x, Vector< double > &dudx)
	Exact gradient as a Vector. More...
void	TanhSolnForPoisson::get_source (const Vector< double > &x, double &source)
	Source function to make it an exact solution. More...
int	main (int argc, char **argv)
	Driver code for hp-adaptive solution to the 2D Poisson problem. More...

Function Documentation

main()

int main	(	int argc	,
		char **	argv
	)

Driver code for hp-adaptive solution to the 2D Poisson problem.

{
 
#ifdef OOMPH_HAS_MPI
 
 // Initialise MPI
 MPI_Helpers::init(argc,argv);
 
#endif
 
 // Store command line arguments
 CommandLineArgs::setup(argc,argv);
  
 // Create label for output
 //------------------------
 DocInfo doc_info;
 
 // Set output directory
 doc_info.set_directory("RESLT");
 
 //Set up the problem
 //------------------
 
 // Create the problem with 2D hp-refineable elements from the
 // PRefineableQPoissonElement family. Pass pointer to source function. 
 RefineableTwoDPoissonProblem<PRefineableQPoissonElement<2> > 
  problem(&TanhSolnForPoisson::get_source);
 
 //Are there command-line arguments?
 if(CommandLineArgs::Argc==1)
  {
 
#ifdef OOMPH_HAS_MPI
 
   // Provide storage for each element's partition number
   const unsigned n_element=problem.mesh_pt()->nelement();
   Vector<unsigned> out_element_partition(n_element);
 
   // Distribute the problem
   bool report_stats=true;
   out_element_partition=problem.distribute(report_stats);
 
   // Write partition to disk
   std::ofstream output_file;
   char filename[100];
   sprintf(filename,"out_hp_adaptive_poisson_partition.dat");
   output_file.open(filename);
   for (unsigned e=0;e<n_element;e++)
    {
     output_file << out_element_partition[e] << std::endl;
    }
 
   // Check halo schemes (optional)
   problem.check_halo_schemes(doc_info);
 
#endif
   
  }
 else // Validation run - read in partition from file
  {
 
#ifdef OOMPH_HAS_MPI
 
   DocInfo mesh_doc_info;
   mesh_doc_info.set_directory("RESLT_MESH");
   mesh_doc_info.number()=0;
   std::ifstream input_file;
   char filename[100];
 
   // Get the partition to be used from file
   const unsigned n_element=problem.mesh_pt()->nelement();
   Vector<unsigned> element_partition(n_element);
   sprintf(filename,"hp_adaptive_poisson_partition.dat");
   input_file.open(filename);
   std::string input_string;
   for (unsigned e=0;e<n_element;e++)
    {
     getline(input_file,input_string,'\n');
     element_partition[e]=atoi(input_string.c_str());
    }
 
   // Now perform the distribution
   bool report_stats=true;
   problem.distribute(element_partition,mesh_doc_info,report_stats);
 
#endif
 
  } // end of mesh distribution
 
 
 // Check if we're ready to go:
 //----------------------------
 cout << "\n\n\nProblem self-test ";
 if (problem.self_test()==0) 
  {
   cout << "passed: Problem can be solved." << std::endl;
  }
 else 
  {
   throw OomphLibError("Self test failed",
                       OOMPH_CURRENT_FUNCTION,
                       OOMPH_EXCEPTION_LOCATION);
  }
 
 // Set the orientation of the "step" to 45 degrees
 TanhSolnForPoisson::TanPhi=1.0;
 
 // Choose a large value for the steepness of the "step"
 TanhSolnForPoisson::Alpha=20.0;
 
 // Initially uniformly refine the mesh
 for (unsigned p=0; p<0; p++)
  {
   cout << "p-refining:" << endl;
   problem.p_refine_uniformly();
  }
 for (unsigned h=0; h<0; h++)
  {
   cout << "h-refining:" << endl;
   problem.refine_uniformly();
  }
 
 problem.newton_solve();
 
 //Output the solution
 doc_info.number()=1;
 problem.doc_solution(doc_info);
 
 problem.p_adapt();
 problem.newton_solve();
 doc_info.number()=2;
 problem.doc_solution(doc_info);
 
 problem.adapt();
 problem.newton_solve();
 doc_info.number()=3;
 problem.doc_solution(doc_info);
 
 problem.p_adapt();
 problem.newton_solve();
 doc_info.number()=4;
 problem.doc_solution(doc_info);
 
 problem.adapt();
 problem.newton_solve();
 doc_info.number()=5;
 problem.doc_solution(doc_info);
 
 problem.p_adapt();
 problem.newton_solve();
 doc_info.number()=6;
 problem.doc_solution(doc_info);
 
 problem.adapt();
 problem.newton_solve();
 doc_info.number()=7;
 problem.doc_solution(doc_info);
 
 problem.p_adapt();
 problem.newton_solve();
 doc_info.number()=8;
 problem.doc_solution(doc_info);
 
 problem.adapt();
 problem.newton_solve();
 doc_info.number()=9;
 problem.doc_solution(doc_info);
 
 
 // Count hanging nodes
 unsigned hang_no=0;
 for (unsigned n=0; n<problem.mesh_pt()->nnode(); n++)
  {
   if (problem.mesh_pt()->node_pt(n)->is_hanging()) hang_no++;
  }
 cout << hang_no << " hanging nodes in mesh." << endl;
 
 //Output the solution
 doc_info.number()=0;
 problem.doc_solution(doc_info);
 
 
// Finalise MPI
#ifdef OOMPH_HAS_MPI
 
 MPI_Helpers::finalize();
 
#endif
 
} //end of main

References TanhSolnForPoisson::Alpha, oomph::CommandLineArgs::Argc, e(), MergeRestartFiles::filename, TanhSolnForPoisson::get_source(), n, oomph::DocInfo::number(), OOMPH_CURRENT_FUNCTION, OOMPH_EXCEPTION_LOCATION, p, problem, oomph::DocInfo::set_directory(), Flag_definition::setup(), oomph::Global_string_for_annotation::string(), and TanhSolnForPoisson::TanPhi.