kernel.txx 75 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263
  1. /**
  2. * \file kernel.txx
  3. * \author Dhairya Malhotra, dhairya.malhotra@gmail.com
  4. * \date 12-20-2011
  5. * \brief This file contains the implementation of the struct Kernel and also the
  6. * implementation of various kernels for FMM.
  7. */
  8. #include <cmath>
  9. #include <cstdlib>
  10. #include <vector>
  11. #include <mem_mgr.hpp>
  12. #include <profile.hpp>
  13. #include <vector.hpp>
  14. #include <matrix.hpp>
  15. #include <precomp_mat.hpp>
  16. #include <intrin_wrapper.hpp>
  17. namespace pvfmm{
  18. /**
  19. * \brief Constructor.
  20. */
  21. template <class T>
  22. Kernel<T>::Kernel(Ker_t poten, Ker_t dbl_poten, const char* name, int dim_, std::pair<int,int> k_dim,
  23. size_t dev_poten, size_t dev_dbl_poten){
  24. dim=dim_;
  25. ker_dim[0]=k_dim.first;
  26. ker_dim[1]=k_dim.second;
  27. ker_poten=poten;
  28. dbl_layer_poten=dbl_poten;
  29. ker_name=std::string(name);
  30. dev_ker_poten=dev_poten;
  31. dev_dbl_layer_poten=dev_dbl_poten;
  32. k_s2m=NULL;
  33. k_s2l=NULL;
  34. k_s2t=NULL;
  35. k_m2m=NULL;
  36. k_m2l=NULL;
  37. k_m2t=NULL;
  38. k_l2l=NULL;
  39. k_l2t=NULL;
  40. scale_invar=true;
  41. src_scal.Resize(ker_dim[0]); src_scal.SetZero();
  42. trg_scal.Resize(ker_dim[1]); trg_scal.SetZero();
  43. perm_vec.Resize(Perm_Count);
  44. for(size_t p_type=0;p_type<C_Perm;p_type++){
  45. perm_vec[p_type ]=Permutation<T>(ker_dim[0]);
  46. perm_vec[p_type+C_Perm]=Permutation<T>(ker_dim[1]);
  47. }
  48. init=false;
  49. }
  50. /**
  51. * \brief Initialize the kernel.
  52. */
  53. template <class T>
  54. void Kernel<T>::Initialize(bool verbose) const{
  55. if(init) return;
  56. init=true;
  57. T eps=1.0;
  58. while(eps+(T)1.0>1.0) eps*=0.5;
  59. if(ker_dim[0]*ker_dim[1]>0){ // Determine scal
  60. Matrix<T> M_scal(ker_dim[0],ker_dim[1]);
  61. size_t N=1024;
  62. T eps_=N*eps;
  63. T src_coord[3]={0,0,0};
  64. std::vector<T> trg_coord1(N*COORD_DIM);
  65. std::vector<T> trg_coord2(N*COORD_DIM);
  66. for(size_t i=0;i<N;i++){
  67. T x,y,z,r;
  68. do{
  69. x=(drand48()-0.5);
  70. y=(drand48()-0.5);
  71. z=(drand48()-0.5);
  72. r=sqrt(x*x+y*y+z*z);
  73. }while(r<0.25);
  74. trg_coord1[i*COORD_DIM+0]=x;
  75. trg_coord1[i*COORD_DIM+1]=y;
  76. trg_coord1[i*COORD_DIM+2]=z;
  77. }
  78. for(size_t i=0;i<N*COORD_DIM;i++){
  79. trg_coord2[i]=trg_coord1[i]*0.5;
  80. }
  81. T max_val=0;
  82. Matrix<T> M1(N,ker_dim[0]*ker_dim[1]);
  83. Matrix<T> M2(N,ker_dim[0]*ker_dim[1]);
  84. for(size_t i=0;i<N;i++){
  85. BuildMatrix(&src_coord [ 0], 1,
  86. &trg_coord1[i*COORD_DIM], 1, &(M1[i][0]));
  87. BuildMatrix(&src_coord [ 0], 1,
  88. &trg_coord2[i*COORD_DIM], 1, &(M2[i][0]));
  89. for(size_t j=0;j<ker_dim[0]*ker_dim[1];j++){
  90. max_val=std::max<T>(max_val,M1[i][j]);
  91. max_val=std::max<T>(max_val,M2[i][j]);
  92. }
  93. }
  94. for(size_t i=0;i<ker_dim[0]*ker_dim[1];i++){
  95. T dot11=0, dot12=0, dot22=0;
  96. for(size_t j=0;j<N;j++){
  97. dot11+=M1[j][i]*M1[j][i];
  98. dot12+=M1[j][i]*M2[j][i];
  99. dot22+=M2[j][i]*M2[j][i];
  100. }
  101. if(dot11>max_val*max_val*eps_ &&
  102. dot22>max_val*max_val*eps_ ){
  103. T s=dot12/dot11;
  104. M_scal[0][i]=log(s)/log(2.0);
  105. T err=sqrt(0.5*(dot22/dot11)/(s*s)-0.5);
  106. if(err>eps_){
  107. scale_invar=false;
  108. M_scal[0][i]=0.0;
  109. }
  110. assert(M_scal[0][i]>=0.0); // Kernel function must decay
  111. }else M_scal[0][i]=-1;
  112. }
  113. src_scal.Resize(ker_dim[0]); src_scal.SetZero();
  114. trg_scal.Resize(ker_dim[1]); trg_scal.SetZero();
  115. if(scale_invar){
  116. Matrix<T> b(ker_dim[0]*ker_dim[1]+1,1); b.SetZero();
  117. mem::memcopy(&b[0][0],&M_scal[0][0],ker_dim[0]*ker_dim[1]*sizeof(T));
  118. Matrix<T> M(ker_dim[0]*ker_dim[1]+1,ker_dim[0]+ker_dim[1]); M.SetZero();
  119. M[ker_dim[0]*ker_dim[1]][0]=1;
  120. for(size_t i0=0;i0<ker_dim[0];i0++)
  121. for(size_t i1=0;i1<ker_dim[1];i1++){
  122. size_t j=i0*ker_dim[1]+i1;
  123. if(b[j][0]>=0){
  124. M[j][ 0+ i0]=1;
  125. M[j][i1+ker_dim[0]]=1;
  126. }
  127. }
  128. Matrix<T> x=M.pinv()*b;
  129. for(size_t i=0;i<ker_dim[0];i++){
  130. src_scal[i]=x[i][0];
  131. }
  132. for(size_t i=0;i<ker_dim[1];i++){
  133. trg_scal[i]=x[ker_dim[0]+i][0];
  134. }
  135. for(size_t i0=0;i0<ker_dim[0];i0++)
  136. for(size_t i1=0;i1<ker_dim[1];i1++){
  137. if(M_scal[i0][i1]>=0){
  138. if(fabs(src_scal[i0]+trg_scal[i1]-M_scal[i0][i1])>eps_){
  139. scale_invar=false;
  140. }
  141. }
  142. }
  143. }
  144. if(!scale_invar){
  145. src_scal.SetZero();
  146. trg_scal.SetZero();
  147. //std::cout<<ker_name<<" not-scale-invariant\n";
  148. }
  149. }
  150. if(ker_dim[0]*ker_dim[1]>0){ // Determine symmetry
  151. size_t N=1024;
  152. T eps_=N*eps;
  153. T src_coord[3]={0,0,0};
  154. std::vector<T> trg_coord1(N*COORD_DIM);
  155. std::vector<T> trg_coord2(N*COORD_DIM);
  156. for(size_t i=0;i<N;i++){
  157. T x,y,z,r;
  158. do{
  159. x=(drand48()-0.5);
  160. y=(drand48()-0.5);
  161. z=(drand48()-0.5);
  162. r=sqrt(x*x+y*y+z*z);
  163. }while(r<0.25);
  164. trg_coord1[i*COORD_DIM+0]=x;
  165. trg_coord1[i*COORD_DIM+1]=y;
  166. trg_coord1[i*COORD_DIM+2]=z;
  167. }
  168. for(size_t p_type=0;p_type<C_Perm;p_type++){ // For each symmetry transform
  169. switch(p_type){ // Set trg_coord2
  170. case ReflecX:
  171. for(size_t i=0;i<N;i++){
  172. trg_coord2[i*COORD_DIM+0]=-trg_coord1[i*COORD_DIM+0];
  173. trg_coord2[i*COORD_DIM+1]= trg_coord1[i*COORD_DIM+1];
  174. trg_coord2[i*COORD_DIM+2]= trg_coord1[i*COORD_DIM+2];
  175. }
  176. break;
  177. case ReflecY:
  178. for(size_t i=0;i<N;i++){
  179. trg_coord2[i*COORD_DIM+0]= trg_coord1[i*COORD_DIM+0];
  180. trg_coord2[i*COORD_DIM+1]=-trg_coord1[i*COORD_DIM+1];
  181. trg_coord2[i*COORD_DIM+2]= trg_coord1[i*COORD_DIM+2];
  182. }
  183. break;
  184. case ReflecZ:
  185. for(size_t i=0;i<N;i++){
  186. trg_coord2[i*COORD_DIM+0]= trg_coord1[i*COORD_DIM+0];
  187. trg_coord2[i*COORD_DIM+1]= trg_coord1[i*COORD_DIM+1];
  188. trg_coord2[i*COORD_DIM+2]=-trg_coord1[i*COORD_DIM+2];
  189. }
  190. break;
  191. case SwapXY:
  192. for(size_t i=0;i<N;i++){
  193. trg_coord2[i*COORD_DIM+0]= trg_coord1[i*COORD_DIM+1];
  194. trg_coord2[i*COORD_DIM+1]= trg_coord1[i*COORD_DIM+0];
  195. trg_coord2[i*COORD_DIM+2]= trg_coord1[i*COORD_DIM+2];
  196. }
  197. break;
  198. case SwapXZ:
  199. for(size_t i=0;i<N;i++){
  200. trg_coord2[i*COORD_DIM+0]= trg_coord1[i*COORD_DIM+2];
  201. trg_coord2[i*COORD_DIM+1]= trg_coord1[i*COORD_DIM+1];
  202. trg_coord2[i*COORD_DIM+2]= trg_coord1[i*COORD_DIM+0];
  203. }
  204. break;
  205. default:
  206. for(size_t i=0;i<N;i++){
  207. trg_coord2[i*COORD_DIM+0]= trg_coord1[i*COORD_DIM+0];
  208. trg_coord2[i*COORD_DIM+1]= trg_coord1[i*COORD_DIM+1];
  209. trg_coord2[i*COORD_DIM+2]= trg_coord1[i*COORD_DIM+2];
  210. }
  211. }
  212. Matrix<long long> M11, M22;
  213. {
  214. Matrix<T> M1(N,ker_dim[0]*ker_dim[1]); M1.SetZero();
  215. Matrix<T> M2(N,ker_dim[0]*ker_dim[1]); M2.SetZero();
  216. for(size_t i=0;i<N;i++){
  217. BuildMatrix(&src_coord [ 0], 1,
  218. &trg_coord1[i*COORD_DIM], 1, &(M1[i][0]));
  219. BuildMatrix(&src_coord [ 0], 1,
  220. &trg_coord2[i*COORD_DIM], 1, &(M2[i][0]));
  221. }
  222. Matrix<T> dot11(ker_dim[0]*ker_dim[1],ker_dim[0]*ker_dim[1]);dot11.SetZero();
  223. Matrix<T> dot12(ker_dim[0]*ker_dim[1],ker_dim[0]*ker_dim[1]);dot12.SetZero();
  224. Matrix<T> dot22(ker_dim[0]*ker_dim[1],ker_dim[0]*ker_dim[1]);dot22.SetZero();
  225. std::vector<T> norm1(ker_dim[0]*ker_dim[1]);
  226. std::vector<T> norm2(ker_dim[0]*ker_dim[1]);
  227. {
  228. for(size_t k=0;k<N;k++)
  229. for(size_t i=0;i<ker_dim[0]*ker_dim[1];i++)
  230. for(size_t j=0;j<ker_dim[0]*ker_dim[1];j++){
  231. dot11[i][j]+=M1[k][i]*M1[k][j];
  232. dot12[i][j]+=M1[k][i]*M2[k][j];
  233. dot22[i][j]+=M2[k][i]*M2[k][j];
  234. }
  235. for(size_t i=0;i<ker_dim[0]*ker_dim[1];i++){
  236. norm1[i]=sqrt(dot11[i][i]);
  237. norm2[i]=sqrt(dot22[i][i]);
  238. }
  239. for(size_t i=0;i<ker_dim[0]*ker_dim[1];i++)
  240. for(size_t j=0;j<ker_dim[0]*ker_dim[1];j++){
  241. dot11[i][j]/=(norm1[i]*norm1[j]);
  242. dot12[i][j]/=(norm1[i]*norm2[j]);
  243. dot22[i][j]/=(norm2[i]*norm2[j]);
  244. }
  245. }
  246. long long flag=1;
  247. M11.Resize(ker_dim[0],ker_dim[1]); M11.SetZero();
  248. M22.Resize(ker_dim[0],ker_dim[1]); M22.SetZero();
  249. for(size_t i=0;i<ker_dim[0]*ker_dim[1];i++){
  250. if(norm1[i]>eps_ && M11[0][i]==0){
  251. for(size_t j=0;j<ker_dim[0]*ker_dim[1];j++){
  252. if(fabs(norm1[i]-norm1[j])<eps_ && fabs(fabs(dot11[i][j])-1.0)<eps_){
  253. M11[0][j]=(dot11[i][j]>0?flag:-flag);
  254. }
  255. if(fabs(norm1[i]-norm2[j])<eps_ && fabs(fabs(dot12[i][j])-1.0)<eps_){
  256. M22[0][j]=(dot12[i][j]>0?flag:-flag);
  257. }
  258. }
  259. flag++;
  260. }
  261. }
  262. }
  263. Matrix<long long> P1, P2;
  264. { // P1
  265. Matrix<long long>& P=P1;
  266. Matrix<long long> M1=M11;
  267. Matrix<long long> M2=M22;
  268. for(size_t i=0;i<M1.Dim(0);i++){
  269. for(size_t j=0;j<M1.Dim(1);j++){
  270. if(M1[i][j]<0) M1[i][j]=-M1[i][j];
  271. if(M2[i][j]<0) M2[i][j]=-M2[i][j];
  272. }
  273. std::sort(&M1[i][0],&M1[i][M1.Dim(1)]);
  274. std::sort(&M2[i][0],&M2[i][M2.Dim(1)]);
  275. }
  276. P.Resize(M1.Dim(0),M1.Dim(0));
  277. for(size_t i=0;i<M1.Dim(0);i++)
  278. for(size_t j=0;j<M1.Dim(0);j++){
  279. P[i][j]=1;
  280. for(size_t k=0;k<M1.Dim(1);k++)
  281. if(M1[i][k]!=M2[j][k]){
  282. P[i][j]=0;
  283. break;
  284. }
  285. }
  286. }
  287. { // P2
  288. Matrix<long long>& P=P2;
  289. Matrix<long long> M1=M11.Transpose();
  290. Matrix<long long> M2=M22.Transpose();
  291. for(size_t i=0;i<M1.Dim(0);i++){
  292. for(size_t j=0;j<M1.Dim(1);j++){
  293. if(M1[i][j]<0) M1[i][j]=-M1[i][j];
  294. if(M2[i][j]<0) M2[i][j]=-M2[i][j];
  295. }
  296. std::sort(&M1[i][0],&M1[i][M1.Dim(1)]);
  297. std::sort(&M2[i][0],&M2[i][M2.Dim(1)]);
  298. }
  299. P.Resize(M1.Dim(0),M1.Dim(0));
  300. for(size_t i=0;i<M1.Dim(0);i++)
  301. for(size_t j=0;j<M1.Dim(0);j++){
  302. P[i][j]=1;
  303. for(size_t k=0;k<M1.Dim(1);k++)
  304. if(M1[i][k]!=M2[j][k]){
  305. P[i][j]=0;
  306. break;
  307. }
  308. }
  309. }
  310. std::vector<Permutation<long long> > P1vec, P2vec;
  311. { // P1vec
  312. Matrix<long long>& Pmat=P1;
  313. std::vector<Permutation<long long> >& Pvec=P1vec;
  314. Permutation<long long> P(Pmat.Dim(0));
  315. Vector<PERM_INT_T>& perm=P.perm;
  316. perm.SetZero();
  317. // First permutation
  318. for(size_t i=0;i<P.Dim();i++)
  319. for(size_t j=0;j<P.Dim();j++){
  320. if(Pmat[i][j]){
  321. perm[i]=j;
  322. break;
  323. }
  324. }
  325. Vector<PERM_INT_T> perm_tmp;
  326. while(true){ // Next permutation
  327. perm_tmp=perm;
  328. std::sort(&perm_tmp[0],&perm_tmp[0]+perm_tmp.Dim());
  329. for(size_t i=0;i<perm_tmp.Dim();i++){
  330. if(perm_tmp[i]!=i) break;
  331. if(i==perm_tmp.Dim()-1){
  332. Pvec.push_back(P);
  333. }
  334. }
  335. bool last=false;
  336. for(size_t i=0;i<P.Dim();i++){
  337. PERM_INT_T tmp=perm[i];
  338. for(size_t j=perm[i]+1;j<P.Dim();j++){
  339. if(Pmat[i][j]){
  340. perm[i]=j;
  341. break;
  342. }
  343. }
  344. if(perm[i]>tmp) break;
  345. for(size_t j=0;j<P.Dim();j++){
  346. if(Pmat[i][j]){
  347. perm[i]=j;
  348. break;
  349. }
  350. }
  351. if(i==P.Dim()-1) last=true;
  352. }
  353. if(last) break;
  354. }
  355. }
  356. { // P2vec
  357. Matrix<long long>& Pmat=P2;
  358. std::vector<Permutation<long long> >& Pvec=P2vec;
  359. Permutation<long long> P(Pmat.Dim(0));
  360. Vector<PERM_INT_T>& perm=P.perm;
  361. perm.SetZero();
  362. // First permutation
  363. for(size_t i=0;i<P.Dim();i++)
  364. for(size_t j=0;j<P.Dim();j++){
  365. if(Pmat[i][j]){
  366. perm[i]=j;
  367. break;
  368. }
  369. }
  370. Vector<PERM_INT_T> perm_tmp;
  371. while(true){ // Next permutation
  372. perm_tmp=perm;
  373. std::sort(&perm_tmp[0],&perm_tmp[0]+perm_tmp.Dim());
  374. for(size_t i=0;i<perm_tmp.Dim();i++){
  375. if(perm_tmp[i]!=i) break;
  376. if(i==perm_tmp.Dim()-1){
  377. Pvec.push_back(P);
  378. }
  379. }
  380. bool last=false;
  381. for(size_t i=0;i<P.Dim();i++){
  382. PERM_INT_T tmp=perm[i];
  383. for(size_t j=perm[i]+1;j<P.Dim();j++){
  384. if(Pmat[i][j]){
  385. perm[i]=j;
  386. break;
  387. }
  388. }
  389. if(perm[i]>tmp) break;
  390. for(size_t j=0;j<P.Dim();j++){
  391. if(Pmat[i][j]){
  392. perm[i]=j;
  393. break;
  394. }
  395. }
  396. if(i==P.Dim()-1) last=true;
  397. }
  398. if(last) break;
  399. }
  400. }
  401. { // Find pairs which acutally work (neglect scaling)
  402. std::vector<Permutation<long long> > P1vec_, P2vec_;
  403. Matrix<long long> M1=M11;
  404. Matrix<long long> M2=M22;
  405. for(size_t i=0;i<M1.Dim(0);i++){
  406. for(size_t j=0;j<M1.Dim(1);j++){
  407. if(M1[i][j]<0) M1[i][j]=-M1[i][j];
  408. if(M2[i][j]<0) M2[i][j]=-M2[i][j];
  409. }
  410. }
  411. Matrix<long long> M;
  412. for(size_t i=0;i<P1vec.size();i++)
  413. for(size_t j=0;j<P2vec.size();j++){
  414. M=P1vec[i]*M2*P2vec[j];
  415. for(size_t k=0;k<M.Dim(0)*M.Dim(1);k++){
  416. if(M[0][k]!=M1[0][k]) break;
  417. if(k==M.Dim(0)*M.Dim(1)-1){
  418. P1vec_.push_back(P1vec[i]);
  419. P2vec_.push_back(P2vec[j]);
  420. }
  421. }
  422. }
  423. P1vec=P1vec_;
  424. P2vec=P2vec_;
  425. }
  426. Permutation<T> P1_, P2_;
  427. { // Find pairs which acutally work
  428. for(size_t k=0;k<P1vec.size();k++){
  429. Permutation<long long> P1=P1vec[k];
  430. Permutation<long long> P2=P2vec[k];
  431. Matrix<long long> M1= M11 ;
  432. Matrix<long long> M2=P1*M22*P2;
  433. Matrix<T> M(M1.Dim(0)*M1.Dim(1)+1,M1.Dim(0)+M1.Dim(1));
  434. M.SetZero(); M[M1.Dim(0)*M1.Dim(1)][0]=1.0;
  435. for(size_t i=0;i<M1.Dim(0);i++)
  436. for(size_t j=0;j<M1.Dim(1);j++){
  437. size_t k=i*M1.Dim(1)+j;
  438. M[k][ i]= M1[i][j];
  439. M[k][M1.Dim(0)+j]=-M2[i][j];
  440. }
  441. M=M.pinv();
  442. { // Construct new permutation
  443. Permutation<long long> P1_(M1.Dim(0));
  444. Permutation<long long> P2_(M1.Dim(1));
  445. for(size_t i=0;i<M1.Dim(0);i++){
  446. P1_.scal[i]=(M[i][M1.Dim(0)*M1.Dim(1)]>0?1:-1);
  447. }
  448. for(size_t i=0;i<M1.Dim(1);i++){
  449. P2_.scal[i]=(M[M1.Dim(0)+i][M1.Dim(0)*M1.Dim(1)]>0?1:-1);
  450. }
  451. P1=P1_*P1 ;
  452. P2=P2 *P2_;
  453. }
  454. bool done=true;
  455. Matrix<long long> Merr=P1*M22*P2-M11;
  456. for(size_t i=0;i<Merr.Dim(0)*Merr.Dim(1);i++){
  457. if(Merr[0][i]){
  458. done=false;
  459. break;
  460. }
  461. }
  462. if(done){
  463. P1_=Permutation<T>(P1.Dim());
  464. P2_=Permutation<T>(P2.Dim());
  465. for(size_t i=0;i<P1.Dim();i++){
  466. P1_.perm[i]=P1.perm[i];
  467. P1_.scal[i]=P1.scal[i];
  468. }
  469. for(size_t i=0;i<P2.Dim();i++){
  470. P2_.perm[i]=P2.perm[i];
  471. P2_.scal[i]=P2.scal[i];
  472. }
  473. break;
  474. }
  475. }
  476. }
  477. //std::cout<<P1_<<'\n';
  478. //std::cout<<P2_<<'\n';
  479. perm_vec[p_type ]=P1_.Transpose();
  480. perm_vec[p_type+C_Perm]=P2_;
  481. }
  482. for(size_t i=0;i<2*C_Perm;i++){
  483. if(perm_vec[i].Dim()==0){
  484. perm_vec.Resize(0);
  485. std::cout<<"no-symmetry for: "<<ker_name<<'\n';
  486. break;
  487. }
  488. }
  489. }
  490. if(verbose){ // Display kernel information
  491. std::cout<<"\n";
  492. std::cout<<"Kernel Name : "<<ker_name<<'\n';
  493. std::cout<<"Precision : "<<(double)eps<<'\n';
  494. std::cout<<"Symmetry : "<<(perm_vec.Dim()>0?"yes":"no")<<'\n';
  495. std::cout<<"Scale Invariant: "<<(scale_invar?"yes":"no")<<'\n';
  496. if(scale_invar && ker_dim[0]*ker_dim[1]>0){
  497. std::cout<<"Scaling Matrix :\n";
  498. Matrix<T> Src(ker_dim[0],1);
  499. Matrix<T> Trg(1,ker_dim[1]);
  500. for(size_t i=0;i<ker_dim[0];i++) Src[i][0]=pow(2.0,src_scal[i]);
  501. for(size_t i=0;i<ker_dim[1];i++) Trg[0][i]=pow(2.0,trg_scal[i]);
  502. std::cout<<Src*Trg;
  503. }
  504. if(ker_dim[0]*ker_dim[1]>0){ // Accuracy of multipole expansion
  505. std::cout<<"Error : ";
  506. for(T rad=1.0; rad>1.0e-2; rad*=0.5){
  507. int m=8; // multipole order
  508. std::vector<T> equiv_surf;
  509. std::vector<T> check_surf;
  510. for(int i0=0;i0<m;i0++){
  511. for(int i1=0;i1<m;i1++){
  512. for(int i2=0;i2<m;i2++){
  513. if(i0== 0 || i1== 0 || i2== 0 ||
  514. i0==m-1 || i1==m-1 || i2==m-1){
  515. // Range: [-1/3,1/3]^3
  516. T x=((T)2*i0-(m-1))/(m-1)/3;
  517. T y=((T)2*i1-(m-1))/(m-1)/3;
  518. T z=((T)2*i2-(m-1))/(m-1)/3;
  519. equiv_surf.push_back(x*RAD0*rad);
  520. equiv_surf.push_back(y*RAD0*rad);
  521. equiv_surf.push_back(z*RAD0*rad);
  522. check_surf.push_back(x*RAD1*rad);
  523. check_surf.push_back(y*RAD1*rad);
  524. check_surf.push_back(z*RAD1*rad);
  525. }
  526. }
  527. }
  528. }
  529. size_t n_equiv=equiv_surf.size()/COORD_DIM;
  530. size_t n_check=equiv_surf.size()/COORD_DIM;
  531. size_t n_src=m;
  532. size_t n_trg=m;
  533. std::vector<T> src_coord;
  534. std::vector<T> trg_coord;
  535. for(size_t i=0;i<n_src*COORD_DIM;i++){
  536. src_coord.push_back((2*drand48()-1)/3*rad);
  537. }
  538. for(size_t i=0;i<n_trg;i++){
  539. T x,y,z,r;
  540. do{
  541. x=(drand48()-0.5);
  542. y=(drand48()-0.5);
  543. z=(drand48()-0.5);
  544. r=sqrt(x*x+y*y+z*z);
  545. }while(r==0.0);
  546. trg_coord.push_back(x/r*sqrt((T)COORD_DIM)*rad);
  547. trg_coord.push_back(y/r*sqrt((T)COORD_DIM)*rad);
  548. trg_coord.push_back(z/r*sqrt((T)COORD_DIM)*rad);
  549. }
  550. Matrix<T> M_s2c(n_src*ker_dim[0],n_check*ker_dim[1]);
  551. BuildMatrix( &src_coord[0], n_src,
  552. &check_surf[0], n_check, &(M_s2c[0][0]));
  553. Matrix<T> M_e2c(n_equiv*ker_dim[0],n_check*ker_dim[1]);
  554. BuildMatrix(&equiv_surf[0], n_equiv,
  555. &check_surf[0], n_check, &(M_e2c[0][0]));
  556. Matrix<T> M_c2e0, M_c2e1;
  557. {
  558. Matrix<T> U,S,V;
  559. M_e2c.SVD(U,S,V);
  560. T eps=1, max_S=0;
  561. while(eps*(T)0.5+(T)1.0>1.0) eps*=0.5;
  562. for(size_t i=0;i<std::min(S.Dim(0),S.Dim(1));i++){
  563. if(fabs(S[i][i])>max_S) max_S=fabs(S[i][i]);
  564. }
  565. for(size_t i=0;i<S.Dim(0);i++) S[i][i]=(S[i][i]>eps*max_S*4?1.0/S[i][i]:0.0);
  566. M_c2e0=V.Transpose()*S;
  567. M_c2e1=U.Transpose();
  568. }
  569. Matrix<T> M_e2t(n_equiv*ker_dim[0],n_trg*ker_dim[1]);
  570. BuildMatrix(&equiv_surf[0], n_equiv,
  571. &trg_coord[0], n_trg , &(M_e2t[0][0]));
  572. Matrix<T> M_s2t(n_src*ker_dim[0],n_trg*ker_dim[1]);
  573. BuildMatrix( &src_coord[0], n_src,
  574. &trg_coord[0], n_trg , &(M_s2t[0][0]));
  575. Matrix<T> M=(M_s2c*M_c2e0)*(M_c2e1*M_e2t)-M_s2t;
  576. T max_error=0, max_value=0;
  577. for(size_t i=0;i<M.Dim(0);i++)
  578. for(size_t j=0;j<M.Dim(1);j++){
  579. max_error=std::max<T>(max_error,fabs(M [i][j]));
  580. max_value=std::max<T>(max_value,fabs(M_s2t[i][j]));
  581. }
  582. std::cout<<(double)(max_error/max_value)<<' ';
  583. if(scale_invar) break;
  584. }
  585. std::cout<<"\n";
  586. }
  587. std::cout<<"\n";
  588. }
  589. { // Initialize auxiliary FMM kernels
  590. if(!k_s2m) k_s2m=this;
  591. if(!k_s2l) k_s2l=this;
  592. if(!k_s2t) k_s2t=this;
  593. if(!k_m2m) k_m2m=this;
  594. if(!k_m2l) k_m2l=this;
  595. if(!k_m2t) k_m2t=this;
  596. if(!k_l2l) k_l2l=this;
  597. if(!k_l2t) k_l2t=this;
  598. assert(k_s2t->ker_dim[0]==ker_dim[0]);
  599. assert(k_s2m->ker_dim[0]==k_s2l->ker_dim[0]);
  600. assert(k_s2m->ker_dim[0]==k_s2t->ker_dim[0]);
  601. assert(k_m2m->ker_dim[0]==k_m2l->ker_dim[0]);
  602. assert(k_m2m->ker_dim[0]==k_m2t->ker_dim[0]);
  603. assert(k_l2l->ker_dim[0]==k_l2t->ker_dim[0]);
  604. assert(k_s2t->ker_dim[1]==ker_dim[1]);
  605. assert(k_s2m->ker_dim[1]==k_m2m->ker_dim[1]);
  606. assert(k_s2l->ker_dim[1]==k_l2l->ker_dim[1]);
  607. assert(k_m2l->ker_dim[1]==k_l2l->ker_dim[1]);
  608. assert(k_s2t->ker_dim[1]==k_m2t->ker_dim[1]);
  609. assert(k_s2t->ker_dim[1]==k_l2t->ker_dim[1]);
  610. k_s2m->Initialize(verbose);
  611. k_s2l->Initialize(verbose);
  612. k_s2t->Initialize(verbose);
  613. k_m2m->Initialize(verbose);
  614. k_m2l->Initialize(verbose);
  615. k_m2t->Initialize(verbose);
  616. k_l2l->Initialize(verbose);
  617. k_l2t->Initialize(verbose);
  618. }
  619. }
  620. /**
  621. * \brief Compute the transformation matrix (on the source strength vector)
  622. * to get potential at target coordinates due to sources at the given
  623. * coordinates.
  624. * \param[in] r_src Coordinates of source points.
  625. * \param[in] src_cnt Number of source points.
  626. * \param[in] r_trg Coordinates of target points.
  627. * \param[in] trg_cnt Number of target points.
  628. * \param[out] k_out Output array with potential values.
  629. */
  630. template <class T>
  631. void Kernel<T>::BuildMatrix(T* r_src, int src_cnt,
  632. T* r_trg, int trg_cnt, T* k_out) const{
  633. int dim=3; //Only supporting 3D
  634. memset(k_out, 0, src_cnt*ker_dim[0]*trg_cnt*ker_dim[1]*sizeof(T));
  635. for(int i=0;i<src_cnt;i++) //TODO Optimize this.
  636. for(int j=0;j<ker_dim[0];j++){
  637. std::vector<T> v_src(ker_dim[0],0);
  638. v_src[j]=1.0;
  639. ker_poten(&r_src[i*dim], 1, &v_src[0], 1, r_trg, trg_cnt,
  640. &k_out[(i*ker_dim[0]+j)*trg_cnt*ker_dim[1]], NULL);
  641. }
  642. }
  643. /**
  644. * \brief Generic kernel which rearranges data for vectorization, calls the
  645. * actual uKernel and copies data to the output array in the original order.
  646. */
  647. template <class Real_t, int SRC_DIM, int TRG_DIM, void (*uKernel)(Matrix<Real_t>&, Matrix<Real_t>&, Matrix<Real_t>&, Matrix<Real_t>&)>
  648. void generic_kernel(Real_t* r_src, int src_cnt, Real_t* v_src, int dof, Real_t* r_trg, int trg_cnt, Real_t* v_trg, mem::MemoryManager* mem_mgr){
  649. assert(dof==1);
  650. int VecLen=8;
  651. if(sizeof(Real_t)==sizeof( float)) VecLen=8;
  652. if(sizeof(Real_t)==sizeof(double)) VecLen=4;
  653. #define STACK_BUFF_SIZE 4096
  654. Real_t stack_buff[STACK_BUFF_SIZE+MEM_ALIGN];
  655. Real_t* buff=NULL;
  656. Matrix<Real_t> src_coord;
  657. Matrix<Real_t> src_value;
  658. Matrix<Real_t> trg_coord;
  659. Matrix<Real_t> trg_value;
  660. { // Rearrange data in src_coord, src_coord, trg_coord, trg_value
  661. size_t src_cnt_, trg_cnt_; // counts after zero padding
  662. src_cnt_=((src_cnt+VecLen-1)/VecLen)*VecLen;
  663. trg_cnt_=((trg_cnt+VecLen-1)/VecLen)*VecLen;
  664. size_t buff_size=src_cnt_*(COORD_DIM+SRC_DIM)+
  665. trg_cnt_*(COORD_DIM+TRG_DIM);
  666. if(buff_size>STACK_BUFF_SIZE){ // Allocate buff
  667. buff=mem::aligned_new<Real_t>(buff_size, mem_mgr);
  668. }
  669. Real_t* buff_ptr=buff;
  670. if(!buff_ptr){ // use stack_buff
  671. uintptr_t ptr=(uintptr_t)stack_buff;
  672. static uintptr_t ALIGN_MINUS_ONE=MEM_ALIGN-1;
  673. static uintptr_t NOT_ALIGN_MINUS_ONE=~ALIGN_MINUS_ONE;
  674. ptr=((ptr+ALIGN_MINUS_ONE) & NOT_ALIGN_MINUS_ONE);
  675. buff_ptr=(Real_t*)ptr;
  676. }
  677. src_coord.ReInit(COORD_DIM, src_cnt_,buff_ptr,false); buff_ptr+=COORD_DIM*src_cnt_;
  678. src_value.ReInit( SRC_DIM, src_cnt_,buff_ptr,false); buff_ptr+= SRC_DIM*src_cnt_;
  679. trg_coord.ReInit(COORD_DIM, trg_cnt_,buff_ptr,false); buff_ptr+=COORD_DIM*trg_cnt_;
  680. trg_value.ReInit( TRG_DIM, trg_cnt_,buff_ptr,false);//buff_ptr+= TRG_DIM*trg_cnt_;
  681. { // Set src_coord
  682. size_t i=0;
  683. for( ;i<src_cnt ;i++){
  684. for(size_t j=0;j<COORD_DIM;j++){
  685. src_coord[j][i]=r_src[i*COORD_DIM+j];
  686. }
  687. }
  688. for( ;i<src_cnt_;i++){
  689. for(size_t j=0;j<COORD_DIM;j++){
  690. src_coord[j][i]=0;
  691. }
  692. }
  693. }
  694. { // Set src_value
  695. size_t i=0;
  696. for( ;i<src_cnt ;i++){
  697. for(size_t j=0;j<SRC_DIM;j++){
  698. src_value[j][i]=v_src[i*SRC_DIM+j];
  699. }
  700. }
  701. for( ;i<src_cnt_;i++){
  702. for(size_t j=0;j<SRC_DIM;j++){
  703. src_value[j][i]=0;
  704. }
  705. }
  706. }
  707. { // Set trg_coord
  708. size_t i=0;
  709. for( ;i<trg_cnt ;i++){
  710. for(size_t j=0;j<COORD_DIM;j++){
  711. trg_coord[j][i]=r_trg[i*COORD_DIM+j];
  712. }
  713. }
  714. for( ;i<trg_cnt_;i++){
  715. for(size_t j=0;j<COORD_DIM;j++){
  716. trg_coord[j][i]=0;
  717. }
  718. }
  719. }
  720. { // Set trg_value
  721. size_t i=0;
  722. for( ;i<trg_cnt_;i++){
  723. for(size_t j=0;j<TRG_DIM;j++){
  724. trg_value[j][i]=0;
  725. }
  726. }
  727. }
  728. }
  729. uKernel(src_coord,src_value,trg_coord,trg_value);
  730. { // Set v_trg
  731. for(size_t i=0;i<trg_cnt ;i++){
  732. for(size_t j=0;j<TRG_DIM;j++){
  733. v_trg[i*TRG_DIM+j]+=trg_value[j][i];
  734. }
  735. }
  736. }
  737. if(buff){ // Free memory: buff
  738. mem::aligned_delete<Real_t>(buff);
  739. }
  740. }
  741. ////////////////////////////////////////////////////////////////////////////////
  742. //////// LAPLACE KERNEL ////////
  743. ////////////////////////////////////////////////////////////////////////////////
  744. /**
  745. * \brief Green's function for the Poisson's equation. Kernel tensor
  746. * dimension = 1x1.
  747. */
  748. template <class Real_t, class Vec_t=Real_t, Vec_t (*RINV_INTRIN)(Vec_t)=rinv_intrin0<Vec_t> >
  749. void laplace_poten_uKernel(Matrix<Real_t>& src_coord, Matrix<Real_t>& src_value, Matrix<Real_t>& trg_coord, Matrix<Real_t>& trg_value){
  750. #define SRC_BLK 1000
  751. size_t VecLen=sizeof(Vec_t)/sizeof(Real_t);
  752. //// Number of newton iterations
  753. size_t NWTN_ITER=0;
  754. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin0<Vec_t,Real_t>) NWTN_ITER=0;
  755. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin1<Vec_t,Real_t>) NWTN_ITER=1;
  756. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin2<Vec_t,Real_t>) NWTN_ITER=2;
  757. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin3<Vec_t,Real_t>) NWTN_ITER=3;
  758. Real_t nwtn_scal=1; // scaling factor for newton iterations
  759. for(int i=0;i<NWTN_ITER;i++){
  760. nwtn_scal=2*nwtn_scal*nwtn_scal*nwtn_scal;
  761. }
  762. const Real_t OOFP = 1.0/(4*nwtn_scal*const_pi<Real_t>());
  763. size_t src_cnt_=src_coord.Dim(1);
  764. size_t trg_cnt_=trg_coord.Dim(1);
  765. for(size_t sblk=0;sblk<src_cnt_;sblk+=SRC_BLK){
  766. size_t src_cnt=src_cnt_-sblk;
  767. if(src_cnt>SRC_BLK) src_cnt=SRC_BLK;
  768. for(size_t t=0;t<trg_cnt_;t+=VecLen){
  769. Vec_t tx=load_intrin<Vec_t>(&trg_coord[0][t]);
  770. Vec_t ty=load_intrin<Vec_t>(&trg_coord[1][t]);
  771. Vec_t tz=load_intrin<Vec_t>(&trg_coord[2][t]);
  772. Vec_t tv=zero_intrin<Vec_t>();
  773. for(size_t s=sblk;s<sblk+src_cnt;s++){
  774. Vec_t dx=sub_intrin(tx,bcast_intrin<Vec_t>(&src_coord[0][s]));
  775. Vec_t dy=sub_intrin(ty,bcast_intrin<Vec_t>(&src_coord[1][s]));
  776. Vec_t dz=sub_intrin(tz,bcast_intrin<Vec_t>(&src_coord[2][s]));
  777. Vec_t sv= bcast_intrin<Vec_t>(&src_value[0][s]) ;
  778. Vec_t r2= mul_intrin(dx,dx) ;
  779. r2=add_intrin(r2,mul_intrin(dy,dy));
  780. r2=add_intrin(r2,mul_intrin(dz,dz));
  781. Vec_t rinv=RINV_INTRIN(r2);
  782. tv=add_intrin(tv,mul_intrin(rinv,sv));
  783. }
  784. Vec_t oofp=set_intrin<Vec_t,Real_t>(OOFP);
  785. tv=add_intrin(mul_intrin(tv,oofp),load_intrin<Vec_t>(&trg_value[0][t]));
  786. store_intrin(&trg_value[0][t],tv);
  787. }
  788. }
  789. { // Add FLOPS
  790. #ifndef __MIC__
  791. Profile::Add_FLOP((long long)trg_cnt_*(long long)src_cnt_*(12+4*(NWTN_ITER)));
  792. #endif
  793. }
  794. #undef SRC_BLK
  795. }
  796. template <class T, int newton_iter>
  797. void laplace_poten(T* r_src, int src_cnt, T* v_src, int dof, T* r_trg, int trg_cnt, T* v_trg, mem::MemoryManager* mem_mgr){
  798. #define LAP_KER_NWTN(nwtn) if(newton_iter==nwtn) \
  799. generic_kernel<Real_t, 1, 1, laplace_poten_uKernel<Real_t,Vec_t, rinv_intrin##nwtn<Vec_t,Real_t> > > \
  800. ((Real_t*)r_src, src_cnt, (Real_t*)v_src, dof, (Real_t*)r_trg, trg_cnt, (Real_t*)v_trg, mem_mgr)
  801. #define LAPLACE_KERNEL LAP_KER_NWTN(0); LAP_KER_NWTN(1); LAP_KER_NWTN(2); LAP_KER_NWTN(3);
  802. if(mem::TypeTraits<T>::ID()==mem::TypeTraits<float>::ID()){
  803. typedef float Real_t;
  804. #if defined __MIC__
  805. #define Vec_t Real_t
  806. #elif defined __AVX__
  807. #define Vec_t __m256
  808. #elif defined __SSE3__
  809. #define Vec_t __m128
  810. #else
  811. #define Vec_t Real_t
  812. #endif
  813. LAPLACE_KERNEL;
  814. #undef Vec_t
  815. }else if(mem::TypeTraits<T>::ID()==mem::TypeTraits<double>::ID()){
  816. typedef double Real_t;
  817. #if defined __MIC__
  818. #define Vec_t Real_t
  819. #elif defined __AVX__
  820. #define Vec_t __m256d
  821. #elif defined __SSE3__
  822. #define Vec_t __m128d
  823. #else
  824. #define Vec_t Real_t
  825. #endif
  826. LAPLACE_KERNEL;
  827. #undef Vec_t
  828. }else{
  829. typedef T Real_t;
  830. #define Vec_t Real_t
  831. LAPLACE_KERNEL;
  832. #undef Vec_t
  833. }
  834. #undef LAP_KER_NWTN
  835. #undef LAPLACE_KERNEL
  836. }
  837. // Laplace double layer potential.
  838. template <class Real_t, class Vec_t=Real_t, Vec_t (*RINV_INTRIN)(Vec_t)=rinv_intrin0<Vec_t> >
  839. void laplace_dbl_uKernel(Matrix<Real_t>& src_coord, Matrix<Real_t>& src_value, Matrix<Real_t>& trg_coord, Matrix<Real_t>& trg_value){
  840. #define SRC_BLK 500
  841. size_t VecLen=sizeof(Vec_t)/sizeof(Real_t);
  842. //// Number of newton iterations
  843. size_t NWTN_ITER=0;
  844. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin0<Vec_t,Real_t>) NWTN_ITER=0;
  845. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin1<Vec_t,Real_t>) NWTN_ITER=1;
  846. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin2<Vec_t,Real_t>) NWTN_ITER=2;
  847. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin3<Vec_t,Real_t>) NWTN_ITER=3;
  848. Real_t nwtn_scal=1; // scaling factor for newton iterations
  849. for(int i=0;i<NWTN_ITER;i++){
  850. nwtn_scal=2*nwtn_scal*nwtn_scal*nwtn_scal;
  851. }
  852. const Real_t OOFP = -1.0/(4*nwtn_scal*nwtn_scal*nwtn_scal*const_pi<Real_t>());
  853. size_t src_cnt_=src_coord.Dim(1);
  854. size_t trg_cnt_=trg_coord.Dim(1);
  855. for(size_t sblk=0;sblk<src_cnt_;sblk+=SRC_BLK){
  856. size_t src_cnt=src_cnt_-sblk;
  857. if(src_cnt>SRC_BLK) src_cnt=SRC_BLK;
  858. for(size_t t=0;t<trg_cnt_;t+=VecLen){
  859. Vec_t tx=load_intrin<Vec_t>(&trg_coord[0][t]);
  860. Vec_t ty=load_intrin<Vec_t>(&trg_coord[1][t]);
  861. Vec_t tz=load_intrin<Vec_t>(&trg_coord[2][t]);
  862. Vec_t tv=zero_intrin<Vec_t>();
  863. for(size_t s=sblk;s<sblk+src_cnt;s++){
  864. Vec_t dx=sub_intrin(tx,bcast_intrin<Vec_t>(&src_coord[0][s]));
  865. Vec_t dy=sub_intrin(ty,bcast_intrin<Vec_t>(&src_coord[1][s]));
  866. Vec_t dz=sub_intrin(tz,bcast_intrin<Vec_t>(&src_coord[2][s]));
  867. Vec_t sn0= bcast_intrin<Vec_t>(&src_value[0][s]) ;
  868. Vec_t sn1= bcast_intrin<Vec_t>(&src_value[1][s]) ;
  869. Vec_t sn2= bcast_intrin<Vec_t>(&src_value[2][s]) ;
  870. Vec_t sv= bcast_intrin<Vec_t>(&src_value[3][s]) ;
  871. Vec_t r2= mul_intrin(dx,dx) ;
  872. r2=add_intrin(r2,mul_intrin(dy,dy));
  873. r2=add_intrin(r2,mul_intrin(dz,dz));
  874. Vec_t rinv=RINV_INTRIN(r2);
  875. Vec_t r3inv=mul_intrin(mul_intrin(rinv,rinv),rinv);
  876. Vec_t rdotn= mul_intrin(sn0,dx);
  877. rdotn=add_intrin(rdotn, mul_intrin(sn1,dy));
  878. rdotn=add_intrin(rdotn, mul_intrin(sn2,dz));
  879. sv=mul_intrin(sv,rdotn);
  880. tv=add_intrin(tv,mul_intrin(r3inv,sv));
  881. }
  882. Vec_t oofp=set_intrin<Vec_t,Real_t>(OOFP);
  883. tv=add_intrin(mul_intrin(tv,oofp),load_intrin<Vec_t>(&trg_value[0][t]));
  884. store_intrin(&trg_value[0][t],tv);
  885. }
  886. }
  887. { // Add FLOPS
  888. #ifndef __MIC__
  889. Profile::Add_FLOP((long long)trg_cnt_*(long long)src_cnt_*(20+4*(NWTN_ITER)));
  890. #endif
  891. }
  892. #undef SRC_BLK
  893. }
  894. template <class T, int newton_iter>
  895. void laplace_dbl_poten(T* r_src, int src_cnt, T* v_src, int dof, T* r_trg, int trg_cnt, T* v_trg, mem::MemoryManager* mem_mgr){
  896. #define LAP_KER_NWTN(nwtn) if(newton_iter==nwtn) \
  897. generic_kernel<Real_t, 4, 1, laplace_dbl_uKernel<Real_t,Vec_t, rinv_intrin##nwtn<Vec_t,Real_t> > > \
  898. ((Real_t*)r_src, src_cnt, (Real_t*)v_src, dof, (Real_t*)r_trg, trg_cnt, (Real_t*)v_trg, mem_mgr)
  899. #define LAPLACE_KERNEL LAP_KER_NWTN(0); LAP_KER_NWTN(1); LAP_KER_NWTN(2); LAP_KER_NWTN(3);
  900. if(mem::TypeTraits<T>::ID()==mem::TypeTraits<float>::ID()){
  901. typedef float Real_t;
  902. #if defined __MIC__
  903. #define Vec_t Real_t
  904. #elif defined __AVX__
  905. #define Vec_t __m256
  906. #elif defined __SSE3__
  907. #define Vec_t __m128
  908. #else
  909. #define Vec_t Real_t
  910. #endif
  911. LAPLACE_KERNEL;
  912. #undef Vec_t
  913. }else if(mem::TypeTraits<T>::ID()==mem::TypeTraits<double>::ID()){
  914. typedef double Real_t;
  915. #if defined __MIC__
  916. #define Vec_t Real_t
  917. #elif defined __AVX__
  918. #define Vec_t __m256d
  919. #elif defined __SSE3__
  920. #define Vec_t __m128d
  921. #else
  922. #define Vec_t Real_t
  923. #endif
  924. LAPLACE_KERNEL;
  925. #undef Vec_t
  926. }else{
  927. typedef T Real_t;
  928. #define Vec_t Real_t
  929. LAPLACE_KERNEL;
  930. #undef Vec_t
  931. }
  932. #undef LAP_KER_NWTN
  933. #undef LAPLACE_KERNEL
  934. }
  935. // Laplace grdient kernel.
  936. template <class Real_t, class Vec_t=Real_t, Vec_t (*RINV_INTRIN)(Vec_t)=rinv_intrin0<Vec_t> >
  937. void laplace_grad_uKernel(Matrix<Real_t>& src_coord, Matrix<Real_t>& src_value, Matrix<Real_t>& trg_coord, Matrix<Real_t>& trg_value){
  938. #define SRC_BLK 500
  939. size_t VecLen=sizeof(Vec_t)/sizeof(Real_t);
  940. //// Number of newton iterations
  941. size_t NWTN_ITER=0;
  942. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin0<Vec_t,Real_t>) NWTN_ITER=0;
  943. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin1<Vec_t,Real_t>) NWTN_ITER=1;
  944. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin2<Vec_t,Real_t>) NWTN_ITER=2;
  945. if(RINV_INTRIN==(Vec_t (*)(Vec_t))rinv_intrin3<Vec_t,Real_t>) NWTN_ITER=3;
  946. Real_t nwtn_scal=1; // scaling factor for newton iterations
  947. for(int i=0;i<NWTN_ITER;i++){
  948. nwtn_scal=2*nwtn_scal*nwtn_scal*nwtn_scal;
  949. }
  950. const Real_t OOFP = -1.0/(4*nwtn_scal*nwtn_scal*nwtn_scal*const_pi<Real_t>());
  951. size_t src_cnt_=src_coord.Dim(1);
  952. size_t trg_cnt_=trg_coord.Dim(1);
  953. for(size_t sblk=0;sblk<src_cnt_;sblk+=SRC_BLK){
  954. size_t src_cnt=src_cnt_-sblk;
  955. if(src_cnt>SRC_BLK) src_cnt=SRC_BLK;
  956. for(size_t t=0;t<trg_cnt_;t+=VecLen){
  957. Vec_t tx=load_intrin<Vec_t>(&trg_coord[0][t]);
  958. Vec_t ty=load_intrin<Vec_t>(&trg_coord[1][t]);
  959. Vec_t tz=load_intrin<Vec_t>(&trg_coord[2][t]);
  960. Vec_t tv0=zero_intrin<Vec_t>();
  961. Vec_t tv1=zero_intrin<Vec_t>();
  962. Vec_t tv2=zero_intrin<Vec_t>();
  963. for(size_t s=sblk;s<sblk+src_cnt;s++){
  964. Vec_t dx=sub_intrin(tx,bcast_intrin<Vec_t>(&src_coord[0][s]));
  965. Vec_t dy=sub_intrin(ty,bcast_intrin<Vec_t>(&src_coord[1][s]));
  966. Vec_t dz=sub_intrin(tz,bcast_intrin<Vec_t>(&src_coord[2][s]));
  967. Vec_t sv= bcast_intrin<Vec_t>(&src_value[0][s]) ;
  968. Vec_t r2= mul_intrin(dx,dx) ;
  969. r2=add_intrin(r2,mul_intrin(dy,dy));
  970. r2=add_intrin(r2,mul_intrin(dz,dz));
  971. Vec_t rinv=RINV_INTRIN(r2);
  972. Vec_t r3inv=mul_intrin(mul_intrin(rinv,rinv),rinv);
  973. sv=mul_intrin(sv,r3inv);
  974. tv0=add_intrin(tv0,mul_intrin(sv,dx));
  975. tv1=add_intrin(tv1,mul_intrin(sv,dy));
  976. tv2=add_intrin(tv2,mul_intrin(sv,dz));
  977. }
  978. Vec_t oofp=set_intrin<Vec_t,Real_t>(OOFP);
  979. tv0=add_intrin(mul_intrin(tv0,oofp),load_intrin<Vec_t>(&trg_value[0][t]));
  980. tv1=add_intrin(mul_intrin(tv1,oofp),load_intrin<Vec_t>(&trg_value[1][t]));
  981. tv2=add_intrin(mul_intrin(tv2,oofp),load_intrin<Vec_t>(&trg_value[2][t]));
  982. store_intrin(&trg_value[0][t],tv0);
  983. store_intrin(&trg_value[1][t],tv1);
  984. store_intrin(&trg_value[2][t],tv2);
  985. }
  986. }
  987. { // Add FLOPS
  988. #ifndef __MIC__
  989. Profile::Add_FLOP((long long)trg_cnt_*(long long)src_cnt_*(19+4*(NWTN_ITER)));
  990. #endif
  991. }
  992. #undef SRC_BLK
  993. }
  994. template <class T, int newton_iter>
  995. void laplace_grad(T* r_src, int src_cnt, T* v_src, int dof, T* r_trg, int trg_cnt, T* v_trg, mem::MemoryManager* mem_mgr){
  996. #define LAP_KER_NWTN(nwtn) if(newton_iter==nwtn) \
  997. generic_kernel<Real_t, 1, 3, laplace_grad_uKernel<Real_t,Vec_t, rinv_intrin##nwtn<Vec_t,Real_t> > > \
  998. ((Real_t*)r_src, src_cnt, (Real_t*)v_src, dof, (Real_t*)r_trg, trg_cnt, (Real_t*)v_trg, mem_mgr)
  999. #define LAPLACE_KERNEL LAP_KER_NWTN(0); LAP_KER_NWTN(1); LAP_KER_NWTN(2); LAP_KER_NWTN(3);
  1000. if(mem::TypeTraits<T>::ID()==mem::TypeTraits<float>::ID()){
  1001. typedef float Real_t;
  1002. #if defined __MIC__
  1003. #define Vec_t Real_t
  1004. #elif defined __AVX__
  1005. #define Vec_t __m256
  1006. #elif defined __SSE3__
  1007. #define Vec_t __m128
  1008. #else
  1009. #define Vec_t Real_t
  1010. #endif
  1011. LAPLACE_KERNEL;
  1012. #undef Vec_t
  1013. }else if(mem::TypeTraits<T>::ID()==mem::TypeTraits<double>::ID()){
  1014. typedef double Real_t;
  1015. #if defined __MIC__
  1016. #define Vec_t Real_t
  1017. #elif defined __AVX__
  1018. #define Vec_t __m256d
  1019. #elif defined __SSE3__
  1020. #define Vec_t __m128d
  1021. #else
  1022. #define Vec_t Real_t
  1023. #endif
  1024. LAPLACE_KERNEL;
  1025. #undef Vec_t
  1026. }else{
  1027. typedef T Real_t;
  1028. #define Vec_t Real_t
  1029. LAPLACE_KERNEL;
  1030. #undef Vec_t
  1031. }
  1032. #undef LAP_KER_NWTN
  1033. #undef LAPLACE_KERNEL
  1034. }
  1035. ////////////////////////////////////////////////////////////////////////////////
  1036. //////// STOKES KERNEL ////////
  1037. ////////////////////////////////////////////////////////////////////////////////
  1038. /**
  1039. * \brief Green's function for the Stokes's equation. Kernel tensor
  1040. * dimension = 3x3.
  1041. */
  1042. template <class T>
  1043. void stokes_vel(T* r_src, int src_cnt, T* v_src_, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1044. #ifndef __MIC__
  1045. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(28*dof));
  1046. #endif
  1047. const T mu=1.0;
  1048. const T OOEPMU = 1.0/(8.0*const_pi<T>()*mu);
  1049. for(int t=0;t<trg_cnt;t++){
  1050. for(int i=0;i<dof;i++){
  1051. T p[3]={0,0,0};
  1052. for(int s=0;s<src_cnt;s++){
  1053. T dR[3]={r_trg[3*t ]-r_src[3*s ],
  1054. r_trg[3*t+1]-r_src[3*s+1],
  1055. r_trg[3*t+2]-r_src[3*s+2]};
  1056. T R = (dR[0]*dR[0]+dR[1]*dR[1]+dR[2]*dR[2]);
  1057. if (R!=0){
  1058. T invR2=1.0/R;
  1059. T invR=sqrt(invR2);
  1060. T v_src[3]={v_src_[(s*dof+i)*3 ],
  1061. v_src_[(s*dof+i)*3+1],
  1062. v_src_[(s*dof+i)*3+2]};
  1063. T inner_prod=(v_src[0]*dR[0] +
  1064. v_src[1]*dR[1] +
  1065. v_src[2]*dR[2])* invR2;
  1066. p[0] += (v_src[0] + dR[0]*inner_prod)*invR;
  1067. p[1] += (v_src[1] + dR[1]*inner_prod)*invR;
  1068. p[2] += (v_src[2] + dR[2]*inner_prod)*invR;
  1069. }
  1070. }
  1071. k_out[(t*dof+i)*3+0] += p[0]*OOEPMU;
  1072. k_out[(t*dof+i)*3+1] += p[1]*OOEPMU;
  1073. k_out[(t*dof+i)*3+2] += p[2]*OOEPMU;
  1074. }
  1075. }
  1076. }
  1077. template <class T>
  1078. void stokes_sym_dip(T* r_src, int src_cnt, T* v_src, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1079. #ifndef __MIC__
  1080. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(47*dof));
  1081. #endif
  1082. const T mu=1.0;
  1083. const T OOEPMU = -1.0/(8.0*const_pi<T>()*mu);
  1084. for(int t=0;t<trg_cnt;t++){
  1085. for(int i=0;i<dof;i++){
  1086. T p[3]={0,0,0};
  1087. for(int s=0;s<src_cnt;s++){
  1088. T dR[3]={r_trg[3*t ]-r_src[3*s ],
  1089. r_trg[3*t+1]-r_src[3*s+1],
  1090. r_trg[3*t+2]-r_src[3*s+2]};
  1091. T R = (dR[0]*dR[0]+dR[1]*dR[1]+dR[2]*dR[2]);
  1092. if (R!=0){
  1093. T invR2=1.0/R;
  1094. T invR=sqrt(invR2);
  1095. T invR3=invR2*invR;
  1096. T* f=&v_src[(s*dof+i)*6+0];
  1097. T* n=&v_src[(s*dof+i)*6+3];
  1098. T r_dot_n=(n[0]*dR[0]+n[1]*dR[1]+n[2]*dR[2]);
  1099. T r_dot_f=(f[0]*dR[0]+f[1]*dR[1]+f[2]*dR[2]);
  1100. T n_dot_f=(f[0]* n[0]+f[1]* n[1]+f[2]* n[2]);
  1101. p[0] += dR[0]*(n_dot_f - 3*r_dot_n*r_dot_f*invR2)*invR3;
  1102. p[1] += dR[1]*(n_dot_f - 3*r_dot_n*r_dot_f*invR2)*invR3;
  1103. p[2] += dR[2]*(n_dot_f - 3*r_dot_n*r_dot_f*invR2)*invR3;
  1104. }
  1105. }
  1106. k_out[(t*dof+i)*3+0] += p[0]*OOEPMU;
  1107. k_out[(t*dof+i)*3+1] += p[1]*OOEPMU;
  1108. k_out[(t*dof+i)*3+2] += p[2]*OOEPMU;
  1109. }
  1110. }
  1111. }
  1112. template <class T>
  1113. void stokes_press(T* r_src, int src_cnt, T* v_src_, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1114. #ifndef __MIC__
  1115. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(17*dof));
  1116. #endif
  1117. const T OOFP = 1.0/(4.0*const_pi<T>());
  1118. for(int t=0;t<trg_cnt;t++){
  1119. for(int i=0;i<dof;i++){
  1120. T p=0;
  1121. for(int s=0;s<src_cnt;s++){
  1122. T dR[3]={r_trg[3*t ]-r_src[3*s ],
  1123. r_trg[3*t+1]-r_src[3*s+1],
  1124. r_trg[3*t+2]-r_src[3*s+2]};
  1125. T R = (dR[0]*dR[0]+dR[1]*dR[1]+dR[2]*dR[2]);
  1126. if (R!=0){
  1127. T invR2=1.0/R;
  1128. T invR=sqrt(invR2);
  1129. T invR3=invR2*invR;
  1130. T v_src[3]={v_src_[(s*dof+i)*3 ],
  1131. v_src_[(s*dof+i)*3+1],
  1132. v_src_[(s*dof+i)*3+2]};
  1133. T inner_prod=(v_src[0]*dR[0] +
  1134. v_src[1]*dR[1] +
  1135. v_src[2]*dR[2])* invR3;
  1136. p += inner_prod;
  1137. }
  1138. }
  1139. k_out[t*dof+i] += p*OOFP;
  1140. }
  1141. }
  1142. }
  1143. template <class T>
  1144. void stokes_stress(T* r_src, int src_cnt, T* v_src_, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1145. #ifndef __MIC__
  1146. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(45*dof));
  1147. #endif
  1148. const T TOFP = -3.0/(4.0*const_pi<T>());
  1149. for(int t=0;t<trg_cnt;t++){
  1150. for(int i=0;i<dof;i++){
  1151. T p[9]={0,0,0,
  1152. 0,0,0,
  1153. 0,0,0};
  1154. for(int s=0;s<src_cnt;s++){
  1155. T dR[3]={r_trg[3*t ]-r_src[3*s ],
  1156. r_trg[3*t+1]-r_src[3*s+1],
  1157. r_trg[3*t+2]-r_src[3*s+2]};
  1158. T R = (dR[0]*dR[0]+dR[1]*dR[1]+dR[2]*dR[2]);
  1159. if (R!=0){
  1160. T invR2=1.0/R;
  1161. T invR=sqrt(invR2);
  1162. T invR3=invR2*invR;
  1163. T invR5=invR3*invR2;
  1164. T v_src[3]={v_src_[(s*dof+i)*3 ],
  1165. v_src_[(s*dof+i)*3+1],
  1166. v_src_[(s*dof+i)*3+2]};
  1167. T inner_prod=(v_src[0]*dR[0] +
  1168. v_src[1]*dR[1] +
  1169. v_src[2]*dR[2])* invR5;
  1170. p[0] += inner_prod*dR[0]*dR[0]; p[1] += inner_prod*dR[1]*dR[0]; p[2] += inner_prod*dR[2]*dR[0];
  1171. p[3] += inner_prod*dR[0]*dR[1]; p[4] += inner_prod*dR[1]*dR[1]; p[5] += inner_prod*dR[2]*dR[1];
  1172. p[6] += inner_prod*dR[0]*dR[2]; p[7] += inner_prod*dR[1]*dR[2]; p[8] += inner_prod*dR[2]*dR[2];
  1173. }
  1174. }
  1175. k_out[(t*dof+i)*9+0] += p[0]*TOFP;
  1176. k_out[(t*dof+i)*9+1] += p[1]*TOFP;
  1177. k_out[(t*dof+i)*9+2] += p[2]*TOFP;
  1178. k_out[(t*dof+i)*9+3] += p[3]*TOFP;
  1179. k_out[(t*dof+i)*9+4] += p[4]*TOFP;
  1180. k_out[(t*dof+i)*9+5] += p[5]*TOFP;
  1181. k_out[(t*dof+i)*9+6] += p[6]*TOFP;
  1182. k_out[(t*dof+i)*9+7] += p[7]*TOFP;
  1183. k_out[(t*dof+i)*9+8] += p[8]*TOFP;
  1184. }
  1185. }
  1186. }
  1187. template <class T>
  1188. void stokes_grad(T* r_src, int src_cnt, T* v_src_, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1189. #ifndef __MIC__
  1190. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(89*dof));
  1191. #endif
  1192. const T mu=1.0;
  1193. const T OOEPMU = 1.0/(8.0*const_pi<T>()*mu);
  1194. for(int t=0;t<trg_cnt;t++){
  1195. for(int i=0;i<dof;i++){
  1196. T p[9]={0,0,0,
  1197. 0,0,0,
  1198. 0,0,0};
  1199. for(int s=0;s<src_cnt;s++){
  1200. T dR[3]={r_trg[3*t ]-r_src[3*s ],
  1201. r_trg[3*t+1]-r_src[3*s+1],
  1202. r_trg[3*t+2]-r_src[3*s+2]};
  1203. T R = (dR[0]*dR[0]+dR[1]*dR[1]+dR[2]*dR[2]);
  1204. if (R!=0){
  1205. T invR2=1.0/R;
  1206. T invR=sqrt(invR2);
  1207. T invR3=invR2*invR;
  1208. T v_src[3]={v_src_[(s*dof+i)*3 ],
  1209. v_src_[(s*dof+i)*3+1],
  1210. v_src_[(s*dof+i)*3+2]};
  1211. T inner_prod=(v_src[0]*dR[0] +
  1212. v_src[1]*dR[1] +
  1213. v_src[2]*dR[2]);
  1214. p[0] += ( inner_prod*(1-3*dR[0]*dR[0]*invR2))*invR3; //6
  1215. p[1] += (dR[1]*v_src[0]-v_src[1]*dR[0]+inner_prod*( -3*dR[1]*dR[0]*invR2))*invR3; //9
  1216. p[2] += (dR[2]*v_src[0]-v_src[2]*dR[0]+inner_prod*( -3*dR[2]*dR[0]*invR2))*invR3;
  1217. p[3] += (dR[0]*v_src[1]-v_src[0]*dR[1]+inner_prod*( -3*dR[0]*dR[1]*invR2))*invR3;
  1218. p[4] += ( inner_prod*(1-3*dR[1]*dR[1]*invR2))*invR3;
  1219. p[5] += (dR[2]*v_src[1]-v_src[2]*dR[1]+inner_prod*( -3*dR[2]*dR[1]*invR2))*invR3;
  1220. p[6] += (dR[0]*v_src[2]-v_src[0]*dR[2]+inner_prod*( -3*dR[0]*dR[2]*invR2))*invR3;
  1221. p[7] += (dR[1]*v_src[2]-v_src[1]*dR[2]+inner_prod*( -3*dR[1]*dR[2]*invR2))*invR3;
  1222. p[8] += ( inner_prod*(1-3*dR[2]*dR[2]*invR2))*invR3;
  1223. }
  1224. }
  1225. k_out[(t*dof+i)*9+0] += p[0]*OOEPMU;
  1226. k_out[(t*dof+i)*9+1] += p[1]*OOEPMU;
  1227. k_out[(t*dof+i)*9+2] += p[2]*OOEPMU;
  1228. k_out[(t*dof+i)*9+3] += p[3]*OOEPMU;
  1229. k_out[(t*dof+i)*9+4] += p[4]*OOEPMU;
  1230. k_out[(t*dof+i)*9+5] += p[5]*OOEPMU;
  1231. k_out[(t*dof+i)*9+6] += p[6]*OOEPMU;
  1232. k_out[(t*dof+i)*9+7] += p[7]*OOEPMU;
  1233. k_out[(t*dof+i)*9+8] += p[8]*OOEPMU;
  1234. }
  1235. }
  1236. }
  1237. #ifndef __MIC__
  1238. #ifdef USE_SSE
  1239. namespace
  1240. {
  1241. #define IDEAL_ALIGNMENT 16
  1242. #define SIMD_LEN (int)(IDEAL_ALIGNMENT / sizeof(double))
  1243. #define DECL_SIMD_ALIGNED __declspec(align(IDEAL_ALIGNMENT))
  1244. void stokesDirectVecSSE(
  1245. const int ns,
  1246. const int nt,
  1247. const double *sx,
  1248. const double *sy,
  1249. const double *sz,
  1250. const double *tx,
  1251. const double *ty,
  1252. const double *tz,
  1253. const double *srcDen,
  1254. double *trgVal,
  1255. const double cof )
  1256. {
  1257. if ( size_t(sx)%IDEAL_ALIGNMENT || size_t(sy)%IDEAL_ALIGNMENT || size_t(sz)%IDEAL_ALIGNMENT )
  1258. abort();
  1259. double mu = cof;
  1260. double OOEP = 1.0/(8.0*const_pi<double>());
  1261. __m128d tempx;
  1262. __m128d tempy;
  1263. __m128d tempz;
  1264. double oomeu = 1/mu;
  1265. double aux_arr[3*SIMD_LEN+1];
  1266. double *tempvalx;
  1267. double *tempvaly;
  1268. double *tempvalz;
  1269. if (size_t(aux_arr)%IDEAL_ALIGNMENT) // if aux_arr is misaligned
  1270. {
  1271. tempvalx = aux_arr + 1;
  1272. if (size_t(tempvalx)%IDEAL_ALIGNMENT)
  1273. abort();
  1274. }
  1275. else
  1276. tempvalx = aux_arr;
  1277. tempvaly=tempvalx+SIMD_LEN;
  1278. tempvalz=tempvaly+SIMD_LEN;
  1279. /*! One over eight pi */
  1280. __m128d ooep = _mm_set1_pd (OOEP);
  1281. __m128d half = _mm_set1_pd (0.5);
  1282. __m128d opf = _mm_set1_pd (1.5);
  1283. __m128d zero = _mm_setzero_pd ();
  1284. __m128d oomu = _mm_set1_pd (1/mu);
  1285. // loop over sources
  1286. int i = 0;
  1287. for (; i < nt; i++) {
  1288. tempx = _mm_setzero_pd();
  1289. tempy = _mm_setzero_pd();
  1290. tempz = _mm_setzero_pd();
  1291. __m128d txi = _mm_load1_pd (&tx[i]);
  1292. __m128d tyi = _mm_load1_pd (&ty[i]);
  1293. __m128d tzi = _mm_load1_pd (&tz[i]);
  1294. int j = 0;
  1295. // Load and calculate in groups of SIMD_LEN
  1296. for (; j + SIMD_LEN <= ns; j+=SIMD_LEN) {
  1297. __m128d sxj = _mm_load_pd (&sx[j]);
  1298. __m128d syj = _mm_load_pd (&sy[j]);
  1299. __m128d szj = _mm_load_pd (&sz[j]);
  1300. __m128d sdenx = _mm_set_pd (srcDen[(j+1)*3], srcDen[j*3]);
  1301. __m128d sdeny = _mm_set_pd (srcDen[(j+1)*3+1], srcDen[j*3+1]);
  1302. __m128d sdenz = _mm_set_pd (srcDen[(j+1)*3+2], srcDen[j*3+2]);
  1303. __m128d dX, dY, dZ;
  1304. __m128d dR2;
  1305. __m128d S;
  1306. dX = _mm_sub_pd(txi , sxj);
  1307. dY = _mm_sub_pd(tyi , syj);
  1308. dZ = _mm_sub_pd(tzi , szj);
  1309. sxj = _mm_mul_pd(dX, dX);
  1310. syj = _mm_mul_pd(dY, dY);
  1311. szj = _mm_mul_pd(dZ, dZ);
  1312. dR2 = _mm_add_pd(sxj, syj);
  1313. dR2 = _mm_add_pd(szj, dR2);
  1314. __m128d temp = _mm_cmpeq_pd (dR2, zero);
  1315. __m128d xhalf = _mm_mul_pd (half, dR2);
  1316. __m128 dR2_s = _mm_cvtpd_ps(dR2);
  1317. __m128 S_s = _mm_rsqrt_ps(dR2_s);
  1318. __m128d S_d = _mm_cvtps_pd(S_s);
  1319. // To handle the condition when src and trg coincide
  1320. S_d = _mm_andnot_pd (temp, S_d);
  1321. S = _mm_mul_pd (S_d, S_d);
  1322. S = _mm_mul_pd (S, xhalf);
  1323. S = _mm_sub_pd (opf, S);
  1324. S = _mm_mul_pd (S, S_d);
  1325. __m128d dotx = _mm_mul_pd (dX, sdenx);
  1326. __m128d doty = _mm_mul_pd (dY, sdeny);
  1327. __m128d dotz = _mm_mul_pd (dZ, sdenz);
  1328. __m128d dot_sum = _mm_add_pd (dotx, doty);
  1329. dot_sum = _mm_add_pd (dot_sum, dotz);
  1330. dot_sum = _mm_mul_pd (dot_sum, S);
  1331. dot_sum = _mm_mul_pd (dot_sum, S);
  1332. dotx = _mm_mul_pd (dot_sum, dX);
  1333. doty = _mm_mul_pd (dot_sum, dY);
  1334. dotz = _mm_mul_pd (dot_sum, dZ);
  1335. sdenx = _mm_add_pd (sdenx, dotx);
  1336. sdeny = _mm_add_pd (sdeny, doty);
  1337. sdenz = _mm_add_pd (sdenz, dotz);
  1338. sdenx = _mm_mul_pd (sdenx, S);
  1339. sdeny = _mm_mul_pd (sdeny, S);
  1340. sdenz = _mm_mul_pd (sdenz, S);
  1341. tempx = _mm_add_pd (sdenx, tempx);
  1342. tempy = _mm_add_pd (sdeny, tempy);
  1343. tempz = _mm_add_pd (sdenz, tempz);
  1344. }
  1345. tempx = _mm_mul_pd (tempx, ooep);
  1346. tempy = _mm_mul_pd (tempy, ooep);
  1347. tempz = _mm_mul_pd (tempz, ooep);
  1348. tempx = _mm_mul_pd (tempx, oomu);
  1349. tempy = _mm_mul_pd (tempy, oomu);
  1350. tempz = _mm_mul_pd (tempz, oomu);
  1351. _mm_store_pd(tempvalx, tempx);
  1352. _mm_store_pd(tempvaly, tempy);
  1353. _mm_store_pd(tempvalz, tempz);
  1354. for (int k = 0; k < SIMD_LEN; k++) {
  1355. trgVal[i*3] += tempvalx[k];
  1356. trgVal[i*3+1] += tempvaly[k];
  1357. trgVal[i*3+2] += tempvalz[k];
  1358. }
  1359. for (; j < ns; j++) {
  1360. double x = tx[i] - sx[j];
  1361. double y = ty[i] - sy[j];
  1362. double z = tz[i] - sz[j];
  1363. double r2 = x*x + y*y + z*z;
  1364. double r = sqrt(r2);
  1365. double invdr;
  1366. if (r == 0)
  1367. invdr = 0;
  1368. else
  1369. invdr = 1/r;
  1370. double dot = (x*srcDen[j*3] + y*srcDen[j*3+1] + z*srcDen[j*3+2]) * invdr * invdr;
  1371. double denx = srcDen[j*3] + dot*x;
  1372. double deny = srcDen[j*3+1] + dot*y;
  1373. double denz = srcDen[j*3+2] + dot*z;
  1374. trgVal[i*3] += denx*invdr*OOEP*oomeu;
  1375. trgVal[i*3+1] += deny*invdr*OOEP*oomeu;
  1376. trgVal[i*3+2] += denz*invdr*OOEP*oomeu;
  1377. }
  1378. }
  1379. return;
  1380. }
  1381. void stokesPressureSSE(
  1382. const int ns,
  1383. const int nt,
  1384. const double *sx,
  1385. const double *sy,
  1386. const double *sz,
  1387. const double *tx,
  1388. const double *ty,
  1389. const double *tz,
  1390. const double *srcDen,
  1391. double *trgVal)
  1392. {
  1393. if ( size_t(sx)%IDEAL_ALIGNMENT || size_t(sy)%IDEAL_ALIGNMENT || size_t(sz)%IDEAL_ALIGNMENT )
  1394. abort();
  1395. double OOFP = 1.0/(4.0*const_pi<double>());
  1396. __m128d temp_press;
  1397. double aux_arr[SIMD_LEN+1];
  1398. double *tempval_press;
  1399. if (size_t(aux_arr)%IDEAL_ALIGNMENT) // if aux_arr is misaligned
  1400. {
  1401. tempval_press = aux_arr + 1;
  1402. if (size_t(tempval_press)%IDEAL_ALIGNMENT)
  1403. abort();
  1404. }
  1405. else
  1406. tempval_press = aux_arr;
  1407. /*! One over eight pi */
  1408. __m128d oofp = _mm_set1_pd (OOFP);
  1409. __m128d half = _mm_set1_pd (0.5);
  1410. __m128d opf = _mm_set1_pd (1.5);
  1411. __m128d zero = _mm_setzero_pd ();
  1412. // loop over sources
  1413. int i = 0;
  1414. for (; i < nt; i++) {
  1415. temp_press = _mm_setzero_pd();
  1416. __m128d txi = _mm_load1_pd (&tx[i]);
  1417. __m128d tyi = _mm_load1_pd (&ty[i]);
  1418. __m128d tzi = _mm_load1_pd (&tz[i]);
  1419. int j = 0;
  1420. // Load and calculate in groups of SIMD_LEN
  1421. for (; j + SIMD_LEN <= ns; j+=SIMD_LEN) {
  1422. __m128d sxj = _mm_load_pd (&sx[j]);
  1423. __m128d syj = _mm_load_pd (&sy[j]);
  1424. __m128d szj = _mm_load_pd (&sz[j]);
  1425. __m128d sdenx = _mm_set_pd (srcDen[(j+1)*3], srcDen[j*3]);
  1426. __m128d sdeny = _mm_set_pd (srcDen[(j+1)*3+1], srcDen[j*3+1]);
  1427. __m128d sdenz = _mm_set_pd (srcDen[(j+1)*3+2], srcDen[j*3+2]);
  1428. __m128d dX, dY, dZ;
  1429. __m128d dR2;
  1430. __m128d S;
  1431. dX = _mm_sub_pd(txi , sxj);
  1432. dY = _mm_sub_pd(tyi , syj);
  1433. dZ = _mm_sub_pd(tzi , szj);
  1434. sxj = _mm_mul_pd(dX, dX);
  1435. syj = _mm_mul_pd(dY, dY);
  1436. szj = _mm_mul_pd(dZ, dZ);
  1437. dR2 = _mm_add_pd(sxj, syj);
  1438. dR2 = _mm_add_pd(szj, dR2);
  1439. __m128d temp = _mm_cmpeq_pd (dR2, zero);
  1440. __m128d xhalf = _mm_mul_pd (half, dR2);
  1441. __m128 dR2_s = _mm_cvtpd_ps(dR2);
  1442. __m128 S_s = _mm_rsqrt_ps(dR2_s);
  1443. __m128d S_d = _mm_cvtps_pd(S_s);
  1444. // To handle the condition when src and trg coincide
  1445. S_d = _mm_andnot_pd (temp, S_d);
  1446. S = _mm_mul_pd (S_d, S_d);
  1447. S = _mm_mul_pd (S, xhalf);
  1448. S = _mm_sub_pd (opf, S);
  1449. S = _mm_mul_pd (S, S_d);
  1450. __m128d dotx = _mm_mul_pd (dX, sdenx);
  1451. __m128d doty = _mm_mul_pd (dY, sdeny);
  1452. __m128d dotz = _mm_mul_pd (dZ, sdenz);
  1453. __m128d dot_sum = _mm_add_pd (dotx, doty);
  1454. dot_sum = _mm_add_pd (dot_sum, dotz);
  1455. dot_sum = _mm_mul_pd (dot_sum, S);
  1456. dot_sum = _mm_mul_pd (dot_sum, S);
  1457. dot_sum = _mm_mul_pd (dot_sum, S);
  1458. temp_press = _mm_add_pd (dot_sum, temp_press);
  1459. }
  1460. temp_press = _mm_mul_pd (temp_press, oofp);
  1461. _mm_store_pd(tempval_press, temp_press);
  1462. for (int k = 0; k < SIMD_LEN; k++) {
  1463. trgVal[i] += tempval_press[k];
  1464. }
  1465. for (; j < ns; j++) {
  1466. double x = tx[i] - sx[j];
  1467. double y = ty[i] - sy[j];
  1468. double z = tz[i] - sz[j];
  1469. double r2 = x*x + y*y + z*z;
  1470. double r = sqrt(r2);
  1471. double invdr;
  1472. if (r == 0)
  1473. invdr = 0;
  1474. else
  1475. invdr = 1/r;
  1476. double dot = (x*srcDen[j*3] + y*srcDen[j*3+1] + z*srcDen[j*3+2]) * invdr * invdr * invdr;
  1477. trgVal[i] += dot*OOFP;
  1478. }
  1479. }
  1480. return;
  1481. }
  1482. void stokesStressSSE(
  1483. const int ns,
  1484. const int nt,
  1485. const double *sx,
  1486. const double *sy,
  1487. const double *sz,
  1488. const double *tx,
  1489. const double *ty,
  1490. const double *tz,
  1491. const double *srcDen,
  1492. double *trgVal)
  1493. {
  1494. if ( size_t(sx)%IDEAL_ALIGNMENT || size_t(sy)%IDEAL_ALIGNMENT || size_t(sz)%IDEAL_ALIGNMENT )
  1495. abort();
  1496. double TOFP = -3.0/(4.0*const_pi<double>());
  1497. __m128d tempxx; __m128d tempxy; __m128d tempxz;
  1498. __m128d tempyx; __m128d tempyy; __m128d tempyz;
  1499. __m128d tempzx; __m128d tempzy; __m128d tempzz;
  1500. double aux_arr[9*SIMD_LEN+1];
  1501. double *tempvalxx, *tempvalxy, *tempvalxz;
  1502. double *tempvalyx, *tempvalyy, *tempvalyz;
  1503. double *tempvalzx, *tempvalzy, *tempvalzz;
  1504. if (size_t(aux_arr)%IDEAL_ALIGNMENT) // if aux_arr is misaligned
  1505. {
  1506. tempvalxx = aux_arr + 1;
  1507. if (size_t(tempvalxx)%IDEAL_ALIGNMENT)
  1508. abort();
  1509. }
  1510. else
  1511. tempvalxx = aux_arr;
  1512. tempvalxy=tempvalxx+SIMD_LEN;
  1513. tempvalxz=tempvalxy+SIMD_LEN;
  1514. tempvalyx=tempvalxz+SIMD_LEN;
  1515. tempvalyy=tempvalyx+SIMD_LEN;
  1516. tempvalyz=tempvalyy+SIMD_LEN;
  1517. tempvalzx=tempvalyz+SIMD_LEN;
  1518. tempvalzy=tempvalzx+SIMD_LEN;
  1519. tempvalzz=tempvalzy+SIMD_LEN;
  1520. /*! One over eight pi */
  1521. __m128d tofp = _mm_set1_pd (TOFP);
  1522. __m128d half = _mm_set1_pd (0.5);
  1523. __m128d opf = _mm_set1_pd (1.5);
  1524. __m128d zero = _mm_setzero_pd ();
  1525. // loop over sources
  1526. int i = 0;
  1527. for (; i < nt; i++) {
  1528. tempxx = _mm_setzero_pd(); tempxy = _mm_setzero_pd(); tempxz = _mm_setzero_pd();
  1529. tempyx = _mm_setzero_pd(); tempyy = _mm_setzero_pd(); tempyz = _mm_setzero_pd();
  1530. tempzx = _mm_setzero_pd(); tempzy = _mm_setzero_pd(); tempzz = _mm_setzero_pd();
  1531. __m128d txi = _mm_load1_pd (&tx[i]);
  1532. __m128d tyi = _mm_load1_pd (&ty[i]);
  1533. __m128d tzi = _mm_load1_pd (&tz[i]);
  1534. int j = 0;
  1535. // Load and calculate in groups of SIMD_LEN
  1536. for (; j + SIMD_LEN <= ns; j+=SIMD_LEN) {
  1537. __m128d sxj = _mm_load_pd (&sx[j]);
  1538. __m128d syj = _mm_load_pd (&sy[j]);
  1539. __m128d szj = _mm_load_pd (&sz[j]);
  1540. __m128d sdenx = _mm_set_pd (srcDen[(j+1)*3], srcDen[j*3]);
  1541. __m128d sdeny = _mm_set_pd (srcDen[(j+1)*3+1], srcDen[j*3+1]);
  1542. __m128d sdenz = _mm_set_pd (srcDen[(j+1)*3+2], srcDen[j*3+2]);
  1543. __m128d dX, dY, dZ;
  1544. __m128d dR2;
  1545. __m128d S;
  1546. __m128d S2;
  1547. dX = _mm_sub_pd(txi , sxj);
  1548. dY = _mm_sub_pd(tyi , syj);
  1549. dZ = _mm_sub_pd(tzi , szj);
  1550. sxj = _mm_mul_pd(dX, dX);
  1551. syj = _mm_mul_pd(dY, dY);
  1552. szj = _mm_mul_pd(dZ, dZ);
  1553. dR2 = _mm_add_pd(sxj, syj);
  1554. dR2 = _mm_add_pd(szj, dR2);
  1555. __m128d temp = _mm_cmpeq_pd (dR2, zero);
  1556. __m128d xhalf = _mm_mul_pd (half, dR2);
  1557. __m128 dR2_s = _mm_cvtpd_ps(dR2);
  1558. __m128 S_s = _mm_rsqrt_ps(dR2_s);
  1559. __m128d S_d = _mm_cvtps_pd(S_s);
  1560. // To handle the condition when src and trg coincide
  1561. S_d = _mm_andnot_pd (temp, S_d);
  1562. S = _mm_mul_pd (S_d, S_d);
  1563. S = _mm_mul_pd (S, xhalf);
  1564. S = _mm_sub_pd (opf, S);
  1565. S = _mm_mul_pd (S, S_d);
  1566. S2 = _mm_mul_pd (S, S);
  1567. __m128d dotx = _mm_mul_pd (dX, sdenx);
  1568. __m128d doty = _mm_mul_pd (dY, sdeny);
  1569. __m128d dotz = _mm_mul_pd (dZ, sdenz);
  1570. __m128d dot_sum = _mm_add_pd (dotx, doty);
  1571. dot_sum = _mm_add_pd (dot_sum, dotz);
  1572. dot_sum = _mm_mul_pd (dot_sum, S);
  1573. dot_sum = _mm_mul_pd (dot_sum, S2);
  1574. dot_sum = _mm_mul_pd (dot_sum, S2);
  1575. dotx = _mm_mul_pd (dot_sum, dX);
  1576. doty = _mm_mul_pd (dot_sum, dY);
  1577. dotz = _mm_mul_pd (dot_sum, dZ);
  1578. tempxx = _mm_add_pd (_mm_mul_pd(dotx,dX), tempxx);
  1579. tempxy = _mm_add_pd (_mm_mul_pd(dotx,dY), tempxy);
  1580. tempxz = _mm_add_pd (_mm_mul_pd(dotx,dZ), tempxz);
  1581. tempyx = _mm_add_pd (_mm_mul_pd(doty,dX), tempyx);
  1582. tempyy = _mm_add_pd (_mm_mul_pd(doty,dY), tempyy);
  1583. tempyz = _mm_add_pd (_mm_mul_pd(doty,dZ), tempyz);
  1584. tempzx = _mm_add_pd (_mm_mul_pd(dotz,dX), tempzx);
  1585. tempzy = _mm_add_pd (_mm_mul_pd(dotz,dY), tempzy);
  1586. tempzz = _mm_add_pd (_mm_mul_pd(dotz,dZ), tempzz);
  1587. }
  1588. tempxx = _mm_mul_pd (tempxx, tofp);
  1589. tempxy = _mm_mul_pd (tempxy, tofp);
  1590. tempxz = _mm_mul_pd (tempxz, tofp);
  1591. tempyx = _mm_mul_pd (tempyx, tofp);
  1592. tempyy = _mm_mul_pd (tempyy, tofp);
  1593. tempyz = _mm_mul_pd (tempyz, tofp);
  1594. tempzx = _mm_mul_pd (tempzx, tofp);
  1595. tempzy = _mm_mul_pd (tempzy, tofp);
  1596. tempzz = _mm_mul_pd (tempzz, tofp);
  1597. _mm_store_pd(tempvalxx, tempxx); _mm_store_pd(tempvalxy, tempxy); _mm_store_pd(tempvalxz, tempxz);
  1598. _mm_store_pd(tempvalyx, tempyx); _mm_store_pd(tempvalyy, tempyy); _mm_store_pd(tempvalyz, tempyz);
  1599. _mm_store_pd(tempvalzx, tempzx); _mm_store_pd(tempvalzy, tempzy); _mm_store_pd(tempvalzz, tempzz);
  1600. for (int k = 0; k < SIMD_LEN; k++) {
  1601. trgVal[i*9 ] += tempvalxx[k];
  1602. trgVal[i*9+1] += tempvalxy[k];
  1603. trgVal[i*9+2] += tempvalxz[k];
  1604. trgVal[i*9+3] += tempvalyx[k];
  1605. trgVal[i*9+4] += tempvalyy[k];
  1606. trgVal[i*9+5] += tempvalyz[k];
  1607. trgVal[i*9+6] += tempvalzx[k];
  1608. trgVal[i*9+7] += tempvalzy[k];
  1609. trgVal[i*9+8] += tempvalzz[k];
  1610. }
  1611. for (; j < ns; j++) {
  1612. double x = tx[i] - sx[j];
  1613. double y = ty[i] - sy[j];
  1614. double z = tz[i] - sz[j];
  1615. double r2 = x*x + y*y + z*z;
  1616. double r = sqrt(r2);
  1617. double invdr;
  1618. if (r == 0)
  1619. invdr = 0;
  1620. else
  1621. invdr = 1/r;
  1622. double invdr2=invdr*invdr;
  1623. double dot = (x*srcDen[j*3] + y*srcDen[j*3+1] + z*srcDen[j*3+2]) * invdr2 * invdr2 * invdr;
  1624. double denx = dot*x;
  1625. double deny = dot*y;
  1626. double denz = dot*z;
  1627. trgVal[i*9 ] += denx*x*TOFP;
  1628. trgVal[i*9+1] += denx*y*TOFP;
  1629. trgVal[i*9+2] += denx*z*TOFP;
  1630. trgVal[i*9+3] += deny*x*TOFP;
  1631. trgVal[i*9+4] += deny*y*TOFP;
  1632. trgVal[i*9+5] += deny*z*TOFP;
  1633. trgVal[i*9+6] += denz*x*TOFP;
  1634. trgVal[i*9+7] += denz*y*TOFP;
  1635. trgVal[i*9+8] += denz*z*TOFP;
  1636. }
  1637. }
  1638. return;
  1639. }
  1640. void stokesGradSSE(
  1641. const int ns,
  1642. const int nt,
  1643. const double *sx,
  1644. const double *sy,
  1645. const double *sz,
  1646. const double *tx,
  1647. const double *ty,
  1648. const double *tz,
  1649. const double *srcDen,
  1650. double *trgVal,
  1651. const double cof )
  1652. {
  1653. if ( size_t(sx)%IDEAL_ALIGNMENT || size_t(sy)%IDEAL_ALIGNMENT || size_t(sz)%IDEAL_ALIGNMENT )
  1654. abort();
  1655. double mu = cof;
  1656. double OOEP = 1.0/(8.0*const_pi<double>());
  1657. __m128d tempxx; __m128d tempxy; __m128d tempxz;
  1658. __m128d tempyx; __m128d tempyy; __m128d tempyz;
  1659. __m128d tempzx; __m128d tempzy; __m128d tempzz;
  1660. double oomeu = 1/mu;
  1661. double aux_arr[9*SIMD_LEN+1];
  1662. double *tempvalxx, *tempvalxy, *tempvalxz;
  1663. double *tempvalyx, *tempvalyy, *tempvalyz;
  1664. double *tempvalzx, *tempvalzy, *tempvalzz;
  1665. if (size_t(aux_arr)%IDEAL_ALIGNMENT) // if aux_arr is misaligned
  1666. {
  1667. tempvalxx = aux_arr + 1;
  1668. if (size_t(tempvalxx)%IDEAL_ALIGNMENT)
  1669. abort();
  1670. }
  1671. else
  1672. tempvalxx = aux_arr;
  1673. tempvalxy=tempvalxx+SIMD_LEN;
  1674. tempvalxz=tempvalxy+SIMD_LEN;
  1675. tempvalyx=tempvalxz+SIMD_LEN;
  1676. tempvalyy=tempvalyx+SIMD_LEN;
  1677. tempvalyz=tempvalyy+SIMD_LEN;
  1678. tempvalzx=tempvalyz+SIMD_LEN;
  1679. tempvalzy=tempvalzx+SIMD_LEN;
  1680. tempvalzz=tempvalzy+SIMD_LEN;
  1681. /*! One over eight pi */
  1682. __m128d ooep = _mm_set1_pd (OOEP);
  1683. __m128d half = _mm_set1_pd (0.5);
  1684. __m128d opf = _mm_set1_pd (1.5);
  1685. __m128d three = _mm_set1_pd (3.0);
  1686. __m128d zero = _mm_setzero_pd ();
  1687. __m128d oomu = _mm_set1_pd (1/mu);
  1688. __m128d ooepmu = _mm_mul_pd(ooep,oomu);
  1689. // loop over sources
  1690. int i = 0;
  1691. for (; i < nt; i++) {
  1692. tempxx = _mm_setzero_pd(); tempxy = _mm_setzero_pd(); tempxz = _mm_setzero_pd();
  1693. tempyx = _mm_setzero_pd(); tempyy = _mm_setzero_pd(); tempyz = _mm_setzero_pd();
  1694. tempzx = _mm_setzero_pd(); tempzy = _mm_setzero_pd(); tempzz = _mm_setzero_pd();
  1695. __m128d txi = _mm_load1_pd (&tx[i]);
  1696. __m128d tyi = _mm_load1_pd (&ty[i]);
  1697. __m128d tzi = _mm_load1_pd (&tz[i]);
  1698. int j = 0;
  1699. // Load and calculate in groups of SIMD_LEN
  1700. for (; j + SIMD_LEN <= ns; j+=SIMD_LEN) {
  1701. __m128d sxj = _mm_load_pd (&sx[j]);
  1702. __m128d syj = _mm_load_pd (&sy[j]);
  1703. __m128d szj = _mm_load_pd (&sz[j]);
  1704. __m128d sdenx = _mm_set_pd (srcDen[(j+1)*3], srcDen[j*3]);
  1705. __m128d sdeny = _mm_set_pd (srcDen[(j+1)*3+1], srcDen[j*3+1]);
  1706. __m128d sdenz = _mm_set_pd (srcDen[(j+1)*3+2], srcDen[j*3+2]);
  1707. __m128d dX, dY, dZ;
  1708. __m128d dR2;
  1709. __m128d S;
  1710. __m128d S2;
  1711. __m128d S3;
  1712. dX = _mm_sub_pd(txi , sxj);
  1713. dY = _mm_sub_pd(tyi , syj);
  1714. dZ = _mm_sub_pd(tzi , szj);
  1715. sxj = _mm_mul_pd(dX, dX);
  1716. syj = _mm_mul_pd(dY, dY);
  1717. szj = _mm_mul_pd(dZ, dZ);
  1718. dR2 = _mm_add_pd(sxj, syj);
  1719. dR2 = _mm_add_pd(szj, dR2);
  1720. __m128d temp = _mm_cmpeq_pd (dR2, zero);
  1721. __m128d xhalf = _mm_mul_pd (half, dR2);
  1722. __m128 dR2_s = _mm_cvtpd_ps(dR2);
  1723. __m128 S_s = _mm_rsqrt_ps(dR2_s);
  1724. __m128d S_d = _mm_cvtps_pd(S_s);
  1725. // To handle the condition when src and trg coincide
  1726. S_d = _mm_andnot_pd (temp, S_d);
  1727. S = _mm_mul_pd (S_d, S_d);
  1728. S = _mm_mul_pd (S, xhalf);
  1729. S = _mm_sub_pd (opf, S);
  1730. S = _mm_mul_pd (S, S_d);
  1731. S2 = _mm_mul_pd (S, S);
  1732. S3 = _mm_mul_pd (S2, S);
  1733. __m128d dotx = _mm_mul_pd (dX, sdenx);
  1734. __m128d doty = _mm_mul_pd (dY, sdeny);
  1735. __m128d dotz = _mm_mul_pd (dZ, sdenz);
  1736. __m128d dot_sum = _mm_add_pd (dotx, doty);
  1737. dot_sum = _mm_add_pd (dot_sum, dotz);
  1738. dot_sum = _mm_mul_pd (dot_sum, S2);
  1739. tempxx = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dX, sdenx), _mm_mul_pd(sdenx, dX)), _mm_mul_pd(dot_sum, _mm_sub_pd(dR2 , _mm_mul_pd(three, _mm_mul_pd(dX, dX)))))),tempxx);
  1740. tempxy = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dY, sdenx), _mm_mul_pd(sdeny, dX)), _mm_mul_pd(dot_sum, _mm_sub_pd(zero, _mm_mul_pd(three, _mm_mul_pd(dY, dX)))))),tempxy);
  1741. tempxz = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dZ, sdenx), _mm_mul_pd(sdenz, dX)), _mm_mul_pd(dot_sum, _mm_sub_pd(zero, _mm_mul_pd(three, _mm_mul_pd(dZ, dX)))))),tempxz);
  1742. tempyx = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dX, sdeny), _mm_mul_pd(sdenx, dY)), _mm_mul_pd(dot_sum, _mm_sub_pd(zero, _mm_mul_pd(three, _mm_mul_pd(dX, dY)))))),tempyx);
  1743. tempyy = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dY, sdeny), _mm_mul_pd(sdeny, dY)), _mm_mul_pd(dot_sum, _mm_sub_pd(dR2 , _mm_mul_pd(three, _mm_mul_pd(dY, dY)))))),tempyy);
  1744. tempyz = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dZ, sdeny), _mm_mul_pd(sdenz, dY)), _mm_mul_pd(dot_sum, _mm_sub_pd(zero, _mm_mul_pd(three, _mm_mul_pd(dZ, dY)))))),tempyz);
  1745. tempzx = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dX, sdenz), _mm_mul_pd(sdenx, dZ)), _mm_mul_pd(dot_sum, _mm_sub_pd(zero, _mm_mul_pd(three, _mm_mul_pd(dX, dZ)))))),tempzx);
  1746. tempzy = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dY, sdenz), _mm_mul_pd(sdeny, dZ)), _mm_mul_pd(dot_sum, _mm_sub_pd(zero, _mm_mul_pd(three, _mm_mul_pd(dY, dZ)))))),tempzy);
  1747. tempzz = _mm_add_pd(_mm_mul_pd(S3,_mm_add_pd(_mm_sub_pd(_mm_mul_pd(dZ, sdenz), _mm_mul_pd(sdenz, dZ)), _mm_mul_pd(dot_sum, _mm_sub_pd(dR2 , _mm_mul_pd(three, _mm_mul_pd(dZ, dZ)))))),tempzz);
  1748. }
  1749. tempxx = _mm_mul_pd (tempxx, ooepmu);
  1750. tempxy = _mm_mul_pd (tempxy, ooepmu);
  1751. tempxz = _mm_mul_pd (tempxz, ooepmu);
  1752. tempyx = _mm_mul_pd (tempyx, ooepmu);
  1753. tempyy = _mm_mul_pd (tempyy, ooepmu);
  1754. tempyz = _mm_mul_pd (tempyz, ooepmu);
  1755. tempzx = _mm_mul_pd (tempzx, ooepmu);
  1756. tempzy = _mm_mul_pd (tempzy, ooepmu);
  1757. tempzz = _mm_mul_pd (tempzz, ooepmu);
  1758. _mm_store_pd(tempvalxx, tempxx); _mm_store_pd(tempvalxy, tempxy); _mm_store_pd(tempvalxz, tempxz);
  1759. _mm_store_pd(tempvalyx, tempyx); _mm_store_pd(tempvalyy, tempyy); _mm_store_pd(tempvalyz, tempyz);
  1760. _mm_store_pd(tempvalzx, tempzx); _mm_store_pd(tempvalzy, tempzy); _mm_store_pd(tempvalzz, tempzz);
  1761. for (int k = 0; k < SIMD_LEN; k++) {
  1762. trgVal[i*9 ] += tempvalxx[k];
  1763. trgVal[i*9+1] += tempvalxy[k];
  1764. trgVal[i*9+2] += tempvalxz[k];
  1765. trgVal[i*9+3] += tempvalyx[k];
  1766. trgVal[i*9+4] += tempvalyy[k];
  1767. trgVal[i*9+5] += tempvalyz[k];
  1768. trgVal[i*9+6] += tempvalzx[k];
  1769. trgVal[i*9+7] += tempvalzy[k];
  1770. trgVal[i*9+8] += tempvalzz[k];
  1771. }
  1772. for (; j < ns; j++) {
  1773. double x = tx[i] - sx[j];
  1774. double y = ty[i] - sy[j];
  1775. double z = tz[i] - sz[j];
  1776. double r2 = x*x + y*y + z*z;
  1777. double r = sqrt(r2);
  1778. double invdr;
  1779. if (r == 0)
  1780. invdr = 0;
  1781. else
  1782. invdr = 1/r;
  1783. double invdr2=invdr*invdr;
  1784. double invdr3=invdr2*invdr;
  1785. double dot = (x*srcDen[j*3] + y*srcDen[j*3+1] + z*srcDen[j*3+2]);
  1786. trgVal[i*9 ] += OOEP*oomeu*invdr3*( x*srcDen[j*3 ] - srcDen[j*3 ]*x + dot*(1-3*x*x*invdr2) );
  1787. trgVal[i*9+1] += OOEP*oomeu*invdr3*( y*srcDen[j*3 ] - srcDen[j*3+1]*x + dot*(0-3*y*x*invdr2) );
  1788. trgVal[i*9+2] += OOEP*oomeu*invdr3*( z*srcDen[j*3 ] - srcDen[j*3+2]*x + dot*(0-3*z*x*invdr2) );
  1789. trgVal[i*9+3] += OOEP*oomeu*invdr3*( x*srcDen[j*3+1] - srcDen[j*3 ]*y + dot*(0-3*x*y*invdr2) );
  1790. trgVal[i*9+4] += OOEP*oomeu*invdr3*( y*srcDen[j*3+1] - srcDen[j*3+1]*y + dot*(1-3*y*y*invdr2) );
  1791. trgVal[i*9+5] += OOEP*oomeu*invdr3*( z*srcDen[j*3+1] - srcDen[j*3+2]*y + dot*(0-3*z*y*invdr2) );
  1792. trgVal[i*9+6] += OOEP*oomeu*invdr3*( x*srcDen[j*3+2] - srcDen[j*3 ]*z + dot*(0-3*x*z*invdr2) );
  1793. trgVal[i*9+7] += OOEP*oomeu*invdr3*( y*srcDen[j*3+2] - srcDen[j*3+1]*z + dot*(0-3*y*z*invdr2) );
  1794. trgVal[i*9+8] += OOEP*oomeu*invdr3*( z*srcDen[j*3+2] - srcDen[j*3+2]*z + dot*(1-3*z*z*invdr2) );
  1795. }
  1796. }
  1797. return;
  1798. }
  1799. #undef SIMD_LEN
  1800. #define X(s,k) (s)[(k)*COORD_DIM]
  1801. #define Y(s,k) (s)[(k)*COORD_DIM+1]
  1802. #define Z(s,k) (s)[(k)*COORD_DIM+2]
  1803. void stokesDirectSSEShuffle(const int ns, const int nt, double const src[], double const trg[], double const den[], double pot[], const double kernel_coef, mem::MemoryManager* mem_mgr=NULL)
  1804. {
  1805. std::vector<double> xs(ns+1); std::vector<double> xt(nt);
  1806. std::vector<double> ys(ns+1); std::vector<double> yt(nt);
  1807. std::vector<double> zs(ns+1); std::vector<double> zt(nt);
  1808. int x_shift = size_t(&xs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1809. int y_shift = size_t(&ys[0]) % IDEAL_ALIGNMENT ? 1:0;
  1810. int z_shift = size_t(&zs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1811. //1. reshuffle memory
  1812. for (int k =0;k<ns;k++){
  1813. xs[k+x_shift]=X(src,k);
  1814. ys[k+y_shift]=Y(src,k);
  1815. zs[k+z_shift]=Z(src,k);
  1816. }
  1817. for (int k=0;k<nt;k++){
  1818. xt[k]=X(trg,k);
  1819. yt[k]=Y(trg,k);
  1820. zt[k]=Z(trg,k);
  1821. }
  1822. //2. perform caclulation
  1823. stokesDirectVecSSE(ns,nt,&xs[x_shift],&ys[y_shift],&zs[z_shift],&xt[0],&yt[0],&zt[0],den,pot,kernel_coef);
  1824. return;
  1825. }
  1826. void stokesPressureSSEShuffle(const int ns, const int nt, double const src[], double const trg[], double const den[], double pot[], mem::MemoryManager* mem_mgr=NULL)
  1827. {
  1828. std::vector<double> xs(ns+1); std::vector<double> xt(nt);
  1829. std::vector<double> ys(ns+1); std::vector<double> yt(nt);
  1830. std::vector<double> zs(ns+1); std::vector<double> zt(nt);
  1831. int x_shift = size_t(&xs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1832. int y_shift = size_t(&ys[0]) % IDEAL_ALIGNMENT ? 1:0;
  1833. int z_shift = size_t(&zs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1834. //1. reshuffle memory
  1835. for (int k =0;k<ns;k++){
  1836. xs[k+x_shift]=X(src,k);
  1837. ys[k+y_shift]=Y(src,k);
  1838. zs[k+z_shift]=Z(src,k);
  1839. }
  1840. for (int k=0;k<nt;k++){
  1841. xt[k]=X(trg,k);
  1842. yt[k]=Y(trg,k);
  1843. zt[k]=Z(trg,k);
  1844. }
  1845. //2. perform caclulation
  1846. stokesPressureSSE(ns,nt,&xs[x_shift],&ys[y_shift],&zs[z_shift],&xt[0],&yt[0],&zt[0],den,pot);
  1847. return;
  1848. }
  1849. void stokesStressSSEShuffle(const int ns, const int nt, double const src[], double const trg[], double const den[], double pot[], mem::MemoryManager* mem_mgr=NULL)
  1850. {
  1851. std::vector<double> xs(ns+1); std::vector<double> xt(nt);
  1852. std::vector<double> ys(ns+1); std::vector<double> yt(nt);
  1853. std::vector<double> zs(ns+1); std::vector<double> zt(nt);
  1854. int x_shift = size_t(&xs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1855. int y_shift = size_t(&ys[0]) % IDEAL_ALIGNMENT ? 1:0;
  1856. int z_shift = size_t(&zs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1857. //1. reshuffle memory
  1858. for (int k =0;k<ns;k++){
  1859. xs[k+x_shift]=X(src,k);
  1860. ys[k+y_shift]=Y(src,k);
  1861. zs[k+z_shift]=Z(src,k);
  1862. }
  1863. for (int k=0;k<nt;k++){
  1864. xt[k]=X(trg,k);
  1865. yt[k]=Y(trg,k);
  1866. zt[k]=Z(trg,k);
  1867. }
  1868. //2. perform caclulation
  1869. stokesStressSSE(ns,nt,&xs[x_shift],&ys[y_shift],&zs[z_shift],&xt[0],&yt[0],&zt[0],den,pot);
  1870. return;
  1871. }
  1872. void stokesGradSSEShuffle(const int ns, const int nt, double const src[], double const trg[], double const den[], double pot[], const double kernel_coef, mem::MemoryManager* mem_mgr=NULL)
  1873. {
  1874. std::vector<double> xs(ns+1); std::vector<double> xt(nt);
  1875. std::vector<double> ys(ns+1); std::vector<double> yt(nt);
  1876. std::vector<double> zs(ns+1); std::vector<double> zt(nt);
  1877. int x_shift = size_t(&xs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1878. int y_shift = size_t(&ys[0]) % IDEAL_ALIGNMENT ? 1:0;
  1879. int z_shift = size_t(&zs[0]) % IDEAL_ALIGNMENT ? 1:0;
  1880. //1. reshuffle memory
  1881. for (int k =0;k<ns;k++){
  1882. xs[k+x_shift]=X(src,k);
  1883. ys[k+y_shift]=Y(src,k);
  1884. zs[k+z_shift]=Z(src,k);
  1885. }
  1886. for (int k=0;k<nt;k++){
  1887. xt[k]=X(trg,k);
  1888. yt[k]=Y(trg,k);
  1889. zt[k]=Z(trg,k);
  1890. }
  1891. //2. perform caclulation
  1892. stokesGradSSE(ns,nt,&xs[x_shift],&ys[y_shift],&zs[z_shift],&xt[0],&yt[0],&zt[0],den,pot,kernel_coef);
  1893. return;
  1894. }
  1895. #undef X
  1896. #undef Y
  1897. #undef Z
  1898. #undef IDEAL_ALIGNMENT
  1899. #undef DECL_SIMD_ALIGNED
  1900. }
  1901. template <>
  1902. void stokes_vel<double>(double* r_src, int src_cnt, double* v_src_, int dof, double* r_trg, int trg_cnt, double* k_out, mem::MemoryManager* mem_mgr){
  1903. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(28*dof));
  1904. const double mu=1.0;
  1905. stokesDirectSSEShuffle(src_cnt, trg_cnt, r_src, r_trg, v_src_, k_out, mu, mem_mgr);
  1906. }
  1907. template <>
  1908. void stokes_press<double>(double* r_src, int src_cnt, double* v_src_, int dof, double* r_trg, int trg_cnt, double* k_out, mem::MemoryManager* mem_mgr){
  1909. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(17*dof));
  1910. stokesPressureSSEShuffle(src_cnt, trg_cnt, r_src, r_trg, v_src_, k_out, mem_mgr);
  1911. return;
  1912. }
  1913. template <>
  1914. void stokes_stress<double>(double* r_src, int src_cnt, double* v_src_, int dof, double* r_trg, int trg_cnt, double* k_out, mem::MemoryManager* mem_mgr){
  1915. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(45*dof));
  1916. stokesStressSSEShuffle(src_cnt, trg_cnt, r_src, r_trg, v_src_, k_out, mem_mgr);
  1917. }
  1918. template <>
  1919. void stokes_grad<double>(double* r_src, int src_cnt, double* v_src_, int dof, double* r_trg, int trg_cnt, double* k_out, mem::MemoryManager* mem_mgr){
  1920. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(89*dof));
  1921. const double mu=1.0;
  1922. stokesGradSSEShuffle(src_cnt, trg_cnt, r_src, r_trg, v_src_, k_out, mu, mem_mgr);
  1923. }
  1924. #endif
  1925. #endif
  1926. ////////////////////////////////////////////////////////////////////////////////
  1927. //////// BIOT-SAVART KERNEL ////////
  1928. ////////////////////////////////////////////////////////////////////////////////
  1929. template <class T>
  1930. void biot_savart(T* r_src, int src_cnt, T* v_src_, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1931. #ifndef __MIC__
  1932. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(26*dof));
  1933. #endif
  1934. const T OOFP = -1.0/(4.0*const_pi<T>());
  1935. for(int t=0;t<trg_cnt;t++){
  1936. for(int i=0;i<dof;i++){
  1937. T p[3]={0,0,0};
  1938. for(int s=0;s<src_cnt;s++){
  1939. T dR[3]={r_trg[3*t ]-r_src[3*s ],
  1940. r_trg[3*t+1]-r_src[3*s+1],
  1941. r_trg[3*t+2]-r_src[3*s+2]};
  1942. T R2 = (dR[0]*dR[0]+dR[1]*dR[1]+dR[2]*dR[2]);
  1943. if (R2!=0){
  1944. T invR2=1.0/R2;
  1945. T invR=sqrt(invR2);
  1946. T invR3=invR*invR2;
  1947. T v_src[3]={v_src_[(s*dof+i)*3 ],
  1948. v_src_[(s*dof+i)*3+1],
  1949. v_src_[(s*dof+i)*3+2]};
  1950. p[0] -= (v_src[1]*dR[2]-v_src[2]*dR[1])*invR3;
  1951. p[1] -= (v_src[2]*dR[0]-v_src[0]*dR[2])*invR3;
  1952. p[2] -= (v_src[0]*dR[1]-v_src[1]*dR[0])*invR3;
  1953. }
  1954. }
  1955. k_out[(t*dof+i)*3+0] += p[0]*OOFP;
  1956. k_out[(t*dof+i)*3+1] += p[1]*OOFP;
  1957. k_out[(t*dof+i)*3+2] += p[2]*OOFP;
  1958. }
  1959. }
  1960. }
  1961. ////////////////////////////////////////////////////////////////////////////////
  1962. //////// HELMHOLTZ KERNEL ////////
  1963. ////////////////////////////////////////////////////////////////////////////////
  1964. /**
  1965. * \brief Green's function for the Helmholtz's equation. Kernel tensor
  1966. * dimension = 2x2.
  1967. */
  1968. template <class T>
  1969. void helmholtz_poten(T* r_src, int src_cnt, T* v_src, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1970. #ifndef __MIC__
  1971. Profile::Add_FLOP((long long)trg_cnt*(long long)src_cnt*(24*dof));
  1972. #endif
  1973. const T mu = (20.0*const_pi<T>());
  1974. for(int t=0;t<trg_cnt;t++){
  1975. for(int i=0;i<dof;i++){
  1976. T p[2]={0,0};
  1977. for(int s=0;s<src_cnt;s++){
  1978. T dX_reg=r_trg[3*t ]-r_src[3*s ];
  1979. T dY_reg=r_trg[3*t+1]-r_src[3*s+1];
  1980. T dZ_reg=r_trg[3*t+2]-r_src[3*s+2];
  1981. T R = (dX_reg*dX_reg+dY_reg*dY_reg+dZ_reg*dZ_reg);
  1982. if (R!=0){
  1983. R = sqrt(R);
  1984. T invR=1.0/R;
  1985. T G[2]={cos(mu*R)*invR, sin(mu*R)*invR};
  1986. p[0] += v_src[(s*dof+i)*2+0]*G[0] - v_src[(s*dof+i)*2+1]*G[1];
  1987. p[1] += v_src[(s*dof+i)*2+0]*G[1] + v_src[(s*dof+i)*2+1]*G[0];
  1988. }
  1989. }
  1990. k_out[(t*dof+i)*2+0] += p[0];
  1991. k_out[(t*dof+i)*2+1] += p[1];
  1992. }
  1993. }
  1994. }
  1995. template <class T>
  1996. void helmholtz_grad(T* r_src, int src_cnt, T* v_src, int dof, T* r_trg, int trg_cnt, T* k_out, mem::MemoryManager* mem_mgr){
  1997. //TODO Implement this.
  1998. }
  1999. }//end namespace