pvfmm.hpp 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  1. /**
  2. * \file pvfmm.hpp
  3. * \author Dhairya Malhotra, dhairya.malhotra@gmail.com
  4. * \date 1-2-2014
  5. * \brief This file contains wrapper functions for PvFMM.
  6. */
  7. #ifndef _PVFMM_HPP_
  8. #define _PVFMM_HPP_
  9. #include <mpi.h>
  10. #include <cstdlib>
  11. #include <iostream>
  12. #include <pvfmm_common.hpp>
  13. #include <fmm_cheb.hpp>
  14. #include <fmm_node.hpp>
  15. #include <fmm_tree.hpp>
  16. namespace pvfmm{
  17. typedef FMM_Node<Cheb_Node<double> > ChebFMM_Node;
  18. typedef FMM_Cheb<ChebFMM_Node> ChebFMM;
  19. typedef FMM_Tree<ChebFMM> ChebFMM_Tree;
  20. typedef ChebFMM_Node::NodeData ChebFMM_Data;
  21. typedef void (*ChebFn)(double* , int , double*);
  22. ChebFMM_Tree* ChebFMM_CreateTree(int cheb_deg, int data_dim, ChebFn fn_ptr, std::vector<double>& trg_coord, MPI_Comm& comm,
  23. double tol=1e-6, int max_pts=100, BoundaryType bndry=FreeSpace, int init_depth=0){
  24. int np, myrank;
  25. MPI_Comm_size(comm, &np);
  26. MPI_Comm_rank(comm, &myrank);
  27. ChebFMM_Data tree_data;
  28. tree_data.cheb_deg=cheb_deg;
  29. tree_data.data_dof=data_dim;
  30. tree_data.input_fn=fn_ptr;
  31. tree_data.tol=tol;
  32. bool adap=true;
  33. tree_data.dim=COORD_DIM;
  34. tree_data.max_depth=MAX_DEPTH;
  35. tree_data.max_pts=max_pts;
  36. { // Set points for initial tree.
  37. std::vector<double> coord;
  38. size_t N=pow(8.0,init_depth);
  39. N=(N<np?np:N)*max_pts;
  40. size_t NN=ceil(pow((double)N,1.0/3.0));
  41. size_t N_total=NN*NN*NN;
  42. size_t start= myrank *N_total/np;
  43. size_t end =(myrank+1)*N_total/np;
  44. for(size_t i=start;i<end;i++){
  45. coord.push_back(((double)((i/ 1 )%NN)+0.5)/NN);
  46. coord.push_back(((double)((i/ NN )%NN)+0.5)/NN);
  47. coord.push_back(((double)((i/(NN*NN))%NN)+0.5)/NN);
  48. }
  49. tree_data.pt_coord=coord;
  50. }
  51. // Set target points.
  52. tree_data.trg_coord=trg_coord;
  53. ChebFMM_Tree* tree=new ChebFMM_Tree(comm);
  54. tree->Initialize(&tree_data);
  55. tree->InitFMM_Tree(adap,bndry);
  56. return tree;
  57. }
  58. void ChebFMM_Evaluate(ChebFMM_Tree* tree, std::vector<double>& trg_val, size_t loc_size=0){
  59. tree->RunFMM();
  60. Vector<double> trg_value;
  61. Vector<size_t> trg_scatter;
  62. {// Collect data from each node to trg_value and trg_scatter.
  63. std::vector<double> trg_value_;
  64. std::vector<size_t> trg_scatter_;
  65. std::vector<ChebFMM_Node*>& nodes=tree->GetNodeList();
  66. for(size_t i=0;i<nodes.size();i++){
  67. if(nodes[i]->IsLeaf() && !nodes[i]->IsGhost()){
  68. Vector<double>& trg_value=nodes[i]->trg_value;
  69. Vector<size_t>& trg_scatter=nodes[i]->trg_scatter;
  70. for(size_t j=0;j<trg_value.Dim();j++) trg_value_.push_back(trg_value[j]);
  71. for(size_t j=0;j<trg_scatter.Dim();j++) trg_scatter_.push_back(trg_scatter[j]);
  72. }
  73. }
  74. trg_value=trg_value_;
  75. trg_scatter=trg_scatter_;
  76. }
  77. par::ScatterReverse(trg_value,trg_scatter,*tree->Comm(),loc_size);
  78. trg_val.assign(&trg_value[0],&trg_value[0]+trg_value.Dim());;
  79. }
  80. typedef FMM_Node<MPI_Node<double> > PtFMM_Node;
  81. typedef FMM_Pts<PtFMM_Node> PtFMM;
  82. typedef FMM_Tree<PtFMM> PtFMM_Tree;
  83. typedef PtFMM_Node::NodeData PtFMM_Data;
  84. PtFMM_Tree* PtFMM_CreateTree(std::vector<double>& src_coord, std::vector<double>& src_value,
  85. std::vector<double>& surf_coord, std::vector<double>& surf_value,
  86. std::vector<double>& trg_coord, MPI_Comm& comm, int max_pts=100,
  87. BoundaryType bndry=FreeSpace, int init_depth=0){
  88. int np, myrank;
  89. MPI_Comm_size(comm, &np);
  90. MPI_Comm_rank(comm, &myrank);
  91. PtFMM_Data tree_data;
  92. bool adap=true;
  93. tree_data.dim=COORD_DIM;
  94. tree_data.max_depth=MAX_DEPTH;
  95. tree_data.max_pts=max_pts;
  96. // Set source points.
  97. tree_data. src_coord= src_coord;
  98. tree_data. src_value= src_value;
  99. tree_data.surf_coord=surf_coord;
  100. tree_data.surf_value=surf_value;
  101. // Set target points.
  102. tree_data.trg_coord=trg_coord;
  103. tree_data. pt_coord=trg_coord;
  104. PtFMM_Tree* tree=new PtFMM_Tree(comm);
  105. tree->Initialize(&tree_data);
  106. tree->InitFMM_Tree(adap,bndry);
  107. return tree;
  108. }
  109. PtFMM_Tree* PtFMM_CreateTree(std::vector<double>& src_coord, std::vector<double>& src_value,
  110. std::vector<double>& trg_coord, MPI_Comm& comm, int max_pts=100,
  111. BoundaryType bndry=FreeSpace, int init_depth=0){
  112. std::vector<double> surf_coord;
  113. std::vector<double> surf_value;
  114. return PtFMM_CreateTree(src_coord, src_value, surf_coord,surf_value, trg_coord, comm, max_pts, bndry, init_depth);
  115. }
  116. void PtFMM_Evaluate(PtFMM_Tree* tree, std::vector<double>& trg_val, size_t loc_size=0, std::vector<double>* src_val=NULL, std::vector<double>* surf_val=NULL){
  117. if(src_val){
  118. std::vector<size_t> src_scatter_;
  119. std::vector<PtFMM_Node*>& nodes=tree->GetNodeList();
  120. for(size_t i=0;i<nodes.size();i++){
  121. if(nodes[i]->IsLeaf() && !nodes[i]->IsGhost()){
  122. Vector<size_t>& src_scatter=nodes[i]->src_scatter;
  123. for(size_t j=0;j<src_scatter.Dim();j++) src_scatter_.push_back(src_scatter[j]);
  124. }
  125. }
  126. Vector<double> src_value=*src_val;
  127. Vector<size_t> src_scatter=src_scatter_;
  128. par::ScatterForward(src_value,src_scatter,*tree->Comm());
  129. size_t indx=0;
  130. for(size_t i=0;i<nodes.size();i++){
  131. if(nodes[i]->IsLeaf() && !nodes[i]->IsGhost()){
  132. Vector<double>& src_value_=nodes[i]->src_value;
  133. for(size_t j=0;j<src_value_.Dim();j++){
  134. src_value_[j]=src_value[indx];
  135. indx++;
  136. }
  137. }
  138. }
  139. }
  140. if(surf_val){
  141. std::vector<size_t> surf_scatter_;
  142. std::vector<PtFMM_Node*>& nodes=tree->GetNodeList();
  143. for(size_t i=0;i<nodes.size();i++){
  144. if(nodes[i]->IsLeaf() && !nodes[i]->IsGhost()){
  145. Vector<size_t>& surf_scatter=nodes[i]->surf_scatter;
  146. for(size_t j=0;j<surf_scatter.Dim();j++) surf_scatter_.push_back(surf_scatter[j]);
  147. }
  148. }
  149. Vector<double> surf_value=*surf_val;
  150. Vector<size_t> surf_scatter=surf_scatter_;
  151. par::ScatterForward(surf_value,surf_scatter,*tree->Comm());
  152. size_t indx=0;
  153. for(size_t i=0;i<nodes.size();i++){
  154. if(nodes[i]->IsLeaf() && !nodes[i]->IsGhost()){
  155. Vector<double>& surf_value_=nodes[i]->surf_value;
  156. for(size_t j=0;j<surf_value_.Dim();j++){
  157. surf_value_[j]=surf_value[indx];
  158. indx++;
  159. }
  160. }
  161. }
  162. }
  163. tree->RunFMM();
  164. Vector<double> trg_value;
  165. Vector<size_t> trg_scatter;
  166. {
  167. std::vector<double> trg_value_;
  168. std::vector<size_t> trg_scatter_;
  169. std::vector<PtFMM_Node*>& nodes=tree->GetNodeList();
  170. for(size_t i=0;i<nodes.size();i++){
  171. if(nodes[i]->IsLeaf() && !nodes[i]->IsGhost()){
  172. Vector<double>& trg_value=nodes[i]->trg_value;
  173. Vector<size_t>& trg_scatter=nodes[i]->trg_scatter;
  174. for(size_t j=0;j<trg_value.Dim();j++) trg_value_.push_back(trg_value[j]);
  175. for(size_t j=0;j<trg_scatter.Dim();j++) trg_scatter_.push_back(trg_scatter[j]);
  176. }
  177. }
  178. trg_value=trg_value_;
  179. trg_scatter=trg_scatter_;
  180. }
  181. par::ScatterReverse(trg_value,trg_scatter,*tree->Comm(),loc_size);
  182. trg_val.assign(&trg_value[0],&trg_value[0]+trg_value.Dim());;
  183. }
  184. }//end namespace
  185. #endif //_PVFMM_HPP_