boundary_quadrature.hpp 258 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943
  1. #ifndef _SCTL_BOUNDARY_QUADRATURE_HPP_
  2. #define _SCTL_BOUNDARY_QUADRATURE_HPP_
  3. #include <mutex>
  4. #include <atomic>
  5. #include <tuple>
  6. namespace SCTL_NAMESPACE {
  7. template <class Real, Integer DIM, Integer ORDER> class Basis {
  8. public:
  9. using ValueType = Real;
  10. // class EvalOperator {
  11. // public:
  12. // };
  13. using EvalOpType = Matrix<ValueType>;
  14. static constexpr Long Dim() {
  15. return DIM;
  16. }
  17. static constexpr Long Size() {
  18. return pow<DIM,Long>(ORDER);
  19. }
  20. static const Matrix<ValueType>& Nodes() {
  21. static Matrix<ValueType> nodes_(DIM,Size());
  22. auto nodes_1d = [](Integer i) {
  23. return 0.5 - 0.5 * sctl::cos<ValueType>((2*i+1) * const_pi<ValueType>() / (2*ORDER));
  24. };
  25. { // Set nodes_
  26. static std::mutex mutex;
  27. static std::atomic<Integer> first_time(true);
  28. if (first_time.load(std::memory_order_relaxed)) {
  29. std::lock_guard<std::mutex> guard(mutex);
  30. if (first_time.load(std::memory_order_relaxed)) {
  31. Integer N = 1;
  32. for (Integer d = 0; d < DIM; d++) {
  33. for (Integer j = 0; j < ORDER; j++) {
  34. for (Integer i = 0; i < N; i++) {
  35. for (Integer k = 0; k < d; k++) {
  36. nodes_[k][j*N+i] = nodes_[k][i];
  37. }
  38. nodes_[d][j*N+i] = nodes_1d(j);
  39. }
  40. }
  41. N *= ORDER;
  42. }
  43. std::atomic_thread_fence(std::memory_order_seq_cst);
  44. first_time.store(false);
  45. }
  46. }
  47. }
  48. return nodes_;
  49. }
  50. static const Vector<ValueType>& QuadWts() {
  51. static Vector<ValueType> wts(Size());
  52. { // Set nodes_
  53. static std::mutex mutex;
  54. static std::atomic<Integer> first_time(true);
  55. if (first_time.load(std::memory_order_relaxed)) {
  56. std::lock_guard<std::mutex> guard(mutex);
  57. if (first_time.load(std::memory_order_relaxed)) {
  58. StaticArray<ValueType,ORDER> wts_1d;
  59. { // Set wts_1d
  60. Vector<ValueType> x_(ORDER);
  61. ChebBasis<ValueType>::template Nodes<1>(ORDER, x_);
  62. Vector<ValueType> V_cheb(ORDER * ORDER);
  63. { // Set V_cheb
  64. Vector<ValueType> I(ORDER*ORDER);
  65. I = 0;
  66. for (Long i = 0; i < ORDER; i++) I[i*ORDER+i] = 1;
  67. ChebBasis<ValueType>::template Approx<1>(ORDER, I, V_cheb);
  68. }
  69. Matrix<ValueType> M(ORDER, ORDER, V_cheb.begin());
  70. Vector<ValueType> w_sample(ORDER);
  71. for (Integer i = 0; i < ORDER; i++) {
  72. w_sample[i] = (i % 2 ? 0 : -(ORDER/(ValueType)(i*i-1)));
  73. }
  74. for (Integer j = 0; j < ORDER; j++) {
  75. wts_1d[j] = 0;
  76. for (Integer i = 0; i < ORDER; i++) {
  77. wts_1d[j] += M[j][i] * w_sample[i] / ORDER;
  78. }
  79. }
  80. }
  81. wts[0] = 1;
  82. Integer N = 1;
  83. for (Integer d = 0; d < DIM; d++) {
  84. for (Integer j = 1; j < ORDER; j++) {
  85. for (Integer i = 0; i < N; i++) {
  86. wts[j*N+i] = wts[i] * wts_1d[j];
  87. }
  88. }
  89. for (Integer i = 0; i < N; i++) {
  90. wts[i] *= wts_1d[0];
  91. }
  92. N *= ORDER;
  93. }
  94. std::atomic_thread_fence(std::memory_order_seq_cst);
  95. first_time.store(false);
  96. }
  97. }
  98. }
  99. return wts;
  100. }
  101. static void Grad(Vector<Basis>& dX, const Vector<Basis>& X) {
  102. static Matrix<ValueType> GradOp[DIM];
  103. static std::mutex mutex;
  104. static std::atomic<Integer> first_time(true);
  105. if (first_time.load(std::memory_order_relaxed)) {
  106. std::lock_guard<std::mutex> guard(mutex);
  107. if (first_time.load(std::memory_order_relaxed)) {
  108. { // Set GradOp
  109. auto nodes = Basis<ValueType,1,ORDER>::Nodes();
  110. SCTL_ASSERT(nodes.Dim(1) == ORDER);
  111. Matrix<ValueType> M(ORDER, ORDER);
  112. for (Integer i = 0; i < ORDER; i++) { // Set M
  113. Real x = nodes[0][i];
  114. for (Integer j = 0; j < ORDER; j++) {
  115. M[j][i] = 0;
  116. for (Integer l = 0; l < ORDER; l++) {
  117. if (l != j) {
  118. Real M_ = 1;
  119. for (Integer k = 0; k < ORDER; k++) {
  120. if (k != j && k != l) M_ *= (x - nodes[0][k]);
  121. if (k != j) M_ /= (nodes[0][j] - nodes[0][k]);
  122. }
  123. M[j][i] += M_;
  124. }
  125. }
  126. }
  127. }
  128. for (Integer d = 0; d < DIM; d++) {
  129. GradOp[d].ReInit(Size(), Size());
  130. GradOp[d] = 0;
  131. Integer stride0 = sctl::pow<Integer>(ORDER, d);
  132. Integer repeat0 = sctl::pow<Integer>(ORDER, d);
  133. Integer stride1 = sctl::pow<Integer>(ORDER, d+1);
  134. Integer repeat1 = sctl::pow<Integer>(ORDER, DIM-d-1);
  135. for (Integer k1 = 0; k1 < repeat1; k1++) {
  136. for (Integer i = 0; i < ORDER; i++) {
  137. for (Integer j = 0; j < ORDER; j++) {
  138. for (Integer k0 = 0; k0 < repeat0; k0++) {
  139. GradOp[d][k1*stride1 + i*stride0 + k0][k1*stride1 + j*stride0 + k0] = M[i][j];
  140. }
  141. }
  142. }
  143. }
  144. }
  145. }
  146. std::atomic_thread_fence(std::memory_order_seq_cst);
  147. first_time.store(false);
  148. }
  149. }
  150. if (dX.Dim() != X.Dim()*DIM) dX.ReInit(X.Dim()*DIM);
  151. for (Long i = 0; i < X.Dim(); i++) {
  152. const Matrix<ValueType> Vi(1, Size(), (Iterator<ValueType>)(ConstIterator<ValueType>)X[i].NodeValues_, false);
  153. for (Integer k = 0; k < DIM; k++) {
  154. Matrix<ValueType> Vo(1, Size(), dX[i*DIM+k].NodeValues_, false);
  155. Matrix<ValueType>::GEMM(Vo, Vi, GradOp[k]);
  156. }
  157. }
  158. }
  159. static EvalOpType SetupEval(const Matrix<ValueType>& X) {
  160. Long N = X.Dim(1);
  161. SCTL_ASSERT(X.Dim(0) == DIM);
  162. Matrix<ValueType> M(Size(), N);
  163. { // Set M
  164. auto nodes = Basis<ValueType,1,ORDER>::Nodes();
  165. Integer NN = Basis<ValueType,1,ORDER>::Size();
  166. Matrix<ValueType> M_(NN, DIM*N);
  167. for (Long i = 0; i < DIM*N; i++) {
  168. ValueType x = X[0][i];
  169. for (Integer j = 0; j < NN; j++) {
  170. ValueType y = 1;
  171. for (Integer k = 0; k < NN; k++) {
  172. y *= (j==k ? 1 : (nodes[0][k] - x) / (nodes[0][k] - nodes[0][j]));
  173. }
  174. M_[j][i] = y;
  175. }
  176. }
  177. if (DIM == 1) {
  178. SCTL_ASSERT(M.Dim(0) == M_.Dim(0));
  179. SCTL_ASSERT(M.Dim(1) == M_.Dim(1));
  180. M = M_;
  181. } else {
  182. Integer NNN = 1;
  183. M = 1;
  184. for (Integer d = 0; d < DIM; d++) {
  185. for (Integer k = 1; k < NN; k++) {
  186. for (Integer j = 0; j < NNN; j++) {
  187. for (Long i = 0; i < N; i++) {
  188. M[k*NNN+j][i] = M[j][i] * M_[k][d*N+i];
  189. }
  190. }
  191. }
  192. { // k = 0
  193. for (Integer j = 0; j < NNN; j++) {
  194. for (Long i = 0; i < N; i++) {
  195. M[j][i] *= M_[0][d*N+i];
  196. }
  197. }
  198. }
  199. NNN *= NN;
  200. }
  201. }
  202. }
  203. return M;
  204. }
  205. static void Eval(Matrix<ValueType>& Y, const Vector<Basis>& X, const EvalOpType& M) {
  206. Long N0 = X.Dim();
  207. Long N1 = M.Dim(1);
  208. SCTL_ASSERT(M.Dim(0) == Size());
  209. if (Y.Dim(0) != N0 || Y.Dim(1) != N1) Y.ReInit(N0, N1);
  210. for (Long i = 0; i < N0; i++) {
  211. const Matrix<ValueType> X_(1,Size(),(Iterator<ValueType>)(ConstIterator<ValueType>)X[i].NodeValues_,false);
  212. Matrix<ValueType> Y_(1,N1,Y[i],false);
  213. Matrix<ValueType>::GEMM(Y_,X_,M);
  214. }
  215. }
  216. Basis operator+(Basis X) const {
  217. for (Long i = 0; i < Size(); i++) X[i] = (*this)[i] + X[i];
  218. return X;
  219. }
  220. Basis operator-(Basis X) const {
  221. for (Long i = 0; i < Size(); i++) X[i] = (*this)[i] - X[i];
  222. return X;
  223. }
  224. Basis operator*(Basis X) const {
  225. for (Long i = 0; i < Size(); i++) X[i] = (*this)[i] * X[i];
  226. return X;
  227. }
  228. Basis operator*(Real a) const {
  229. Basis X = (*this);
  230. for (Long i = 0; i < Size(); i++) X[i] *= a;
  231. return X;
  232. }
  233. Basis operator+(Real a) const {
  234. Basis X = (*this);
  235. for (Long i = 0; i < Size(); i++) X[i] += a;
  236. return X;
  237. }
  238. Basis& operator+=(const Basis& X) {
  239. for (Long i = 0; i < Size(); i++) (*this)[i] += X[i];
  240. return *this;
  241. }
  242. Basis& operator-=(const Basis& X) {
  243. for (Long i = 0; i < Size(); i++) (*this)[i] -= X[i];
  244. return *this;
  245. }
  246. Basis& operator*=(const Basis& X) {
  247. for (Long i = 0; i < Size(); i++) (*this)[i] *= X[i];
  248. return *this;
  249. }
  250. Basis& operator*=(Real a) {
  251. for (Long i = 0; i < Size(); i++) (*this)[i] *= a;
  252. return *this;
  253. }
  254. Basis& operator+=(Real a) {
  255. for (Long i = 0; i < Size(); i++) (*this)[i] += a;
  256. return *this;
  257. }
  258. Basis& operator=(Real a) {
  259. for (Long i = 0; i < Size(); i++) (*this)[i] = a;
  260. return *this;
  261. }
  262. const ValueType& operator[](Long i) const {
  263. SCTL_ASSERT(i < Size());
  264. return NodeValues_[i];
  265. }
  266. ValueType& operator[](Long i) {
  267. SCTL_ASSERT(i < Size());
  268. return NodeValues_[i];
  269. }
  270. private:
  271. StaticArray<ValueType,Size()> NodeValues_;
  272. };
  273. template <Integer COORD_DIM, class Basis> class ElemList {
  274. public:
  275. using CoordBasis = Basis;
  276. using CoordType = typename CoordBasis::ValueType;
  277. static constexpr Integer CoordDim() {
  278. return COORD_DIM;
  279. }
  280. static constexpr Integer ElemDim() {
  281. return CoordBasis::Dim();
  282. }
  283. ElemList(Long Nelem = 0) {
  284. ReInit(Nelem);
  285. }
  286. void ReInit(Long Nelem = 0) {
  287. Nelem_ = Nelem;
  288. X_.ReInit(Nelem_ * COORD_DIM);
  289. }
  290. void ReInit(const Vector<CoordBasis>& X) {
  291. Nelem_ = X.Dim() / COORD_DIM;
  292. SCTL_ASSERT(X.Dim() == Nelem_ * COORD_DIM);
  293. X_ = X;
  294. }
  295. Long NElem() const {
  296. return Nelem_;
  297. }
  298. CoordBasis& operator()(Long elem, Integer dim) {
  299. SCTL_ASSERT(elem >= 0 && elem < Nelem_);
  300. SCTL_ASSERT(dim >= 0 && dim < COORD_DIM);
  301. return X_[elem*COORD_DIM+dim];
  302. }
  303. const CoordBasis& operator()(Long elem, Integer dim) const {
  304. SCTL_ASSERT(elem >= 0 && elem < Nelem_);
  305. SCTL_ASSERT(dim >= 0 && dim < COORD_DIM);
  306. return X_[elem*COORD_DIM+dim];
  307. }
  308. const Vector<CoordBasis>& ElemVector() const {
  309. return X_;
  310. }
  311. private:
  312. static_assert(CoordBasis::Dim() <= CoordDim(), "Basis dimension can not be greater than COORD_DIM.");
  313. Vector<CoordBasis> X_;
  314. Long Nelem_;
  315. mutable Vector<CoordBasis> dX_;
  316. };
  317. template <class Real> class Quadrature {
  318. static Real machine_epsilon() {
  319. Real eps=1;
  320. while(eps*(Real)0.5+(Real)1.0>1.0) eps*=0.5;
  321. return eps;
  322. }
  323. template <Integer DIM> static void DuffyQuad(Matrix<Real>& nodes, Vector<Real>& weights, const Vector<Real>& coord, Integer order, Real adapt = -1.0) {
  324. SCTL_ASSERT(coord.Dim() == DIM);
  325. static Real eps = machine_epsilon()*16;
  326. Matrix<Real> qx;
  327. Vector<Real> qw;
  328. { // Set qx, qw
  329. Vector<Real> qx0, qw0;
  330. ChebBasis<Real>::quad_rule(order, qx0, qw0);
  331. Integer N = sctl::pow<DIM,Integer>(order);
  332. qx.ReInit(DIM,N);
  333. qw.ReInit(N);
  334. qw[0] = 1;
  335. Integer N_ = 1;
  336. for (Integer d = 0; d < DIM; d++) {
  337. for (Integer j = 0; j < order; j++) {
  338. for (Integer i = 0; i < N_; i++) {
  339. for (Integer k = 0; k < d; k++) {
  340. qx[k][j*N_+i] = qx[k][i];
  341. }
  342. qx[d][j*N_+i] = qx0[j];
  343. qw[j*N_+i] = qw[i];
  344. }
  345. }
  346. for (Integer j = 0; j < order; j++) {
  347. for (Integer i = 0; i < N_; i++) {
  348. qw[j*N_+i] *= qw0[j];
  349. }
  350. }
  351. N_ *= order;
  352. }
  353. }
  354. Vector<Real> X;
  355. { // Set X
  356. StaticArray<Real,2*DIM+2> X_;
  357. X_[0] = 0;
  358. X_[1] = adapt;
  359. for (Integer i = 0; i < DIM; i++) {
  360. X_[2*i+2] = sctl::fabs<Real>(coord[i]);
  361. X_[2*i+3] = sctl::fabs<Real>(coord[i]-1);
  362. }
  363. std::sort((Iterator<Real>)X_, (Iterator<Real>)X_+2*DIM+2);
  364. X.PushBack(std::max<Real>(0, X_[2*DIM]-1));
  365. for (Integer i = 0; i < 2*DIM+2; i++) {
  366. if (X[X.Dim()-1] < X_[i]) {
  367. if (X.Dim())
  368. X.PushBack(X_[i]);
  369. }
  370. }
  371. /////////////////////////////////////////////////////////////////////////////////////////////////
  372. Vector<Real> r(1);
  373. r[0] = X[0];
  374. for (Integer i = 1; i < X.Dim(); i++) {
  375. while (r[r.Dim() - 1] > 0.0 && (order*0.5) * r[r.Dim() - 1] < X[i]) r.PushBack((order*0.5) * r[r.Dim() - 1]); // TODO
  376. r.PushBack(X[i]);
  377. }
  378. X = r;
  379. /////////////////////////////////////////////////////////////////////////////////////////////////
  380. }
  381. Vector<Real> nds, wts;
  382. for (Integer k = 0; k < X.Dim()-1; k++) {
  383. for (Integer dd = 0; dd < 2*DIM; dd++) {
  384. Integer d0 = (dd>>1);
  385. StaticArray<Real,2*DIM> range0, range1;
  386. { // Set range0, range1
  387. Integer d1 = (dd%2?1:-1);
  388. for (Integer d = 0; d < DIM; d++) {
  389. range0[d*2+0] = std::max<Real>(0,std::min<Real>(1,coord[d] - X[k] ));
  390. range0[d*2+1] = std::max<Real>(0,std::min<Real>(1,coord[d] + X[k] ));
  391. range1[d*2+0] = std::max<Real>(0,std::min<Real>(1,coord[d] - X[k+1]));
  392. range1[d*2+1] = std::max<Real>(0,std::min<Real>(1,coord[d] + X[k+1]));
  393. }
  394. range0[d0*2+0] = std::max<Real>(0,std::min<Real>(1,coord[d0] + d1*X[k+0]));
  395. range0[d0*2+1] = std::max<Real>(0,std::min<Real>(1,coord[d0] + d1*X[k+0]));
  396. range1[d0*2+0] = std::max<Real>(0,std::min<Real>(1,coord[d0] + d1*X[k+1]));
  397. range1[d0*2+1] = std::max<Real>(0,std::min<Real>(1,coord[d0] + d1*X[k+1]));
  398. }
  399. { // if volume(range0, range1) == 0 then continue
  400. Real v0 = 1, v1 = 1;
  401. for (Integer d = 0; d < DIM; d++) {
  402. if (d == d0) {
  403. v0 *= sctl::fabs<Real>(range0[d*2+0]-range1[d*2+0]);
  404. v1 *= sctl::fabs<Real>(range0[d*2+0]-range1[d*2+0]);
  405. } else {
  406. v0 *= range0[d*2+1]-range0[d*2+0];
  407. v1 *= range1[d*2+1]-range1[d*2+0];
  408. }
  409. }
  410. if (v0 < eps && v1 < eps) continue;
  411. }
  412. for (Integer i = 0; i < qx.Dim(1); i++) { // Set nds, wts
  413. Real w = qw[i];
  414. Real z = qx[d0][i];
  415. for (Integer d = 0; d < DIM; d++) {
  416. Real y = qx[d][i];
  417. nds.PushBack((range0[d*2+0]*(1-y) + range0[d*2+1]*y)*(1-z) + (range1[d*2+0]*(1-y) + range1[d*2+1]*y)*z);
  418. if (d == d0) {
  419. w *= abs(range1[d*2+0] - range0[d*2+0]);
  420. } else {
  421. w *= (range0[d*2+1] - range0[d*2+0])*(1-z) + (range1[d*2+1] - range1[d*2+0])*z;
  422. }
  423. }
  424. wts.PushBack(w);
  425. }
  426. }
  427. }
  428. nodes = Matrix<Real>(nds.Dim()/DIM,DIM,nds.begin()).Transpose();
  429. weights = wts;
  430. }
  431. template <Integer DIM> static void TensorProductGaussQuad(Matrix<Real>& nodes, Vector<Real>& weights, Integer order) {
  432. Vector<Real> coord(DIM);
  433. coord = 0;
  434. coord[0] = -10;
  435. DuffyQuad<DIM>(nodes, weights, coord, order);
  436. }
  437. template <class DensityBasis, class ElemList, class Kernel> static void SetupSingular(Matrix<Real>& M_singular, const Matrix<Real>& trg_nds, const ElemList& elem_lst, const Kernel& kernel, Integer order_singular = 10, Integer order_direct = 10, Real Rqbx = 0) {
  438. using CoordBasis = typename ElemList::CoordBasis;
  439. using CoordEvalOpType = typename CoordBasis::EvalOpType;
  440. using DensityEvalOpType = typename DensityBasis::EvalOpType;
  441. constexpr Integer CoordDim = ElemList::CoordDim();
  442. constexpr Integer ElemDim = ElemList::ElemDim();
  443. constexpr Integer KDIM0 = Kernel::SrcDim();
  444. constexpr Integer KDIM1 = Kernel::TrgDim();
  445. const Long Nelem = elem_lst.NElem();
  446. const Integer Ntrg = trg_nds.Dim(1);
  447. SCTL_ASSERT(trg_nds.Dim(0) == ElemDim);
  448. const Vector<CoordBasis>& X = elem_lst.ElemVector();
  449. Vector<CoordBasis> dX;
  450. CoordBasis::Grad(dX, X);
  451. Vector<Real> Xt, Xnt;
  452. { // Set Xt, Xnt
  453. auto Meval = CoordBasis::SetupEval(trg_nds);
  454. eval_basis(Xt, X, CoordDim, trg_nds.Dim(1), Meval);
  455. Xnt = Xt;
  456. Vector<Real> dX_;
  457. eval_basis(dX_, dX, 2*CoordDim, trg_nds.Dim(1), Meval);
  458. for (Long i = 0; i < Ntrg; i++) {
  459. for (Long j = 0; j < Nelem; j++) {
  460. auto Xn = Xnt.begin() + (j*Ntrg+i)*CoordDim;
  461. auto dX0 = dX_.begin() + (j*Ntrg+i)*2*CoordDim;
  462. StaticArray<Real,CoordDim> normal;
  463. normal[0] = dX0[2]*dX0[5] - dX0[4]*dX0[3];
  464. normal[1] = dX0[4]*dX0[1] - dX0[0]*dX0[5];
  465. normal[2] = dX0[0]*dX0[3] - dX0[2]*dX0[1];
  466. Real Xa = sctl::sqrt<Real>(normal[0]*normal[0]+normal[1]*normal[1]+normal[2]*normal[2]);
  467. Real invXa = 1/Xa;
  468. normal[0] *= invXa;
  469. normal[1] *= invXa;
  470. normal[2] *= invXa;
  471. Real sqrt_Xa = sqrt<Real>(Xa);
  472. Xn[0] = normal[0]*sqrt_Xa*Rqbx;
  473. Xn[1] = normal[1]*sqrt_Xa*Rqbx;
  474. Xn[2] = normal[2]*sqrt_Xa*Rqbx;
  475. }
  476. }
  477. }
  478. SCTL_ASSERT(Xt.Dim() == Nelem * Ntrg * CoordDim);
  479. auto& M = M_singular;
  480. M.ReInit(Nelem * KDIM0 * DensityBasis::Size(), KDIM1 * Ntrg);
  481. #pragma omp parallel for schedule(static)
  482. for (Long i = 0; i < Ntrg; i++) { // Set M (singular)
  483. Matrix<Real> quad_nds;
  484. Vector<Real> quad_wts;
  485. { // Set quad_nds, quad_wts
  486. StaticArray<Real,ElemDim> trg_node_;
  487. for (Integer k = 0; k < ElemDim; k++) {
  488. trg_node_[k] = trg_nds[k][i];
  489. }
  490. Vector<Real> trg_node(ElemDim, trg_node_, false);
  491. DuffyQuad<ElemDim>(quad_nds, quad_wts, trg_node, order_singular, fabs(Rqbx));
  492. }
  493. const CoordEvalOpType CoordEvalOp = CoordBasis::SetupEval(quad_nds);
  494. Integer Nnds = quad_wts.Dim();
  495. Vector<Real> X_, dX_, Xa_, Xn_;
  496. { // Set X_, dX_
  497. eval_basis(X_, X, CoordDim, Nnds, CoordEvalOp);
  498. eval_basis(dX_, dX, CoordDim * ElemDim, Nnds, CoordEvalOp);
  499. }
  500. if (CoordDim == 3 && ElemDim == 2) { // Compute Xa_, Xn_
  501. Long N = Nelem*Nnds;
  502. Xa_.ReInit(N);
  503. Xn_.ReInit(N*CoordDim);
  504. for (Long j = 0; j < N; j++) {
  505. StaticArray<Real,CoordDim> normal;
  506. normal[0] = dX_[j*6+2]*dX_[j*6+5] - dX_[j*6+4]*dX_[j*6+3];
  507. normal[1] = dX_[j*6+4]*dX_[j*6+1] - dX_[j*6+0]*dX_[j*6+5];
  508. normal[2] = dX_[j*6+0]*dX_[j*6+3] - dX_[j*6+2]*dX_[j*6+1];
  509. Xa_[j] = sctl::sqrt<Real>(normal[0]*normal[0]+normal[1]*normal[1]+normal[2]*normal[2]);
  510. Real invXa = 1/Xa_[j];
  511. Xn_[j*3+0] = normal[0] * invXa;
  512. Xn_[j*3+1] = normal[1] * invXa;
  513. Xn_[j*3+2] = normal[2] * invXa;
  514. }
  515. }
  516. DensityEvalOpType DensityEvalOp;
  517. if (std::is_same<CoordBasis,DensityBasis>::value) {
  518. DensityEvalOp = CoordEvalOp;
  519. } else {
  520. DensityEvalOp = DensityBasis::SetupEval(quad_nds);
  521. }
  522. for (Long j = 0; j < Nelem; j++) {
  523. Matrix<Real> M__(Nnds * KDIM0, KDIM1);
  524. if (Rqbx == 0) { // Set kernel matrix M__
  525. const Vector<Real> X0_(CoordDim, Xt.begin() + (j * Ntrg + i) * CoordDim, false);
  526. const Vector<Real> X__(Nnds * CoordDim, X_.begin() + j * Nnds * CoordDim, false);
  527. const Vector<Real> Xn__(Nnds * CoordDim, Xn_.begin() + j * Nnds * CoordDim, false);
  528. kernel.template KernelMatrix<Real>(M__, X0_, X__, Xn__);
  529. } else {
  530. Vector<Real> X0_(CoordDim);
  531. constexpr Integer qbx_order = 6;
  532. StaticArray<Matrix<Real>,qbx_order> M___;
  533. for (Integer k = 0; k < qbx_order; k++) { // Set kernel matrix M___
  534. for (Integer kk = 0; kk < CoordDim; kk++) X0_[kk] = Xt[(j * Ntrg + i) * CoordDim + kk] + (k+1) * Xnt[(j * Ntrg + i) * CoordDim + kk];
  535. const Vector<Real> X__(Nnds * CoordDim, X_.begin() + j * Nnds * CoordDim, false);
  536. const Vector<Real> Xn__(Nnds * CoordDim, Xn_.begin() + j * Nnds * CoordDim, false);
  537. kernel.template KernelMatrix<Real>(M___[k], X0_, X__, Xn__);
  538. }
  539. for (Long k = 0; k < Nnds * KDIM0 * KDIM1; k++) {
  540. M__[0][k] = 0;
  541. M__[0][k] += 6*M___[0][0][k];
  542. M__[0][k] += -15*M___[1][0][k];
  543. M__[0][k] += 20*M___[2][0][k];
  544. M__[0][k] += -15*M___[3][0][k];
  545. M__[0][k] += 6*M___[4][0][k];
  546. M__[0][k] += -1*M___[5][0][k];
  547. }
  548. }
  549. for (Long k0 = 0; k0 < KDIM0; k0++) {
  550. for (Long k1 = 0; k1 < KDIM1; k1++) {
  551. for (Long l = 0; l < DensityBasis::Size(); l++) {
  552. Real M_lk = 0;
  553. for (Long n = 0; n < Nnds; n++) {
  554. Real quad_wt = Xa_[j * Nnds + n] * quad_wts[n];
  555. M_lk += DensityEvalOp[l][n] * quad_wt * M__[n*KDIM0+k0][k1];
  556. }
  557. M[(j * KDIM0 + k0) * DensityBasis::Size() + l][k1 * Ntrg + i] = M_lk;
  558. }
  559. }
  560. }
  561. }
  562. }
  563. { // Set M (subtract direct)
  564. Matrix<Real> quad_nds;
  565. Vector<Real> quad_wts;
  566. TensorProductGaussQuad<ElemDim>(quad_nds, quad_wts, order_direct);
  567. const CoordEvalOpType CoordEvalOp = CoordBasis::SetupEval(quad_nds);
  568. Integer Nnds = quad_wts.Dim();
  569. Vector<Real> X_, dX_, Xa_, Xn_;
  570. { // Set X_, dX_
  571. eval_basis(X_, X, CoordDim, Nnds, CoordEvalOp);
  572. eval_basis(dX_, dX, CoordDim * ElemDim, Nnds, CoordEvalOp);
  573. }
  574. if (CoordDim == 3 && ElemDim == 2) { // Compute Xa_, Xn_
  575. Long N = Nelem*Nnds;
  576. Xa_.ReInit(N);
  577. Xn_.ReInit(N*CoordDim);
  578. for (Long j = 0; j < N; j++) {
  579. StaticArray<Real,CoordDim> normal;
  580. normal[0] = dX_[j*6+2]*dX_[j*6+5] - dX_[j*6+4]*dX_[j*6+3];
  581. normal[1] = dX_[j*6+4]*dX_[j*6+1] - dX_[j*6+0]*dX_[j*6+5];
  582. normal[2] = dX_[j*6+0]*dX_[j*6+3] - dX_[j*6+2]*dX_[j*6+1];
  583. Xa_[j] = sctl::sqrt<Real>(normal[0]*normal[0]+normal[1]*normal[1]+normal[2]*normal[2]);
  584. Real invXa = 1/Xa_[j];
  585. Xn_[j*3+0] = normal[0] * invXa;
  586. Xn_[j*3+1] = normal[1] * invXa;
  587. Xn_[j*3+2] = normal[2] * invXa;
  588. }
  589. }
  590. DensityEvalOpType DensityEvalOp;
  591. if (std::is_same<CoordBasis,DensityBasis>::value) {
  592. DensityEvalOp = CoordEvalOp;
  593. } else {
  594. DensityEvalOp = DensityBasis::SetupEval(quad_nds);
  595. }
  596. #pragma omp parallel for schedule(static)
  597. for (Long i = 0; i < Ntrg; i++) { // Subtract direct contribution
  598. for (Long j = 0; j < Nelem; j++) {
  599. Matrix<Real> M__(Nnds * KDIM0, KDIM1);
  600. { // Set kernel matrix M__
  601. const Vector<Real> X0_(CoordDim, (Iterator<Real>)Xt.begin() + (j * Ntrg + i) * CoordDim, false);
  602. const Vector<Real> X__(Nnds * CoordDim, X_.begin() + j * Nnds * CoordDim, false);
  603. const Vector<Real> Xn__(Nnds * CoordDim, Xn_.begin() + j * Nnds * CoordDim, false);
  604. kernel.template KernelMatrix<Real>(M__, X0_, X__, Xn__);
  605. }
  606. for (Long k0 = 0; k0 < KDIM0; k0++) {
  607. for (Long k1 = 0; k1 < KDIM1; k1++) {
  608. for (Long l = 0; l < DensityBasis::Size(); l++) {
  609. Real M_lk = 0;
  610. for (Long n = 0; n < Nnds; n++) {
  611. Real quad_wt = Xa_[j * Nnds + n] * quad_wts[n];
  612. M_lk += DensityEvalOp[l][n] * quad_wt * M__[n*KDIM0+k0][k1];
  613. }
  614. M[(j * KDIM0 + k0) * DensityBasis::Size() + l][k1 * Ntrg + i] -= M_lk;
  615. }
  616. }
  617. }
  618. }
  619. }
  620. }
  621. }
  622. template <class DensityBasis> static void EvalSingular(Matrix<Real>& U, const Vector<DensityBasis>& density, const Matrix<Real>& M, Integer KDIM0_, Integer KDIM1_) {
  623. if (M.Dim(0) == 0 || M.Dim(1) == 0) {
  624. U.ReInit(0,0);
  625. return;
  626. }
  627. const Long Ntrg = M.Dim(1) / KDIM1_;
  628. SCTL_ASSERT(M.Dim(1) == KDIM1_ * Ntrg);
  629. const Long Nelem = M.Dim(0) / (KDIM0_ * DensityBasis::Size());
  630. SCTL_ASSERT(M.Dim(0) == Nelem * KDIM0_ * DensityBasis::Size());
  631. const Integer dof = density.Dim() / (Nelem * KDIM0_);
  632. SCTL_ASSERT(density.Dim() == Nelem * dof * KDIM0_);
  633. if (U.Dim(0) != Nelem * dof * KDIM1_ || U.Dim(1) != Ntrg) {
  634. U.ReInit(Nelem * dof * KDIM1_, Ntrg);
  635. U = 0;
  636. }
  637. for (Long j = 0; j < Nelem; j++) {
  638. const Matrix<Real> M_(KDIM0_ * DensityBasis::Size(), KDIM1_ * Ntrg, (Iterator<Real>)M[j * KDIM0_ * DensityBasis::Size()], false);
  639. Matrix<Real> U_(dof, KDIM1_ * Ntrg, U[j*dof*KDIM1_], false);
  640. Matrix<Real> F_(dof, KDIM0_ * DensityBasis::Size());
  641. for (Long i = 0; i < dof; i++) {
  642. for (Long k = 0; k < KDIM0_; k++) {
  643. for (Long l = 0; l < DensityBasis::Size(); l++) {
  644. F_[i][k * DensityBasis::Size() + l] = density[(j * dof + i) * KDIM0_ + k][l];
  645. }
  646. }
  647. }
  648. Matrix<Real>::GEMM(U_, F_, M_);
  649. }
  650. }
  651. template <Integer DIM> struct PointData {
  652. bool operator<(const PointData& p) const {
  653. return mid < p.mid;
  654. }
  655. Long rank;
  656. Long surf_rank;
  657. Morton<DIM> mid;
  658. StaticArray<Real,DIM> coord;
  659. Real radius2;
  660. };
  661. template <class T1, class T2> struct Pair {
  662. Pair() {}
  663. Pair(T1 x, T2 y) : first(x), second(y) {}
  664. bool operator<(const Pair& p) const {
  665. return (first < p.first) || (((first == p.first) && (second < p.second)));
  666. }
  667. T1 first;
  668. T2 second;
  669. };
  670. template <class ElemList> static void BuildNbrList(Vector<Pair<Long,Long>>& pair_lst, const Vector<Real>& Xt, const Vector<Long>& trg_surf, const ElemList& elem_lst, Real distance_factor, Real period_length, const Comm& comm) {
  671. using CoordBasis = typename ElemList::CoordBasis;
  672. constexpr Integer CoordDim = ElemList::CoordDim();
  673. constexpr Integer ElemDim = ElemList::ElemDim();
  674. using PtData = PointData<CoordDim>;
  675. const Integer rank = comm.Rank();
  676. Real R0 = 0;
  677. StaticArray<Real,CoordDim> X0;
  678. { // Find bounding box
  679. Long N = Xt.Dim() / CoordDim;
  680. SCTL_ASSERT(Xt.Dim() == N * CoordDim);
  681. SCTL_ASSERT(N);
  682. StaticArray<Real,CoordDim*2> Xloc;
  683. StaticArray<Real,CoordDim*2> Xglb;
  684. for (Integer k = 0; k < CoordDim; k++) {
  685. Xloc[0*CoordDim+k] = Xt[k];
  686. Xloc[1*CoordDim+k] = Xt[k];
  687. }
  688. for (Long i = 0; i < N; i++) {
  689. for (Integer k = 0; k < CoordDim; k++) {
  690. Xloc[0*CoordDim+k] = std::min<Real>(Xloc[0*CoordDim+k], Xt[i*CoordDim+k]);
  691. Xloc[1*CoordDim+k] = std::max<Real>(Xloc[1*CoordDim+k], Xt[i*CoordDim+k]);
  692. }
  693. }
  694. comm.Allreduce((ConstIterator<Real>)Xloc+0*CoordDim, (Iterator<Real>)Xglb+0*CoordDim, CoordDim, Comm::CommOp::MIN);
  695. comm.Allreduce((ConstIterator<Real>)Xloc+1*CoordDim, (Iterator<Real>)Xglb+1*CoordDim, CoordDim, Comm::CommOp::MAX);
  696. for (Integer k = 0; k < CoordDim; k++) {
  697. R0 = std::max(R0, Xglb[1*CoordDim+k]-Xglb[0*CoordDim+k]);
  698. }
  699. R0 = R0 * 2.0;
  700. for (Integer k = 0; k < CoordDim; k++) {
  701. X0[k] = Xglb[k] - R0*0.25;
  702. }
  703. }
  704. if (period_length > 0) {
  705. R0 = period_length;
  706. }
  707. Vector<PtData> PtSrc, PtTrg;
  708. Integer order_upsample = (Integer)(const_pi<Real>() / distance_factor + 0.5);
  709. { // Set PtSrc
  710. const Vector<CoordBasis>& X_elem_lst = elem_lst.ElemVector();
  711. Vector<CoordBasis> dX_elem_lst;
  712. CoordBasis::Grad(dX_elem_lst, X_elem_lst);
  713. Matrix<Real> nds;
  714. Vector<Real> wts;
  715. TensorProductGaussQuad<ElemDim>(nds, wts, order_upsample);
  716. const Long Nnds = nds.Dim(1);
  717. Vector<Real> X, dX;
  718. const auto CoordEvalOp = CoordBasis::SetupEval(nds);
  719. eval_basis(X, X_elem_lst, CoordDim, Nnds, CoordEvalOp);
  720. eval_basis(dX, dX_elem_lst, CoordDim * ElemDim, Nnds, CoordEvalOp);
  721. const Long N = X.Dim() / CoordDim;
  722. const Long Nelem = elem_lst.NElem();
  723. SCTL_ASSERT(X.Dim() == N * CoordDim);
  724. SCTL_ASSERT(N == Nelem * Nnds);
  725. Long rank_offset, surf_rank_offset;
  726. { // Set rank_offset, surf_rank_offset
  727. comm.Scan(Ptr2ConstItr<Long>(&N,1), Ptr2Itr<Long>(&rank_offset,1), 1, Comm::CommOp::SUM);
  728. comm.Scan(Ptr2ConstItr<Long>(&Nelem,1), Ptr2Itr<Long>(&surf_rank_offset,1), 1, Comm::CommOp::SUM);
  729. surf_rank_offset -= Nelem;
  730. rank_offset -= N;
  731. }
  732. PtSrc.ReInit(N);
  733. const Real R0inv = 1.0 / R0;
  734. for (Long i = 0; i < N; i++) { // Set coord
  735. for (Integer k = 0; k < CoordDim; k++) {
  736. PtSrc[i].coord[k] = (X[i*CoordDim+k] - X0[k]) * R0inv;
  737. }
  738. }
  739. if (period_length > 0) { // Wrap-around coord
  740. for (Long i = 0; i < N; i++) {
  741. auto& x = PtSrc[i].coord;
  742. for (Integer k = 0; k < CoordDim; k++) {
  743. x[k] -= (Long)(x[k]);
  744. }
  745. }
  746. }
  747. for (Long i = 0; i < N; i++) { // Set radius2, mid, rank
  748. Integer depth = 0;
  749. { // Set radius2, depth
  750. Real radius2 = 0;
  751. for (Integer k0 = 0; k0 < ElemDim; k0++) {
  752. Real R2 = 0;
  753. for (Integer k1 = 0; k1 < CoordDim; k1++) {
  754. Real dX_ = dX[(i*CoordDim+k1)*ElemDim+k0];
  755. R2 += dX_*dX_;
  756. }
  757. radius2 = std::max(radius2, R2);
  758. }
  759. radius2 *= R0inv*R0inv * distance_factor*distance_factor;
  760. PtSrc[i].radius2 = radius2;
  761. Long Rinv = (Long)(1.0/radius2);
  762. while (Rinv > 0) {
  763. Rinv = (Rinv>>2);
  764. depth++;
  765. }
  766. }
  767. PtSrc[i].mid = Morton<CoordDim>((Iterator<Real>)PtSrc[i].coord, std::min(Morton<CoordDim>::MaxDepth(),depth));
  768. PtSrc[i].rank = rank_offset + i;
  769. }
  770. for (Long i = 0 ; i < Nelem; i++) { // Set surf_rank
  771. for (Long j = 0; j < Nnds; j++) {
  772. PtSrc[i*Nnds+j].surf_rank = surf_rank_offset + i;
  773. }
  774. }
  775. Vector<PtData> PtSrcSorted;
  776. comm.HyperQuickSort(PtSrc, PtSrcSorted);
  777. PtSrc.Swap(PtSrcSorted);
  778. }
  779. { // Set PtTrg
  780. const Long N = Xt.Dim() / CoordDim;
  781. SCTL_ASSERT(Xt.Dim() == N * CoordDim);
  782. Long rank_offset;
  783. { // Set rank_offset
  784. comm.Scan(Ptr2ConstItr<Long>(&N,1), Ptr2Itr<Long>(&rank_offset,1), 1, Comm::CommOp::SUM);
  785. rank_offset -= N;
  786. }
  787. PtTrg.ReInit(N);
  788. const Real R0inv = 1.0 / R0;
  789. for (Long i = 0; i < N; i++) { // Set coord
  790. for (Integer k = 0; k < CoordDim; k++) {
  791. PtTrg[i].coord[k] = (Xt[i*CoordDim+k] - X0[k]) * R0inv;
  792. }
  793. }
  794. if (period_length > 0) { // Wrap-around coord
  795. for (Long i = 0; i < N; i++) {
  796. auto& x = PtTrg[i].coord;
  797. for (Integer k = 0; k < CoordDim; k++) {
  798. x[k] -= (Long)(x[k]);
  799. }
  800. }
  801. }
  802. for (Long i = 0; i < N; i++) { // Set radius2, mid, rank
  803. PtTrg[i].radius2 = 0;
  804. PtTrg[i].mid = Morton<CoordDim>((Iterator<Real>)PtTrg[i].coord);
  805. PtTrg[i].rank = rank_offset + i;
  806. }
  807. if (trg_surf.Dim()) { // Set surf_rank
  808. SCTL_ASSERT(trg_surf.Dim() == N);
  809. for (Long i = 0; i < N; i++) {
  810. PtTrg[i].surf_rank = trg_surf[i];
  811. }
  812. } else {
  813. for (Long i = 0; i < N; i++) {
  814. PtTrg[i].surf_rank = -1;
  815. }
  816. }
  817. Vector<PtData> PtTrgSorted;
  818. comm.HyperQuickSort(PtTrg, PtTrgSorted);
  819. PtTrg.Swap(PtTrgSorted);
  820. }
  821. Tree<CoordDim> tree(comm);
  822. { // Init tree
  823. Vector<Real> Xall(PtSrc.Dim()+PtTrg.Dim());
  824. { // Set Xall
  825. Xall.ReInit((PtSrc.Dim()+PtTrg.Dim())*CoordDim);
  826. Long Nsrc = PtSrc.Dim();
  827. Long Ntrg = PtTrg.Dim();
  828. for (Long i = 0; i < Nsrc; i++) {
  829. for (Integer k = 0; k < CoordDim; k++) {
  830. Xall[i*CoordDim+k] = PtSrc[i].coord[k];
  831. }
  832. }
  833. for (Long i = 0; i < Ntrg; i++) {
  834. for (Integer k = 0; k < CoordDim; k++) {
  835. Xall[(Nsrc+i)*CoordDim+k] = PtTrg[i].coord[k];
  836. }
  837. }
  838. }
  839. tree.UpdateRefinement(Xall, 1000, true, period_length>0);
  840. }
  841. { // Repartition PtSrc, PtTrg
  842. PtData splitter;
  843. splitter.mid = tree.GetPartitionMID()[rank];
  844. comm.PartitionS(PtSrc, splitter);
  845. comm.PartitionS(PtTrg, splitter);
  846. }
  847. { // Add tree data PtSrc
  848. const auto& node_mid = tree.GetNodeMID();
  849. const Long N = node_mid.Dim();
  850. SCTL_ASSERT(N);
  851. Vector<Long> dsp(N), cnt(N);
  852. for (Long i = 0; i < N; i++) {
  853. PtData m0;
  854. m0.mid = node_mid[i];
  855. dsp[i] = std::lower_bound(PtSrc.begin(), PtSrc.end(), m0) - PtSrc.begin();
  856. }
  857. for (Long i = 0; i < N-1; i++) {
  858. cnt[i] = dsp[i+1] - dsp[i];
  859. }
  860. cnt[N-1] = PtSrc.Dim() - dsp[N-1];
  861. tree.AddData("PtSrc", PtSrc, cnt);
  862. }
  863. tree.template Broadcast<PtData>("PtSrc");
  864. { // Build pair_lst
  865. Vector<Long> cnt;
  866. Vector<PtData> PtSrc;
  867. tree.GetData(PtSrc, cnt, "PtSrc");
  868. const auto& node_mid = tree.GetNodeMID();
  869. const auto& node_attr = tree.GetNodeAttr();
  870. Vector<Morton<CoordDim>> nbr_mid_tmp;
  871. for (Long i = 0; i < node_mid.Dim(); i++) {
  872. if (node_attr[i].Leaf && !node_attr[i].Ghost) {
  873. Vector<Morton<CoordDim>> child_mid;
  874. node_mid[i].Children(child_mid);
  875. for (const auto& trg_mid : child_mid) {
  876. Integer d0 = trg_mid.Depth();
  877. Vector<PtData> Src, Trg;
  878. { // Set Trg
  879. PtData m0, m1;
  880. m0.mid = trg_mid;
  881. m1.mid = trg_mid.Next();
  882. Long a = std::lower_bound(PtTrg.begin(), PtTrg.end(), m0) - PtTrg.begin();
  883. Long b = std::lower_bound(PtTrg.begin(), PtTrg.end(), m1) - PtTrg.begin();
  884. Trg.ReInit(b-a, PtTrg.begin()+a, false);
  885. if (!Trg.Dim()) continue;
  886. }
  887. Vector<std::set<Long>> near_elem(Trg.Dim());
  888. for (Integer d = 0; d <= d0; d++) {
  889. trg_mid.NbrList(nbr_mid_tmp, d, period_length>0);
  890. for (const auto& src_mid : nbr_mid_tmp) { // Set Src
  891. PtData m0, m1;
  892. m0.mid = src_mid;
  893. m1.mid = (d==d0 ? src_mid.Next() : src_mid.Ancestor(d+1));
  894. Long a = std::lower_bound(PtSrc.begin(), PtSrc.end(), m0) - PtSrc.begin();
  895. Long b = std::lower_bound(PtSrc.begin(), PtSrc.end(), m1) - PtSrc.begin();
  896. Src.ReInit(b-a, PtSrc.begin()+a, false);
  897. if (!Src.Dim()) continue;
  898. for (Long t = 0; t < Trg.Dim(); t++) { // set near_elem[t] <-- {s : dist(s,t) < radius(s)}
  899. for (Long s = 0; s < Src.Dim(); s++) {
  900. if (Trg[t].surf_rank != Src[s].surf_rank) {
  901. Real R2 = 0;
  902. for (Integer k = 0; k < CoordDim; k++) {
  903. Real dx = (Src[s].coord[k] - Trg[t].coord[k]);
  904. R2 += dx * dx;
  905. }
  906. if (R2 < Src[s].radius2) {
  907. near_elem[t].insert(Src[s].surf_rank);
  908. }
  909. }
  910. }
  911. }
  912. }
  913. }
  914. for (Long t = 0; t < Trg.Dim(); t++) { // Set pair_lst
  915. for (Long elem_idx : near_elem[t]) {
  916. pair_lst.PushBack(Pair<Long,Long>(elem_idx,Trg[t].rank));
  917. }
  918. }
  919. }
  920. }
  921. }
  922. }
  923. { // Sort and repartition pair_lst
  924. Vector<Pair<Long,Long>> pair_lst_sorted;
  925. comm.HyperQuickSort(pair_lst, pair_lst_sorted);
  926. Long surf_rank_offset;
  927. const Long Nelem = elem_lst.NElem();
  928. comm.Scan(Ptr2ConstItr<Long>(&Nelem,1), Ptr2Itr<Long>(&surf_rank_offset,1), 1, Comm::CommOp::SUM);
  929. surf_rank_offset -= Nelem;
  930. comm.PartitionS(pair_lst_sorted, Pair<Long,Long>(surf_rank_offset,0));
  931. pair_lst.Swap(pair_lst_sorted);
  932. }
  933. }
  934. template <class ElemList> static void BuildNbrListDeprecated(Vector<Pair<Long,Long>>& pair_lst, const Vector<Real>& Xt, const ElemList& elem_lst, const Matrix<Real>& surf_nds, Real distance_factor) {
  935. using CoordBasis = typename ElemList::CoordBasis;
  936. constexpr Integer CoordDim = ElemList::CoordDim();
  937. constexpr Integer ElemDim = ElemList::ElemDim();
  938. const Long Nelem = elem_lst.NElem();
  939. const Long Ntrg = Xt.Dim() / CoordDim;
  940. SCTL_ASSERT(Xt.Dim() == Ntrg * CoordDim);
  941. Long Nnds, Nsurf_nds;
  942. Vector<Real> X_surf, X, dX;
  943. Integer order_upsample = (Integer)(const_pi<Real>() / distance_factor + 0.5);
  944. { // Set X, dX
  945. const Vector<CoordBasis>& X_elem_lst = elem_lst.ElemVector();
  946. Vector<CoordBasis> dX_elem_lst;
  947. CoordBasis::Grad(dX_elem_lst, X_elem_lst);
  948. Matrix<Real> nds_upsample;
  949. Vector<Real> wts_upsample;
  950. TensorProductGaussQuad<ElemDim>(nds_upsample, wts_upsample, order_upsample);
  951. Nnds = nds_upsample.Dim(1);
  952. const auto CoordEvalOp = CoordBasis::SetupEval(nds_upsample);
  953. eval_basis(X, X_elem_lst, CoordDim, nds_upsample.Dim(1), CoordEvalOp);
  954. eval_basis(dX, dX_elem_lst, CoordDim * ElemDim, nds_upsample.Dim(1), CoordEvalOp);
  955. Nsurf_nds = surf_nds.Dim(1);
  956. const auto CoordEvalOp_surf = CoordBasis::SetupEval(surf_nds);
  957. eval_basis(X_surf, X_elem_lst, CoordDim, Nsurf_nds, CoordEvalOp_surf);
  958. }
  959. Real d2 = distance_factor * distance_factor;
  960. for (Long i = 0; i < Nelem; i++) {
  961. std::set<Long> near_pts;
  962. std::set<Long> self_pts;
  963. for (Long j = 0; j < Nnds; j++) {
  964. Real R2_max = 0;
  965. StaticArray<Real, CoordDim> X0;
  966. for (Integer k = 0; k < CoordDim; k++) {
  967. X0[k] = X[(i*Nnds+j)*CoordDim+k];
  968. }
  969. for (Integer k0 = 0; k0 < ElemDim; k0++) {
  970. Real R2 = 0;
  971. for (Integer k1 = 0; k1 < CoordDim; k1++) {
  972. Real dX_ = dX[((i*Nnds+j)*CoordDim+k1)*ElemDim+k0];
  973. R2 += dX_*dX_;
  974. }
  975. R2_max = std::max(R2_max, R2*d2);
  976. }
  977. for (Long k = 0; k < Ntrg; k++) {
  978. Real R2 = 0;
  979. for (Integer l = 0; l < CoordDim; l++) {
  980. Real dX = Xt[k*CoordDim+l]- X0[l];
  981. R2 += dX * dX;
  982. }
  983. if (R2 < R2_max) near_pts.insert(k);
  984. }
  985. }
  986. for (Long j = 0; j < Nsurf_nds; j++) {
  987. StaticArray<Real, CoordDim> X0;
  988. for (Integer k = 0; k < CoordDim; k++) {
  989. X0[k] = X_surf[(i*Nsurf_nds+j)*CoordDim+k];
  990. }
  991. for (Long k = 0; k < Ntrg; k++) {
  992. Real R2 = 0;
  993. for (Integer l = 0; l < CoordDim; l++) {
  994. Real dX = Xt[k*CoordDim+l]- X0[l];
  995. R2 += dX * dX;
  996. }
  997. if (R2 == 0) self_pts.insert(k);
  998. }
  999. }
  1000. for (Long trg_idx : self_pts) {
  1001. near_pts.erase(trg_idx);
  1002. }
  1003. for (Long trg_idx : near_pts) {
  1004. pair_lst.PushBack(Pair<Long,Long>(i,trg_idx));
  1005. }
  1006. }
  1007. }
  1008. template <class DensityBasis, class ElemList, class Kernel> static void SetupNearSingular(Matrix<Real>& M_near_singular, Vector<Pair<Long,Long>>& pair_lst, const Vector<Real>& Xt_, const Vector<Long>& trg_surf, const ElemList& elem_lst, const Kernel& kernel, Integer order_singular, Integer order_direct, Real period_length, const Comm& comm) {
  1009. static_assert(std::is_same<Real,typename DensityBasis::ValueType>::value);
  1010. static_assert(std::is_same<Real,typename ElemList::CoordType>::value);
  1011. static_assert(DensityBasis::Dim() == ElemList::ElemDim());
  1012. using CoordBasis = typename ElemList::CoordBasis;
  1013. using CoordEvalOpType = typename CoordBasis::EvalOpType;
  1014. using DensityEvalOpType = typename DensityBasis::EvalOpType;
  1015. constexpr Integer CoordDim = ElemList::CoordDim();
  1016. constexpr Integer ElemDim = ElemList::ElemDim();
  1017. constexpr Integer KDIM0 = Kernel::SrcDim();
  1018. constexpr Integer KDIM1 = Kernel::TrgDim();
  1019. const Long Nelem = elem_lst.NElem();
  1020. BuildNbrList(pair_lst, Xt_, trg_surf, elem_lst, 2.5/order_direct, period_length, comm);
  1021. const Long Ninterac = pair_lst.Dim();
  1022. Vector<Real> Xt;
  1023. { // Set Xt
  1024. Integer rank = comm.Rank();
  1025. Integer np = comm.Size();
  1026. Vector<Long> splitter_ranks;
  1027. { // Set splitter_ranks
  1028. Vector<Long> cnt(np);
  1029. const Long N = Xt_.Dim() / CoordDim;
  1030. comm.Allgather(Ptr2ConstItr<Long>(&N,1), 1, cnt.begin(), 1);
  1031. scan(splitter_ranks, cnt);
  1032. }
  1033. Vector<Long> scatter_index, recv_index, recv_cnt(np), recv_dsp(np);
  1034. { // Set scatter_index, recv_index, recv_cnt, recv_dsp
  1035. { // Set scatter_index, recv_index
  1036. Vector<Pair<Long,Long>> scatter_pair(pair_lst.Dim());
  1037. for (Long i = 0; i < pair_lst.Dim(); i++) {
  1038. scatter_pair[i] = Pair<Long,Long>(pair_lst[i].second,i);
  1039. }
  1040. omp_par::merge_sort(scatter_pair.begin(), scatter_pair.end());
  1041. recv_index.ReInit(scatter_pair.Dim());
  1042. scatter_index.ReInit(scatter_pair.Dim());
  1043. for (Long i = 0; i < scatter_index.Dim(); i++) {
  1044. recv_index[i] = scatter_pair[i].first;
  1045. scatter_index[i] = scatter_pair[i].second;
  1046. }
  1047. }
  1048. for (Integer i = 0; i < np; i++) {
  1049. recv_dsp[i] = std::lower_bound(recv_index.begin(), recv_index.end(), splitter_ranks[i]) - recv_index.begin();
  1050. }
  1051. for (Integer i = 0; i < np-1; i++) {
  1052. recv_cnt[i] = recv_dsp[i+1] - recv_dsp[i];
  1053. }
  1054. recv_cnt[np-1] = recv_index.Dim() - recv_dsp[np-1];
  1055. }
  1056. Vector<Long> send_index, send_cnt(np), send_dsp(np);
  1057. { // Set send_index, send_cnt, send_dsp
  1058. comm.Alltoall(recv_cnt.begin(), 1, send_cnt.begin(), 1);
  1059. scan(send_dsp, send_cnt);
  1060. send_index.ReInit(send_cnt[np-1] + send_dsp[np-1]);
  1061. comm.Alltoallv(recv_index.begin(), recv_cnt.begin(), recv_dsp.begin(), send_index.begin(), send_cnt.begin(), send_dsp.begin());
  1062. }
  1063. Vector<Real> Xt_send(send_index.Dim() * CoordDim);
  1064. for (Long i = 0; i < send_index.Dim(); i++) { // Set Xt_send
  1065. Long idx = send_index[i] - splitter_ranks[rank];
  1066. for (Integer k = 0; k < CoordDim; k++) {
  1067. Xt_send[i*CoordDim+k] = Xt_[idx*CoordDim+k];
  1068. }
  1069. }
  1070. Vector<Real> Xt_recv(recv_index.Dim() * CoordDim);
  1071. { // Set Xt_recv
  1072. for (Long i = 0; i < np; i++) {
  1073. send_cnt[i] *= CoordDim;
  1074. send_dsp[i] *= CoordDim;
  1075. recv_cnt[i] *= CoordDim;
  1076. recv_dsp[i] *= CoordDim;
  1077. }
  1078. comm.Alltoallv(Xt_send.begin(), send_cnt.begin(), send_dsp.begin(), Xt_recv.begin(), recv_cnt.begin(), recv_dsp.begin());
  1079. }
  1080. Xt.ReInit(scatter_index.Dim() * CoordDim);
  1081. for (Long i = 0; i < scatter_index.Dim(); i++) { // Set Xt
  1082. Long idx = scatter_index[i];
  1083. for (Integer k = 0; k < CoordDim; k++) {
  1084. Xt[idx*CoordDim+k] = Xt_recv[i*CoordDim+k];
  1085. }
  1086. }
  1087. }
  1088. const Vector<CoordBasis>& X = elem_lst.ElemVector();
  1089. Vector<CoordBasis> dX;
  1090. CoordBasis::Grad(dX, X);
  1091. Long elem_rank_offset;
  1092. { // Set elem_rank_offset
  1093. comm.Scan(Ptr2ConstItr<Long>(&Nelem,1), Ptr2Itr<Long>(&elem_rank_offset,1), 1, Comm::CommOp::SUM);
  1094. elem_rank_offset -= Nelem;
  1095. }
  1096. auto& M = M_near_singular;
  1097. M.ReInit(Ninterac * KDIM0 * DensityBasis::Size(), KDIM1);
  1098. #pragma omp parallel for schedule(static)
  1099. for (Long j = 0; j < Ninterac; j++) { // Set M (near-singular)
  1100. const Long src_idx = pair_lst[j].first - elem_rank_offset;
  1101. Real adapt = -1.0;
  1102. Tensor<Real,true,ElemDim,1> u0;
  1103. { // Set u0 (project target point to the surface patch in parameter space)
  1104. ConstIterator<Real> Xt_ = Xt.begin() + j * CoordDim;
  1105. const auto& nodes = CoordBasis::Nodes();
  1106. Long min_idx = -1;
  1107. Real min_R2 = 1e10;
  1108. for (Long i = 0; i < CoordBasis::Size(); i++) {
  1109. Real R2 = 0;
  1110. for (Integer k = 0; k < CoordDim; k++) {
  1111. Real dX = X[src_idx * CoordDim + k][i] - Xt_[k];
  1112. R2 += dX * dX;
  1113. }
  1114. if (R2 < min_R2) {
  1115. min_R2 = R2;
  1116. min_idx = i;
  1117. }
  1118. }
  1119. SCTL_ASSERT(min_idx >= 0);
  1120. for (Integer k = 0; k < ElemDim; k++) {
  1121. u0(k,0) = nodes[k][min_idx];
  1122. }
  1123. for (Integer i = 0; i < 2; i++) { // iterate
  1124. Matrix<Real> X_, dX_;
  1125. for (Integer k = 0; k < ElemDim; k++) {
  1126. u0(k,0) = std::min<Real>(1.0, u0(k,0));
  1127. u0(k,0) = std::max<Real>(0.0, u0(k,0));
  1128. }
  1129. const auto eval_op = CoordBasis::SetupEval(Matrix<Real>(ElemDim,1,u0.begin(),false));
  1130. CoordBasis::Eval(X_, Vector<CoordBasis>(CoordDim,(Iterator<CoordBasis>)X.begin()+src_idx*CoordDim,false),eval_op);
  1131. CoordBasis::Eval(dX_, Vector<CoordBasis>(CoordDim*ElemDim,dX.begin()+src_idx*CoordDim*ElemDim,false),eval_op);
  1132. const Tensor<Real,false,CoordDim,1> x0((Iterator<Real>)Xt_);
  1133. const Tensor<Real,false,CoordDim,1> x(X_.begin());
  1134. const Tensor<Real,false,CoordDim,ElemDim> x_u(dX_.begin());
  1135. auto inv = [](const Tensor<Real,true,2,2>& M) {
  1136. Tensor<Real,true,2,2> Minv;
  1137. Real det_inv = 1.0 / (M(0,0)*M(1,1) - M(1,0)*M(0,1));
  1138. Minv(0,0) = M(1,1) * det_inv;
  1139. Minv(0,1) =-M(0,1) * det_inv;
  1140. Minv(1,0) =-M(1,0) * det_inv;
  1141. Minv(1,1) = M(0,0) * det_inv;
  1142. return Minv;
  1143. };
  1144. auto du = inv(x_u.RotateRight()*x_u) * x_u.RotateRight()*(x0-x);
  1145. u0 = u0 + du;
  1146. auto x_u_squared = x_u.RotateRight() * x_u;
  1147. adapt = sctl::sqrt<Real>( ((x0-x).RotateRight()*(x0-x))(0,0) / std::max<Real>(x_u_squared(0,0),x_u_squared(1,1)) );
  1148. }
  1149. }
  1150. Matrix<Real> quad_nds;
  1151. Vector<Real> quad_wts;
  1152. DuffyQuad<ElemDim>(quad_nds, quad_wts, Vector<Real>(ElemDim,u0.begin(),false), order_singular, adapt);
  1153. const CoordEvalOpType CoordEvalOp = CoordBasis::SetupEval(quad_nds);
  1154. Integer Nnds = quad_wts.Dim();
  1155. Vector<Real> X_, dX_, Xa_, Xn_;
  1156. { // Set X_, dX_
  1157. const Vector<CoordBasis> X__(CoordDim, (Iterator<CoordBasis>)X.begin() + src_idx * CoordDim, false);
  1158. const Vector<CoordBasis> dX__(CoordDim * ElemDim, (Iterator<CoordBasis>)dX.begin() + src_idx * CoordDim * ElemDim, false);
  1159. eval_basis(X_, X__, CoordDim, Nnds, CoordEvalOp);
  1160. eval_basis(dX_, dX__, CoordDim * ElemDim, Nnds, CoordEvalOp);
  1161. }
  1162. if (CoordDim == 3 && ElemDim == 2) { // Compute Xa_, Xn_
  1163. Xa_.ReInit(Nnds);
  1164. Xn_.ReInit(Nnds*CoordDim);
  1165. for (Long j = 0; j < Nnds; j++) {
  1166. StaticArray<Real,CoordDim> normal;
  1167. normal[0] = dX_[j*6+2]*dX_[j*6+5] - dX_[j*6+4]*dX_[j*6+3];
  1168. normal[1] = dX_[j*6+4]*dX_[j*6+1] - dX_[j*6+0]*dX_[j*6+5];
  1169. normal[2] = dX_[j*6+0]*dX_[j*6+3] - dX_[j*6+2]*dX_[j*6+1];
  1170. Xa_[j] = sctl::sqrt<Real>(normal[0]*normal[0]+normal[1]*normal[1]+normal[2]*normal[2]);
  1171. Real invXa = 1/Xa_[j];
  1172. Xn_[j*3+0] = normal[0] * invXa;
  1173. Xn_[j*3+1] = normal[1] * invXa;
  1174. Xn_[j*3+2] = normal[2] * invXa;
  1175. }
  1176. }
  1177. DensityEvalOpType DensityEvalOp;
  1178. if (std::is_same<CoordBasis,DensityBasis>::value) {
  1179. DensityEvalOp = CoordEvalOp;
  1180. } else {
  1181. DensityEvalOp = DensityBasis::SetupEval(quad_nds);
  1182. }
  1183. Matrix<Real> M__(Nnds * KDIM0, KDIM1);
  1184. { // Set kernel matrix M__
  1185. const Vector<Real> X0_(CoordDim, (Iterator<Real>)Xt.begin() + j * CoordDim, false);
  1186. kernel.template KernelMatrix<Real>(M__, X0_, X_, Xn_);
  1187. }
  1188. for (Long k0 = 0; k0 < KDIM0; k0++) {
  1189. for (Long k1 = 0; k1 < KDIM1; k1++) {
  1190. for (Long l = 0; l < DensityBasis::Size(); l++) {
  1191. Real M_lk = 0;
  1192. for (Long n = 0; n < Nnds; n++) {
  1193. Real quad_wt = Xa_[n] * quad_wts[n];
  1194. M_lk += DensityEvalOp[l][n] * quad_wt * M__[n*KDIM0+k0][k1];
  1195. }
  1196. M[(j * KDIM0 + k0) * DensityBasis::Size() + l][k1] = M_lk;
  1197. }
  1198. }
  1199. }
  1200. }
  1201. { // Set M (subtract direct)
  1202. Matrix<Real> quad_nds;
  1203. Vector<Real> quad_wts;
  1204. TensorProductGaussQuad<ElemDim>(quad_nds, quad_wts, order_direct);
  1205. const CoordEvalOpType CoordEvalOp = CoordBasis::SetupEval(quad_nds);
  1206. Integer Nnds = quad_wts.Dim();
  1207. Vector<Real> X_, dX_, Xa_, Xn_;
  1208. { // Set X_, dX_
  1209. eval_basis(X_, X, CoordDim, Nnds, CoordEvalOp);
  1210. eval_basis(dX_, dX, CoordDim * ElemDim, Nnds, CoordEvalOp);
  1211. }
  1212. if (CoordDim == 3 && ElemDim == 2) { // Compute Xa_, Xn_
  1213. Long N = Nelem*Nnds;
  1214. Xa_.ReInit(N);
  1215. Xn_.ReInit(N*CoordDim);
  1216. for (Long j = 0; j < N; j++) {
  1217. StaticArray<Real,CoordDim> normal;
  1218. normal[0] = dX_[j*6+2]*dX_[j*6+5] - dX_[j*6+4]*dX_[j*6+3];
  1219. normal[1] = dX_[j*6+4]*dX_[j*6+1] - dX_[j*6+0]*dX_[j*6+5];
  1220. normal[2] = dX_[j*6+0]*dX_[j*6+3] - dX_[j*6+2]*dX_[j*6+1];
  1221. Xa_[j] = sctl::sqrt<Real>(normal[0]*normal[0]+normal[1]*normal[1]+normal[2]*normal[2]);
  1222. Real invXa = 1/Xa_[j];
  1223. Xn_[j*3+0] = normal[0] * invXa;
  1224. Xn_[j*3+1] = normal[1] * invXa;
  1225. Xn_[j*3+2] = normal[2] * invXa;
  1226. }
  1227. }
  1228. DensityEvalOpType DensityEvalOp;
  1229. if (std::is_same<CoordBasis,DensityBasis>::value) {
  1230. DensityEvalOp = CoordEvalOp;
  1231. } else {
  1232. DensityEvalOp = DensityBasis::SetupEval(quad_nds);
  1233. }
  1234. #pragma omp parallel for schedule(static)
  1235. for (Long j = 0; j < Ninterac; j++) { // Subtract direct contribution
  1236. const Long src_idx = pair_lst[j].first - elem_rank_offset;
  1237. Matrix<Real> M__(Nnds * KDIM0, KDIM1);
  1238. { // Set kernel matrix M__
  1239. const Vector<Real> X0_(CoordDim, (Iterator<Real>)Xt.begin() + j * CoordDim, false);
  1240. Vector<Real> X__(Nnds * CoordDim, X_.begin() + src_idx * Nnds * CoordDim, false);
  1241. Vector<Real> Xn__(Nnds * CoordDim, Xn_.begin() + src_idx * Nnds * CoordDim, false);
  1242. kernel.template KernelMatrix<Real>(M__, X0_, X__, Xn__);
  1243. }
  1244. for (Long k0 = 0; k0 < KDIM0; k0++) {
  1245. for (Long k1 = 0; k1 < KDIM1; k1++) {
  1246. for (Long l = 0; l < DensityBasis::Size(); l++) {
  1247. Real M_lk = 0;
  1248. for (Long n = 0; n < Nnds; n++) {
  1249. Real quad_wt = Xa_[src_idx * Nnds + n] * quad_wts[n];
  1250. M_lk += DensityEvalOp[l][n] * quad_wt * M__[n*KDIM0+k0][k1];
  1251. }
  1252. M[(j * KDIM0 + k0) * DensityBasis::Size() + l][k1] -= M_lk;
  1253. }
  1254. }
  1255. }
  1256. }
  1257. }
  1258. }
  1259. template <class DensityBasis> static void EvalNearSingular(Vector<Real>& U, const Vector<DensityBasis>& density, const Matrix<Real>& M, const Vector<Pair<Long,Long>>& pair_lst, Long Nelem_, Long Ntrg_, Integer KDIM0_, Integer KDIM1_, const Comm& comm) {
  1260. const Long Ninterac = pair_lst.Dim();
  1261. const Integer dof = density.Dim() / Nelem_ / KDIM0_;
  1262. SCTL_ASSERT(density.Dim() == Nelem_ * dof * KDIM0_);
  1263. Long elem_rank_offset;
  1264. { // Set elem_rank_offset
  1265. comm.Scan(Ptr2ConstItr<Long>(&Nelem_,1), Ptr2Itr<Long>(&elem_rank_offset,1), 1, Comm::CommOp::SUM);
  1266. elem_rank_offset -= Nelem_;
  1267. }
  1268. Vector<Real> U_loc(Ninterac*dof*KDIM1_);
  1269. for (Long j = 0; j < Ninterac; j++) {
  1270. const Long src_idx = pair_lst[j].first - elem_rank_offset;
  1271. const Matrix<Real> M_(KDIM0_ * DensityBasis::Size(), KDIM1_, (Iterator<Real>)M[j * KDIM0_ * DensityBasis::Size()], false);
  1272. Matrix<Real> U_(dof, KDIM1_, U_loc.begin() + j*dof*KDIM1_, false);
  1273. Matrix<Real> F_(dof, KDIM0_ * DensityBasis::Size());
  1274. for (Long i = 0; i < dof; i++) {
  1275. for (Long k = 0; k < KDIM0_; k++) {
  1276. for (Long l = 0; l < DensityBasis::Size(); l++) {
  1277. F_[i][k * DensityBasis::Size() + l] = density[(src_idx * dof + i) * KDIM0_ + k][l];
  1278. }
  1279. }
  1280. }
  1281. Matrix<Real>::GEMM(U_, F_, M_);
  1282. }
  1283. if (U.Dim() != Ntrg_ * dof * KDIM1_) {
  1284. U.ReInit(Ntrg_ * dof * KDIM1_);
  1285. U = 0;
  1286. }
  1287. { // Set U
  1288. Integer rank = comm.Rank();
  1289. Integer np = comm.Size();
  1290. Vector<Long> splitter_ranks;
  1291. { // Set splitter_ranks
  1292. Vector<Long> cnt(np);
  1293. comm.Allgather(Ptr2ConstItr<Long>(&Ntrg_,1), 1, cnt.begin(), 1);
  1294. scan(splitter_ranks, cnt);
  1295. }
  1296. Vector<Long> scatter_index, send_index, send_cnt(np), send_dsp(np);
  1297. { // Set scatter_index, send_index, send_cnt, send_dsp
  1298. { // Set scatter_index, send_index
  1299. Vector<Pair<Long,Long>> scatter_pair(pair_lst.Dim());
  1300. for (Long i = 0; i < pair_lst.Dim(); i++) {
  1301. scatter_pair[i] = Pair<Long,Long>(pair_lst[i].second,i);
  1302. }
  1303. omp_par::merge_sort(scatter_pair.begin(), scatter_pair.end());
  1304. send_index.ReInit(scatter_pair.Dim());
  1305. scatter_index.ReInit(scatter_pair.Dim());
  1306. for (Long i = 0; i < scatter_index.Dim(); i++) {
  1307. send_index[i] = scatter_pair[i].first;
  1308. scatter_index[i] = scatter_pair[i].second;
  1309. }
  1310. }
  1311. for (Integer i = 0; i < np; i++) {
  1312. send_dsp[i] = std::lower_bound(send_index.begin(), send_index.end(), splitter_ranks[i]) - send_index.begin();
  1313. }
  1314. for (Integer i = 0; i < np-1; i++) {
  1315. send_cnt[i] = send_dsp[i+1] - send_dsp[i];
  1316. }
  1317. send_cnt[np-1] = send_index.Dim() - send_dsp[np-1];
  1318. }
  1319. Vector<Long> recv_index, recv_cnt(np), recv_dsp(np);
  1320. { // Set recv_index, recv_cnt, recv_dsp
  1321. comm.Alltoall(send_cnt.begin(), 1, recv_cnt.begin(), 1);
  1322. scan(recv_dsp, recv_cnt);
  1323. recv_index.ReInit(recv_cnt[np-1] + recv_dsp[np-1]);
  1324. comm.Alltoallv(send_index.begin(), send_cnt.begin(), send_dsp.begin(), recv_index.begin(), recv_cnt.begin(), recv_dsp.begin());
  1325. }
  1326. Vector<Real> U_send(scatter_index.Dim() * dof * KDIM1_);
  1327. for (Long i = 0; i < scatter_index.Dim(); i++) {
  1328. Long idx = scatter_index[i]*dof*KDIM1_;
  1329. for (Long k = 0; k < dof * KDIM1_; k++) {
  1330. U_send[i*dof*KDIM1_ + k] = U_loc[idx + k];
  1331. }
  1332. }
  1333. Vector<Real> U_recv(recv_index.Dim() * dof * KDIM1_);
  1334. { // Set U_recv
  1335. for (Long i = 0; i < np; i++) {
  1336. send_cnt[i] *= dof * KDIM1_;
  1337. send_dsp[i] *= dof * KDIM1_;
  1338. recv_cnt[i] *= dof * KDIM1_;
  1339. recv_dsp[i] *= dof * KDIM1_;
  1340. }
  1341. comm.Alltoallv(U_send.begin(), send_cnt.begin(), send_dsp.begin(), U_recv.begin(), recv_cnt.begin(), recv_dsp.begin());
  1342. }
  1343. for (Long i = 0; i < recv_index.Dim(); i++) { // Set U
  1344. Long idx = (recv_index[i] - splitter_ranks[rank]) * dof * KDIM1_;
  1345. for (Integer k = 0; k < dof * KDIM1_; k++) {
  1346. U[idx + k] += U_recv[i*dof*KDIM1_ + k];
  1347. }
  1348. }
  1349. }
  1350. }
  1351. template <class ElemList, class DensityBasis, class Kernel> static void Direct(Vector<Real>& U, const Vector<Real>& Xt, const ElemList& elem_lst, const Vector<DensityBasis>& density, const Kernel& kernel, Integer order_direct, const Comm& comm) {
  1352. using CoordBasis = typename ElemList::CoordBasis;
  1353. using CoordEvalOpType = typename CoordBasis::EvalOpType;
  1354. using DensityEvalOpType = typename DensityBasis::EvalOpType;
  1355. constexpr Integer CoordDim = ElemList::CoordDim();
  1356. constexpr Integer ElemDim = ElemList::ElemDim();
  1357. constexpr Integer KDIM0 = Kernel::SrcDim();
  1358. constexpr Integer KDIM1 = Kernel::TrgDim();
  1359. const Long Nelem = elem_lst.NElem();
  1360. const Integer dof = density.Dim() / Nelem / KDIM0;
  1361. SCTL_ASSERT(density.Dim() == Nelem * dof * KDIM0);
  1362. Matrix<Real> quad_nds;
  1363. Vector<Real> quad_wts;
  1364. TensorProductGaussQuad<ElemDim>(quad_nds, quad_wts, order_direct);
  1365. const CoordEvalOpType CoordEvalOp = CoordBasis::SetupEval(quad_nds);
  1366. Integer Nnds = quad_wts.Dim();
  1367. const Vector<CoordBasis>& X = elem_lst.ElemVector();
  1368. Vector<CoordBasis> dX;
  1369. CoordBasis::Grad(dX, X);
  1370. Vector<Real> X_, dX_, Xa_, Xn_;
  1371. eval_basis(X_, X, CoordDim, Nnds, CoordEvalOp);
  1372. eval_basis(dX_, dX, CoordDim*ElemDim, Nnds, CoordEvalOp);
  1373. if (CoordDim == 3 && ElemDim == 2) { // Compute Xa_, Xn_
  1374. Long N = Nelem*Nnds;
  1375. Xa_.ReInit(N);
  1376. Xn_.ReInit(N*CoordDim);
  1377. for (Long j = 0; j < N; j++) {
  1378. StaticArray<Real,CoordDim> normal;
  1379. normal[0] = dX_[j*6+2]*dX_[j*6+5] - dX_[j*6+4]*dX_[j*6+3];
  1380. normal[1] = dX_[j*6+4]*dX_[j*6+1] - dX_[j*6+0]*dX_[j*6+5];
  1381. normal[2] = dX_[j*6+0]*dX_[j*6+3] - dX_[j*6+2]*dX_[j*6+1];
  1382. Xa_[j] = sctl::sqrt<Real>(normal[0]*normal[0]+normal[1]*normal[1]+normal[2]*normal[2]);
  1383. Real invXa = 1/Xa_[j];
  1384. Xn_[j*3+0] = normal[0] * invXa;
  1385. Xn_[j*3+1] = normal[1] * invXa;
  1386. Xn_[j*3+2] = normal[2] * invXa;
  1387. }
  1388. }
  1389. Vector<Real> Fa_;
  1390. { // Set Fa_
  1391. Vector<Real> F_;
  1392. if (std::is_same<CoordBasis,DensityBasis>::value) {
  1393. eval_basis(F_, density, dof * KDIM0, Nnds, CoordEvalOp);
  1394. } else {
  1395. const DensityEvalOpType EvalOp = DensityBasis::SetupEval(quad_nds);
  1396. eval_basis(F_, density, dof * KDIM0, Nnds, EvalOp);
  1397. }
  1398. Fa_.ReInit(F_.Dim());
  1399. const Integer DensityDOF = dof * KDIM0;
  1400. SCTL_ASSERT(F_.Dim() == Nelem * Nnds * DensityDOF);
  1401. for (Long j = 0; j < Nelem; j++) {
  1402. for (Integer k = 0; k < Nnds; k++) {
  1403. Long idx = j * Nnds + k;
  1404. Real quad_wt = Xa_[idx] * quad_wts[k];
  1405. for (Integer l = 0; l < DensityDOF; l++) {
  1406. Fa_[idx * DensityDOF + l] = F_[idx * DensityDOF + l] * quad_wt;
  1407. }
  1408. }
  1409. }
  1410. }
  1411. { // Evaluate potential
  1412. const Long Ntrg = Xt.Dim() / CoordDim;
  1413. SCTL_ASSERT(Xt.Dim() == Ntrg * CoordDim);
  1414. if (U.Dim() != Ntrg * dof * KDIM1) {
  1415. U.ReInit(Ntrg * dof * KDIM1);
  1416. U = 0;
  1417. }
  1418. ParticleFMM<Real,CoordDim>::Eval(U, Xt, X_, Xn_, Fa_, kernel, comm);
  1419. }
  1420. }
  1421. public:
  1422. template <class DensityBasis, class ElemList, class Kernel> void Setup(const ElemList& elem_lst, const Vector<Real>& Xt, const Kernel& kernel, Integer order_singular, Integer order_direct, Real period_length, const Comm& comm) {
  1423. Xt_.ReInit(0);
  1424. M_singular.ReInit(0,0);
  1425. M_near_singular.ReInit(0,0);
  1426. pair_lst.ReInit(0);
  1427. order_direct_ = order_direct;
  1428. period_length_ = period_length;
  1429. comm_ = comm;
  1430. Profile::Tic("Setup", &comm_);
  1431. static_assert(std::is_same<Real,typename DensityBasis::ValueType>::value);
  1432. static_assert(std::is_same<Real,typename ElemList::CoordType>::value);
  1433. static_assert(DensityBasis::Dim() == ElemList::ElemDim());
  1434. Xt_ = Xt;
  1435. M_singular.ReInit(0,0);
  1436. Profile::Tic("SetupNearSingular", &comm_);
  1437. SetupNearSingular<DensityBasis>(M_near_singular, pair_lst, Xt_, Vector<Long>(), elem_lst, kernel, order_singular, order_direct_, period_length_, comm_);
  1438. Profile::Toc();
  1439. Profile::Toc();
  1440. }
  1441. template <class DensityBasis, class PotentialBasis, class ElemList, class Kernel> void Setup(const ElemList& elem_lst, const Kernel& kernel, Integer order_singular, Integer order_direct, Real period_length, const Comm& comm, Real Rqbx = 0) {
  1442. Xt_.ReInit(0);
  1443. M_singular.ReInit(0,0);
  1444. M_near_singular.ReInit(0,0);
  1445. pair_lst.ReInit(0);
  1446. order_direct_ = order_direct;
  1447. period_length_ = period_length;
  1448. comm_ = comm;
  1449. Profile::Tic("Setup", &comm_);
  1450. static_assert(std::is_same<Real,typename PotentialBasis::ValueType>::value);
  1451. static_assert(std::is_same<Real,typename DensityBasis::ValueType>::value);
  1452. static_assert(std::is_same<Real,typename ElemList::CoordType>::value);
  1453. static_assert(PotentialBasis::Dim() == ElemList::ElemDim());
  1454. static_assert(DensityBasis::Dim() == ElemList::ElemDim());
  1455. Vector<Long> trg_surf;
  1456. { // Set Xt_
  1457. using CoordBasis = typename ElemList::CoordBasis;
  1458. Matrix<Real> trg_nds = PotentialBasis::Nodes();
  1459. auto Meval = CoordBasis::SetupEval(trg_nds);
  1460. eval_basis(Xt_, elem_lst.ElemVector(), ElemList::CoordDim(), trg_nds.Dim(1), Meval);
  1461. { // Set trg_surf
  1462. const Long Nelem = elem_lst.NElem();
  1463. const Long Nnds = trg_nds.Dim(1);
  1464. Long elem_offset;
  1465. { // Set elem_offset
  1466. comm.Scan(Ptr2ConstItr<Long>(&Nelem,1), Ptr2Itr<Long>(&elem_offset,1), 1, Comm::CommOp::SUM);
  1467. elem_offset -= Nelem;
  1468. }
  1469. trg_surf.ReInit(elem_lst.NElem() * trg_nds.Dim(1));
  1470. for (Long i = 0; i < Nelem; i++) {
  1471. for (Long j = 0; j < Nnds; j++) {
  1472. trg_surf[i*Nnds+j] = elem_offset + i;
  1473. }
  1474. }
  1475. }
  1476. }
  1477. Profile::Tic("SetupSingular", &comm_);
  1478. SetupSingular<DensityBasis>(M_singular, PotentialBasis::Nodes(), elem_lst, kernel, order_singular, order_direct_, Rqbx);
  1479. Profile::Toc();
  1480. Profile::Tic("SetupNearSingular", &comm_);
  1481. SetupNearSingular<DensityBasis>(M_near_singular, pair_lst, Xt_, trg_surf, elem_lst, kernel, order_singular, order_direct_, period_length_, comm_);
  1482. Profile::Toc();
  1483. Profile::Toc();
  1484. }
  1485. template <class DensityBasis, class PotentialBasis, class ElemList, class Kernel> void Eval(Vector<PotentialBasis>& U, const ElemList& elements, const Vector<DensityBasis>& F, const Kernel& kernel) {
  1486. Profile::Tic("Eval", &comm_);
  1487. Matrix<Real> U_singular;
  1488. Vector<Real> U_direct, U_near_sing;
  1489. Profile::Tic("EvalDirect", &comm_);
  1490. Direct(U_direct, Xt_, elements, F, kernel, order_direct_, comm_);
  1491. Profile::Toc();
  1492. Profile::Tic("EvalSingular", &comm_);
  1493. EvalSingular(U_singular, F, M_singular, kernel.SrcDim(), kernel.TrgDim());
  1494. Profile::Toc();
  1495. Profile::Tic("EvalNearSingular", &comm_);
  1496. EvalNearSingular(U_near_sing, F, M_near_singular, pair_lst, elements.NElem(), Xt_.Dim() / ElemList::CoordDim(), kernel.SrcDim(), kernel.TrgDim(), comm_);
  1497. SCTL_ASSERT(U_near_sing.Dim() == U_direct.Dim());
  1498. Profile::Toc();
  1499. const Long dof = U_direct.Dim() / (elements.NElem() * PotentialBasis::Size() * kernel.TrgDim());
  1500. SCTL_ASSERT(U_direct .Dim() == elements.NElem() * PotentialBasis::Size() * dof * kernel.TrgDim());
  1501. SCTL_ASSERT(U_near_sing.Dim() == elements.NElem() * PotentialBasis::Size() * dof * kernel.TrgDim());
  1502. if (U.Dim() != elements.NElem() * dof * kernel.TrgDim()) {
  1503. U.ReInit(elements.NElem() * dof * kernel.TrgDim());
  1504. }
  1505. for (int i = 0; i < elements.NElem(); i++) {
  1506. for (int j = 0; j < PotentialBasis::Size(); j++) {
  1507. for (int k = 0; k < dof*kernel.TrgDim(); k++) {
  1508. Real& U_ = U[i*dof*kernel.TrgDim()+k][j];
  1509. U_ = 0;
  1510. U_ += U_direct [(i*PotentialBasis::Size()+j)*dof*kernel.TrgDim()+k];
  1511. U_ += U_near_sing[(i*PotentialBasis::Size()+j)*dof*kernel.TrgDim()+k];
  1512. U_ *= kernel.template ScaleFactor<Real>();
  1513. }
  1514. }
  1515. }
  1516. if (U_singular.Dim(1)) {
  1517. SCTL_ASSERT(U_singular.Dim(0) == elements.NElem() * dof * kernel.TrgDim());
  1518. SCTL_ASSERT(U_singular.Dim(1) == PotentialBasis::Size());
  1519. for (int i = 0; i < elements.NElem(); i++) {
  1520. for (int j = 0; j < PotentialBasis::Size(); j++) {
  1521. for (int k = 0; k < dof*kernel.TrgDim(); k++) {
  1522. U[i*dof*kernel.TrgDim()+k][j] += U_singular[i*dof*kernel.TrgDim()+k][j] * kernel.template ScaleFactor<Real>();
  1523. }
  1524. }
  1525. }
  1526. }
  1527. Profile::Toc();
  1528. }
  1529. template <class DensityBasis, class ElemList, class Kernel> void Eval(Vector<Real>& U, const ElemList& elements, const Vector<DensityBasis>& F, const Kernel& kernel) {
  1530. Profile::Tic("Eval", &comm_);
  1531. Matrix<Real> U_singular;
  1532. Vector<Real> U_direct, U_near_sing;
  1533. Profile::Tic("EvalDirect", &comm_);
  1534. Direct(U_direct, Xt_, elements, F, kernel, order_direct_, comm_);
  1535. Profile::Toc();
  1536. Profile::Tic("EvalSingular", &comm_);
  1537. EvalSingular(U_singular, F, M_singular, kernel.SrcDim(), kernel.TrgDim());
  1538. Profile::Toc();
  1539. Profile::Tic("EvalNearSingular", &comm_);
  1540. EvalNearSingular(U_near_sing, F, M_near_singular, pair_lst, elements.NElem(), Xt_.Dim() / ElemList::CoordDim(), kernel.SrcDim(), kernel.TrgDim(), comm_);
  1541. SCTL_ASSERT(U_near_sing.Dim() == U_direct.Dim());
  1542. Profile::Toc();
  1543. Long Nt = Xt_.Dim() / ElemList::CoordDim();
  1544. const Long dof = U_direct.Dim() / (Nt * kernel.TrgDim());
  1545. SCTL_ASSERT(U_direct.Dim() == Nt * dof * kernel.TrgDim());
  1546. if (U.Dim() != U_direct.Dim()) {
  1547. U.ReInit(U_direct.Dim());
  1548. }
  1549. for (int i = 0; i < U.Dim(); i++) {
  1550. U[i] = (U_direct[i] + U_near_sing[i]) * kernel.template ScaleFactor<Real>();
  1551. }
  1552. if (U_singular.Dim(1)) {
  1553. SCTL_ASSERT(U_singular.Dim(0) == elements.NElem() * dof * kernel.TrgDim());
  1554. const Long Nnodes = U_singular.Dim(1);
  1555. for (int i = 0; i < elements.NElem(); i++) {
  1556. for (int j = 0; j < Nnodes; j++) {
  1557. for (int k = 0; k < dof*kernel.TrgDim(); k++) {
  1558. Real& U_ = U[(i*Nnodes+j)*dof*kernel.TrgDim()+k];
  1559. U_ += U_singular[i*dof*kernel.TrgDim()+k][j] * kernel.template ScaleFactor<Real>();
  1560. }
  1561. }
  1562. }
  1563. }
  1564. Profile::Toc();
  1565. }
  1566. template <Integer ORDER = 5> static void test(Integer order_singular = 10, Integer order_direct = 5, const Comm& comm = Comm::World()) {
  1567. constexpr Integer COORD_DIM = 3;
  1568. constexpr Integer ELEM_DIM = COORD_DIM-1;
  1569. using ElemList = ElemList<COORD_DIM, Basis<Real, ELEM_DIM, ORDER>>;
  1570. using DensityBasis = Basis<Real, ELEM_DIM, ORDER>;
  1571. using PotentialBasis = Basis<Real, ELEM_DIM, ORDER>;
  1572. int np = comm.Size();
  1573. int rank = comm.Rank();
  1574. auto build_torus = [rank,np](ElemList& elements, long Nt, long Np, Real Rmajor, Real Rminor){
  1575. auto nodes = ElemList::CoordBasis::Nodes();
  1576. auto torus = [](Real theta, Real phi, Real Rmajor, Real Rminor) {
  1577. Real R = Rmajor + Rminor * cos<Real>(phi);
  1578. Real X = R * cos<Real>(theta);
  1579. Real Y = R * sin<Real>(theta);
  1580. Real Z = Rminor * sin<Real>(phi);
  1581. return std::make_tuple(X,Y,Z);
  1582. };
  1583. long start = Nt*Np*(rank+0)/np;
  1584. long end = Nt*Np*(rank+1)/np;
  1585. elements.ReInit(end - start);
  1586. for (long ii = start; ii < end; ii++) {
  1587. long i = ii / Np;
  1588. long j = ii % Np;
  1589. for (int k = 0; k < ElemList::CoordBasis::Size(); k++) {
  1590. Real X, Y, Z;
  1591. Real theta = 2 * const_pi<Real>() * (i + nodes[0][k]) / Nt;
  1592. Real phi = 2 * const_pi<Real>() * (j + nodes[1][k]) / Np;
  1593. std::tie(X,Y,Z) = torus(theta, phi, Rmajor, Rminor);
  1594. elements(ii-start,0)[k] = X;
  1595. elements(ii-start,1)[k] = Y;
  1596. elements(ii-start,2)[k] = Z;
  1597. }
  1598. }
  1599. };
  1600. ElemList elements_src, elements_trg;
  1601. build_torus(elements_src, 28, 16, 2, 1.0);
  1602. build_torus(elements_trg, 29, 17, 2, 0.99);
  1603. Vector<Real> Xt;
  1604. Vector<PotentialBasis> U_onsurf, U_offsurf;
  1605. Vector<DensityBasis> density_sl, density_dl;
  1606. { // Set Xt, elements_src, elements_trg, density_sl, density_dl, U
  1607. Real X0[COORD_DIM] = {3,2,1};
  1608. std::function<void(Real*,Real*,Real*)> potential = [X0](Real* U, Real* X, Real* Xn) {
  1609. Real dX[COORD_DIM] = {X[0]-X0[0],X[1]-X0[1],X[2]-X0[2]};
  1610. Real Rinv = 1/sqrt(dX[0]*dX[0]+dX[1]*dX[1]+dX[2]*dX[2]);
  1611. U[0] = Rinv;
  1612. };
  1613. std::function<void(Real*,Real*,Real*)> potential_normal_derivative = [X0](Real* U, Real* X, Real* Xn) {
  1614. Real dX[COORD_DIM] = {X[0]-X0[0],X[1]-X0[1],X[2]-X0[2]};
  1615. Real Rinv = 1/sqrt(dX[0]*dX[0]+dX[1]*dX[1]+dX[2]*dX[2]);
  1616. Real RdotN = dX[0]*Xn[0]+dX[1]*Xn[1]+dX[2]*Xn[2];
  1617. U[0] = -RdotN * Rinv*Rinv*Rinv;
  1618. };
  1619. DiscretizeSurfaceFn<COORD_DIM,1>(density_sl, elements_src, potential_normal_derivative);
  1620. DiscretizeSurfaceFn<COORD_DIM,1>(density_dl, elements_src, potential);
  1621. DiscretizeSurfaceFn<COORD_DIM,1>(U_onsurf , elements_src, potential);
  1622. DiscretizeSurfaceFn<COORD_DIM,1>(U_offsurf , elements_trg, potential);
  1623. for (long i = 0; i < elements_trg.NElem(); i++) { // Set Xt
  1624. for (long j = 0; j < PotentialBasis::Size(); j++) {
  1625. for (int k = 0; k < COORD_DIM; k++) {
  1626. Xt.PushBack(elements_trg(i,k)[j]);
  1627. }
  1628. }
  1629. }
  1630. }
  1631. GenericKernel<Laplace3D_DxU> Laplace_DxU;
  1632. GenericKernel<Laplace3D_FxU> Laplace_FxU;
  1633. Profile::Enable(true);
  1634. if (1) { // Greeen's identity test (Laplace, on-surface)
  1635. Profile::Tic("OnSurface", &comm);
  1636. Quadrature<Real> quadrature_DxU, quadrature_FxU;
  1637. quadrature_FxU.Setup<DensityBasis, PotentialBasis>(elements_src, Laplace_FxU, order_singular, order_direct, -1.0, comm);
  1638. quadrature_DxU.Setup<DensityBasis, PotentialBasis>(elements_src, Laplace_DxU, order_singular, order_direct, -1.0, comm);
  1639. Vector<PotentialBasis> U_sl, U_dl;
  1640. quadrature_FxU.Eval(U_sl, elements_src, density_sl, Laplace_FxU);
  1641. quadrature_DxU.Eval(U_dl, elements_src, density_dl, Laplace_DxU);
  1642. Profile::Toc();
  1643. Real max_err = 0;
  1644. Vector<PotentialBasis> err(U_onsurf.Dim());
  1645. for (long i = 0; i < U_sl.Dim(); i++) {
  1646. for (long j = 0; j < PotentialBasis::Size(); j++) {
  1647. err[i][j] = 0.5*U_onsurf[i][j] - (U_sl[i][j] + U_dl[i][j]);
  1648. max_err = std::max<Real>(max_err, fabs(err[i][j]));
  1649. }
  1650. }
  1651. { // Print error
  1652. Real glb_err;
  1653. comm.Allreduce(Ptr2ConstItr<Real>(&max_err,1), Ptr2Itr<Real>(&glb_err,1), 1, Comm::CommOp::MAX);
  1654. if (!comm.Rank()) std::cout<<"Error = "<<glb_err<<'\n';
  1655. }
  1656. { // Write VTK output
  1657. VTUData vtu;
  1658. vtu.AddElems(elements_src, err, ORDER);
  1659. vtu.WriteVTK("err", comm);
  1660. }
  1661. { // Write VTK output
  1662. VTUData vtu;
  1663. vtu.AddElems(elements_src, U_onsurf, ORDER);
  1664. vtu.WriteVTK("U", comm);
  1665. }
  1666. }
  1667. if (1) { // Greeen's identity test (Laplace, off-surface)
  1668. Profile::Tic("OffSurface", &comm);
  1669. Quadrature<Real> quadrature_DxU, quadrature_FxU;
  1670. quadrature_FxU.Setup<DensityBasis>(elements_src, Xt, Laplace_FxU, order_singular, order_direct, -1.0, comm);
  1671. quadrature_DxU.Setup<DensityBasis>(elements_src, Xt, Laplace_DxU, order_singular, order_direct, -1.0, comm);
  1672. Vector<Real> U_sl, U_dl;
  1673. quadrature_FxU.Eval(U_sl, elements_src, density_sl, Laplace_FxU);
  1674. quadrature_DxU.Eval(U_dl, elements_src, density_dl, Laplace_DxU);
  1675. Profile::Toc();
  1676. Real max_err = 0;
  1677. Vector<PotentialBasis> err(elements_trg.NElem());
  1678. for (long i = 0; i < elements_trg.NElem(); i++) {
  1679. for (long j = 0; j < PotentialBasis::Size(); j++) {
  1680. err[i][j] = U_offsurf[i][j] - (U_sl[i*PotentialBasis::Size()+j] + U_dl[i*PotentialBasis::Size()+j]);
  1681. max_err = std::max<Real>(max_err, fabs(err[i][j]));
  1682. }
  1683. }
  1684. { // Print error
  1685. Real glb_err;
  1686. comm.Allreduce(Ptr2ConstItr<Real>(&max_err,1), Ptr2Itr<Real>(&glb_err,1), 1, Comm::CommOp::MAX);
  1687. if (!comm.Rank()) std::cout<<"Error = "<<glb_err<<'\n';
  1688. }
  1689. { // Write VTK output
  1690. VTUData vtu;
  1691. vtu.AddElems(elements_trg, err, ORDER);
  1692. vtu.WriteVTK("err", comm);
  1693. }
  1694. { // Write VTK output
  1695. VTUData vtu;
  1696. vtu.AddElems(elements_trg, U_offsurf, ORDER);
  1697. vtu.WriteVTK("U", comm);
  1698. }
  1699. }
  1700. Profile::print(&comm);
  1701. }
  1702. static void test1() {
  1703. const Comm& comm = Comm::World();
  1704. constexpr Integer ORDER = 15;
  1705. Integer order_singular = 20;
  1706. Integer order_direct = 20;
  1707. constexpr Integer COORD_DIM = 3;
  1708. constexpr Integer ELEM_DIM = COORD_DIM-1;
  1709. using ElemList = ElemList<COORD_DIM, Basis<Real, ELEM_DIM, ORDER>>;
  1710. using DensityBasis = Basis<Real, ELEM_DIM, ORDER>;
  1711. using PotentialBasis = Basis<Real, ELEM_DIM, ORDER>;
  1712. int np = comm.Size();
  1713. int rank = comm.Rank();
  1714. auto build_sphere = [rank,np](ElemList& elements, Real X, Real Y, Real Z, Real R){
  1715. auto nodes = ElemList::CoordBasis::Nodes();
  1716. long start = 2*COORD_DIM*(rank+0)/np;
  1717. long end = 2*COORD_DIM*(rank+1)/np;
  1718. elements.ReInit(end - start);
  1719. for (long ii = start; ii < end; ii++) {
  1720. long i = ii / 2;
  1721. long j = ii % 2;
  1722. for (int k = 0; k < ElemList::CoordBasis::Size(); k++) {
  1723. Real coord[COORD_DIM];
  1724. coord[(i+0)%COORD_DIM] = (j ? -1.0 : 1.0);
  1725. coord[(i+1)%COORD_DIM] = 2.0 * nodes[j?1:0][k] - 1.0;
  1726. coord[(i+2)%COORD_DIM] = 2.0 * nodes[j?0:1][k] - 1.0;
  1727. Real R0 = sqrt<Real>(coord[0]*coord[0] + coord[1]*coord[1] + coord[2]*coord[2]);
  1728. elements(ii-start,0)[k] = X + R * coord[0] / R0;
  1729. elements(ii-start,1)[k] = Y + R * coord[1] / R0;
  1730. elements(ii-start,2)[k] = Z + R * coord[2] / R0;
  1731. }
  1732. }
  1733. };
  1734. ElemList elements;
  1735. build_sphere(elements, 0.0, 0.0, 0.0, 1.00);
  1736. Vector<DensityBasis> density_sl;
  1737. { // Set density_sl
  1738. std::function<void(Real*,Real*,Real*)> sigma = [](Real* U, Real* X, Real* Xn) {
  1739. Real R = sqrt(X[0]*X[0]+X[1]*X[1]+X[2]*X[2]);
  1740. Real sinp = sqrt(X[1]*X[1] + X[2]*X[2]) / R;
  1741. Real cosp = -X[0] / R;
  1742. U[0] = -1.5;
  1743. U[1] = 0;
  1744. U[2] = 0;
  1745. };
  1746. DiscretizeSurfaceFn<COORD_DIM,3>(density_sl, elements, sigma);
  1747. }
  1748. GenericKernel<Stokes3D_DxU> Stokes_DxU;
  1749. GenericKernel<Stokes3D_FxU> Stokes_FxU;
  1750. Profile::Enable(true);
  1751. if (1) {
  1752. Vector<PotentialBasis> U;
  1753. Quadrature<Real> quadrature_FxU;
  1754. quadrature_FxU.Setup<DensityBasis, PotentialBasis>(elements, Stokes_FxU, order_singular, order_direct, -1.0, comm);
  1755. quadrature_FxU.Eval(U, elements, density_sl, Stokes_FxU);
  1756. { // Write VTK output
  1757. VTUData vtu;
  1758. vtu.AddElems(elements, U, ORDER);
  1759. vtu.WriteVTK("U", comm);
  1760. }
  1761. { // Write VTK output
  1762. VTUData vtu;
  1763. vtu.AddElems(elements, density_sl, ORDER);
  1764. vtu.WriteVTK("sigma", comm);
  1765. }
  1766. }
  1767. Profile::print(&comm);
  1768. }
  1769. private:
  1770. static void scan(Vector<Long>& dsp, const Vector<Long>& cnt) {
  1771. dsp.ReInit(cnt.Dim());
  1772. if (cnt.Dim()) dsp[0] = 0;
  1773. omp_par::scan(cnt.begin(), dsp.begin(), cnt.Dim());
  1774. }
  1775. template <class Basis> static void eval_basis(Vector<Real>& value, const Vector<Basis> X, Integer dof, Integer Nnds, const typename Basis::EvalOpType& EvalOp) {
  1776. Long Nelem = X.Dim() / dof;
  1777. SCTL_ASSERT(X.Dim() == Nelem * dof);
  1778. value.ReInit(Nelem*Nnds*dof);
  1779. Matrix<Real> X_(Nelem*dof, Nnds, value.begin(),false);
  1780. Basis::Eval(X_, X, EvalOp);
  1781. for (Long j = 0; j < Nelem; j++) { // Rearrange data
  1782. Matrix<Real> X(Nnds, dof, X_[j*dof], false);
  1783. X = Matrix<Real>(dof, Nnds, X_[j*dof], false).Transpose();
  1784. }
  1785. }
  1786. template <int CoordDim, int FnDim, class FnBasis, class ElemList> static void DiscretizeSurfaceFn(Vector<FnBasis>& U, const ElemList& elements, std::function<void(Real*,Real*,Real*)> fn) {
  1787. using CoordBasis = typename ElemList::CoordBasis;
  1788. const long Nelem = elements.NElem();
  1789. U.ReInit(Nelem * FnDim);
  1790. Matrix<Real> X, X_grad;
  1791. { // Set X, X_grad
  1792. Vector<CoordBasis> coord = elements.ElemVector();
  1793. Vector<CoordBasis> coord_grad;
  1794. CoordBasis::Grad(coord_grad, coord);
  1795. const auto Meval = CoordBasis::SetupEval(FnBasis::Nodes());
  1796. CoordBasis::Eval(X, coord, Meval);
  1797. CoordBasis::Eval(X_grad, coord_grad, Meval);
  1798. }
  1799. for (long i = 0; i < Nelem; i++) {
  1800. for (long j = 0; j < FnBasis::Size(); j++) {
  1801. Real X_[CoordDim], Xn[CoordDim], U_[FnDim];
  1802. for (long k = 0; k < CoordDim; k++) {
  1803. X_[k] = X[i*CoordDim+k][j];
  1804. }
  1805. { // Set Xn
  1806. Real Xu[CoordDim], Xv[CoordDim];
  1807. for (long k = 0; k < CoordDim; k++) {
  1808. Xu[k] = X_grad[(i*CoordDim+k)*2+0][j];
  1809. Xv[k] = X_grad[(i*CoordDim+k)*2+1][j];
  1810. }
  1811. Real dA = 0;
  1812. for (long k = 0; k < CoordDim; k++) {
  1813. Xn[k] = Xu[(k+1)%CoordDim] * Xv[(k+2)%CoordDim];
  1814. Xn[k] -= Xv[(k+1)%CoordDim] * Xu[(k+2)%CoordDim];
  1815. dA += Xn[k] * Xn[k];
  1816. }
  1817. dA = sqrt(dA);
  1818. for (long k = 0; k < CoordDim; k++) {
  1819. Xn[k] /= dA;
  1820. }
  1821. }
  1822. fn(U_, X_, Xn);
  1823. for (long k = 0; k < FnDim; k++) {
  1824. U[i*FnDim+k][j] = U_[k];
  1825. }
  1826. }
  1827. }
  1828. }
  1829. Vector<Real> Xt_;
  1830. Matrix<Real> M_singular;
  1831. Matrix<Real> M_near_singular;
  1832. Vector<Pair<Long,Long>> pair_lst;
  1833. Integer order_direct_;
  1834. Real period_length_;
  1835. Comm comm_;
  1836. };
  1837. template <class Real, Integer ORDER=10> class Stellarator {
  1838. private:
  1839. static constexpr Integer COORD_DIM = 3;
  1840. static constexpr Integer ELEM_DIM = COORD_DIM-1;
  1841. using ElemBasis = Basis<Real, ELEM_DIM, ORDER>;
  1842. using ElemLst = ElemList<COORD_DIM, ElemBasis>;
  1843. struct Laplace3D_dUxF {
  1844. template <class ValueType> static constexpr ValueType ScaleFactor() {
  1845. return 1 / (4 * const_pi<ValueType>());
  1846. }
  1847. template <class ValueType> static void Eval(ValueType (&u)[3][1], const ValueType (&r)[3], const ValueType (&n)[3], void* ctx_ptr) {
  1848. ValueType r2 = r[0]*r[0]+r[1]*r[1]+r[2]*r[2];
  1849. ValueType rinv = (r2>1e-16 ? 1/sqrt<ValueType>(r2) : 0);
  1850. ValueType rinv3 = rinv * rinv * rinv;
  1851. u[0][0] = -r[0] * rinv3;
  1852. u[1][0] = -r[1] * rinv3;
  1853. u[2][0] = -r[2] * rinv3;
  1854. }
  1855. };
  1856. struct BiotSavart3D {
  1857. template <class ValueType> static constexpr ValueType ScaleFactor() {
  1858. return 1 / (4 * const_pi<ValueType>());
  1859. }
  1860. template <class ValueType> static void Eval(ValueType (&u)[3][3], const ValueType (&r)[3], const ValueType (&n)[3], void* ctx_ptr) {
  1861. ValueType r2 = r[0]*r[0]+r[1]*r[1]+r[2]*r[2];
  1862. ValueType rinv = (r2>1e-16 ? 1/sqrt<ValueType>(r2) : 0);
  1863. ValueType rinv3 = rinv * rinv * rinv;
  1864. u[0][0] = (0) * rinv3; u[0][1] = -r[2] * rinv3; u[0][2] = r[1] * rinv3;
  1865. u[1][0] = r[2] * rinv3; u[1][1] = (0) * rinv3; u[1][2] = -r[0] * rinv3;
  1866. u[2][0] = -r[1] * rinv3; u[2][1] = r[0] * rinv3; u[2][2] = (0) * rinv3;
  1867. }
  1868. };
  1869. struct Laplace3D_dUxD {
  1870. template <class ValueType> static constexpr ValueType ScaleFactor() {
  1871. return 1 / (4 * const_pi<ValueType>());
  1872. }
  1873. template <class ValueType> static void Eval(ValueType (&u)[3][3], const ValueType (&r)[3], const ValueType (&n)[3], void* ctx_ptr) {
  1874. ValueType r2 = r[0]*r[0]+r[1]*r[1]+r[2]*r[2];
  1875. ValueType rinv = (r2>1e-16 ? 1/sqrt<ValueType>(r2) : 0);
  1876. ValueType rdotn = r[0]*n[0] + r[1]*n[1] + r[2]*n[2];
  1877. ValueType rinv2 = rinv * rinv;
  1878. ValueType rinv3 = rinv * rinv2;
  1879. ValueType rinv5 = rinv3 * rinv2;
  1880. u[0][0] = -1 * rinv3 + 3 * r[0] * r[0] * rinv5;
  1881. u[0][1] = -0 * rinv3 + 3 * r[0] * r[1] * rinv5;
  1882. u[0][2] = -0 * rinv3 + 3 * r[0] * r[2] * rinv5;
  1883. u[1][0] = -0 * rinv3 + 3 * r[1] * r[0] * rinv5;
  1884. u[1][1] = -1 * rinv3 + 3 * r[1] * r[1] * rinv5;
  1885. u[1][2] = -0 * rinv3 + 3 * r[1] * r[2] * rinv5;
  1886. u[2][0] = -0 * rinv3 + 3 * r[2] * r[0] * rinv5;
  1887. u[2][1] = -0 * rinv3 + 3 * r[2] * r[1] * rinv5;
  1888. u[2][2] = -1 * rinv3 + 3 * r[2] * r[2] * rinv5;
  1889. }
  1890. };
  1891. struct Laplace3D_DxdU {
  1892. template <class ValueType> static constexpr ValueType ScaleFactor() {
  1893. return 1 / (4 * const_pi<ValueType>());
  1894. }
  1895. template <class ValueType> static void Eval(ValueType (&u)[1][3], const ValueType (&r)[3], const ValueType (&n)[3], void* ctx_ptr) {
  1896. ValueType r2 = r[0]*r[0]+r[1]*r[1]+r[2]*r[2];
  1897. ValueType rinv = (r2>1e-16 ? 1/sqrt<ValueType>(r2) : 0);
  1898. ValueType rdotn = r[0]*n[0] + r[1]*n[1] + r[2]*n[2];
  1899. ValueType rinv2 = rinv * rinv;
  1900. ValueType rinv3 = rinv * rinv2;
  1901. ValueType rinv5 = rinv3 * rinv2;
  1902. u[0][0] = -n[0] * rinv3 + 3*rdotn * r[0] * rinv5;
  1903. u[0][1] = -n[1] * rinv3 + 3*rdotn * r[1] * rinv5;
  1904. u[0][2] = -n[2] * rinv3 + 3*rdotn * r[2] * rinv5;
  1905. }
  1906. };
  1907. struct Laplace3D_Fxd2U {
  1908. template <class ValueType> static constexpr ValueType ScaleFactor() {
  1909. return 1 / (4 * const_pi<ValueType>());
  1910. }
  1911. template <class ValueType> static void Eval(ValueType (&u)[1][9], const ValueType (&r)[3], const ValueType (&n)[3], void* ctx_ptr) {
  1912. ValueType r2 = r[0]*r[0]+r[1]*r[1]+r[2]*r[2];
  1913. ValueType rinv = (r2>1e-16 ? 1/sqrt<ValueType>(r2) : 0);
  1914. ValueType rinv2 = rinv * rinv;
  1915. ValueType rinv3 = rinv * rinv2;
  1916. ValueType rinv5 = rinv3 * rinv2;
  1917. u[0][0+3*0] = -1 * rinv3 + 3 * r[0] * r[0] * rinv5;
  1918. u[0][1+3*0] = -0 * rinv3 + 3 * r[0] * r[1] * rinv5;
  1919. u[0][2+3*0] = -0 * rinv3 + 3 * r[0] * r[2] * rinv5;
  1920. u[0][0+3*1] = -0 * rinv3 + 3 * r[1] * r[0] * rinv5;
  1921. u[0][1+3*1] = -1 * rinv3 + 3 * r[1] * r[1] * rinv5;
  1922. u[0][2+3*1] = -0 * rinv3 + 3 * r[1] * r[2] * rinv5;
  1923. u[0][0+3*2] = -0 * rinv3 + 3 * r[2] * r[0] * rinv5;
  1924. u[0][1+3*2] = -0 * rinv3 + 3 * r[2] * r[1] * rinv5;
  1925. u[0][2+3*2] = -1 * rinv3 + 3 * r[2] * r[2] * rinv5;
  1926. }
  1927. };
  1928. public:
  1929. Stellarator(const Vector<Long>& NtNp = Vector<Long>()) {
  1930. NtNp_ = NtNp;
  1931. Long Nsurf = NtNp_.Dim() / 2;
  1932. SCTL_ASSERT(Nsurf*2 == NtNp_.Dim());
  1933. Long Nelem = 0;
  1934. elem_dsp.ReInit(Nsurf);
  1935. if (elem_dsp.Dim()) elem_dsp[0] = 0;
  1936. for (Long i = 0; i < Nsurf; i++) {
  1937. Nelem += NtNp_[i*2+0]*NtNp_[i*2+1];
  1938. if (i+1 < Nsurf) elem_dsp[i+1] = elem_dsp[i] + NtNp_[i*2+0]*NtNp_[i*2+1];
  1939. }
  1940. elements.ReInit(Nelem);
  1941. for (Long i = 0; i < Nsurf; i++) {
  1942. InitSurf(i);
  1943. }
  1944. }
  1945. Long ElemIdx(Long s, Long t, Long p) {
  1946. SCTL_ASSERT(0 <= s && s < elem_dsp.Dim());
  1947. SCTL_ASSERT(0 <= t && t < NtNp_[s*2+0]);
  1948. SCTL_ASSERT(0 <= p && p < NtNp_[s*2+1]);
  1949. return elem_dsp[s] + t*NtNp_[s*2+1] + p;
  1950. }
  1951. ElemBasis& Elem(Long elem, Integer dim) {
  1952. return elements(elem,dim);
  1953. }
  1954. const ElemBasis& Elem(Long elem, Integer dim) const {
  1955. return elements(elem,dim);
  1956. }
  1957. const ElemLst& GetElemList() {
  1958. return elements;
  1959. }
  1960. static void test_() {
  1961. constexpr Integer order_singular = 20;
  1962. constexpr Integer order_direct = 35;
  1963. Comm comm = Comm::World();
  1964. Profile::Enable(true);
  1965. Stellarator<Real,ORDER> S;
  1966. { // Set S
  1967. Vector<Real> X(COORD_DIM);
  1968. Vector<Real> R(1);
  1969. X = 0;
  1970. R = 1;
  1971. SCTL_ASSERT(X.Dim() == R.Dim() * COORD_DIM);
  1972. Long N = R.Dim();
  1973. S.elements.ReInit(2*COORD_DIM*N);
  1974. auto nodes = ElemLst::CoordBasis::Nodes();
  1975. for (Long l = 0; l < N; l++) {
  1976. for (Integer i = 0; i < COORD_DIM; i++) {
  1977. for (Integer j = 0; j < 2; j++) {
  1978. for (int k = 0; k < ElemLst::CoordBasis::Size(); k++) {
  1979. Real coord[COORD_DIM];
  1980. coord[(i+0)%COORD_DIM] = (j ? -1.0 : 1.0);
  1981. coord[(i+1)%COORD_DIM] = 2.0 * nodes[j?1:0][k] - 1.0;
  1982. coord[(i+2)%COORD_DIM] = 2.0 * nodes[j?0:1][k] - 1.0;
  1983. Real R0 = sqrt<Real>(coord[0]*coord[0] + coord[1]*coord[1] + coord[2]*coord[2]);
  1984. S.elements((l*COORD_DIM+i)*2+j,0)[k] = X[l*COORD_DIM+0] + R[l] * coord[0] / R0;
  1985. S.elements((l*COORD_DIM+i)*2+j,1)[k] = X[l*COORD_DIM+1] + R[l] * coord[1] / R0;
  1986. S.elements((l*COORD_DIM+i)*2+j,2)[k] = X[l*COORD_DIM+2] + R[l] * coord[2] / R0;
  1987. }
  1988. }
  1989. }
  1990. }
  1991. S.elem_dsp.ReInit(1);
  1992. S.elem_dsp = 0;
  1993. }
  1994. S.quadrature_Fxd2U.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_Fxd2U, order_singular, order_direct, -1.0, comm, -0.01 * pow<-2,Real>(ORDER));
  1995. //S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm, -0.01 * pow<-2,Real>(ORDER));
  1996. { // test Fxd2U
  1997. Vector<ElemBasis> U, sigma(S.elements.NElem());
  1998. sigma = 1;
  1999. sigma[0] = 1;
  2000. S.quadrature_Fxd2U.Eval(U, S.GetElemList(), sigma, S.Laplace_Fxd2U);
  2001. //S.quadrature_FxdU.Eval(U, S.GetElemList(), sigma, S.Laplace_FxdU);
  2002. { // Write VTU
  2003. VTUData vtu;
  2004. vtu.AddElems(S.GetElemList(), U, ORDER);
  2005. vtu.WriteVTK("test", comm);
  2006. }
  2007. }
  2008. Profile::print(&comm);
  2009. }
  2010. static void test() {
  2011. constexpr Integer order_singular = 15;
  2012. constexpr Integer order_direct = 35;
  2013. Comm comm = Comm::World();
  2014. Profile::Enable(true);
  2015. Stellarator<Real,ORDER> S;
  2016. { // Init S
  2017. Vector<Long> NtNp;
  2018. NtNp.PushBack(40);
  2019. NtNp.PushBack(8);
  2020. S = Stellarator<Real,ORDER>(NtNp);
  2021. }
  2022. Vector<ElemBasis> normal, area_elem;
  2023. auto compute_dot_prod = [](const Vector<ElemBasis>& A, const Vector<ElemBasis>& B) {
  2024. const Long Nelem = A.Dim() / COORD_DIM;
  2025. const Long Nnodes = ElemBasis::Size();
  2026. SCTL_ASSERT(A.Dim() == Nelem * COORD_DIM);
  2027. SCTL_ASSERT(B.Dim() == Nelem * COORD_DIM);
  2028. Vector<ElemBasis> AdotB(Nelem);
  2029. for (Long i = 0; i < Nelem; i++) {
  2030. for (Long j = 0; j < Nnodes; j++) {
  2031. Real a_dot_b = 0;
  2032. a_dot_b += A[i*COORD_DIM+0][j]*B[i*COORD_DIM+0][j];
  2033. a_dot_b += A[i*COORD_DIM+1][j]*B[i*COORD_DIM+1][j];
  2034. a_dot_b += A[i*COORD_DIM+2][j]*B[i*COORD_DIM+2][j];
  2035. AdotB[i][j] = a_dot_b;
  2036. }
  2037. }
  2038. return AdotB;
  2039. };
  2040. auto compute_inner_prod = [&S, &area_elem](const Vector<ElemBasis>& A, const Vector<ElemBasis>& B) {
  2041. const auto& quad_wts = ElemBasis::QuadWts();
  2042. const Long Nelem = S.GetElemList().NElem();
  2043. const Long Nnodes = ElemBasis::Size();
  2044. const Long dof = B.Dim() / Nelem;
  2045. Real sum = 0;
  2046. for (Long i = 0; i < Nelem; i++) {
  2047. for (Long j = 0; j < Nnodes; j++) {
  2048. Real AdotB = 0;
  2049. for (Long k = 0; k < dof; k++) {
  2050. AdotB += A[i*dof+k][j] * B[i*dof+k][j];
  2051. }
  2052. sum += AdotB * area_elem[i][j] * quad_wts[j];
  2053. }
  2054. }
  2055. return sum;
  2056. };
  2057. auto compute_norm_area_elem = [&S](Vector<ElemBasis>& normal, Vector<ElemBasis>& area_elem){ // Set normal, area_elem
  2058. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2059. const Long Nelem = S.GetElemList().NElem();
  2060. const Long Nnodes = ElemBasis::Size();
  2061. Vector<ElemBasis> dX;
  2062. ElemBasis::Grad(dX, X);
  2063. area_elem.ReInit(Nelem);
  2064. normal.ReInit(Nelem * COORD_DIM);
  2065. for (Long i = 0; i < Nelem; i++) {
  2066. for (Long j = 0; j < Nnodes; j++) {
  2067. Tensor<Real,true,COORD_DIM> x, n;
  2068. Tensor<Real,true,COORD_DIM,2> dx;
  2069. x(0) = X[i*COORD_DIM+0][j];
  2070. x(1) = X[i*COORD_DIM+1][j];
  2071. x(2) = X[i*COORD_DIM+2][j];
  2072. dx(0,0) = dX[i*COORD_DIM*2+0][j];
  2073. dx(0,1) = dX[i*COORD_DIM*2+1][j];
  2074. dx(1,0) = dX[i*COORD_DIM*2+2][j];
  2075. dx(1,1) = dX[i*COORD_DIM*2+3][j];
  2076. dx(2,0) = dX[i*COORD_DIM*2+4][j];
  2077. dx(2,1) = dX[i*COORD_DIM*2+5][j];
  2078. n(0) = dx(1,0) * dx(2,1) - dx(2,0) * dx(1,1);
  2079. n(1) = dx(2,0) * dx(0,1) - dx(0,0) * dx(2,1);
  2080. n(2) = dx(0,0) * dx(1,1) - dx(1,0) * dx(0,1);
  2081. Real area_elem_ = sqrt<Real>(n(0)*n(0) + n(1)*n(1) + n(2)*n(2));
  2082. Real ooae = 1 / area_elem_;
  2083. n(0) *= ooae;
  2084. n(1) *= ooae;
  2085. n(2) *= ooae;
  2086. normal[i*COORD_DIM+0][j] = n(0);
  2087. normal[i*COORD_DIM+1][j] = n(1);
  2088. normal[i*COORD_DIM+2][j] = n(2);
  2089. area_elem[i][j] = area_elem_;
  2090. }
  2091. }
  2092. };
  2093. compute_norm_area_elem(normal, area_elem);
  2094. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  2095. S.quadrature_DxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_DxU , order_singular, order_direct, -1.0, comm);
  2096. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  2097. S.quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm);
  2098. auto compute_poloidal_circulation = [&S] (const Vector<ElemBasis>& B) {
  2099. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2100. const Long Nelem = S.GetElemList().NElem();
  2101. const Long Nnodes = ElemBasis::Size();
  2102. const auto& quad_wts = Basis<Real,1,ORDER>::QuadWts();
  2103. Vector<ElemBasis> dX;
  2104. ElemBasis::Grad(dX, X);
  2105. const Long Nt = 40;
  2106. const Long Np = 8;
  2107. for (Long t = 0; t < Nt; t++) {
  2108. for (Long j = 0; j < ORDER; j++) {
  2109. Real sum = 0;
  2110. for (Long p = 0; p < Np; p++) {
  2111. for (Long i = 0; i < ORDER; i++) {
  2112. Long elem_idx = t*Np+p;
  2113. Long node_idx = i*ORDER+j;
  2114. Tensor<Real,true,COORD_DIM,2> dx;
  2115. dx(0,0) = dX[elem_idx*COORD_DIM*2+0][node_idx];
  2116. dx(0,1) = dX[elem_idx*COORD_DIM*2+1][node_idx];
  2117. dx(1,0) = dX[elem_idx*COORD_DIM*2+2][node_idx];
  2118. dx(1,1) = dX[elem_idx*COORD_DIM*2+3][node_idx];
  2119. dx(2,0) = dX[elem_idx*COORD_DIM*2+4][node_idx];
  2120. dx(2,1) = dX[elem_idx*COORD_DIM*2+5][node_idx];
  2121. Tensor<Real,true,COORD_DIM> b;
  2122. b(0) = B[elem_idx*COORD_DIM+0][node_idx];
  2123. b(1) = B[elem_idx*COORD_DIM+1][node_idx];
  2124. b(2) = B[elem_idx*COORD_DIM+2][node_idx];
  2125. sum += (b(0)*dx(0,1) + b(1)*dx(1,1) + b(2)*dx(2,1)) * quad_wts[i];
  2126. }
  2127. }
  2128. std::cout<<sum<<' ';
  2129. }
  2130. }
  2131. std::cout<<'\n';
  2132. };
  2133. auto compute_toroidal_circulation = [&S] (const Vector<ElemBasis>& B) {
  2134. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2135. const Long Nelem = S.GetElemList().NElem();
  2136. const Long Nnodes = ElemBasis::Size();
  2137. const auto& quad_wts = Basis<Real,1,ORDER>::QuadWts();
  2138. Vector<ElemBasis> dX;
  2139. ElemBasis::Grad(dX, X);
  2140. const Long Nt = 40;
  2141. const Long Np = 8;
  2142. for (Long p = 0; p < Np; p++) {
  2143. for (Long i = 0; i < ORDER; i++) {
  2144. Real sum = 0;
  2145. for (Long t = 0; t < Nt; t++) {
  2146. for (Long j = 0; j < ORDER; j++) {
  2147. Long elem_idx = t*Np+p;
  2148. Long node_idx = i*ORDER+j;
  2149. Tensor<Real,true,COORD_DIM,2> dx;
  2150. dx(0,0) = dX[elem_idx*COORD_DIM*2+0][node_idx];
  2151. dx(0,1) = dX[elem_idx*COORD_DIM*2+1][node_idx];
  2152. dx(1,0) = dX[elem_idx*COORD_DIM*2+2][node_idx];
  2153. dx(1,1) = dX[elem_idx*COORD_DIM*2+3][node_idx];
  2154. dx(2,0) = dX[elem_idx*COORD_DIM*2+4][node_idx];
  2155. dx(2,1) = dX[elem_idx*COORD_DIM*2+5][node_idx];
  2156. Tensor<Real,true,COORD_DIM> b;
  2157. b(0) = B[elem_idx*COORD_DIM+0][node_idx];
  2158. b(1) = B[elem_idx*COORD_DIM+1][node_idx];
  2159. b(2) = B[elem_idx*COORD_DIM+2][node_idx];
  2160. sum += (b(0)*dx(0,0) + b(1)*dx(1,0) + b(2)*dx(2,0)) * quad_wts[j];
  2161. }
  2162. }
  2163. std::cout<<sum<<' ';
  2164. }
  2165. }
  2166. std::cout<<'\n';
  2167. };
  2168. auto compute_poloidal_circulation_ = [&S,&area_elem] (const Vector<ElemBasis>& B) {
  2169. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2170. const Long Nelem = S.GetElemList().NElem();
  2171. const Long Nnodes = ElemBasis::Size();
  2172. const auto& quad_wts = ElemBasis::QuadWts();
  2173. Vector<ElemBasis> dX;
  2174. ElemBasis::Grad(dX, X);
  2175. Real sum = 0;
  2176. for (Long i = 0; i < Nelem; i++) {
  2177. for (Long j = 0; j < Nnodes; j++) {
  2178. Tensor<Real,true,COORD_DIM,2> dx;
  2179. dx(0,0) = dX[i*COORD_DIM*2+0][j];
  2180. dx(0,1) = dX[i*COORD_DIM*2+1][j];
  2181. dx(1,0) = dX[i*COORD_DIM*2+2][j];
  2182. dx(1,1) = dX[i*COORD_DIM*2+3][j];
  2183. dx(2,0) = dX[i*COORD_DIM*2+4][j];
  2184. dx(2,1) = dX[i*COORD_DIM*2+5][j];
  2185. Tensor<Real,true,COORD_DIM> b;
  2186. b(0) = B[i*COORD_DIM+0][j];
  2187. b(1) = B[i*COORD_DIM+1][j];
  2188. b(2) = B[i*COORD_DIM+2][j];
  2189. Real s = 1/area_elem[i][j];
  2190. sum += (b(0)*dx(0,1) + b(1)*dx(1,1) + b(2)*dx(2,1)) * s * area_elem[i][j] * quad_wts[j];
  2191. }
  2192. }
  2193. return sum;
  2194. };
  2195. auto compute_toroidal_circulation_ = [&S,&area_elem] (const Vector<ElemBasis>& B) {
  2196. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2197. const Long Nelem = S.GetElemList().NElem();
  2198. const Long Nnodes = ElemBasis::Size();
  2199. const auto& quad_wts = ElemBasis::QuadWts();
  2200. Vector<ElemBasis> dX;
  2201. ElemBasis::Grad(dX, X);
  2202. Real sum = 0;
  2203. for (Long i = 0; i < Nelem; i++) {
  2204. for (Long j = 0; j < Nnodes; j++) {
  2205. Tensor<Real,true,COORD_DIM,2> dx;
  2206. dx(0,0) = dX[i*COORD_DIM*2+0][j];
  2207. dx(0,1) = dX[i*COORD_DIM*2+1][j];
  2208. dx(1,0) = dX[i*COORD_DIM*2+2][j];
  2209. dx(1,1) = dX[i*COORD_DIM*2+3][j];
  2210. dx(2,0) = dX[i*COORD_DIM*2+4][j];
  2211. dx(2,1) = dX[i*COORD_DIM*2+5][j];
  2212. Tensor<Real,true,COORD_DIM> b;
  2213. b(0) = B[i*COORD_DIM+0][j];
  2214. b(1) = B[i*COORD_DIM+1][j];
  2215. b(2) = B[i*COORD_DIM+2][j];
  2216. Real s = 1/area_elem[i][j];
  2217. sum += (b(0)*dx(0,0) + b(1)*dx(1,0) + b(2)*dx(2,0)) * s * area_elem[i][j] * quad_wts[j];
  2218. }
  2219. }
  2220. return sum;
  2221. };
  2222. auto compute_grad_adj = [&S,&area_elem] (const Vector<ElemBasis>& V) {
  2223. const Long Nelem = S.GetElemList().NElem();
  2224. const Long Nnodes = ElemBasis::Size();
  2225. Vector<ElemBasis> du_dX(Nelem*COORD_DIM*2);
  2226. { // Set du_dX
  2227. Vector<ElemBasis> dX;
  2228. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  2229. auto inv2x2 = [](Tensor<Real, true, 2, 2> M) {
  2230. Tensor<Real, true, 2, 2> Mout;
  2231. Real oodet = 1 / (M(0,0) * M(1,1) - M(0,1) * M(1,0));
  2232. Mout(0,0) = M(1,1) * oodet;
  2233. Mout(0,1) = -M(0,1) * oodet;
  2234. Mout(1,0) = -M(1,0) * oodet;
  2235. Mout(1,1) = M(0,0) * oodet;
  2236. return Mout;
  2237. };
  2238. for (Long i = 0; i < Nelem; i++) {
  2239. for (Long j = 0; j < Nnodes; j++) {
  2240. Tensor<Real, true, 3, 2> dX_du;
  2241. dX_du(0,0) = dX[(i*COORD_DIM+0)*2+0][j];
  2242. dX_du(1,0) = dX[(i*COORD_DIM+1)*2+0][j];
  2243. dX_du(2,0) = dX[(i*COORD_DIM+2)*2+0][j];
  2244. dX_du(0,1) = dX[(i*COORD_DIM+0)*2+1][j];
  2245. dX_du(1,1) = dX[(i*COORD_DIM+1)*2+1][j];
  2246. dX_du(2,1) = dX[(i*COORD_DIM+2)*2+1][j];
  2247. Tensor<Real, true, 2, 2> G; // = dX_du.Transpose() * dX_du;
  2248. G(0,0) = dX_du(0,0) * dX_du(0,0) + dX_du(1,0) * dX_du(1,0) + dX_du(2,0) * dX_du(2,0);
  2249. G(0,1) = dX_du(0,0) * dX_du(0,1) + dX_du(1,0) * dX_du(1,1) + dX_du(2,0) * dX_du(2,1);
  2250. G(1,0) = dX_du(0,1) * dX_du(0,0) + dX_du(1,1) * dX_du(1,0) + dX_du(2,1) * dX_du(2,0);
  2251. G(1,1) = dX_du(0,1) * dX_du(0,1) + dX_du(1,1) * dX_du(1,1) + dX_du(2,1) * dX_du(2,1);
  2252. Tensor<Real, true, 2, 2> Ginv = inv2x2(G);
  2253. du_dX[(i*COORD_DIM+0)*2+0][j] = Ginv(0,0) * dX_du(0,0) + Ginv(0,1) * dX_du(0,1);
  2254. du_dX[(i*COORD_DIM+1)*2+0][j] = Ginv(0,0) * dX_du(1,0) + Ginv(0,1) * dX_du(1,1);
  2255. du_dX[(i*COORD_DIM+2)*2+0][j] = Ginv(0,0) * dX_du(2,0) + Ginv(0,1) * dX_du(2,1);
  2256. du_dX[(i*COORD_DIM+0)*2+1][j] = Ginv(1,0) * dX_du(0,0) + Ginv(1,1) * dX_du(0,1);
  2257. du_dX[(i*COORD_DIM+1)*2+1][j] = Ginv(1,0) * dX_du(1,0) + Ginv(1,1) * dX_du(1,1);
  2258. du_dX[(i*COORD_DIM+2)*2+1][j] = Ginv(1,0) * dX_du(2,0) + Ginv(1,1) * dX_du(2,1);
  2259. }
  2260. }
  2261. }
  2262. Vector<ElemBasis> dudX_V(Nelem*2);
  2263. for (Long i = 0; i < Nelem; i++) {
  2264. for (Long j = 0; j < Nnodes; j++) {
  2265. dudX_V[i*2+0][j] = 0;
  2266. dudX_V[i*2+1][j] = 0;
  2267. dudX_V[i*2+0][j] += du_dX[(i*COORD_DIM+0)*2+0][j] * V[i*COORD_DIM+0][j] * area_elem[i][j];
  2268. dudX_V[i*2+0][j] += du_dX[(i*COORD_DIM+1)*2+0][j] * V[i*COORD_DIM+1][j] * area_elem[i][j];
  2269. dudX_V[i*2+0][j] += du_dX[(i*COORD_DIM+2)*2+0][j] * V[i*COORD_DIM+2][j] * area_elem[i][j];
  2270. dudX_V[i*2+1][j] += du_dX[(i*COORD_DIM+0)*2+1][j] * V[i*COORD_DIM+0][j] * area_elem[i][j];
  2271. dudX_V[i*2+1][j] += du_dX[(i*COORD_DIM+1)*2+1][j] * V[i*COORD_DIM+1][j] * area_elem[i][j];
  2272. dudX_V[i*2+1][j] += du_dX[(i*COORD_DIM+2)*2+1][j] * V[i*COORD_DIM+2][j] * area_elem[i][j];
  2273. }
  2274. }
  2275. Vector<ElemBasis> grad_dudX_V;
  2276. ElemBasis::Grad(grad_dudX_V, dudX_V);
  2277. Vector<ElemBasis> grad_adj_V(Nelem);
  2278. for (Long i = 0; i < Nelem; i++) {
  2279. for (Long j = 0; j < Nnodes; j++) {
  2280. grad_adj_V[i][j] = -(grad_dudX_V[(i*2+0)*2+0][j] + grad_dudX_V[(i*2+1)*2+1][j]) / area_elem[i][j];
  2281. }
  2282. }
  2283. return grad_adj_V;
  2284. };
  2285. auto compute_B0 = [&S](const Real alpha) { // alpha/|r| \hat{\theta}
  2286. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2287. const Long Nelem = S.GetElemList().NElem();
  2288. const Long Nnodes = ElemBasis::Size();
  2289. Vector<ElemBasis> B0(Nelem * COORD_DIM);
  2290. for (Long i = 0; i < Nelem; i++) {
  2291. for (Long j = 0; j < Nnodes; j++) {
  2292. Tensor<Real,true,COORD_DIM> x, b0, axis;
  2293. x(0) = X[i*COORD_DIM+0][j];
  2294. x(1) = X[i*COORD_DIM+1][j];
  2295. x(2) = X[i*COORD_DIM+2][j];
  2296. axis(0) = 0;
  2297. axis(1) = 0;
  2298. axis(2) = 1;
  2299. b0(0) = axis(1) * x(2) - axis(2) * x(1);
  2300. b0(1) = axis(2) * x(0) - axis(0) * x(2);
  2301. b0(2) = axis(0) * x(1) - axis(1) * x(0);
  2302. Real scale = 1 / (b0(0)*b0(0) + b0(1)*b0(1) + b0(2)*b0(2));
  2303. b0(0) *= scale;
  2304. b0(1) *= scale;
  2305. b0(2) *= scale;
  2306. B0[i*COORD_DIM+0][j] = alpha * b0(0);
  2307. B0[i*COORD_DIM+1][j] = alpha * b0(1);
  2308. B0[i*COORD_DIM+2][j] = alpha * b0(2);
  2309. }
  2310. }
  2311. return B0;
  2312. };
  2313. auto compute_dB0 = [&S](const Real alpha) { // alpha/|r| \hat{\theta}
  2314. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2315. const Long Nelem = S.GetElemList().NElem();
  2316. const Long Nnodes = ElemBasis::Size();
  2317. Vector<ElemBasis> dB0(Nelem * COORD_DIM * COORD_DIM);
  2318. for (Long i = 0; i < Nelem; i++) {
  2319. for (Long j = 0; j < Nnodes; j++) {
  2320. Tensor<Real,true,COORD_DIM> x;
  2321. x(0) = X[i*COORD_DIM+0][j];
  2322. x(1) = X[i*COORD_DIM+1][j];
  2323. x(2) = X[i*COORD_DIM+2][j];
  2324. Real R2inv = 1 / (x(0)*x(0) + x(1)*x(1));
  2325. dB0[(i*COORD_DIM+0)*COORD_DIM+0][j] = alpha * (2*x(0)*x(1) * R2inv*R2inv);
  2326. dB0[(i*COORD_DIM+0)*COORD_DIM+1][j] = alpha * (-R2inv + 2*x(1)*x(1) * R2inv*R2inv);
  2327. dB0[(i*COORD_DIM+0)*COORD_DIM+2][j] = 0;
  2328. dB0[(i*COORD_DIM+1)*COORD_DIM+0][j] = alpha * (R2inv - 2*x(0)*x(0) * R2inv*R2inv);
  2329. dB0[(i*COORD_DIM+1)*COORD_DIM+1][j] = alpha * (-2*x(0)*x(1) * R2inv*R2inv);
  2330. dB0[(i*COORD_DIM+1)*COORD_DIM+2][j] = 0;
  2331. dB0[(i*COORD_DIM+2)*COORD_DIM+0][j] = 0;
  2332. dB0[(i*COORD_DIM+2)*COORD_DIM+1][j] = 0;
  2333. dB0[(i*COORD_DIM+2)*COORD_DIM+2][j] = 0;
  2334. }
  2335. }
  2336. return dB0;
  2337. };
  2338. auto compute_half_n_plus_dG = [&S, &normal](const Vector<ElemBasis>& sigma) { // B = n sigma/2 + dG[sigma]
  2339. const Long Nelem = S.GetElemList().NElem();
  2340. const Long Nnodes = ElemBasis::Size();
  2341. Vector<ElemBasis> B;
  2342. S.quadrature_FxdU.Eval(B, S.GetElemList(), sigma, S.Laplace_FxdU);
  2343. for (Long i = 0; i < Nelem; i++) {
  2344. for (Long j = 0; j < Nnodes; j++) {
  2345. for (Long k = 0; k < COORD_DIM; k++) {
  2346. B[i*COORD_DIM+k][j] -= 0.5*sigma[i][j]*normal[i*COORD_DIM+k][j];
  2347. }
  2348. }
  2349. }
  2350. return B;
  2351. };
  2352. auto compute_A11 = [&S,&normal,&compute_half_n_plus_dG,&compute_dot_prod](Vector<Real>& B_dot_n, const Vector<Real>& sigma) {
  2353. const Long Nelem = S.GetElemList().NElem();
  2354. const Long Nnodes = ElemBasis::Size();
  2355. B_dot_n.ReInit(Nelem * Nnodes);
  2356. Vector<ElemBasis> sigma_(Nelem);
  2357. for (Long i = 0; i < Nelem; i++) {
  2358. for (Long j = 0; j < Nnodes; j++) {
  2359. sigma_[i][j] = sigma[i*Nnodes+j];
  2360. }
  2361. }
  2362. Vector<ElemBasis> B_dot_n_ = compute_dot_prod(normal, compute_half_n_plus_dG(sigma_));
  2363. for (Long i = 0; i < Nelem; i++) {
  2364. for (Long j = 0; j < Nnodes; j++) {
  2365. B_dot_n[i*Nnodes+j] = B_dot_n_[i][j];
  2366. }
  2367. }
  2368. };
  2369. auto compute_A12 = [&S,&normal,&compute_dot_prod,&compute_B0](Vector<Real>& B_dot_n, const Real alpha) {
  2370. const Long Nelem = S.GetElemList().NElem();
  2371. const Long Nnodes = ElemBasis::Size();
  2372. B_dot_n.ReInit(Nelem * Nnodes);
  2373. Vector<ElemBasis> B_dot_n_ = compute_dot_prod(normal, compute_B0(alpha));
  2374. for (Long i = 0; i < Nelem; i++) {
  2375. for (Long j = 0; j < Nnodes; j++) {
  2376. B_dot_n[i*Nnodes+j] = B_dot_n_[i][j];
  2377. }
  2378. }
  2379. };
  2380. auto compute_A21 = [&S,&normal,&compute_half_n_plus_dG,&compute_poloidal_circulation_](const Vector<Real>& sigma) {
  2381. const Long Nelem = S.GetElemList().NElem();
  2382. const Long Nnodes = ElemBasis::Size();
  2383. Vector<ElemBasis> sigma_(Nelem);
  2384. for (Long i = 0; i < Nelem; i++) {
  2385. for (Long j = 0; j < Nnodes; j++) {
  2386. sigma_[i][j] = sigma[i*Nnodes+j];
  2387. }
  2388. }
  2389. if (0) { // alternate implementation
  2390. //Vector<ElemBasis> A21_(Nelem);
  2391. //Vector<Real> A21(Nelem*Nnodes);
  2392. //compute_A21adj(A21, 1);
  2393. //for (Long i = 0; i < Nelem; i++) {
  2394. // for (Long j = 0; j < Nnodes; j++) {
  2395. // A21_[i][j] = A21[i*Nnodes+j];
  2396. // }
  2397. //}
  2398. //return compute_inner_prod(A21_, sigma_);
  2399. }
  2400. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma_);
  2401. Vector<ElemBasis> J(Nelem * COORD_DIM);
  2402. for (Long i = 0; i < Nelem; i++) { // Set J
  2403. for (Long j = 0; j < Nnodes; j++) {
  2404. Tensor<Real,true,COORD_DIM> b, n;
  2405. b(0) = B[i*COORD_DIM+0][j];
  2406. b(1) = B[i*COORD_DIM+1][j];
  2407. b(2) = B[i*COORD_DIM+2][j];
  2408. n(0) = normal[i*COORD_DIM+0][j];
  2409. n(1) = normal[i*COORD_DIM+1][j];
  2410. n(2) = normal[i*COORD_DIM+2][j];
  2411. J[i*COORD_DIM+0][j] = n(1) * b(2) - n(2) * b(1);
  2412. J[i*COORD_DIM+1][j] = n(2) * b(0) - n(0) * b(2);
  2413. J[i*COORD_DIM+2][j] = n(0) * b(1) - n(1) * b(0);
  2414. }
  2415. }
  2416. Vector<ElemBasis> A;
  2417. S.quadrature_FxU.Eval(A, S.GetElemList(), J, S.Laplace_FxU);
  2418. return compute_poloidal_circulation_(A)/S.NtNp_[0];
  2419. };
  2420. auto compute_A22 = [&S,&compute_B0,&normal,&compute_poloidal_circulation_](const Real alpha) {
  2421. const Long Nelem = S.GetElemList().NElem();
  2422. const Long Nnodes = ElemBasis::Size();
  2423. Vector<ElemBasis> B = compute_B0(alpha);
  2424. Vector<ElemBasis> J(Nelem * COORD_DIM);
  2425. for (Long i = 0; i < Nelem; i++) { // Set J
  2426. for (Long j = 0; j < Nnodes; j++) {
  2427. Tensor<Real,true,COORD_DIM> b, n;
  2428. b(0) = B[i*COORD_DIM+0][j];
  2429. b(1) = B[i*COORD_DIM+1][j];
  2430. b(2) = B[i*COORD_DIM+2][j];
  2431. n(0) = normal[i*COORD_DIM+0][j];
  2432. n(1) = normal[i*COORD_DIM+1][j];
  2433. n(2) = normal[i*COORD_DIM+2][j];
  2434. J[i*COORD_DIM+0][j] = n(1) * b(2) - n(2) * b(1);
  2435. J[i*COORD_DIM+1][j] = n(2) * b(0) - n(0) * b(2);
  2436. J[i*COORD_DIM+2][j] = n(0) * b(1) - n(1) * b(0);
  2437. }
  2438. }
  2439. Vector<ElemBasis> A;
  2440. S.quadrature_FxU.Eval(A, S.GetElemList(), J, S.Laplace_FxU);
  2441. return compute_poloidal_circulation_(A)/S.NtNp_[0];
  2442. };
  2443. auto compute_A = [&compute_A11,&compute_A12,&compute_A21,&compute_A22] (const Vector<Real>& x) {
  2444. const Vector<Real> sigma(x.Dim()-1,(Iterator<Real>)x.begin(),false);
  2445. const Real& alpha = x[x.Dim()-1];
  2446. Vector<Real> Ax;
  2447. Ax.ReInit(x.Dim());
  2448. Vector<Real> Bdotn(x.Dim()-1,Ax.begin(),false);
  2449. Real& flux = Ax[x.Dim()-1];
  2450. Vector<Real> Adotn_0, Adotn_1;
  2451. compute_A11(Adotn_0, sigma);
  2452. compute_A12(Adotn_1, alpha);
  2453. Bdotn = Adotn_0 + Adotn_1;
  2454. flux = compute_A21(sigma) + compute_A22(alpha);
  2455. return Ax;
  2456. };
  2457. auto compute_invA = [&S,&comm,&compute_A] (Vector<ElemBasis>& sigma, Real& alpha, Real flux) {
  2458. typename sctl::ParallelSolver<Real>::ParallelOp BIOp = [&compute_A](sctl::Vector<Real>* Ax, const sctl::Vector<Real>& x) {
  2459. (*Ax) = compute_A(x);
  2460. };
  2461. const Long Nelem = S.GetElemList().NElem();
  2462. const Long Nnodes = ElemBasis::Size();
  2463. Vector<Real> rhs_(Nelem * Nnodes + 1);
  2464. rhs_ = 0;
  2465. rhs_[Nelem * Nnodes] = flux;
  2466. Vector<Real> x_(Nelem * Nnodes + 1);
  2467. x_ = 0;
  2468. ParallelSolver<Real> linear_solver(comm, true);
  2469. linear_solver(&x_, BIOp, rhs_, 1e-8, 50);
  2470. sigma.ReInit(Nelem);
  2471. for (Long i = 0; i < Nelem; i++) {
  2472. for (Long j = 0; j < Nnodes; j++) {
  2473. sigma[i][j] = x_[i*Nnodes+j];
  2474. }
  2475. }
  2476. alpha = x_[Nelem * Nnodes];
  2477. };
  2478. auto compute_invA_ = [&S,&comm,&compute_A] (Vector<Real>& b) {
  2479. typename sctl::ParallelSolver<Real>::ParallelOp BIOp = [&compute_A](sctl::Vector<Real>* Ax, const sctl::Vector<Real>& x) {
  2480. (*Ax) = compute_A(x);
  2481. };
  2482. const Long Nelem = S.GetElemList().NElem();
  2483. const Long Nnodes = ElemBasis::Size();
  2484. Vector<Real> x(b.Dim());
  2485. x = 0;
  2486. ParallelSolver<Real> linear_solver(comm, true);
  2487. linear_solver(&x, BIOp, b, 1e-8, 50);
  2488. return x;
  2489. };
  2490. auto compute_A11adj = [&S](Vector<Real>& U, const Vector<Real>& sigma) { // A11adj = I/2 + D
  2491. const Long Nelem = S.GetElemList().NElem();
  2492. const Long Nnodes = ElemBasis::Size();
  2493. Vector<ElemBasis> sigma_(Nelem);
  2494. for (Long i = 0; i < Nelem; i++) {
  2495. for (Long j = 0; j < Nnodes; j++) {
  2496. sigma_[i][j] = sigma[i*Nnodes+j];
  2497. }
  2498. }
  2499. S.quadrature_DxU.Eval(U, S.GetElemList(), sigma_, S.Laplace_DxU);
  2500. U = sigma*(-0.5) + U;
  2501. };
  2502. auto compute_A12adj = [&S,&compute_A12,&compute_inner_prod](const Vector<Real>& sigma_) {
  2503. const Long Nelem = S.GetElemList().NElem();
  2504. const Long Nnodes = ElemBasis::Size();
  2505. Vector<Real> A12_sigma_;
  2506. compute_A12(A12_sigma_, 1);
  2507. Vector<ElemBasis> A12_sigma(Nelem), sigma(Nelem);
  2508. for (Long i = 0; i < Nelem; i++) {
  2509. for (Long j = 0; j < Nnodes; j++) {
  2510. sigma[i][j] = sigma_[i*Nnodes+j];
  2511. A12_sigma[i][j] = A12_sigma_[i*Nnodes+j];
  2512. }
  2513. }
  2514. return compute_inner_prod(A12_sigma, sigma);
  2515. };
  2516. auto compute_A21adj = [&S,&area_elem,&normal](Vector<Real>& A21adj_flux, Real flux) {
  2517. const Long Nelem = S.GetElemList().NElem();
  2518. const Long Nnodes = ElemBasis::Size();
  2519. Vector<ElemBasis> density(Nelem * COORD_DIM);
  2520. { // Set density
  2521. Vector<ElemBasis> dX;
  2522. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  2523. for (Long i = 0; i < Nelem; i++) {
  2524. for (Long j = 0; j < Nnodes; j++) {
  2525. Tensor<Real,true,COORD_DIM,2> dx;
  2526. dx(0,0) = dX[i*COORD_DIM*2+0][j];
  2527. dx(0,1) = dX[i*COORD_DIM*2+1][j];
  2528. dx(1,0) = dX[i*COORD_DIM*2+2][j];
  2529. dx(1,1) = dX[i*COORD_DIM*2+3][j];
  2530. dx(2,0) = dX[i*COORD_DIM*2+4][j];
  2531. dx(2,1) = dX[i*COORD_DIM*2+5][j];
  2532. Real s = 1 / (area_elem[i][j] * S.NtNp_[0]);
  2533. for (Long k = 0; k < COORD_DIM; k++) {
  2534. density[i*COORD_DIM+k][j] = dx(k,1) * s;
  2535. }
  2536. }
  2537. }
  2538. }
  2539. Vector<ElemBasis> Gdensity;
  2540. S.quadrature_FxU.Eval(Gdensity, S.GetElemList(), density, S.Laplace_FxU);
  2541. Vector<ElemBasis> nxGdensity(Nelem * COORD_DIM);
  2542. for (Long i = 0; i < Nelem; i++) { // Set nxGdensity
  2543. for (Long j = 0; j < Nnodes; j++) {
  2544. Tensor<Real,true,COORD_DIM> Gdensity_, n;
  2545. Gdensity_(0) = Gdensity[i*COORD_DIM+0][j];
  2546. Gdensity_(1) = Gdensity[i*COORD_DIM+1][j];
  2547. Gdensity_(2) = Gdensity[i*COORD_DIM+2][j];
  2548. n(0) = normal[i*COORD_DIM+0][j];
  2549. n(1) = normal[i*COORD_DIM+1][j];
  2550. n(2) = normal[i*COORD_DIM+2][j];
  2551. nxGdensity[i*COORD_DIM+0][j] = n(1) * Gdensity_(2) - n(2) * Gdensity_(1);
  2552. nxGdensity[i*COORD_DIM+1][j] = n(2) * Gdensity_(0) - n(0) * Gdensity_(2);
  2553. nxGdensity[i*COORD_DIM+2][j] = n(0) * Gdensity_(1) - n(1) * Gdensity_(0);
  2554. }
  2555. }
  2556. S.quadrature_dUxF.Eval(A21adj_flux, S.GetElemList(), nxGdensity, S.Laplace_dUxF);
  2557. A21adj_flux *= flux;
  2558. };
  2559. auto compute_A22adj = [&compute_A22] (const Real alpha) {
  2560. return compute_A22(alpha);
  2561. };
  2562. auto compute_Aadj = [&compute_A11adj,&compute_A12adj,&compute_A21adj,&compute_A22adj] (const Vector<Real>& x) {
  2563. const Vector<Real> sigma(x.Dim()-1,(Iterator<Real>)x.begin(),false);
  2564. const Real& alpha = x[x.Dim()-1];
  2565. Vector<Real> Ax;
  2566. Ax.ReInit(x.Dim());
  2567. Vector<Real> Bdotn(x.Dim()-1,Ax.begin(),false);
  2568. Real& flux = Ax[x.Dim()-1];
  2569. Vector<Real> Adotn_0, Adotn_1;
  2570. compute_A11adj(Adotn_0, sigma);
  2571. compute_A21adj(Adotn_1, alpha);
  2572. Bdotn = Adotn_0 + Adotn_1;
  2573. flux = compute_A12adj(sigma) + compute_A22adj(alpha);
  2574. return Ax;
  2575. };
  2576. auto compute_invAadj = [&S,&comm,&compute_Aadj] (Vector<Real>& b) {
  2577. typename sctl::ParallelSolver<Real>::ParallelOp BIOp = [&compute_Aadj](sctl::Vector<Real>* Ax, const sctl::Vector<Real>& x) {
  2578. (*Ax) = compute_Aadj(x);
  2579. };
  2580. const Long Nelem = S.GetElemList().NElem();
  2581. const Long Nnodes = ElemBasis::Size();
  2582. Vector<Real> x(b.Dim());
  2583. x = 0;
  2584. ParallelSolver<Real> linear_solver(comm, true);
  2585. linear_solver(&x, BIOp, b, 1e-8, 50);
  2586. return x;
  2587. };
  2588. auto compute_dg_dsigma = [&S, &normal, &compute_dot_prod](const Vector<ElemBasis>& B) { // dg_dsigma = \int 2 B \cdot (\nabla G + n/2)
  2589. Vector<ElemBasis> B_dot_gradG;
  2590. S.quadrature_dUxF.Eval(B_dot_gradG, S.GetElemList(), B, S.Laplace_dUxF);
  2591. return B_dot_gradG * (-2.0) + compute_dot_prod(B,normal);
  2592. };
  2593. auto compute_dg_dalpha = [&S,&compute_B0,&compute_inner_prod] (const Vector<ElemBasis>& B) {
  2594. auto dB_dalpha = compute_B0(1);
  2595. return 2*compute_inner_prod(B,dB_dalpha);
  2596. };
  2597. auto compute_dg_dnu = [&S,&comm,&normal,&compute_inner_prod,&area_elem,&compute_dB0](const Vector<ElemBasis>& sigma, Real alpha, const Vector<ElemBasis>& B) { // dg_dnu = (B*B) 2H - (2 B) \cdot (n \cdnot nabla) \nabla G[sigma] + (2 B) \alpha dB0_dnu \hat{\theta} + sigma (\nabla D)^T [2 B] + (2H) sigma (\nabla G)^T [2 B]
  2598. const Long Nelem = S.GetElemList().NElem();
  2599. const Long Nnodes = ElemBasis::Size();
  2600. Vector<ElemBasis> v = B * 2.0;
  2601. Vector<ElemBasis> dg_dnu0(Nelem), dg_dnu1(Nelem), dg_dnu2(Nelem), dg_dnu3(Nelem), dg_dnu4(Nelem);
  2602. dg_dnu0 = 0;
  2603. dg_dnu1 = 0;
  2604. dg_dnu2 = 0;
  2605. dg_dnu3 = 0;
  2606. dg_dnu4 = 0;
  2607. Vector<ElemBasis> H(Nelem);
  2608. { // Set mean curvature H
  2609. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2610. Vector<ElemBasis> dX, d2X;
  2611. ElemBasis::Grad(dX, X);
  2612. ElemBasis::Grad(d2X, dX);
  2613. for (Long i = 0; i < Nelem; i++) {
  2614. for (Long j = 0; j < Nnodes; j++) {
  2615. Tensor<Real,true,2,2> I, invI, II;
  2616. for (Long k0 = 0; k0 < 2; k0++) {
  2617. for (Long k1 = 0; k1 < 2; k1++) {
  2618. I(k0,k1) = 0;
  2619. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  2620. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  2621. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  2622. II(k0,k1) = 0;
  2623. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  2624. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  2625. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  2626. }
  2627. }
  2628. { // Set invI
  2629. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  2630. invI(0,0) = I(1,1) / detI;
  2631. invI(0,1) = -I(0,1) / detI;
  2632. invI(1,0) = -I(1,0) / detI;
  2633. invI(1,1) = I(0,0) / detI;
  2634. }
  2635. { // Set H
  2636. H[i][j] = 0;
  2637. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  2638. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  2639. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  2640. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  2641. }
  2642. }
  2643. }
  2644. }
  2645. // dg_dnu0 = (B*B) 2H
  2646. for (Long i = 0; i < Nelem; i++) {
  2647. for (Long j = 0; j < Nnodes; j++) {
  2648. dg_dnu0[i][j] = 0;
  2649. dg_dnu0[i][j] += B[i*COORD_DIM+0][j] * B[i*COORD_DIM+0][j] * (2.0*H[i][j]);
  2650. dg_dnu0[i][j] += B[i*COORD_DIM+1][j] * B[i*COORD_DIM+1][j] * (2.0*H[i][j]);
  2651. dg_dnu0[i][j] += B[i*COORD_DIM+2][j] * B[i*COORD_DIM+2][j] * (2.0*H[i][j]);
  2652. }
  2653. }
  2654. // dg_dnu1 = (2 B) \cdot (n \cdnot \nabla) \nabla G[sigma]
  2655. Vector<ElemBasis> d2Gsigma;
  2656. Quadrature<Real> quadrature_Fxd2U;
  2657. quadrature_Fxd2U.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_Fxd2U, order_singular, order_direct, -1.0, comm, -0.01 * pow<-2,Real>(ORDER));
  2658. quadrature_Fxd2U.Eval(d2Gsigma, S.GetElemList(), sigma, S.Laplace_Fxd2U);
  2659. for (Long i = 0; i < Nelem; i++) {
  2660. for (Long j = 0; j < Nnodes; j++) {
  2661. dg_dnu1[i][j] = 0;
  2662. dg_dnu1[i][j] -= d2Gsigma[i*9+0][j] * normal[i*COORD_DIM+0][j] * v[i*COORD_DIM+0][j];
  2663. dg_dnu1[i][j] -= d2Gsigma[i*9+1][j] * normal[i*COORD_DIM+0][j] * v[i*COORD_DIM+1][j];
  2664. dg_dnu1[i][j] -= d2Gsigma[i*9+2][j] * normal[i*COORD_DIM+0][j] * v[i*COORD_DIM+2][j];
  2665. dg_dnu1[i][j] -= d2Gsigma[i*9+3][j] * normal[i*COORD_DIM+1][j] * v[i*COORD_DIM+0][j];
  2666. dg_dnu1[i][j] -= d2Gsigma[i*9+4][j] * normal[i*COORD_DIM+1][j] * v[i*COORD_DIM+1][j];
  2667. dg_dnu1[i][j] -= d2Gsigma[i*9+5][j] * normal[i*COORD_DIM+1][j] * v[i*COORD_DIM+2][j];
  2668. dg_dnu1[i][j] -= d2Gsigma[i*9+6][j] * normal[i*COORD_DIM+2][j] * v[i*COORD_DIM+0][j];
  2669. dg_dnu1[i][j] -= d2Gsigma[i*9+7][j] * normal[i*COORD_DIM+2][j] * v[i*COORD_DIM+1][j];
  2670. dg_dnu1[i][j] -= d2Gsigma[i*9+8][j] * normal[i*COORD_DIM+2][j] * v[i*COORD_DIM+2][j];
  2671. }
  2672. }
  2673. // dg_dnu2 = (2 B) \alpha (n \cdot \nabla) \hat{\theta} / |r|
  2674. Vector<ElemBasis> dB0 = compute_dB0(alpha);
  2675. for (Long i = 0; i < Nelem; i++) {
  2676. for (Long j = 0; j < Nnodes; j++) {
  2677. dg_dnu2[i][j] = 0;
  2678. dg_dnu2[i][j] += dB0[i*9+0][j] * normal[i*COORD_DIM+0][j] * v[i*COORD_DIM+0][j];
  2679. dg_dnu2[i][j] += dB0[i*9+1][j] * normal[i*COORD_DIM+1][j] * v[i*COORD_DIM+0][j];
  2680. dg_dnu2[i][j] += dB0[i*9+2][j] * normal[i*COORD_DIM+2][j] * v[i*COORD_DIM+0][j];
  2681. dg_dnu2[i][j] += dB0[i*9+3][j] * normal[i*COORD_DIM+0][j] * v[i*COORD_DIM+1][j];
  2682. dg_dnu2[i][j] += dB0[i*9+4][j] * normal[i*COORD_DIM+1][j] * v[i*COORD_DIM+1][j];
  2683. dg_dnu2[i][j] += dB0[i*9+5][j] * normal[i*COORD_DIM+2][j] * v[i*COORD_DIM+1][j];
  2684. dg_dnu2[i][j] += dB0[i*9+6][j] * normal[i*COORD_DIM+0][j] * v[i*COORD_DIM+2][j];
  2685. dg_dnu2[i][j] += dB0[i*9+7][j] * normal[i*COORD_DIM+1][j] * v[i*COORD_DIM+2][j];
  2686. dg_dnu2[i][j] += dB0[i*9+8][j] * normal[i*COORD_DIM+2][j] * v[i*COORD_DIM+2][j];
  2687. }
  2688. }
  2689. // dg_dnu3 = (sigma (\nabla D)^T [2 B]
  2690. Vector<ElemBasis> nablaDtv;
  2691. Quadrature<Real> quadrature_dUxD;
  2692. quadrature_dUxD.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxD, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  2693. quadrature_dUxD.Eval(nablaDtv, S.GetElemList(), v, S.Laplace_dUxD);
  2694. for (Long i = 0; i < Nelem; i++) {
  2695. for (Long j = 0; j < Nnodes; j++) {
  2696. dg_dnu3[i][j] = 0;
  2697. dg_dnu3[i][j] += sigma[i][j] * nablaDtv[i*COORD_DIM+0][j]*normal[i*COORD_DIM+0][j];
  2698. dg_dnu3[i][j] += sigma[i][j] * nablaDtv[i*COORD_DIM+1][j]*normal[i*COORD_DIM+1][j];
  2699. dg_dnu3[i][j] += sigma[i][j] * nablaDtv[i*COORD_DIM+2][j]*normal[i*COORD_DIM+2][j];
  2700. }
  2701. }
  2702. // dg_dnu4 = (2H) sigma (\nabla G)^T [2 B]
  2703. Quadrature<Real> quadrature_dUxF;
  2704. quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  2705. quadrature_dUxF.Eval(dg_dnu4, S.GetElemList(), v, S.Laplace_dUxF);
  2706. for (Long i = 0; i < Nelem; i++) {
  2707. for (Long j = 0; j < Nnodes; j++) {
  2708. dg_dnu4[i][j] *= 2*H[i][j] * sigma[i][j];
  2709. }
  2710. }
  2711. return dg_dnu0 + dg_dnu1 + dg_dnu2 + dg_dnu3 - dg_dnu4;
  2712. };
  2713. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2714. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2715. Real flux = 1.0, alpha;
  2716. Vector<ElemBasis> sigma(S.GetElemList().NElem());
  2717. compute_invA(sigma, alpha, flux);
  2718. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma) + compute_B0(alpha);
  2719. Real g = compute_inner_prod(B, B);
  2720. std::cout<<"g = "<<g<<'\n';
  2721. { // Write VTU
  2722. VTUData vtu;
  2723. vtu.AddElems(S.GetElemList(), sigma, ORDER);
  2724. vtu.WriteVTK("sigma", comm);
  2725. }
  2726. { // Write VTU
  2727. VTUData vtu;
  2728. vtu.AddElems(S.GetElemList(), B, ORDER);
  2729. vtu.WriteVTK("B", comm);
  2730. }
  2731. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2732. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2733. if (0) { // test dg_dnu
  2734. auto compute_g = [&S,&comm,&normal,&area_elem,&sigma,&alpha,&compute_norm_area_elem,&compute_B0,&compute_inner_prod](const Vector<ElemBasis>& nu, Real eps) {
  2735. const Long Nelem = S.GetElemList().NElem();
  2736. const Long Nnodes = ElemBasis::Size();
  2737. Vector<ElemBasis> X_orig(Nelem*COORD_DIM);
  2738. for (Long i = 0; i < Nelem; i++) {
  2739. for (Long j = 0; j < Nnodes; j++) {
  2740. X_orig[i*COORD_DIM+0][j] = S.Elem(i,0)[j];
  2741. X_orig[i*COORD_DIM+1][j] = S.Elem(i,1)[j];
  2742. X_orig[i*COORD_DIM+2][j] = S.Elem(i,2)[j];
  2743. S.Elem(i,0)[j] += eps*nu[i][j] * normal[i*COORD_DIM+0][j];
  2744. S.Elem(i,1)[j] += eps*nu[i][j] * normal[i*COORD_DIM+1][j];
  2745. S.Elem(i,2)[j] += eps*nu[i][j] * normal[i*COORD_DIM+2][j];
  2746. }
  2747. }
  2748. compute_norm_area_elem(normal, area_elem);
  2749. Vector<Real> Xt(Nelem*Nnodes*COORD_DIM);
  2750. for (Long i = 0; i < Nelem; i++) {
  2751. for (Long j = 0; j < Nnodes; j++) {
  2752. for (Long k = 0; k < COORD_DIM; k++) {
  2753. Xt[(i*Nnodes+j)*COORD_DIM+k] = S.Elem(i,k)[j] - 1e-4*normal[i*COORD_DIM+k][j];// + eps*nu[i][j] * normal[i*COORD_DIM+k][j];
  2754. }
  2755. }
  2756. }
  2757. Vector<ElemBasis> B0 = compute_B0(alpha);
  2758. Vector<ElemBasis> B1;
  2759. Quadrature<Real> quadrature_FxdU;
  2760. quadrature_FxdU.template Setup<ElemBasis>(S.GetElemList(), Xt, S.Laplace_FxdU, order_singular, order_direct, -1, comm);
  2761. quadrature_FxdU.Eval(B1, S.GetElemList(), sigma, S.Laplace_FxdU);
  2762. Real g = compute_inner_prod(B0+B1, B0+B1);
  2763. for (Long i = 0; i < Nelem; i++) {
  2764. for (Long j = 0; j < Nnodes; j++) {
  2765. S.Elem(i,0)[j] = X_orig[i*COORD_DIM+0][j];
  2766. S.Elem(i,1)[j] = X_orig[i*COORD_DIM+1][j];
  2767. S.Elem(i,2)[j] = X_orig[i*COORD_DIM+2][j];
  2768. }
  2769. }
  2770. compute_norm_area_elem(normal, area_elem);
  2771. return g;
  2772. };
  2773. const Long Nelem = S.GetElemList().NElem();
  2774. const Long Nnodes = ElemBasis::Size();
  2775. Vector<ElemBasis> nu(Nelem);
  2776. nu = 1; //area_elem;
  2777. Vector<ElemBasis> dg_dnu = compute_dg_dnu(sigma, alpha, B);
  2778. std::cout<<compute_inner_prod(dg_dnu, nu)<<'\n';
  2779. { // Write VTU
  2780. VTUData vtu;
  2781. vtu.AddElems(S.GetElemList(), dg_dnu, ORDER);
  2782. vtu.WriteVTK("dg_dnu", comm);
  2783. }
  2784. Real eps = 1e-5;
  2785. Real g0 = compute_g(nu,-eps);
  2786. Real g1 = compute_g(nu,eps);
  2787. std::cout<<"g = "<<g0<<" g = "<<g1<<" dg_dnu = "<<(g1-g0)/(2*eps)<<'\n';
  2788. }
  2789. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2790. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2791. if (0) { // test dg_dsigma
  2792. Vector<ElemBasis> dg_dsigma = compute_dg_dsigma(B);
  2793. { // Write VTU
  2794. VTUData vtu;
  2795. vtu.AddElems(S.GetElemList(), dg_dsigma, ORDER);
  2796. vtu.WriteVTK("dg_dsigma", comm);
  2797. }
  2798. Real dt = 1e-1;
  2799. const Long Nelem = S.GetElemList().NElem();
  2800. const auto& quad_wts = ElemBasis::QuadWts();
  2801. Vector<ElemBasis> dg_dsigma_(Nelem);
  2802. dg_dsigma_ = 0;
  2803. for (Long i = 0; i < Nelem; i++) { // Set dg_dsigma_
  2804. for (Long j = 0; j < ElemBasis::Size(); j++) {
  2805. auto sigma_0 = sigma;
  2806. auto sigma_1 = sigma;
  2807. sigma_0[i][j] -= 0.5*dt;
  2808. sigma_1[i][j] += 0.5*dt;
  2809. auto B_0 = compute_half_n_plus_dG(sigma_0) + compute_B0(alpha);
  2810. auto B_1 = compute_half_n_plus_dG(sigma_1) + compute_B0(alpha);
  2811. auto g_0 = compute_inner_prod(B_0, B_0);
  2812. auto g_1 = compute_inner_prod(B_1, B_1);
  2813. dg_dsigma_[i][j] = (g_1 - g_0) / dt;
  2814. dg_dsigma_[i][j] /= quad_wts[j] * area_elem[i][j];
  2815. std::cout<<dg_dsigma_[i][j]<<' '<<j<<' '<<ElemBasis::Size()<<'\n'; ////////////////
  2816. }
  2817. { // Write VTU
  2818. VTUData vtu;
  2819. vtu.AddElems(S.GetElemList(), dg_dsigma_, ORDER);
  2820. vtu.WriteVTK("dg_dsigma_", comm);
  2821. }
  2822. }
  2823. }
  2824. if (0) { // test dg_dalpha
  2825. Real dg_dalpha = compute_dg_dalpha(B);
  2826. Real dt = 1e-1;
  2827. auto B_0 = compute_half_n_plus_dG(sigma) + compute_B0(alpha - 0.5*dt);
  2828. auto B_1 = compute_half_n_plus_dG(sigma) + compute_B0(alpha + 0.5*dt);
  2829. auto g_0 = compute_inner_prod(B_0, B_0);
  2830. auto g_1 = compute_inner_prod(B_1, B_1);
  2831. Real dg_dalpha_ = (g_1 - g_0) / dt;
  2832. std::cout<<dg_dalpha<<' '<<dg_dalpha_<<'\n';
  2833. }
  2834. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2835. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2836. if (0) { // test compute_A21adj
  2837. const Long Nelem = S.GetElemList().NElem();
  2838. const Long Nnodes = ElemBasis::Size();
  2839. Vector<Real> A21adj_;
  2840. compute_A21adj(A21adj_, flux);
  2841. Vector<ElemBasis> A21adj(Nelem);
  2842. for (Long i = 0; i < Nelem; i++) {
  2843. for (Long j = 0; j < Nnodes; j++) {
  2844. A21adj[i][j] = A21adj_[i*Nnodes+j];
  2845. }
  2846. }
  2847. { // Write VTU
  2848. VTUData vtu;
  2849. vtu.AddElems(S.GetElemList(), A21adj, ORDER);
  2850. vtu.WriteVTK("A21adj", comm);
  2851. }
  2852. { // verify
  2853. Vector<Real> sigma_(Nelem*Nnodes);
  2854. for (Long i = 0; i < Nelem; i++) {
  2855. for (Long j = 0; j < Nnodes; j++) {
  2856. sigma_[i*Nnodes+j] = sigma[i][j];
  2857. }
  2858. }
  2859. Real flux = compute_inner_prod(A21adj, sigma);
  2860. std::cout<<"Error: "<<compute_A21(sigma_)-flux<<'\n';
  2861. }
  2862. { // compute finite-difference matrix
  2863. Real dt = 1e+1;
  2864. const Long Nelem = S.GetElemList().NElem();
  2865. const auto& quad_wts = ElemBasis::QuadWts();
  2866. Vector<ElemBasis> A21(Nelem);
  2867. A21 = 0;
  2868. for (Long i = 0; i < Nelem; i++) { // Set A21
  2869. for (Long j = 0; j < ElemBasis::Size(); j++) {
  2870. Vector<Real> sigma_0(Nelem*ElemBasis::Size());
  2871. Vector<Real> sigma_1(Nelem*ElemBasis::Size());
  2872. sigma_0 = 0;
  2873. sigma_1 = 0;
  2874. sigma_0[i*ElemBasis::Size()+j] -= 0.5*dt;
  2875. sigma_1[i*ElemBasis::Size()+j] += 0.5*dt;
  2876. auto flux_0 = compute_A21(sigma_0);
  2877. auto flux_1 = compute_A21(sigma_1);
  2878. A21[i][j] = (flux_1 - flux_0) / dt;
  2879. A21[i][j] /= quad_wts[j] * area_elem[i][j];
  2880. std::cout<<A21[i][j]<<' '<<j<<' '<<ElemBasis::Size()<<'\n'; ////////////////
  2881. }
  2882. { // Write VTU
  2883. VTUData vtu;
  2884. vtu.AddElems(S.GetElemList(), A21, ORDER);
  2885. vtu.WriteVTK("A21", comm);
  2886. }
  2887. }
  2888. }
  2889. }
  2890. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2891. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2892. auto compute_invA11 = [&S,&normal,&comm,&compute_A11](const Vector<ElemBasis>& rhs) { // Solver for sigma: sigma/2 + n.dG[sigma] = rhs
  2893. typename sctl::ParallelSolver<Real>::ParallelOp BIOp = [&S,&normal,&compute_A11](sctl::Vector<Real>* A11_sigma, const sctl::Vector<Real>& sigma) {
  2894. compute_A11(*A11_sigma, sigma);
  2895. };
  2896. const Long Nelem = S.GetElemList().NElem();
  2897. const Long Nnodes = ElemBasis::Size();
  2898. Vector<ElemBasis> sigma(Nelem);
  2899. Vector<Real> rhs_(Nelem * Nnodes), sigma_(Nelem * Nnodes);
  2900. for (Long i = 0; i < Nelem; i++) {
  2901. for (Long j = 0; j < Nnodes; j++) {
  2902. rhs_[i*Nnodes+j] = rhs[i][j];
  2903. sigma_[i*Nnodes+j] = 0;
  2904. }
  2905. }
  2906. ParallelSolver<Real> linear_solver(comm, true);
  2907. linear_solver(&sigma_, BIOp, rhs_, 1e-8, 50);
  2908. for (Long i = 0; i < Nelem; i++) {
  2909. for (Long j = 0; j < Nnodes; j++) {
  2910. sigma[i][j] = sigma_[i*Nnodes+j];
  2911. }
  2912. }
  2913. return sigma;
  2914. };
  2915. auto compute_invA11adj = [&S,&normal,&comm,&compute_A11adj](const Vector<ElemBasis>& rhs) { // Solver for sigma: A11adj sigma = rhs
  2916. typename sctl::ParallelSolver<Real>::ParallelOp BIOp = [&S,&compute_A11adj](sctl::Vector<Real>* A11adj_sigma, const sctl::Vector<Real>& sigma) {
  2917. compute_A11adj(*A11adj_sigma, sigma);
  2918. };
  2919. const Long Nelem = S.GetElemList().NElem();
  2920. const Long Nnodes = ElemBasis::Size();
  2921. Vector<ElemBasis> sigma(Nelem);
  2922. Vector<Real> rhs_(Nelem * Nnodes), sigma_(Nelem * Nnodes);
  2923. for (Long i = 0; i < Nelem; i++) {
  2924. for (Long j = 0; j < Nnodes; j++) {
  2925. rhs_[i*Nnodes+j] = rhs[i][j];
  2926. sigma_[i*Nnodes+j] = 0;
  2927. }
  2928. }
  2929. ParallelSolver<Real> linear_solver(comm, true);
  2930. linear_solver(&sigma_, BIOp, rhs_, 1e-8, 50);
  2931. for (Long i = 0; i < Nelem; i++) {
  2932. for (Long j = 0; j < Nnodes; j++) {
  2933. sigma[i][j] = sigma_[i*Nnodes+j];
  2934. }
  2935. }
  2936. return sigma;
  2937. };
  2938. if (0) { // Test invA11adj
  2939. Vector<ElemBasis> dg_dsigma = compute_dg_dsigma(B);
  2940. Real a = compute_inner_prod(dg_dsigma, compute_invA11(sigma));
  2941. Real b = compute_inner_prod(compute_invA11adj(dg_dsigma), sigma);
  2942. std::cout<<a<<' '<<b<<'\n';
  2943. }
  2944. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2945. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  2946. // 0.168275 0.117983 -0.110446 -96.7293
  2947. // 0.603869 -1.901900 -1.229930 -245.5050
  2948. auto compute_u_dAdnu_v_00 = [&S,&normal,&comm,&compute_half_n_plus_dG,&compute_grad_adj] (const Vector<Real>& u_, const Vector<Real>& v_) {
  2949. const Long Nelem = S.GetElemList().NElem();
  2950. const Long Nnodes = ElemBasis::Size();
  2951. Vector<ElemBasis> u(Nelem), u_n(Nelem*COORD_DIM), v(Nelem);
  2952. for (Long i = 0; i < Nelem; i++) {
  2953. for (Long j = 0; j < Nnodes; j++) {
  2954. u[i][j] = u_[i*Nnodes+j];
  2955. v[i][j] = v_[i*Nnodes+j];
  2956. u_n[i*COORD_DIM+0][j] = u[i][j] * normal[i*COORD_DIM+0][j];
  2957. u_n[i*COORD_DIM+1][j] = u[i][j] * normal[i*COORD_DIM+1][j];
  2958. u_n[i*COORD_DIM+2][j] = u[i][j] * normal[i*COORD_DIM+2][j];
  2959. }
  2960. }
  2961. Vector<ElemBasis> dAdnu0(Nelem), dAdnu1(Nelem), dAdnu2(Nelem), dAdnu3(Nelem);
  2962. dAdnu0 = 0;
  2963. dAdnu1 = 0;
  2964. dAdnu2 = 0;
  2965. dAdnu3 = 0;
  2966. Vector<ElemBasis> H(Nelem);
  2967. { // Set mean curvature H
  2968. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  2969. Vector<ElemBasis> dX, d2X;
  2970. ElemBasis::Grad(dX, X);
  2971. ElemBasis::Grad(d2X, dX);
  2972. for (Long i = 0; i < Nelem; i++) {
  2973. for (Long j = 0; j < Nnodes; j++) {
  2974. Tensor<Real,true,2,2> I, invI, II;
  2975. for (Long k0 = 0; k0 < 2; k0++) {
  2976. for (Long k1 = 0; k1 < 2; k1++) {
  2977. I(k0,k1) = 0;
  2978. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  2979. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  2980. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  2981. II(k0,k1) = 0;
  2982. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  2983. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  2984. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  2985. }
  2986. }
  2987. { // Set invI
  2988. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  2989. invI(0,0) = I(1,1) / detI;
  2990. invI(0,1) = -I(0,1) / detI;
  2991. invI(1,0) = -I(1,0) / detI;
  2992. invI(1,1) = I(0,0) / detI;
  2993. }
  2994. { // Set H
  2995. H[i][j] = 0;
  2996. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  2997. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  2998. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  2999. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3000. }
  3001. }
  3002. }
  3003. }
  3004. // dAdnu0 = u B \cdot grad_nu
  3005. Vector<ElemBasis> B = compute_half_n_plus_dG(v);
  3006. Vector<ElemBasis> u_B(Nelem*COORD_DIM);
  3007. for (Long i = 0; i < Nelem; i++) {
  3008. for (Long j = 0; j < Nnodes; j++) {
  3009. u_B[i*COORD_DIM+0][j] = u[i][j] * B[i*COORD_DIM+0][j];
  3010. u_B[i*COORD_DIM+1][j] = u[i][j] * B[i*COORD_DIM+1][j];
  3011. u_B[i*COORD_DIM+2][j] = u[i][j] * B[i*COORD_DIM+2][j];
  3012. }
  3013. }
  3014. dAdnu0 = compute_grad_adj(u_B)*(-1.0);
  3015. // dAdnu1 = (2H) v (I/2 + \nabla G)^T [u n]
  3016. Quadrature<Real> quadrature_dUxF;
  3017. quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  3018. quadrature_dUxF.Eval(dAdnu1, S.GetElemList(), u_n, S.Laplace_dUxF);
  3019. for (Long i = 0; i < Nelem; i++) {
  3020. for (Long j = 0; j < Nnodes; j++) {
  3021. dAdnu1[i][j] *= -2*H[i][j] * v[i][j];
  3022. }
  3023. }
  3024. // dAdnu2 = (u n) \cdot (n \cdnot \nabla) \nabla G[v]
  3025. Vector<ElemBasis> d2G_v;
  3026. Quadrature<Real> quadrature_Fxd2U;
  3027. quadrature_Fxd2U.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_Fxd2U, order_singular, order_direct, -1.0, comm, -0.01 * pow<-2,Real>(ORDER));
  3028. quadrature_Fxd2U.Eval(d2G_v, S.GetElemList(), v, S.Laplace_Fxd2U);
  3029. for (Long i = 0; i < Nelem; i++) {
  3030. for (Long j = 0; j < Nnodes; j++) {
  3031. dAdnu2[i][j] = 0;
  3032. dAdnu2[i][j] -= d2G_v[i*9+0][j] * normal[i*COORD_DIM+0][j] * u_n[i*COORD_DIM+0][j];
  3033. dAdnu2[i][j] -= d2G_v[i*9+1][j] * normal[i*COORD_DIM+0][j] * u_n[i*COORD_DIM+1][j];
  3034. dAdnu2[i][j] -= d2G_v[i*9+2][j] * normal[i*COORD_DIM+0][j] * u_n[i*COORD_DIM+2][j];
  3035. dAdnu2[i][j] -= d2G_v[i*9+3][j] * normal[i*COORD_DIM+1][j] * u_n[i*COORD_DIM+0][j];
  3036. dAdnu2[i][j] -= d2G_v[i*9+4][j] * normal[i*COORD_DIM+1][j] * u_n[i*COORD_DIM+1][j];
  3037. dAdnu2[i][j] -= d2G_v[i*9+5][j] * normal[i*COORD_DIM+1][j] * u_n[i*COORD_DIM+2][j];
  3038. dAdnu2[i][j] -= d2G_v[i*9+6][j] * normal[i*COORD_DIM+2][j] * u_n[i*COORD_DIM+0][j];
  3039. dAdnu2[i][j] -= d2G_v[i*9+7][j] * normal[i*COORD_DIM+2][j] * u_n[i*COORD_DIM+1][j];
  3040. dAdnu2[i][j] -= d2G_v[i*9+8][j] * normal[i*COORD_DIM+2][j] * u_n[i*COORD_DIM+2][j];
  3041. }
  3042. }
  3043. // dAdnu3 = (v n \cdot \nabla D[u]
  3044. Vector<ElemBasis> nablaDt_u_n;
  3045. Quadrature<Real> quadrature_dUxD;
  3046. quadrature_dUxD.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxD, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  3047. quadrature_dUxD.Eval(nablaDt_u_n, S.GetElemList(), u_n, S.Laplace_dUxD);
  3048. for (Long i = 0; i < Nelem; i++) {
  3049. for (Long j = 0; j < Nnodes; j++) {
  3050. dAdnu3[i][j] = 0;
  3051. dAdnu3[i][j] += v[i][j] * nablaDt_u_n[i*COORD_DIM+0][j]*normal[i*COORD_DIM+0][j];
  3052. dAdnu3[i][j] += v[i][j] * nablaDt_u_n[i*COORD_DIM+1][j]*normal[i*COORD_DIM+1][j];
  3053. dAdnu3[i][j] += v[i][j] * nablaDt_u_n[i*COORD_DIM+2][j]*normal[i*COORD_DIM+2][j];
  3054. }
  3055. }
  3056. return dAdnu0 + dAdnu1 + dAdnu2 + dAdnu3;
  3057. };
  3058. auto compute_u_dAdnu_v_01 = [&S,&comm,&compute_dB0,&normal,&area_elem,&compute_B0,&compute_grad_adj] (const Vector<Real>& u, const Vector<Real>& v) {
  3059. const Long Nelem = S.GetElemList().NElem();
  3060. const Long Nnodes = ElemBasis::Size();
  3061. Vector<ElemBasis> dAdnu(Nelem);
  3062. Vector<ElemBasis> dB0 = compute_dB0(v[Nelem*Nnodes]);
  3063. for (Long i = 0; i < Nelem; i++) {
  3064. for (Long j = 0; j < Nnodes; j++) {
  3065. Real n_n_dB0 = 0;
  3066. n_n_dB0 += dB0[i*9+0][j] * normal[i*COORD_DIM+0][j] * normal[i*COORD_DIM+0][j];
  3067. n_n_dB0 += dB0[i*9+1][j] * normal[i*COORD_DIM+1][j] * normal[i*COORD_DIM+0][j];
  3068. n_n_dB0 += dB0[i*9+2][j] * normal[i*COORD_DIM+2][j] * normal[i*COORD_DIM+0][j];
  3069. n_n_dB0 += dB0[i*9+3][j] * normal[i*COORD_DIM+0][j] * normal[i*COORD_DIM+1][j];
  3070. n_n_dB0 += dB0[i*9+4][j] * normal[i*COORD_DIM+1][j] * normal[i*COORD_DIM+1][j];
  3071. n_n_dB0 += dB0[i*9+5][j] * normal[i*COORD_DIM+2][j] * normal[i*COORD_DIM+1][j];
  3072. n_n_dB0 += dB0[i*9+6][j] * normal[i*COORD_DIM+0][j] * normal[i*COORD_DIM+2][j];
  3073. n_n_dB0 += dB0[i*9+7][j] * normal[i*COORD_DIM+1][j] * normal[i*COORD_DIM+2][j];
  3074. n_n_dB0 += dB0[i*9+8][j] * normal[i*COORD_DIM+2][j] * normal[i*COORD_DIM+2][j];
  3075. dAdnu[i][j] = u[i*Nnodes+j] * n_n_dB0;
  3076. }
  3077. }
  3078. Vector<ElemBasis> B0 = compute_B0(v[Nelem*Nnodes]);
  3079. Vector<ElemBasis> u_B0(Nelem*COORD_DIM);
  3080. for (Long i = 0; i < Nelem; i++) {
  3081. for (Long j = 0; j < Nnodes; j++) {
  3082. u_B0[i*COORD_DIM+0][j] = u[i*Nnodes+j] * B0[i*COORD_DIM+0][j];
  3083. u_B0[i*COORD_DIM+1][j] = u[i*Nnodes+j] * B0[i*COORD_DIM+1][j];
  3084. u_B0[i*COORD_DIM+2][j] = u[i*Nnodes+j] * B0[i*COORD_DIM+2][j];
  3085. }
  3086. }
  3087. dAdnu -= compute_grad_adj(u_B0);
  3088. return dAdnu;
  3089. };
  3090. auto compute_u_dAdnu_v_10 = [&S,&comm,&area_elem,&normal,&compute_dot_prod,&compute_grad_adj,&compute_half_n_plus_dG] (const Vector<Real>& u, const Vector<Real>& v) {
  3091. const Long Nelem = S.GetElemList().NElem();
  3092. const Long Nnodes = ElemBasis::Size();
  3093. Vector<ElemBasis> sigma(Nelem);
  3094. for (Long i = 0; i < Nelem; i++) {
  3095. for (Long j = 0; j < Nnodes; j++) {
  3096. sigma[i][j] = v[i*Nnodes+j];
  3097. }
  3098. }
  3099. auto compute_v = [&S,&area_elem] () {
  3100. const Long Nelem = S.GetElemList().NElem();
  3101. const Long Nnodes = ElemBasis::Size();
  3102. Vector<ElemBasis> v(Nelem * COORD_DIM);
  3103. Vector<ElemBasis> dX;
  3104. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  3105. for (Long i = 0; i < Nelem; i++) {
  3106. for (Long j = 0; j < Nnodes; j++) {
  3107. Tensor<Real,true,COORD_DIM,2> dx;
  3108. dx(0,0) = dX[i*COORD_DIM*2+0][j];
  3109. dx(0,1) = dX[i*COORD_DIM*2+1][j];
  3110. dx(1,0) = dX[i*COORD_DIM*2+2][j];
  3111. dx(1,1) = dX[i*COORD_DIM*2+3][j];
  3112. dx(2,0) = dX[i*COORD_DIM*2+4][j];
  3113. dx(2,1) = dX[i*COORD_DIM*2+5][j];
  3114. Real s = 1 / (area_elem[i][j] * S.NtNp_[0]);
  3115. for (Long k = 0; k < COORD_DIM; k++) {
  3116. v[i*COORD_DIM+k][j] = dx(k,1) * s;
  3117. }
  3118. }
  3119. }
  3120. return v;
  3121. };
  3122. auto compute_AxB = [&S] (const Vector<ElemBasis>& A, const Vector<ElemBasis>& B) {
  3123. const Long Nelem = S.GetElemList().NElem();
  3124. const Long Nnodes = ElemBasis::Size();
  3125. Vector<ElemBasis> J(Nelem * COORD_DIM);
  3126. for (Long i = 0; i < Nelem; i++) { // Set J
  3127. for (Long j = 0; j < Nnodes; j++) {
  3128. Tensor<Real,true,COORD_DIM> a, b;
  3129. a(0) = A[i*COORD_DIM+0][j];
  3130. a(1) = A[i*COORD_DIM+1][j];
  3131. a(2) = A[i*COORD_DIM+2][j];
  3132. b(0) = B[i*COORD_DIM+0][j];
  3133. b(1) = B[i*COORD_DIM+1][j];
  3134. b(2) = B[i*COORD_DIM+2][j];
  3135. J[i*COORD_DIM+0][j] = a(1) * b(2) - a(2) * b(1);
  3136. J[i*COORD_DIM+1][j] = a(2) * b(0) - a(0) * b(2);
  3137. J[i*COORD_DIM+2][j] = a(0) * b(1) - a(1) * b(0);
  3138. }
  3139. }
  3140. return J;
  3141. };
  3142. auto compute_dphi_dnu0 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,compute_grad_adj,sigma] () {
  3143. const Long Nelem = S.GetElemList().NElem();
  3144. const Long Nnodes = ElemBasis::Size();
  3145. Vector<ElemBasis> Gv;
  3146. Vector<ElemBasis> v = compute_v();
  3147. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3148. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3149. Vector<ElemBasis> BxGv = compute_AxB(B,Gv);
  3150. return compute_grad_adj(BxGv)*(-1.0);
  3151. };
  3152. auto compute_dphi_dnu1 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,&compute_dot_prod,sigma] () {
  3153. const Long Nelem = S.GetElemList().NElem();
  3154. const Long Nnodes = ElemBasis::Size();
  3155. Vector<ElemBasis> H(Nelem);
  3156. { // Set mean curvature H
  3157. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3158. Vector<ElemBasis> dX, d2X;
  3159. ElemBasis::Grad(dX, X);
  3160. ElemBasis::Grad(d2X, dX);
  3161. for (Long i = 0; i < Nelem; i++) {
  3162. for (Long j = 0; j < Nnodes; j++) {
  3163. Tensor<Real,true,2,2> I, invI, II;
  3164. for (Long k0 = 0; k0 < 2; k0++) {
  3165. for (Long k1 = 0; k1 < 2; k1++) {
  3166. I(k0,k1) = 0;
  3167. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3168. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3169. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3170. II(k0,k1) = 0;
  3171. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3172. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3173. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3174. }
  3175. }
  3176. { // Set invI
  3177. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3178. invI(0,0) = I(1,1) / detI;
  3179. invI(0,1) = -I(0,1) / detI;
  3180. invI(1,0) = -I(1,0) / detI;
  3181. invI(1,1) = I(0,0) / detI;
  3182. }
  3183. { // Set H
  3184. H[i][j] = 0;
  3185. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3186. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3187. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3188. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3189. }
  3190. }
  3191. }
  3192. }
  3193. Vector<ElemBasis> Gv;
  3194. Vector<ElemBasis> v = compute_v();
  3195. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3196. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3197. Vector<ElemBasis> BxGv = compute_AxB(B,Gv);
  3198. Vector<ElemBasis> n_dot_BxGv = compute_dot_prod(normal,BxGv);
  3199. Vector<ElemBasis> dphi_dnu(Nelem);
  3200. for (Long i = 0; i < Nelem; i++) {
  3201. for (Long j = 0; j < Nnodes; j++) {
  3202. dphi_dnu[i][j] = n_dot_BxGv[i][j] * 2*H[i][j];
  3203. }
  3204. }
  3205. return dphi_dnu;
  3206. };
  3207. auto compute_dphi_dnu2 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,&compute_dot_prod,sigma] () {
  3208. const Long Nelem = S.GetElemList().NElem();
  3209. const Long Nnodes = ElemBasis::Size();
  3210. Vector<ElemBasis> H(Nelem);
  3211. { // Set mean curvature H
  3212. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3213. Vector<ElemBasis> dX, d2X;
  3214. ElemBasis::Grad(dX, X);
  3215. ElemBasis::Grad(d2X, dX);
  3216. for (Long i = 0; i < Nelem; i++) {
  3217. for (Long j = 0; j < Nnodes; j++) {
  3218. Tensor<Real,true,2,2> I, invI, II;
  3219. for (Long k0 = 0; k0 < 2; k0++) {
  3220. for (Long k1 = 0; k1 < 2; k1++) {
  3221. I(k0,k1) = 0;
  3222. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3223. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3224. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3225. II(k0,k1) = 0;
  3226. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3227. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3228. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3229. }
  3230. }
  3231. { // Set invI
  3232. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3233. invI(0,0) = I(1,1) / detI;
  3234. invI(0,1) = -I(0,1) / detI;
  3235. invI(1,0) = -I(1,0) / detI;
  3236. invI(1,1) = I(0,0) / detI;
  3237. }
  3238. { // Set H
  3239. H[i][j] = 0;
  3240. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3241. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3242. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3243. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3244. }
  3245. }
  3246. }
  3247. }
  3248. Vector<ElemBasis> GnxB;
  3249. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3250. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3251. S.quadrature_FxU.Eval(GnxB, S.GetElemList(), nxB, S.Laplace_FxU);
  3252. Vector<ElemBasis> v = compute_v();
  3253. Vector<ElemBasis> v_dot_GnxB = compute_dot_prod(v,GnxB);
  3254. Vector<ElemBasis> dphi_dnu(Nelem);
  3255. for (Long i = 0; i < Nelem; i++) {
  3256. for (Long j = 0; j < Nnodes; j++) {
  3257. dphi_dnu[i][j] = v_dot_GnxB[i][j] * 2*H[i][j];
  3258. }
  3259. }
  3260. return dphi_dnu;
  3261. };
  3262. auto compute_dphi_dnu3 = [&S,&normal,&area_elem,&compute_AxB,&compute_half_n_plus_dG,sigma] () {
  3263. const Long Nelem = S.GetElemList().NElem();
  3264. const Long Nnodes = ElemBasis::Size();
  3265. Vector<ElemBasis> GnxB;
  3266. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3267. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3268. S.quadrature_FxU.Eval(GnxB, S.GetElemList(), nxB, S.Laplace_FxU);
  3269. Vector<ElemBasis> H(Nelem);
  3270. { // Set mean curvature H
  3271. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3272. Vector<ElemBasis> dX, d2X;
  3273. ElemBasis::Grad(dX, X);
  3274. ElemBasis::Grad(d2X, dX);
  3275. for (Long i = 0; i < Nelem; i++) {
  3276. for (Long j = 0; j < Nnodes; j++) {
  3277. Tensor<Real,true,2,2> I, invI, II;
  3278. for (Long k0 = 0; k0 < 2; k0++) {
  3279. for (Long k1 = 0; k1 < 2; k1++) {
  3280. I(k0,k1) = 0;
  3281. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3282. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3283. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3284. II(k0,k1) = 0;
  3285. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3286. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3287. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3288. }
  3289. }
  3290. { // Set invI
  3291. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3292. invI(0,0) = I(1,1) / detI;
  3293. invI(0,1) = -I(0,1) / detI;
  3294. invI(1,0) = -I(1,0) / detI;
  3295. invI(1,1) = I(0,0) / detI;
  3296. }
  3297. { // Set H
  3298. H[i][j] = 0;
  3299. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3300. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3301. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3302. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3303. }
  3304. }
  3305. }
  3306. }
  3307. Vector<ElemBasis> dv_dnu1(Nelem), dv_dnu2(Nelem), dv_dnu3(Nelem);
  3308. { // Set dv_dnu1, dv_dnu2, dv_dnu3
  3309. Vector<ElemBasis> dX, dn, V_tmp(Nelem);
  3310. ElemBasis::Grad(dn, normal);
  3311. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  3312. for (Long i = 0; i < Nelem; i++) {
  3313. for (Long j = 0; j < Nnodes; j++) {
  3314. dv_dnu1[i][j] = 0;
  3315. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+0][j] * dX[(i*COORD_DIM+0)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  3316. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+1][j] * dX[(i*COORD_DIM+1)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  3317. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+2][j] * dX[(i*COORD_DIM+2)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  3318. dv_dnu2[i][j] = 0;
  3319. dv_dnu2[i][j] += GnxB[i*COORD_DIM+0][j] * dn[(i*COORD_DIM+0)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  3320. dv_dnu2[i][j] += GnxB[i*COORD_DIM+1][j] * dn[(i*COORD_DIM+1)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  3321. dv_dnu2[i][j] += GnxB[i*COORD_DIM+2][j] * dn[(i*COORD_DIM+2)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  3322. V_tmp[i][j] = 0;
  3323. V_tmp[i][j] += GnxB[i*COORD_DIM+0][j] * normal[i*COORD_DIM+0][j] / S.NtNp_[0]; //dnu[i*2+1][j] *
  3324. V_tmp[i][j] += GnxB[i*COORD_DIM+1][j] * normal[i*COORD_DIM+1][j] / S.NtNp_[0]; //dnu[i*2+1][j] *
  3325. V_tmp[i][j] += GnxB[i*COORD_DIM+2][j] * normal[i*COORD_DIM+2][j] / S.NtNp_[0]; //dnu[i*2+1][j] *
  3326. }
  3327. }
  3328. { // dv_dnu3 <-- grad_adj V_tmp
  3329. Vector<ElemBasis> grad_adj_V_tmp(Nelem);
  3330. ElemBasis::Grad(grad_adj_V_tmp, V_tmp);
  3331. for (Long i = 0; i < Nelem; i++) {
  3332. for (Long j = 0; j < Nnodes; j++) {
  3333. dv_dnu3[i][j] = -grad_adj_V_tmp[i*2+1][j] / area_elem[i][j];
  3334. }
  3335. }
  3336. }
  3337. }
  3338. return dv_dnu1+dv_dnu2+dv_dnu3;
  3339. };
  3340. auto compute_dphi_dnu4 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,sigma] () {
  3341. const Long Nelem = S.GetElemList().NElem();
  3342. const Long Nnodes = ElemBasis::Size();
  3343. Vector<ElemBasis> dGnxB;
  3344. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3345. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3346. S.quadrature_FxdU.Eval(dGnxB, S.GetElemList(), nxB, S.Laplace_FxdU);
  3347. Vector<ElemBasis> v = compute_v();
  3348. Vector<ElemBasis> dphi_dnu(Nelem);
  3349. for (Long i = 0; i < Nelem; i++) {
  3350. for (Long j = 0; j < Nnodes; j++) {
  3351. Real dphi_dnu_ = 0;
  3352. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+0][j] * v[i*COORD_DIM+0][j];
  3353. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+1][j] * v[i*COORD_DIM+0][j];
  3354. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+2][j] * v[i*COORD_DIM+0][j];
  3355. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+0][j] * v[i*COORD_DIM+1][j];
  3356. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+1][j] * v[i*COORD_DIM+1][j];
  3357. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+2][j] * v[i*COORD_DIM+1][j];
  3358. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+0][j] * v[i*COORD_DIM+2][j];
  3359. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+1][j] * v[i*COORD_DIM+2][j];
  3360. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+2][j] * v[i*COORD_DIM+2][j];
  3361. dphi_dnu[i][j] = dphi_dnu_;
  3362. }
  3363. }
  3364. return dphi_dnu;
  3365. };
  3366. auto compute_dphi_dnu5 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,sigma] () {
  3367. const Long Nelem = S.GetElemList().NElem();
  3368. const Long Nnodes = ElemBasis::Size();
  3369. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3370. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3371. Vector<ElemBasis> dGv;
  3372. Vector<ElemBasis> v = compute_v();
  3373. S.quadrature_FxdU.Eval(dGv, S.GetElemList(), v, S.Laplace_FxdU);
  3374. Vector<ElemBasis> dphi_dnu(Nelem);
  3375. for (Long i = 0; i < Nelem; i++) {
  3376. for (Long j = 0; j < Nnodes; j++) {
  3377. Real dphi_dnu_ = 0;
  3378. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+0][j] * nxB[i*COORD_DIM+0][j];
  3379. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+1][j] * nxB[i*COORD_DIM+0][j];
  3380. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+2][j] * nxB[i*COORD_DIM+0][j];
  3381. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+0][j] * nxB[i*COORD_DIM+1][j];
  3382. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+1][j] * nxB[i*COORD_DIM+1][j];
  3383. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+2][j] * nxB[i*COORD_DIM+1][j];
  3384. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+0][j] * nxB[i*COORD_DIM+2][j];
  3385. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+1][j] * nxB[i*COORD_DIM+2][j];
  3386. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+2][j] * nxB[i*COORD_DIM+2][j];
  3387. dphi_dnu[i][j] = dphi_dnu_;
  3388. }
  3389. }
  3390. return dphi_dnu;
  3391. };
  3392. auto compute_dphi_dnu6 = [&S,&normal,&compute_AxB,&compute_v,sigma,&comm] () {
  3393. const Long Nelem = S.GetElemList().NElem();
  3394. const Long Nnodes = ElemBasis::Size();
  3395. Vector<ElemBasis> Gv;
  3396. Vector<ElemBasis> v = compute_v();
  3397. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3398. Vector<ElemBasis> nxGv = compute_AxB(Gv,normal);
  3399. Vector<ElemBasis> gradB;
  3400. Quadrature<Real> quadrature_Fxd2U;
  3401. quadrature_Fxd2U.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_Fxd2U, order_singular, order_direct, -1.0, comm, -0.01 * pow<-2,Real>(ORDER));
  3402. quadrature_Fxd2U.Eval(gradB, S.GetElemList(), sigma, S.Laplace_Fxd2U);
  3403. Vector<ElemBasis> dphi_dnu(Nelem);
  3404. for (Long i = 0; i < Nelem; i++) {
  3405. for (Long j = 0; j < Nnodes; j++) {
  3406. Real dphi_dnu_ = 0;
  3407. dphi_dnu_ += -nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+0][j] * normal[i*COORD_DIM+0][j];
  3408. dphi_dnu_ += -nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+1][j] * normal[i*COORD_DIM+0][j];
  3409. dphi_dnu_ += -nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+2][j] * normal[i*COORD_DIM+0][j];
  3410. dphi_dnu_ += -nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+0][j] * normal[i*COORD_DIM+1][j];
  3411. dphi_dnu_ += -nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+1][j] * normal[i*COORD_DIM+1][j];
  3412. dphi_dnu_ += -nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+2][j] * normal[i*COORD_DIM+1][j];
  3413. dphi_dnu_ += -nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+0][j] * normal[i*COORD_DIM+2][j];
  3414. dphi_dnu_ += -nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+1][j] * normal[i*COORD_DIM+2][j];
  3415. dphi_dnu_ += -nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+2][j] * normal[i*COORD_DIM+2][j];
  3416. dphi_dnu[i][j] = dphi_dnu_;
  3417. }
  3418. }
  3419. return dphi_dnu;
  3420. };
  3421. auto compute_dphi_dnu7 = [&S,&normal,&compute_AxB,&compute_v,sigma,&comm] () {
  3422. const Long Nelem = S.GetElemList().NElem();
  3423. const Long Nnodes = ElemBasis::Size();
  3424. Vector<ElemBasis> H(Nelem);
  3425. { // Set mean curvature H
  3426. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3427. Vector<ElemBasis> dX, d2X;
  3428. ElemBasis::Grad(dX, X);
  3429. ElemBasis::Grad(d2X, dX);
  3430. for (Long i = 0; i < Nelem; i++) {
  3431. for (Long j = 0; j < Nnodes; j++) {
  3432. Tensor<Real,true,2,2> I, invI, II;
  3433. for (Long k0 = 0; k0 < 2; k0++) {
  3434. for (Long k1 = 0; k1 < 2; k1++) {
  3435. I(k0,k1) = 0;
  3436. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3437. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3438. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3439. II(k0,k1) = 0;
  3440. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3441. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3442. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3443. }
  3444. }
  3445. { // Set invI
  3446. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3447. invI(0,0) = I(1,1) / detI;
  3448. invI(0,1) = -I(0,1) / detI;
  3449. invI(1,0) = -I(1,0) / detI;
  3450. invI(1,1) = I(0,0) / detI;
  3451. }
  3452. { // Set H
  3453. H[i][j] = 0;
  3454. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3455. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3456. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3457. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3458. }
  3459. }
  3460. }
  3461. }
  3462. Vector<ElemBasis> Gv;
  3463. Vector<ElemBasis> v = compute_v();
  3464. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3465. Vector<ElemBasis> nxGv = compute_AxB(Gv,normal);
  3466. Vector<ElemBasis> dphi_dnu(Nelem);
  3467. Quadrature<Real> quadrature_dUxF;
  3468. quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  3469. quadrature_dUxF.Eval(dphi_dnu, S.GetElemList(), nxGv, S.Laplace_dUxF);
  3470. for (Long i = 0; i < Nelem; i++) {
  3471. for (Long j = 0; j < Nnodes; j++) {
  3472. dphi_dnu[i][j] *= -2*H[i][j] * sigma[i][j];
  3473. }
  3474. }
  3475. return dphi_dnu;
  3476. };
  3477. auto compute_dphi_dnu8 = [&S,&normal,&compute_AxB,&compute_v,sigma,&comm] () {
  3478. const Long Nelem = S.GetElemList().NElem();
  3479. const Long Nnodes = ElemBasis::Size();
  3480. Vector<ElemBasis> H(Nelem);
  3481. { // Set mean curvature H
  3482. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3483. Vector<ElemBasis> dX, d2X;
  3484. ElemBasis::Grad(dX, X);
  3485. ElemBasis::Grad(d2X, dX);
  3486. for (Long i = 0; i < Nelem; i++) {
  3487. for (Long j = 0; j < Nnodes; j++) {
  3488. Tensor<Real,true,2,2> I, invI, II;
  3489. for (Long k0 = 0; k0 < 2; k0++) {
  3490. for (Long k1 = 0; k1 < 2; k1++) {
  3491. I(k0,k1) = 0;
  3492. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3493. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3494. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3495. II(k0,k1) = 0;
  3496. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3497. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3498. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3499. }
  3500. }
  3501. { // Set invI
  3502. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3503. invI(0,0) = I(1,1) / detI;
  3504. invI(0,1) = -I(0,1) / detI;
  3505. invI(1,0) = -I(1,0) / detI;
  3506. invI(1,1) = I(0,0) / detI;
  3507. }
  3508. { // Set H
  3509. H[i][j] = 0;
  3510. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3511. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3512. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3513. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3514. }
  3515. }
  3516. }
  3517. }
  3518. Vector<ElemBasis> Gv;
  3519. Vector<ElemBasis> v = compute_v();
  3520. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3521. Vector<ElemBasis> nxGv = compute_AxB(Gv,normal);
  3522. Vector<ElemBasis> dphi_dnu(Nelem);
  3523. Vector<ElemBasis> nablaDt_nxGv;
  3524. Quadrature<Real> quadrature_dUxD;
  3525. quadrature_dUxD.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxD, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  3526. quadrature_dUxD.Eval(nablaDt_nxGv, S.GetElemList(), nxGv, S.Laplace_dUxD);
  3527. for (Long i = 0; i < Nelem; i++) {
  3528. for (Long j = 0; j < Nnodes; j++) {
  3529. dphi_dnu[i][j] = 0;
  3530. dphi_dnu[i][j] += sigma[i][j] * nablaDt_nxGv[i*COORD_DIM+0][j]*normal[i*COORD_DIM+0][j];
  3531. dphi_dnu[i][j] += sigma[i][j] * nablaDt_nxGv[i*COORD_DIM+1][j]*normal[i*COORD_DIM+1][j];
  3532. dphi_dnu[i][j] += sigma[i][j] * nablaDt_nxGv[i*COORD_DIM+2][j]*normal[i*COORD_DIM+2][j];
  3533. }
  3534. }
  3535. return dphi_dnu;
  3536. };
  3537. auto dphi_dnu0 = compute_dphi_dnu0();
  3538. auto dphi_dnu1 = compute_dphi_dnu1();
  3539. auto dphi_dnu2 = compute_dphi_dnu2();
  3540. auto dphi_dnu3 = compute_dphi_dnu3();
  3541. auto dphi_dnu4 = compute_dphi_dnu4();
  3542. auto dphi_dnu5 = compute_dphi_dnu5();
  3543. auto dphi_dnu6 = compute_dphi_dnu6();
  3544. auto dphi_dnu7 = compute_dphi_dnu7();
  3545. auto dphi_dnu8 = compute_dphi_dnu8();
  3546. return (dphi_dnu0+dphi_dnu1+dphi_dnu2+dphi_dnu3+dphi_dnu4+dphi_dnu5+dphi_dnu6+dphi_dnu7+dphi_dnu8) * u[Nelem*Nnodes];
  3547. };
  3548. auto compute_u_dAdnu_v_11 = [&S,&comm,&area_elem,&normal,&compute_dot_prod,&compute_grad_adj,&compute_B0,&compute_dB0] (const Vector<Real>& u, const Vector<Real>& v) {
  3549. const Long Nelem = S.GetElemList().NElem();
  3550. const Long Nnodes = ElemBasis::Size();
  3551. auto compute_v = [&S,&area_elem] () {
  3552. const Long Nelem = S.GetElemList().NElem();
  3553. const Long Nnodes = ElemBasis::Size();
  3554. Vector<ElemBasis> v(Nelem * COORD_DIM);
  3555. Vector<ElemBasis> dX;
  3556. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  3557. for (Long i = 0; i < Nelem; i++) {
  3558. for (Long j = 0; j < Nnodes; j++) {
  3559. Tensor<Real,true,COORD_DIM,2> dx;
  3560. dx(0,0) = dX[i*COORD_DIM*2+0][j];
  3561. dx(0,1) = dX[i*COORD_DIM*2+1][j];
  3562. dx(1,0) = dX[i*COORD_DIM*2+2][j];
  3563. dx(1,1) = dX[i*COORD_DIM*2+3][j];
  3564. dx(2,0) = dX[i*COORD_DIM*2+4][j];
  3565. dx(2,1) = dX[i*COORD_DIM*2+5][j];
  3566. Real s = 1 / (area_elem[i][j] * S.NtNp_[0]);
  3567. for (Long k = 0; k < COORD_DIM; k++) {
  3568. v[i*COORD_DIM+k][j] = dx(k,1) * s;
  3569. }
  3570. }
  3571. }
  3572. return v;
  3573. };
  3574. auto compute_AxB = [&S] (const Vector<ElemBasis>& A, const Vector<ElemBasis>& B) {
  3575. const Long Nelem = S.GetElemList().NElem();
  3576. const Long Nnodes = ElemBasis::Size();
  3577. Vector<ElemBasis> J(Nelem * COORD_DIM);
  3578. for (Long i = 0; i < Nelem; i++) { // Set J
  3579. for (Long j = 0; j < Nnodes; j++) {
  3580. Tensor<Real,true,COORD_DIM> a, b;
  3581. a(0) = A[i*COORD_DIM+0][j];
  3582. a(1) = A[i*COORD_DIM+1][j];
  3583. a(2) = A[i*COORD_DIM+2][j];
  3584. b(0) = B[i*COORD_DIM+0][j];
  3585. b(1) = B[i*COORD_DIM+1][j];
  3586. b(2) = B[i*COORD_DIM+2][j];
  3587. J[i*COORD_DIM+0][j] = a(1) * b(2) - a(2) * b(1);
  3588. J[i*COORD_DIM+1][j] = a(2) * b(0) - a(0) * b(2);
  3589. J[i*COORD_DIM+2][j] = a(0) * b(1) - a(1) * b(0);
  3590. }
  3591. }
  3592. return J;
  3593. };
  3594. auto compute_dphi_dnu0 = [&S,&normal,&compute_AxB,&compute_v,&compute_dB0] () {
  3595. const Long Nelem = S.GetElemList().NElem();
  3596. const Long Nnodes = ElemBasis::Size();
  3597. Vector<ElemBasis> Gv;
  3598. Vector<ElemBasis> v = compute_v();
  3599. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3600. Vector<ElemBasis> nxGv = compute_AxB(Gv,normal);
  3601. Vector<ElemBasis> gradB = compute_dB0(1.0);
  3602. Vector<ElemBasis> dphi_dnu(Nelem);
  3603. for (Long i = 0; i < Nelem; i++) {
  3604. for (Long j = 0; j < Nnodes; j++) {
  3605. Real dphi_dnu_ = 0;
  3606. dphi_dnu_ += nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+0][j] * normal[i*COORD_DIM+0][j];
  3607. dphi_dnu_ += nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+1][j] * normal[i*COORD_DIM+0][j];
  3608. dphi_dnu_ += nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+2][j] * normal[i*COORD_DIM+0][j];
  3609. dphi_dnu_ += nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+0][j] * normal[i*COORD_DIM+1][j];
  3610. dphi_dnu_ += nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+1][j] * normal[i*COORD_DIM+1][j];
  3611. dphi_dnu_ += nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+2][j] * normal[i*COORD_DIM+1][j];
  3612. dphi_dnu_ += nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+0][j] * normal[i*COORD_DIM+2][j];
  3613. dphi_dnu_ += nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+1][j] * normal[i*COORD_DIM+2][j];
  3614. dphi_dnu_ += nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+2][j] * normal[i*COORD_DIM+2][j];
  3615. dphi_dnu[i][j] = dphi_dnu_;
  3616. }
  3617. }
  3618. return dphi_dnu;
  3619. };
  3620. auto compute_dphi_dnu1 = [&S,&normal,&compute_AxB,&compute_v,&compute_B0,compute_grad_adj] () {
  3621. const Long Nelem = S.GetElemList().NElem();
  3622. const Long Nnodes = ElemBasis::Size();
  3623. Vector<ElemBasis> Gv;
  3624. Vector<ElemBasis> v = compute_v();
  3625. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3626. Vector<ElemBasis> B = compute_B0(1.0);
  3627. Vector<ElemBasis> BxGv = compute_AxB(B,Gv);
  3628. return compute_grad_adj(BxGv)*(-1.0);
  3629. };
  3630. auto compute_dphi_dnu2 = [&S,&normal,&compute_AxB,&compute_v,&compute_B0,&compute_dot_prod] () {
  3631. const Long Nelem = S.GetElemList().NElem();
  3632. const Long Nnodes = ElemBasis::Size();
  3633. Vector<ElemBasis> H(Nelem);
  3634. { // Set mean curvature H
  3635. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3636. Vector<ElemBasis> dX, d2X;
  3637. ElemBasis::Grad(dX, X);
  3638. ElemBasis::Grad(d2X, dX);
  3639. for (Long i = 0; i < Nelem; i++) {
  3640. for (Long j = 0; j < Nnodes; j++) {
  3641. Tensor<Real,true,2,2> I, invI, II;
  3642. for (Long k0 = 0; k0 < 2; k0++) {
  3643. for (Long k1 = 0; k1 < 2; k1++) {
  3644. I(k0,k1) = 0;
  3645. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3646. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3647. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3648. II(k0,k1) = 0;
  3649. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3650. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3651. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3652. }
  3653. }
  3654. { // Set invI
  3655. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3656. invI(0,0) = I(1,1) / detI;
  3657. invI(0,1) = -I(0,1) / detI;
  3658. invI(1,0) = -I(1,0) / detI;
  3659. invI(1,1) = I(0,0) / detI;
  3660. }
  3661. { // Set H
  3662. H[i][j] = 0;
  3663. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3664. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3665. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3666. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3667. }
  3668. }
  3669. }
  3670. }
  3671. Vector<ElemBasis> Gv;
  3672. Vector<ElemBasis> v = compute_v();
  3673. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3674. Vector<ElemBasis> B = compute_B0(1.0);
  3675. Vector<ElemBasis> BxGv = compute_AxB(B,Gv);
  3676. Vector<ElemBasis> n_dot_BxGv = compute_dot_prod(normal,BxGv);
  3677. Vector<ElemBasis> dphi_dnu(Nelem);
  3678. for (Long i = 0; i < Nelem; i++) {
  3679. for (Long j = 0; j < Nnodes; j++) {
  3680. dphi_dnu[i][j] = n_dot_BxGv[i][j] * 2*H[i][j];
  3681. }
  3682. }
  3683. return dphi_dnu;
  3684. };
  3685. auto compute_dphi_dnu3 = [&S,&normal,&compute_AxB,&compute_v,&compute_B0,&compute_dot_prod] () {
  3686. const Long Nelem = S.GetElemList().NElem();
  3687. const Long Nnodes = ElemBasis::Size();
  3688. Vector<ElemBasis> H(Nelem);
  3689. { // Set mean curvature H
  3690. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3691. Vector<ElemBasis> dX, d2X;
  3692. ElemBasis::Grad(dX, X);
  3693. ElemBasis::Grad(d2X, dX);
  3694. for (Long i = 0; i < Nelem; i++) {
  3695. for (Long j = 0; j < Nnodes; j++) {
  3696. Tensor<Real,true,2,2> I, invI, II;
  3697. for (Long k0 = 0; k0 < 2; k0++) {
  3698. for (Long k1 = 0; k1 < 2; k1++) {
  3699. I(k0,k1) = 0;
  3700. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3701. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3702. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3703. II(k0,k1) = 0;
  3704. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3705. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3706. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3707. }
  3708. }
  3709. { // Set invI
  3710. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3711. invI(0,0) = I(1,1) / detI;
  3712. invI(0,1) = -I(0,1) / detI;
  3713. invI(1,0) = -I(1,0) / detI;
  3714. invI(1,1) = I(0,0) / detI;
  3715. }
  3716. { // Set H
  3717. H[i][j] = 0;
  3718. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3719. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3720. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3721. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3722. }
  3723. }
  3724. }
  3725. }
  3726. Vector<ElemBasis> GnxB;
  3727. Vector<ElemBasis> B = compute_B0(1.0);
  3728. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3729. S.quadrature_FxU.Eval(GnxB, S.GetElemList(), nxB, S.Laplace_FxU);
  3730. Vector<ElemBasis> v = compute_v();
  3731. Vector<ElemBasis> v_dot_GnxB = compute_dot_prod(v,GnxB);
  3732. Vector<ElemBasis> dphi_dnu(Nelem);
  3733. for (Long i = 0; i < Nelem; i++) {
  3734. for (Long j = 0; j < Nnodes; j++) {
  3735. dphi_dnu[i][j] = v_dot_GnxB[i][j] * 2*H[i][j];
  3736. }
  3737. }
  3738. return dphi_dnu;
  3739. };
  3740. auto compute_dphi_dnu4 = [&S,&normal,&area_elem,&compute_AxB,&compute_B0] () {
  3741. const Long Nelem = S.GetElemList().NElem();
  3742. const Long Nnodes = ElemBasis::Size();
  3743. Vector<ElemBasis> GnxB;
  3744. Vector<ElemBasis> B = compute_B0(1.0);
  3745. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3746. S.quadrature_FxU.Eval(GnxB, S.GetElemList(), nxB, S.Laplace_FxU);
  3747. Vector<ElemBasis> H(Nelem);
  3748. { // Set mean curvature H
  3749. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3750. Vector<ElemBasis> dX, d2X;
  3751. ElemBasis::Grad(dX, X);
  3752. ElemBasis::Grad(d2X, dX);
  3753. for (Long i = 0; i < Nelem; i++) {
  3754. for (Long j = 0; j < Nnodes; j++) {
  3755. Tensor<Real,true,2,2> I, invI, II;
  3756. for (Long k0 = 0; k0 < 2; k0++) {
  3757. for (Long k1 = 0; k1 < 2; k1++) {
  3758. I(k0,k1) = 0;
  3759. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3760. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3761. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3762. II(k0,k1) = 0;
  3763. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3764. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3765. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3766. }
  3767. }
  3768. { // Set invI
  3769. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3770. invI(0,0) = I(1,1) / detI;
  3771. invI(0,1) = -I(0,1) / detI;
  3772. invI(1,0) = -I(1,0) / detI;
  3773. invI(1,1) = I(0,0) / detI;
  3774. }
  3775. { // Set H
  3776. H[i][j] = 0;
  3777. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3778. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3779. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3780. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3781. }
  3782. }
  3783. }
  3784. }
  3785. Vector<ElemBasis> dv_dnu1(Nelem), dv_dnu2(Nelem), dv_dnu3(Nelem);
  3786. { // Set dv_dnu1, dv_dnu2, dv_dnu3
  3787. Vector<ElemBasis> dX, dn, V_tmp(Nelem);
  3788. ElemBasis::Grad(dn, normal);
  3789. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  3790. for (Long i = 0; i < Nelem; i++) {
  3791. for (Long j = 0; j < Nnodes; j++) {
  3792. dv_dnu1[i][j] = 0;
  3793. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+0][j] * dX[(i*COORD_DIM+0)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  3794. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+1][j] * dX[(i*COORD_DIM+1)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  3795. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+2][j] * dX[(i*COORD_DIM+2)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  3796. dv_dnu2[i][j] = 0;
  3797. dv_dnu2[i][j] += GnxB[i*COORD_DIM+0][j] * dn[(i*COORD_DIM+0)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  3798. dv_dnu2[i][j] += GnxB[i*COORD_DIM+1][j] * dn[(i*COORD_DIM+1)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  3799. dv_dnu2[i][j] += GnxB[i*COORD_DIM+2][j] * dn[(i*COORD_DIM+2)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  3800. V_tmp[i][j] = 0;
  3801. V_tmp[i][j] += GnxB[i*COORD_DIM+0][j] * normal[i*COORD_DIM+0][j] / S.NtNp_[0]; //dnu[i*2+1][j] *
  3802. V_tmp[i][j] += GnxB[i*COORD_DIM+1][j] * normal[i*COORD_DIM+1][j] / S.NtNp_[0]; //dnu[i*2+1][j] *
  3803. V_tmp[i][j] += GnxB[i*COORD_DIM+2][j] * normal[i*COORD_DIM+2][j] / S.NtNp_[0]; //dnu[i*2+1][j] *
  3804. }
  3805. }
  3806. { // dv_dnu3 <-- grad_adj V_tmp
  3807. Vector<ElemBasis> grad_adj_V_tmp(Nelem);
  3808. ElemBasis::Grad(grad_adj_V_tmp, V_tmp);
  3809. for (Long i = 0; i < Nelem; i++) {
  3810. for (Long j = 0; j < Nnodes; j++) {
  3811. dv_dnu3[i][j] = -grad_adj_V_tmp[i*2+1][j] / area_elem[i][j];
  3812. }
  3813. }
  3814. }
  3815. }
  3816. return dv_dnu1+dv_dnu2+dv_dnu3;
  3817. };
  3818. auto compute_dphi_dnu5 = [&S,&normal,&compute_AxB,&compute_v,&compute_B0] () {
  3819. const Long Nelem = S.GetElemList().NElem();
  3820. const Long Nnodes = ElemBasis::Size();
  3821. Vector<ElemBasis> dGnxB;
  3822. Vector<ElemBasis> B = compute_B0(1.0);
  3823. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3824. S.quadrature_FxdU.Eval(dGnxB, S.GetElemList(), nxB, S.Laplace_FxdU);
  3825. Vector<ElemBasis> v = compute_v();
  3826. Vector<ElemBasis> dphi_dnu(Nelem);
  3827. for (Long i = 0; i < Nelem; i++) {
  3828. for (Long j = 0; j < Nnodes; j++) {
  3829. Real dphi_dnu_ = 0;
  3830. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+0][j] * v[i*COORD_DIM+0][j];
  3831. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+1][j] * v[i*COORD_DIM+0][j];
  3832. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+2][j] * v[i*COORD_DIM+0][j];
  3833. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+0][j] * v[i*COORD_DIM+1][j];
  3834. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+1][j] * v[i*COORD_DIM+1][j];
  3835. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+2][j] * v[i*COORD_DIM+1][j];
  3836. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+0][j] * v[i*COORD_DIM+2][j];
  3837. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+1][j] * v[i*COORD_DIM+2][j];
  3838. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+2][j] * v[i*COORD_DIM+2][j];
  3839. dphi_dnu[i][j] = dphi_dnu_;
  3840. }
  3841. }
  3842. return dphi_dnu;
  3843. };
  3844. auto compute_dphi_dnu6 = [&S,&normal,&compute_AxB,&compute_v,&compute_B0] () {
  3845. const Long Nelem = S.GetElemList().NElem();
  3846. const Long Nnodes = ElemBasis::Size();
  3847. Vector<ElemBasis> B = compute_B0(1.0);
  3848. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  3849. Vector<ElemBasis> dGv;
  3850. Vector<ElemBasis> v = compute_v();
  3851. S.quadrature_FxdU.Eval(dGv, S.GetElemList(), v, S.Laplace_FxdU);
  3852. Vector<ElemBasis> dphi_dnu(Nelem);
  3853. for (Long i = 0; i < Nelem; i++) {
  3854. for (Long j = 0; j < Nnodes; j++) {
  3855. Real dphi_dnu_ = 0;
  3856. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+0][j] * nxB[i*COORD_DIM+0][j];
  3857. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+1][j] * nxB[i*COORD_DIM+0][j];
  3858. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+2][j] * nxB[i*COORD_DIM+0][j];
  3859. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+0][j] * nxB[i*COORD_DIM+1][j];
  3860. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+1][j] * nxB[i*COORD_DIM+1][j];
  3861. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+2][j] * nxB[i*COORD_DIM+1][j];
  3862. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+0][j] * nxB[i*COORD_DIM+2][j];
  3863. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+1][j] * nxB[i*COORD_DIM+2][j];
  3864. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+2][j] * nxB[i*COORD_DIM+2][j];
  3865. dphi_dnu[i][j] = dphi_dnu_;
  3866. }
  3867. }
  3868. return dphi_dnu;
  3869. };
  3870. auto dphi_dnu0 = compute_dphi_dnu0();
  3871. auto dphi_dnu1 = compute_dphi_dnu1();
  3872. auto dphi_dnu2 = compute_dphi_dnu2();
  3873. auto dphi_dnu3 = compute_dphi_dnu3();
  3874. auto dphi_dnu4 = compute_dphi_dnu4();
  3875. auto dphi_dnu5 = compute_dphi_dnu5();
  3876. auto dphi_dnu6 = compute_dphi_dnu6();
  3877. return (dphi_dnu0+dphi_dnu1+dphi_dnu2+dphi_dnu3+dphi_dnu4+dphi_dnu5+dphi_dnu6) * (u[Nelem*Nnodes] * v[Nelem*Nnodes]);
  3878. };
  3879. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  3880. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  3881. if (0) {
  3882. const Long Nelem = S.GetElemList().NElem();
  3883. const Long Nnodes = ElemBasis::Size();
  3884. auto compute_v = [&S,&area_elem] () {
  3885. const Long Nelem = S.GetElemList().NElem();
  3886. const Long Nnodes = ElemBasis::Size();
  3887. Vector<ElemBasis> v(Nelem * COORD_DIM);
  3888. Vector<ElemBasis> dX;
  3889. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  3890. for (Long i = 0; i < Nelem; i++) {
  3891. for (Long j = 0; j < Nnodes; j++) {
  3892. Tensor<Real,true,COORD_DIM,2> dx;
  3893. dx(0,0) = dX[i*COORD_DIM*2+0][j];
  3894. dx(0,1) = dX[i*COORD_DIM*2+1][j];
  3895. dx(1,0) = dX[i*COORD_DIM*2+2][j];
  3896. dx(1,1) = dX[i*COORD_DIM*2+3][j];
  3897. dx(2,0) = dX[i*COORD_DIM*2+4][j];
  3898. dx(2,1) = dX[i*COORD_DIM*2+5][j];
  3899. Real s = 1 / (area_elem[i][j] * S.NtNp_[0]);
  3900. for (Long k = 0; k < COORD_DIM; k++) {
  3901. v[i*COORD_DIM+k][j] = dx(k,1) * s;
  3902. }
  3903. }
  3904. }
  3905. return v;
  3906. };
  3907. auto compute_AxB = [&S] (const Vector<ElemBasis>& A, const Vector<ElemBasis>& B) {
  3908. const Long Nelem = S.GetElemList().NElem();
  3909. const Long Nnodes = ElemBasis::Size();
  3910. Vector<ElemBasis> J(Nelem * COORD_DIM);
  3911. for (Long i = 0; i < Nelem; i++) { // Set J
  3912. for (Long j = 0; j < Nnodes; j++) {
  3913. Tensor<Real,true,COORD_DIM> a, b;
  3914. a(0) = A[i*COORD_DIM+0][j];
  3915. a(1) = A[i*COORD_DIM+1][j];
  3916. a(2) = A[i*COORD_DIM+2][j];
  3917. b(0) = B[i*COORD_DIM+0][j];
  3918. b(1) = B[i*COORD_DIM+1][j];
  3919. b(2) = B[i*COORD_DIM+2][j];
  3920. J[i*COORD_DIM+0][j] = a(1) * b(2) - a(2) * b(1);
  3921. J[i*COORD_DIM+1][j] = a(2) * b(0) - a(0) * b(2);
  3922. J[i*COORD_DIM+2][j] = a(0) * b(1) - a(1) * b(0);
  3923. }
  3924. }
  3925. return J;
  3926. };
  3927. auto compute_dphi_dnu0 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,compute_grad_adj,sigma] () {
  3928. const Long Nelem = S.GetElemList().NElem();
  3929. const Long Nnodes = ElemBasis::Size();
  3930. Vector<ElemBasis> Gv;
  3931. Vector<ElemBasis> v = compute_v();
  3932. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3933. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3934. Vector<ElemBasis> BxGv = compute_AxB(B,Gv);
  3935. return compute_grad_adj(BxGv)*(-1.0);
  3936. };
  3937. auto compute_dphi_dnu1 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,&compute_dot_prod,sigma] () {
  3938. const Long Nelem = S.GetElemList().NElem();
  3939. const Long Nnodes = ElemBasis::Size();
  3940. Vector<ElemBasis> H(Nelem);
  3941. { // Set mean curvature H
  3942. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3943. Vector<ElemBasis> dX, d2X;
  3944. ElemBasis::Grad(dX, X);
  3945. ElemBasis::Grad(d2X, dX);
  3946. for (Long i = 0; i < Nelem; i++) {
  3947. for (Long j = 0; j < Nnodes; j++) {
  3948. Tensor<Real,true,2,2> I, invI, II;
  3949. for (Long k0 = 0; k0 < 2; k0++) {
  3950. for (Long k1 = 0; k1 < 2; k1++) {
  3951. I(k0,k1) = 0;
  3952. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  3953. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  3954. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  3955. II(k0,k1) = 0;
  3956. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  3957. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  3958. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  3959. }
  3960. }
  3961. { // Set invI
  3962. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  3963. invI(0,0) = I(1,1) / detI;
  3964. invI(0,1) = -I(0,1) / detI;
  3965. invI(1,0) = -I(1,0) / detI;
  3966. invI(1,1) = I(0,0) / detI;
  3967. }
  3968. { // Set H
  3969. H[i][j] = 0;
  3970. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  3971. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  3972. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  3973. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  3974. }
  3975. }
  3976. }
  3977. }
  3978. Vector<ElemBasis> Gv;
  3979. Vector<ElemBasis> v = compute_v();
  3980. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  3981. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  3982. Vector<ElemBasis> BxGv = compute_AxB(B,Gv);
  3983. Vector<ElemBasis> n_dot_BxGv = compute_dot_prod(normal,BxGv);
  3984. Vector<ElemBasis> dphi_dnu(Nelem);
  3985. for (Long i = 0; i < Nelem; i++) {
  3986. for (Long j = 0; j < Nnodes; j++) {
  3987. dphi_dnu[i][j] = n_dot_BxGv[i][j] * 2*H[i][j];
  3988. }
  3989. }
  3990. return dphi_dnu;
  3991. };
  3992. auto compute_dphi_dnu2 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,&compute_dot_prod,sigma] () {
  3993. const Long Nelem = S.GetElemList().NElem();
  3994. const Long Nnodes = ElemBasis::Size();
  3995. Vector<ElemBasis> H(Nelem);
  3996. { // Set mean curvature H
  3997. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  3998. Vector<ElemBasis> dX, d2X;
  3999. ElemBasis::Grad(dX, X);
  4000. ElemBasis::Grad(d2X, dX);
  4001. for (Long i = 0; i < Nelem; i++) {
  4002. for (Long j = 0; j < Nnodes; j++) {
  4003. Tensor<Real,true,2,2> I, invI, II;
  4004. for (Long k0 = 0; k0 < 2; k0++) {
  4005. for (Long k1 = 0; k1 < 2; k1++) {
  4006. I(k0,k1) = 0;
  4007. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  4008. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  4009. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  4010. II(k0,k1) = 0;
  4011. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  4012. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  4013. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  4014. }
  4015. }
  4016. { // Set invI
  4017. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  4018. invI(0,0) = I(1,1) / detI;
  4019. invI(0,1) = -I(0,1) / detI;
  4020. invI(1,0) = -I(1,0) / detI;
  4021. invI(1,1) = I(0,0) / detI;
  4022. }
  4023. { // Set H
  4024. H[i][j] = 0;
  4025. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  4026. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  4027. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  4028. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  4029. }
  4030. }
  4031. }
  4032. }
  4033. Vector<ElemBasis> GnxB;
  4034. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  4035. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  4036. S.quadrature_FxU.Eval(GnxB, S.GetElemList(), nxB, S.Laplace_FxU);
  4037. Vector<ElemBasis> v = compute_v();
  4038. Vector<ElemBasis> v_dot_GnxB = compute_dot_prod(v,GnxB);
  4039. Vector<ElemBasis> dphi_dnu(Nelem);
  4040. for (Long i = 0; i < Nelem; i++) {
  4041. for (Long j = 0; j < Nnodes; j++) {
  4042. dphi_dnu[i][j] = v_dot_GnxB[i][j] * 2*H[i][j];
  4043. }
  4044. }
  4045. return dphi_dnu;
  4046. };
  4047. auto compute_dphi_dnu3 = [&S,&normal,&area_elem,&compute_AxB,&compute_half_n_plus_dG,sigma] () {
  4048. const Long Nelem = S.GetElemList().NElem();
  4049. const Long Nnodes = ElemBasis::Size();
  4050. Vector<ElemBasis> GnxB;
  4051. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  4052. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  4053. S.quadrature_FxU.Eval(GnxB, S.GetElemList(), nxB, S.Laplace_FxU);
  4054. Vector<ElemBasis> H(Nelem);
  4055. { // Set mean curvature H
  4056. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  4057. Vector<ElemBasis> dX, d2X;
  4058. ElemBasis::Grad(dX, X);
  4059. ElemBasis::Grad(d2X, dX);
  4060. for (Long i = 0; i < Nelem; i++) {
  4061. for (Long j = 0; j < Nnodes; j++) {
  4062. Tensor<Real,true,2,2> I, invI, II;
  4063. for (Long k0 = 0; k0 < 2; k0++) {
  4064. for (Long k1 = 0; k1 < 2; k1++) {
  4065. I(k0,k1) = 0;
  4066. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  4067. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  4068. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  4069. II(k0,k1) = 0;
  4070. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  4071. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  4072. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  4073. }
  4074. }
  4075. { // Set invI
  4076. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  4077. invI(0,0) = I(1,1) / detI;
  4078. invI(0,1) = -I(0,1) / detI;
  4079. invI(1,0) = -I(1,0) / detI;
  4080. invI(1,1) = I(0,0) / detI;
  4081. }
  4082. { // Set H
  4083. H[i][j] = 0;
  4084. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  4085. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  4086. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  4087. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  4088. }
  4089. }
  4090. }
  4091. }
  4092. Vector<ElemBasis> dv_dnu1(Nelem), dv_dnu2(Nelem), dv_dnu3(Nelem);
  4093. { // Set dv_dnu1, dv_dnu2, dv_dnu3
  4094. Vector<ElemBasis> dX, dn, V_tmp(Nelem);
  4095. ElemBasis::Grad(dn, normal);
  4096. ElemBasis::Grad(dX, S.GetElemList().ElemVector());
  4097. for (Long i = 0; i < Nelem; i++) {
  4098. for (Long j = 0; j < Nnodes; j++) {
  4099. dv_dnu1[i][j] = 0;
  4100. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+0][j] * dX[(i*COORD_DIM+0)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  4101. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+1][j] * dX[(i*COORD_DIM+1)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  4102. dv_dnu1[i][j] += -GnxB[i*COORD_DIM+2][j] * dX[(i*COORD_DIM+2)*2+1][j] * 2 * H[i][j] / (area_elem[i][j] * S.NtNp_[0]);
  4103. dv_dnu2[i][j] = 0;
  4104. dv_dnu2[i][j] += GnxB[i*COORD_DIM+0][j] * dn[(i*COORD_DIM+0)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  4105. dv_dnu2[i][j] += GnxB[i*COORD_DIM+1][j] * dn[(i*COORD_DIM+1)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  4106. dv_dnu2[i][j] += GnxB[i*COORD_DIM+2][j] * dn[(i*COORD_DIM+2)*2+1][j] / (area_elem[i][j] * S.NtNp_[0]);
  4107. V_tmp[i][j] = 0;
  4108. V_tmp[i][j] += GnxB[i*COORD_DIM+0][j] * normal[i*COORD_DIM+0][j] / (area_elem[i][j] * S.NtNp_[0]); //dnu[i*2+1][j] *
  4109. V_tmp[i][j] += GnxB[i*COORD_DIM+1][j] * normal[i*COORD_DIM+1][j] / (area_elem[i][j] * S.NtNp_[0]); //dnu[i*2+1][j] *
  4110. V_tmp[i][j] += GnxB[i*COORD_DIM+2][j] * normal[i*COORD_DIM+2][j] / (area_elem[i][j] * S.NtNp_[0]); //dnu[i*2+1][j] *
  4111. }
  4112. }
  4113. { // dv_dnu3 <-- grad_adj V_tmp
  4114. Vector<ElemBasis> eye(Nnodes), Mgrad;
  4115. eye = 0;
  4116. for (Long i = 0; i < Nnodes; i++) eye[i][i] = 1;
  4117. ElemBasis::Grad(Mgrad, eye);
  4118. Vector<ElemBasis> grad_adj_V(Nelem);
  4119. const auto& quad_wts = ElemBasis::QuadWts();
  4120. for (Long i = 0; i < Nelem; i++) {
  4121. for (Long j = 0; j < Nnodes; j++) {
  4122. Real sum = 0;
  4123. for (Long k = 0; k < Nnodes; k++) {
  4124. sum += Mgrad[j*2+1][k] * V_tmp[i][k] * (area_elem[i][k] * quad_wts[k]) / (quad_wts[j] * area_elem[i][j]);
  4125. }
  4126. dv_dnu3[i][j] = sum;
  4127. }
  4128. }
  4129. }
  4130. }
  4131. return dv_dnu1+dv_dnu2+dv_dnu3;
  4132. };
  4133. auto compute_dphi_dnu4 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,sigma] () {
  4134. const Long Nelem = S.GetElemList().NElem();
  4135. const Long Nnodes = ElemBasis::Size();
  4136. Vector<ElemBasis> dGnxB;
  4137. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  4138. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  4139. S.quadrature_FxdU.Eval(dGnxB, S.GetElemList(), nxB, S.Laplace_FxdU);
  4140. Vector<ElemBasis> v = compute_v();
  4141. Vector<ElemBasis> dphi_dnu(Nelem);
  4142. for (Long i = 0; i < Nelem; i++) {
  4143. for (Long j = 0; j < Nnodes; j++) {
  4144. Real dphi_dnu_ = 0;
  4145. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+0][j] * v[i*COORD_DIM+0][j];
  4146. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+1][j] * v[i*COORD_DIM+0][j];
  4147. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+0)*COORD_DIM+2][j] * v[i*COORD_DIM+0][j];
  4148. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+0][j] * v[i*COORD_DIM+1][j];
  4149. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+1][j] * v[i*COORD_DIM+1][j];
  4150. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+1)*COORD_DIM+2][j] * v[i*COORD_DIM+1][j];
  4151. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+0][j] * v[i*COORD_DIM+2][j];
  4152. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+1][j] * v[i*COORD_DIM+2][j];
  4153. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGnxB[(i*COORD_DIM+2)*COORD_DIM+2][j] * v[i*COORD_DIM+2][j];
  4154. dphi_dnu[i][j] = dphi_dnu_;
  4155. }
  4156. }
  4157. return dphi_dnu;
  4158. };
  4159. auto compute_dphi_dnu5 = [&S,&normal,&compute_AxB,&compute_v,&compute_half_n_plus_dG,sigma] () {
  4160. const Long Nelem = S.GetElemList().NElem();
  4161. const Long Nnodes = ElemBasis::Size();
  4162. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  4163. Vector<ElemBasis> nxB = compute_AxB(normal,B);
  4164. Vector<ElemBasis> dGv;
  4165. Vector<ElemBasis> v = compute_v();
  4166. S.quadrature_FxdU.Eval(dGv, S.GetElemList(), v, S.Laplace_FxdU);
  4167. Vector<ElemBasis> dphi_dnu(Nelem);
  4168. for (Long i = 0; i < Nelem; i++) {
  4169. for (Long j = 0; j < Nnodes; j++) {
  4170. Real dphi_dnu_ = 0;
  4171. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+0][j] * nxB[i*COORD_DIM+0][j];
  4172. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+1][j] * nxB[i*COORD_DIM+0][j];
  4173. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+0)*COORD_DIM+2][j] * nxB[i*COORD_DIM+0][j];
  4174. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+0][j] * nxB[i*COORD_DIM+1][j];
  4175. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+1][j] * nxB[i*COORD_DIM+1][j];
  4176. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+1)*COORD_DIM+2][j] * nxB[i*COORD_DIM+1][j];
  4177. dphi_dnu_ += -normal[i*COORD_DIM+0][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+0][j] * nxB[i*COORD_DIM+2][j];
  4178. dphi_dnu_ += -normal[i*COORD_DIM+1][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+1][j] * nxB[i*COORD_DIM+2][j];
  4179. dphi_dnu_ += -normal[i*COORD_DIM+2][j] * dGv[(i*COORD_DIM+2)*COORD_DIM+2][j] * nxB[i*COORD_DIM+2][j];
  4180. dphi_dnu[i][j] = dphi_dnu_;
  4181. }
  4182. }
  4183. return dphi_dnu;
  4184. };
  4185. auto compute_dphi_dnu6 = [&S,&normal,&compute_AxB,&compute_v,sigma,&comm] () {
  4186. const Long Nelem = S.GetElemList().NElem();
  4187. const Long Nnodes = ElemBasis::Size();
  4188. Vector<ElemBasis> Gv;
  4189. Vector<ElemBasis> v = compute_v();
  4190. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  4191. Vector<ElemBasis> nxGv = compute_AxB(Gv,normal);
  4192. Vector<ElemBasis> gradB;
  4193. Quadrature<Real> quadrature_Fxd2U;
  4194. quadrature_Fxd2U.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_Fxd2U, order_singular, order_direct, -1.0, comm, -0.01 * pow<-2,Real>(ORDER));
  4195. quadrature_Fxd2U.Eval(gradB, S.GetElemList(), sigma, S.Laplace_Fxd2U);
  4196. Vector<ElemBasis> dphi_dnu(Nelem);
  4197. for (Long i = 0; i < Nelem; i++) {
  4198. for (Long j = 0; j < Nnodes; j++) {
  4199. Real dphi_dnu_ = 0;
  4200. dphi_dnu_ += -nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+0][j] * normal[i*COORD_DIM+0][j];
  4201. dphi_dnu_ += -nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+1][j] * normal[i*COORD_DIM+0][j];
  4202. dphi_dnu_ += -nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+0)*COORD_DIM+2][j] * normal[i*COORD_DIM+0][j];
  4203. dphi_dnu_ += -nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+0][j] * normal[i*COORD_DIM+1][j];
  4204. dphi_dnu_ += -nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+1][j] * normal[i*COORD_DIM+1][j];
  4205. dphi_dnu_ += -nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+1)*COORD_DIM+2][j] * normal[i*COORD_DIM+1][j];
  4206. dphi_dnu_ += -nxGv[i*COORD_DIM+0][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+0][j] * normal[i*COORD_DIM+2][j];
  4207. dphi_dnu_ += -nxGv[i*COORD_DIM+1][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+1][j] * normal[i*COORD_DIM+2][j];
  4208. dphi_dnu_ += -nxGv[i*COORD_DIM+2][j] * gradB[(i*COORD_DIM+2)*COORD_DIM+2][j] * normal[i*COORD_DIM+2][j];
  4209. dphi_dnu[i][j] = dphi_dnu_;
  4210. }
  4211. }
  4212. return dphi_dnu;
  4213. };
  4214. auto compute_dphi_dnu7 = [&S,&normal,&compute_AxB,&compute_v,sigma,&comm] () {
  4215. const Long Nelem = S.GetElemList().NElem();
  4216. const Long Nnodes = ElemBasis::Size();
  4217. Vector<ElemBasis> H(Nelem);
  4218. { // Set mean curvature H
  4219. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  4220. Vector<ElemBasis> dX, d2X;
  4221. ElemBasis::Grad(dX, X);
  4222. ElemBasis::Grad(d2X, dX);
  4223. for (Long i = 0; i < Nelem; i++) {
  4224. for (Long j = 0; j < Nnodes; j++) {
  4225. Tensor<Real,true,2,2> I, invI, II;
  4226. for (Long k0 = 0; k0 < 2; k0++) {
  4227. for (Long k1 = 0; k1 < 2; k1++) {
  4228. I(k0,k1) = 0;
  4229. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  4230. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  4231. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  4232. II(k0,k1) = 0;
  4233. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  4234. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  4235. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  4236. }
  4237. }
  4238. { // Set invI
  4239. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  4240. invI(0,0) = I(1,1) / detI;
  4241. invI(0,1) = -I(0,1) / detI;
  4242. invI(1,0) = -I(1,0) / detI;
  4243. invI(1,1) = I(0,0) / detI;
  4244. }
  4245. { // Set H
  4246. H[i][j] = 0;
  4247. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  4248. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  4249. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  4250. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  4251. }
  4252. }
  4253. }
  4254. }
  4255. Vector<ElemBasis> Gv;
  4256. Vector<ElemBasis> v = compute_v();
  4257. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  4258. Vector<ElemBasis> nxGv = compute_AxB(Gv,normal);
  4259. Vector<ElemBasis> dphi_dnu(Nelem);
  4260. Quadrature<Real> quadrature_dUxF;
  4261. quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  4262. quadrature_dUxF.Eval(dphi_dnu, S.GetElemList(), nxGv, S.Laplace_dUxF);
  4263. for (Long i = 0; i < Nelem; i++) {
  4264. for (Long j = 0; j < Nnodes; j++) {
  4265. dphi_dnu[i][j] *= -2*H[i][j] * sigma[i][j];
  4266. }
  4267. }
  4268. return dphi_dnu;
  4269. };
  4270. auto compute_dphi_dnu8 = [&S,&normal,&compute_AxB,&compute_v,sigma,&comm] () {
  4271. const Long Nelem = S.GetElemList().NElem();
  4272. const Long Nnodes = ElemBasis::Size();
  4273. Vector<ElemBasis> H(Nelem);
  4274. { // Set mean curvature H
  4275. const Vector<ElemBasis> X = S.GetElemList().ElemVector();
  4276. Vector<ElemBasis> dX, d2X;
  4277. ElemBasis::Grad(dX, X);
  4278. ElemBasis::Grad(d2X, dX);
  4279. for (Long i = 0; i < Nelem; i++) {
  4280. for (Long j = 0; j < Nnodes; j++) {
  4281. Tensor<Real,true,2,2> I, invI, II;
  4282. for (Long k0 = 0; k0 < 2; k0++) {
  4283. for (Long k1 = 0; k1 < 2; k1++) {
  4284. I(k0,k1) = 0;
  4285. I(k0,k1) += dX[(i*COORD_DIM+0)*2+k0][j] * dX[(i*COORD_DIM+0)*2+k1][j];
  4286. I(k0,k1) += dX[(i*COORD_DIM+1)*2+k0][j] * dX[(i*COORD_DIM+1)*2+k1][j];
  4287. I(k0,k1) += dX[(i*COORD_DIM+2)*2+k0][j] * dX[(i*COORD_DIM+2)*2+k1][j];
  4288. II(k0,k1) = 0;
  4289. II(k0,k1) += d2X[(i*COORD_DIM+0)*4+k0*2+k1][j] * normal[i*COORD_DIM+0][j];
  4290. II(k0,k1) += d2X[(i*COORD_DIM+1)*4+k0*2+k1][j] * normal[i*COORD_DIM+1][j];
  4291. II(k0,k1) += d2X[(i*COORD_DIM+2)*4+k0*2+k1][j] * normal[i*COORD_DIM+2][j];
  4292. }
  4293. }
  4294. { // Set invI
  4295. Real detI = I(0,0)*I(1,1)-I(0,1)*I(1,0);
  4296. invI(0,0) = I(1,1) / detI;
  4297. invI(0,1) = -I(0,1) / detI;
  4298. invI(1,0) = -I(1,0) / detI;
  4299. invI(1,1) = I(0,0) / detI;
  4300. }
  4301. { // Set H
  4302. H[i][j] = 0;
  4303. H[i][j] += -0.5 * II(0,0)*invI(0,0);
  4304. H[i][j] += -0.5 * II(0,1)*invI(0,1);
  4305. H[i][j] += -0.5 * II(1,0)*invI(1,0);
  4306. H[i][j] += -0.5 * II(1,1)*invI(1,1);
  4307. }
  4308. }
  4309. }
  4310. }
  4311. Vector<ElemBasis> Gv;
  4312. Vector<ElemBasis> v = compute_v();
  4313. S.quadrature_FxU.Eval(Gv, S.GetElemList(), v, S.Laplace_FxU);
  4314. Vector<ElemBasis> nxGv = compute_AxB(Gv,normal);
  4315. Vector<ElemBasis> dphi_dnu(Nelem);
  4316. Vector<ElemBasis> nablaDt_nxGv;
  4317. Quadrature<Real> quadrature_dUxD;
  4318. quadrature_dUxD.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxD, order_singular, order_direct, -1.0, comm, 0.01 * pow<-2,Real>(ORDER));
  4319. quadrature_dUxD.Eval(nablaDt_nxGv, S.GetElemList(), nxGv, S.Laplace_dUxD);
  4320. for (Long i = 0; i < Nelem; i++) {
  4321. for (Long j = 0; j < Nnodes; j++) {
  4322. dphi_dnu[i][j] = 0;
  4323. dphi_dnu[i][j] += sigma[i][j] * nablaDt_nxGv[i*COORD_DIM+0][j]*normal[i*COORD_DIM+0][j];
  4324. dphi_dnu[i][j] += sigma[i][j] * nablaDt_nxGv[i*COORD_DIM+1][j]*normal[i*COORD_DIM+1][j];
  4325. dphi_dnu[i][j] += sigma[i][j] * nablaDt_nxGv[i*COORD_DIM+2][j]*normal[i*COORD_DIM+2][j];
  4326. }
  4327. }
  4328. return dphi_dnu;
  4329. };
  4330. Vector<ElemBasis> nu(Nelem);
  4331. nu = 1; //area_elem;
  4332. Real dphi_dnu0 = compute_inner_prod(nu, compute_dphi_dnu0());
  4333. Real dphi_dnu1 = compute_inner_prod(nu, compute_dphi_dnu1());
  4334. Real dphi_dnu2 = compute_inner_prod(nu, compute_dphi_dnu2());
  4335. Real dphi_dnu3 = compute_inner_prod(nu, compute_dphi_dnu3());
  4336. Real dphi_dnu4 = compute_inner_prod(nu, compute_dphi_dnu4());
  4337. Real dphi_dnu5 = compute_inner_prod(nu, compute_dphi_dnu5());
  4338. Real dphi_dnu6 = compute_inner_prod(nu, compute_dphi_dnu6());
  4339. Real dphi_dnu7 = compute_inner_prod(nu, compute_dphi_dnu7());
  4340. Real dphi_dnu8 = compute_inner_prod(nu, compute_dphi_dnu8());
  4341. std::cout<<dphi_dnu0<<' ';
  4342. std::cout<<dphi_dnu1<<' ';
  4343. std::cout<<dphi_dnu2<<' ';
  4344. std::cout<<dphi_dnu3<<' ';
  4345. std::cout<<dphi_dnu4<<' ';
  4346. std::cout<<dphi_dnu5<<' ';
  4347. std::cout<<dphi_dnu6<<' ';
  4348. std::cout<<dphi_dnu7<<' ';
  4349. std::cout<<dphi_dnu8<<' ';
  4350. std::cout<<'\n';
  4351. std::cout<<dphi_dnu0+dphi_dnu1+dphi_dnu2+dphi_dnu3+dphi_dnu4+dphi_dnu5+dphi_dnu6+dphi_dnu7+dphi_dnu8<<'\n';
  4352. auto compute_flux = [&S,&comm,&normal,&area_elem,&compute_norm_area_elem,&compute_AxB,&compute_v,&compute_inner_prod,&sigma,&compute_half_n_plus_dG] (const Vector<ElemBasis>& nu, Real eps) {
  4353. const Long Nelem = S.GetElemList().NElem();
  4354. const Long Nnodes = ElemBasis::Size();
  4355. Vector<ElemBasis> X_orig(Nelem*COORD_DIM);
  4356. for (Long i = 0; i < Nelem; i++) {
  4357. for (Long j = 0; j < Nnodes; j++) {
  4358. X_orig[i*COORD_DIM+0][j] = S.Elem(i,0)[j];
  4359. X_orig[i*COORD_DIM+1][j] = S.Elem(i,1)[j];
  4360. X_orig[i*COORD_DIM+2][j] = S.Elem(i,2)[j];
  4361. S.Elem(i,0)[j] += eps*nu[i][j] * normal[i*COORD_DIM+0][j];
  4362. S.Elem(i,1)[j] += eps*nu[i][j] * normal[i*COORD_DIM+1][j];
  4363. S.Elem(i,2)[j] += eps*nu[i][j] * normal[i*COORD_DIM+2][j];
  4364. }
  4365. }
  4366. compute_norm_area_elem(normal, area_elem);
  4367. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4368. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4369. Vector<ElemBasis> v = compute_v();
  4370. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma);
  4371. Vector<ElemBasis> J = compute_AxB(normal,B);
  4372. Vector<ElemBasis> A;
  4373. S.quadrature_FxU.Eval(A, S.GetElemList(), J, S.Laplace_FxU);
  4374. Real flux = compute_inner_prod(v, A);
  4375. for (Long i = 0; i < Nelem; i++) {
  4376. for (Long j = 0; j < Nnodes; j++) {
  4377. S.Elem(i,0)[j] = X_orig[i*COORD_DIM+0][j];
  4378. S.Elem(i,1)[j] = X_orig[i*COORD_DIM+1][j];
  4379. S.Elem(i,2)[j] = X_orig[i*COORD_DIM+2][j];
  4380. }
  4381. }
  4382. compute_norm_area_elem(normal, area_elem);
  4383. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4384. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4385. return flux;
  4386. };
  4387. Real dphi_dnu = (compute_flux(nu,1e-3)-compute_flux(nu,-1e-3)) / 2e-3;
  4388. std::cout<<"dphi_dnu = "<<dphi_dnu<<'\n';
  4389. Real phi = compute_flux(nu,0);
  4390. std::cout<<"phi = "<<phi<<'\n';
  4391. }
  4392. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4393. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4394. auto compute_Av = [&S,&area_elem,&normal,&compute_norm_area_elem,&compute_A,&comm] (const Vector<Real>& v, const Vector<ElemBasis>& nu, Real eps) {
  4395. const Long Nelem = S.GetElemList().NElem();
  4396. const Long Nnodes = ElemBasis::Size();
  4397. Vector<ElemBasis> X_orig(Nelem*COORD_DIM);
  4398. for (Long i = 0; i < Nelem; i++) {
  4399. for (Long j = 0; j < Nnodes; j++) {
  4400. X_orig[i*COORD_DIM+0][j] = S.Elem(i,0)[j];
  4401. X_orig[i*COORD_DIM+1][j] = S.Elem(i,1)[j];
  4402. X_orig[i*COORD_DIM+2][j] = S.Elem(i,2)[j];
  4403. S.Elem(i,0)[j] += eps*nu[i][j] * normal[i*COORD_DIM+0][j];
  4404. S.Elem(i,1)[j] += eps*nu[i][j] * normal[i*COORD_DIM+1][j];
  4405. S.Elem(i,2)[j] += eps*nu[i][j] * normal[i*COORD_DIM+2][j];
  4406. }
  4407. }
  4408. compute_norm_area_elem(normal, area_elem);
  4409. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4410. S.quadrature_DxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_DxU , order_singular, order_direct, -1.0, comm);
  4411. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4412. S.quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm);
  4413. Vector<Real> Av = compute_A(v);
  4414. for (Long i = 0; i < Nelem; i++) {
  4415. for (Long j = 0; j < Nnodes; j++) {
  4416. S.Elem(i,0)[j] = X_orig[i*COORD_DIM+0][j];
  4417. S.Elem(i,1)[j] = X_orig[i*COORD_DIM+1][j];
  4418. S.Elem(i,2)[j] = X_orig[i*COORD_DIM+2][j];
  4419. }
  4420. }
  4421. compute_norm_area_elem(normal, area_elem);
  4422. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4423. S.quadrature_DxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_DxU , order_singular, order_direct, -1.0, comm);
  4424. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4425. S.quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm);
  4426. return Av;
  4427. };
  4428. auto compute_u_dAdnu_v = [&S,&compute_Av,&compute_inner_prod] (const Vector<Real>& u, const Vector<Real>& v, const Vector<ElemBasis>& nu) {
  4429. const Long Nelem = S.GetElemList().NElem();
  4430. const Long Nnodes = ElemBasis::Size();
  4431. Real eps = 1e-5;
  4432. Vector<Real> Av0 = compute_Av(v,nu,-eps);
  4433. Vector<Real> Av1 = compute_Av(v,nu,eps);
  4434. Vector<Real> dAdnu_v = (Av1-Av0)*(1/(2*eps));
  4435. Real u_dAdnu_v;
  4436. { // set u_dAdnu_v
  4437. Vector<ElemBasis> u_(Nelem), dAdnu_v_(Nelem);
  4438. for (Long i = 0; i < Nelem; i++) {
  4439. for (Long j = 0; j < Nnodes; j++) {
  4440. u_[i][j] = u[i*Nnodes+j];
  4441. dAdnu_v_[i][j] = dAdnu_v[i*Nnodes+j];
  4442. }
  4443. }
  4444. u_dAdnu_v = compute_inner_prod(u_, dAdnu_v_);
  4445. u_dAdnu_v += u[Nelem*Nnodes] * dAdnu_v[Nelem*Nnodes];
  4446. }
  4447. return u_dAdnu_v;
  4448. };
  4449. if (0) { // test dA_dnu
  4450. const Long Nelem = S.GetElemList().NElem();
  4451. const Long Nnodes = ElemBasis::Size();
  4452. Vector<ElemBasis> nu(Nelem);
  4453. Vector<Real> u(Nelem*Nnodes+1), v(Nelem*Nnodes+1);
  4454. for (Long i = 0; i < Nelem; i++) {
  4455. for (Long j = 0; j < Nnodes; j++) {
  4456. v[i*Nnodes+j] = sigma[i][j];
  4457. u[i*Nnodes+j] = sigma[i][j]*area_elem[i][j];
  4458. }
  4459. }
  4460. v[Nelem*Nnodes] = 0; //alpha;
  4461. u[Nelem*Nnodes] = 0;
  4462. nu = 1; //area_elem;
  4463. Real u_dAdnu_v = compute_u_dAdnu_v(u, v, nu);
  4464. std::cout<<"u_dAdnu_v = "<<u_dAdnu_v<<'\n';
  4465. }
  4466. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4467. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4468. auto compute_dsigma_dnu = [&S,&area_elem,&normal,&compute_norm_area_elem,&compute_invA,&comm] (const Vector<ElemBasis>& nu, Real eps) {
  4469. auto compute_sigma = [&S,&area_elem,&normal,&compute_norm_area_elem,&compute_invA,&comm] (const Vector<ElemBasis>& nu, Real eps) {
  4470. const Long Nelem = S.GetElemList().NElem();
  4471. const Long Nnodes = ElemBasis::Size();
  4472. Vector<ElemBasis> X_orig(Nelem*COORD_DIM);
  4473. for (Long i = 0; i < Nelem; i++) {
  4474. for (Long j = 0; j < Nnodes; j++) {
  4475. X_orig[i*COORD_DIM+0][j] = S.Elem(i,0)[j];
  4476. X_orig[i*COORD_DIM+1][j] = S.Elem(i,1)[j];
  4477. X_orig[i*COORD_DIM+2][j] = S.Elem(i,2)[j];
  4478. S.Elem(i,0)[j] += eps*nu[i][j] * normal[i*COORD_DIM+0][j];
  4479. S.Elem(i,1)[j] += eps*nu[i][j] * normal[i*COORD_DIM+1][j];
  4480. S.Elem(i,2)[j] += eps*nu[i][j] * normal[i*COORD_DIM+2][j];
  4481. }
  4482. }
  4483. compute_norm_area_elem(normal, area_elem);
  4484. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4485. S.quadrature_DxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_DxU , order_singular, order_direct, -1.0, comm);
  4486. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4487. S.quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm);
  4488. Real flux = 1.0, alpha;
  4489. Vector<ElemBasis> sigma;
  4490. compute_invA(sigma, alpha, flux);
  4491. Vector<Real> sigma_(Nelem*Nnodes+1);
  4492. for (Long i = 0; i < Nelem; i++) {
  4493. for (Long j = 0; j < Nnodes; j++) {
  4494. sigma_[i*Nnodes+j] = sigma[i][j];
  4495. }
  4496. }
  4497. sigma_[Nelem*Nnodes] = alpha;
  4498. for (Long i = 0; i < Nelem; i++) {
  4499. for (Long j = 0; j < Nnodes; j++) {
  4500. S.Elem(i,0)[j] = X_orig[i*COORD_DIM+0][j];
  4501. S.Elem(i,1)[j] = X_orig[i*COORD_DIM+1][j];
  4502. S.Elem(i,2)[j] = X_orig[i*COORD_DIM+2][j];
  4503. }
  4504. }
  4505. compute_norm_area_elem(normal, area_elem);
  4506. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4507. S.quadrature_DxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_DxU , order_singular, order_direct, -1.0, comm);
  4508. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4509. S.quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm);
  4510. return sigma_;
  4511. };
  4512. auto sigma0 = compute_sigma(nu,-eps);
  4513. auto sigma1 = compute_sigma(nu,eps);
  4514. return (sigma1-sigma0) * (1/(2*eps));
  4515. };
  4516. if (0) { // verify dA_dnu sigma + A dsigma_dnu = 0
  4517. const Long Nelem = S.GetElemList().NElem();
  4518. const Long Nnodes = ElemBasis::Size();
  4519. Vector<ElemBasis> nu(Nelem);
  4520. nu = 1; //area_elem;
  4521. Vector<Real> dA_dnu_sigma;
  4522. { // Set dA_dnu_simga
  4523. Vector<Real> sigma_(Nelem*Nnodes+1);
  4524. for (Long i = 0; i < Nelem; i++) {
  4525. for (Long j = 0; j < Nnodes; j++) {
  4526. sigma_[i*Nnodes+j] = sigma[i][j];
  4527. }
  4528. }
  4529. sigma_[Nelem*Nnodes] = alpha;
  4530. Real eps = 1e-3;
  4531. Vector<Real> Asigma0 = compute_Av(sigma_,nu,-eps);
  4532. Vector<Real> Asigma1 = compute_Av(sigma_,nu,eps);
  4533. dA_dnu_sigma = (Asigma1-Asigma0) * (1/(2*eps));
  4534. }
  4535. Vector<Real> A_dsigma_dnu;
  4536. { // Set A_dsigma_dnu
  4537. Vector<Real> dsigma_dnu = compute_dsigma_dnu(nu, 1e-3);
  4538. A_dsigma_dnu = compute_A(dsigma_dnu);
  4539. }
  4540. Vector<ElemBasis> dA_dnu_sigma_(Nelem);
  4541. Vector<ElemBasis> A_dsigma_dnu_(Nelem);
  4542. for (Long i = 0; i < Nelem; i++) {
  4543. for (Long j = 0; j < Nnodes; j++) {
  4544. dA_dnu_sigma_[i][j] = dA_dnu_sigma[i*Nnodes+j];
  4545. A_dsigma_dnu_[i][j] = A_dsigma_dnu[i*Nnodes+j];
  4546. }
  4547. }
  4548. std::cout<<dA_dnu_sigma[Nelem*Nnodes] + A_dsigma_dnu[Nelem*Nnodes]<<'\n';
  4549. { // Write VTU
  4550. VTUData vtu;
  4551. vtu.AddElems(S.GetElemList(), dA_dnu_sigma_ + A_dsigma_dnu_, ORDER);
  4552. vtu.WriteVTK("err", comm);
  4553. }
  4554. }
  4555. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4556. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4557. if (1) { // test grad_g
  4558. const Long Nelem = S.GetElemList().NElem();
  4559. const Long Nnodes = ElemBasis::Size();
  4560. Vector<ElemBasis> dg_dnu;
  4561. { // Compute dg_dnu
  4562. dg_dnu = compute_dg_dnu(sigma, alpha, B);
  4563. Vector<Real> dg_dsigma(Nelem*Nnodes+1);
  4564. { // Set dg_dsigma
  4565. Vector<ElemBasis> dg_dsigma_ = compute_dg_dsigma(B);
  4566. for (Long i = 0; i < Nelem; i++) {
  4567. for (Long j = 0; j < Nnodes; j++) {
  4568. dg_dsigma[i*Nnodes+j] = dg_dsigma_[i][j];
  4569. }
  4570. }
  4571. dg_dsigma[Nelem*Nnodes] = compute_dg_dalpha(B);
  4572. }
  4573. Vector<Real> dg_dsigma_invA = compute_invAadj(dg_dsigma);
  4574. { // Set dg_dnu = - dg_dsigma invA dA_dnu sigma
  4575. Vector<Real> sigma_(Nelem*Nnodes+1);
  4576. for (Long i = 0; i < Nelem; i++) {
  4577. for (Long j = 0; j < Nnodes; j++) {
  4578. sigma_[i*Nnodes+j] = sigma[i][j];
  4579. }
  4580. }
  4581. sigma_[Nelem*Nnodes] = alpha;
  4582. auto dg_dnu1 = compute_u_dAdnu_v_00(dg_dsigma_invA, sigma_)*(-1);
  4583. auto dg_dnu2 = compute_u_dAdnu_v_01(dg_dsigma_invA, sigma_)*(-1);
  4584. auto dg_dnu3 = compute_u_dAdnu_v_10(dg_dsigma_invA, sigma_)*(-1);
  4585. auto dg_dnu4 = compute_u_dAdnu_v_11(dg_dsigma_invA, sigma_)*(-1);
  4586. {
  4587. //Vector<ElemBasis> nu(Nelem);
  4588. //nu = area_elem;
  4589. //Real dg_dnu0_ = -compute_inner_prod(nu, dg_dnu);
  4590. //Real dg_dnu1_ = -compute_inner_prod(nu, dg_dnu1);
  4591. //Real dg_dnu2_ = -compute_inner_prod(nu, dg_dnu2);
  4592. //Real dg_dnu3_ = -compute_inner_prod(nu, dg_dnu3);
  4593. //Real dg_dnu4_ = -compute_inner_prod(nu, dg_dnu4);
  4594. //std::cout<<dg_dnu0_<<' '<<dg_dnu1_<<' '<<dg_dnu2_<<' '<<dg_dnu3_<<' '<<dg_dnu4_<<'\n';
  4595. }
  4596. dg_dnu += dg_dnu1;
  4597. dg_dnu += dg_dnu2;
  4598. dg_dnu += dg_dnu3;
  4599. dg_dnu += dg_dnu4;
  4600. }
  4601. if (0) { // Set dg_dnu = - dg_dsigma invA dA_dnu sigma
  4602. Vector<ElemBasis> nu(Nelem);
  4603. nu = dg_dnu; //1; //area_elem;
  4604. Vector<Real> dg_dsigma_invA = compute_invAadj(dg_dsigma);
  4605. Vector<Real> sigma_(Nelem*Nnodes+1);
  4606. for (Long i = 0; i < Nelem; i++) {
  4607. for (Long j = 0; j < Nnodes; j++) {
  4608. sigma_[i*Nnodes+j] = sigma[i][j];
  4609. }
  4610. }
  4611. sigma_[Nelem*Nnodes] = alpha;
  4612. Vector<Real> dg_dsigma_invA_0 = dg_dsigma_invA; dg_dsigma_invA_0[Nelem*Nnodes] = 0;
  4613. Vector<Real> dg_dsigma_invA_1(Nelem*Nnodes+1); dg_dsigma_invA_1 = 0; dg_dsigma_invA_1[Nelem*Nnodes] = dg_dsigma_invA[Nelem*Nnodes];
  4614. Vector<Real> sigma_0 = sigma_; sigma_0[Nelem*Nnodes] = 0;
  4615. Vector<Real> sigma_1(Nelem*Nnodes+1); sigma_1 = 0; sigma_1[Nelem*Nnodes] = sigma_[Nelem*Nnodes];
  4616. Real dg_dnu1 = -compute_u_dAdnu_v(dg_dsigma_invA_0, sigma_0, nu);
  4617. Real dg_dnu2 = -compute_u_dAdnu_v(dg_dsigma_invA_0, sigma_1, nu);
  4618. Real dg_dnu3 = -compute_u_dAdnu_v(dg_dsigma_invA_1, sigma_0, nu);
  4619. Real dg_dnu4 = -compute_u_dAdnu_v(dg_dsigma_invA_1, sigma_1, nu);
  4620. std::cout<<dg_dnu1<<' '<<dg_dnu2<<' '<<dg_dnu3<<' '<<dg_dnu4<<'\n';
  4621. }
  4622. if (0) { // Set dg_dnu = dg_dsigma dsigma_dnu
  4623. Vector<ElemBasis> nu(Nelem);
  4624. nu = dg_dnu; //1; //area_elem;
  4625. Vector<Real> dsigma_dnu = compute_dsigma_dnu(nu, 1e-3);
  4626. Vector<ElemBasis> dg_dsigma_(Nelem), dsigma_dnu_(Nelem);
  4627. for (Long i = 0; i < Nelem; i++) {
  4628. for (Long j = 0; j < Nnodes; j++) {
  4629. dg_dsigma_[i][j] = dg_dsigma[i*Nnodes+j];
  4630. dsigma_dnu_[i][j] = dsigma_dnu[i*Nnodes+j];
  4631. }
  4632. }
  4633. Real dg_dnu = compute_inner_prod(dg_dsigma_, dsigma_dnu_);
  4634. dg_dnu += dg_dsigma[Nelem*Nnodes] * dsigma_dnu[Nelem*Nnodes];
  4635. std::cout<<dg_dnu<<'\n';
  4636. }
  4637. }
  4638. { // Write VTU
  4639. VTUData vtu;
  4640. vtu.AddElems(S.GetElemList(), dg_dnu, ORDER);
  4641. vtu.WriteVTK("dg_dnu", comm);
  4642. }
  4643. { // Save data
  4644. Matrix<Real> M(S.NtNp_[0]*ORDER, S.NtNp_[1]*ORDER);
  4645. for (Long tt = 0; tt < S.NtNp_[0]; tt++) {
  4646. for (Long pp = 0; pp < S.NtNp_[1]; pp++) {
  4647. for (Long t = 0; t < ORDER; t++) {
  4648. for (Long p = 0; p < ORDER; p++) {
  4649. Long elem_idx = tt * S.NtNp_[1] + pp;
  4650. Long node_idx = p * ORDER + t;
  4651. M[tt*ORDER+t][pp*ORDER+p] = dg_dnu[elem_idx][node_idx];
  4652. }
  4653. }
  4654. }
  4655. }
  4656. M.Write("dg_dnu.mat");
  4657. }
  4658. { // filter dg_dnu and write VTU
  4659. const Long Nelem = S.GetElemList().NElem();
  4660. const Long Nnodes = ElemBasis::Size();
  4661. const Integer INTERP_ORDER = 12;
  4662. Long Nt = S.NtNp_[0]*ORDER/5, Np = S.NtNp_[1]*ORDER/5;
  4663. Matrix<Real> M(Nt, Np); M = 0;
  4664. const auto& quad_wts = ElemBasis::QuadWts();
  4665. const Matrix<Real>& Mnodes = Basis<Real,1,ORDER>::Nodes();
  4666. for (Long tt = 0; tt < S.NtNp_[0]; tt++) {
  4667. for (Long pp = 0; pp < S.NtNp_[1]; pp++) {
  4668. for (Long t = 0; t < ORDER; t++) {
  4669. for (Long p = 0; p < ORDER; p++) {
  4670. Real theta = (tt + Mnodes[0][t]) / S.NtNp_[0];
  4671. Real phi = (pp + Mnodes[0][p]) / S.NtNp_[1];
  4672. Long i = (Long)(theta * Nt);
  4673. Long j = (Long)(phi * Np);
  4674. Real x = theta * Nt - i;
  4675. Real y = phi * Np - j;
  4676. Long elem_idx = tt * S.NtNp_[1] + pp;
  4677. Long node_idx = p * ORDER + t;
  4678. Vector<Real> Interp0(INTERP_ORDER);
  4679. Vector<Real> Interp1(INTERP_ORDER);
  4680. { // Set Interp0, Interp1
  4681. auto node = [] (Long i) {
  4682. return (Real)i - (INTERP_ORDER-1)/2;
  4683. };
  4684. for (Long i = 0; i < INTERP_ORDER; i++) {
  4685. Real wt_x = 1, wt_y = 1;
  4686. for (Long j = 0; j < INTERP_ORDER; j++) {
  4687. if (j != i) {
  4688. wt_x *= (x - node(j)) / (node(i) - node(j));
  4689. wt_y *= (y - node(j)) / (node(i) - node(j));
  4690. }
  4691. Interp0[i] = wt_x;
  4692. Interp1[i] = wt_y;
  4693. }
  4694. }
  4695. }
  4696. for (Long ii = 0; ii < INTERP_ORDER; ii++) {
  4697. for (Long jj = 0; jj < INTERP_ORDER; jj++) {
  4698. Long idx_i = (i + ii-(INTERP_ORDER-1)/2 + Nt) % Nt;
  4699. Long idx_j = (j + jj-(INTERP_ORDER-1)/2 + Np) % Np;
  4700. M[idx_i][idx_j] += dg_dnu[elem_idx][node_idx] * quad_wts[node_idx] * Interp0[ii] * Interp1[jj] / (S.NtNp_[0] * S.NtNp_[1]) * (Nt * Np);
  4701. }
  4702. }
  4703. }
  4704. }
  4705. }
  4706. }
  4707. Vector<ElemBasis> f(Nelem);
  4708. for (Long tt = 0; tt < S.NtNp_[0]; tt++) {
  4709. for (Long pp = 0; pp < S.NtNp_[1]; pp++) {
  4710. for (Long t = 0; t < ORDER; t++) {
  4711. for (Long p = 0; p < ORDER; p++) {
  4712. Matrix<Real> Mnodes = Basis<Real,1,ORDER>::Nodes();
  4713. Real theta = (tt + Mnodes[0][t]) / S.NtNp_[0];
  4714. Real phi = (pp + Mnodes[0][p]) / S.NtNp_[1];
  4715. Long i = (Long)(theta * Nt);
  4716. Long j = (Long)(phi * Np);
  4717. Real x = theta * Nt - i;
  4718. Real y = phi * Np - j;
  4719. Vector<Real> Interp0(INTERP_ORDER);
  4720. Vector<Real> Interp1(INTERP_ORDER);
  4721. { // Set Interp0, Interp1
  4722. auto node = [] (Long i) {
  4723. return (Real)i - (INTERP_ORDER-1)/2;
  4724. };
  4725. for (Long i = 0; i < INTERP_ORDER; i++) {
  4726. Real wt_x = 1, wt_y = 1;
  4727. for (Long j = 0; j < INTERP_ORDER; j++) {
  4728. if (j != i) {
  4729. wt_x *= (x - node(j)) / (node(i) - node(j));
  4730. wt_y *= (y - node(j)) / (node(i) - node(j));
  4731. }
  4732. Interp0[i] = wt_x;
  4733. Interp1[i] = wt_y;
  4734. }
  4735. }
  4736. }
  4737. Real f0 = 0;
  4738. for (Long ii = 0; ii < INTERP_ORDER; ii++) {
  4739. for (Long jj = 0; jj < INTERP_ORDER; jj++) {
  4740. Long idx_i = (i + ii-(INTERP_ORDER-1)/2 + Nt) % Nt;
  4741. Long idx_j = (j + jj-(INTERP_ORDER-1)/2 + Np) % Np;
  4742. f0 += Interp0[ii] * Interp1[jj] * M[idx_i][idx_j];
  4743. }
  4744. }
  4745. Long elem_idx = tt * S.NtNp_[1] + pp;
  4746. Long node_idx = p * ORDER + t;
  4747. f[elem_idx][node_idx] = f0;
  4748. }
  4749. }
  4750. }
  4751. }
  4752. { // Write VTU
  4753. VTUData vtu;
  4754. vtu.AddElems(S.GetElemList(), f, ORDER);
  4755. vtu.WriteVTK("dg_dnu_filtered", comm);
  4756. }
  4757. dg_dnu = f;
  4758. }
  4759. auto compute_g = [&sigma,&alpha,&S,&area_elem,&normal,&compute_norm_area_elem,&compute_invA,&compute_half_n_plus_dG,&compute_B0,&compute_inner_prod,&comm] (const Vector<ElemBasis>& nu, Real eps) {
  4760. const Long Nelem = S.GetElemList().NElem();
  4761. const Long Nnodes = ElemBasis::Size();
  4762. Vector<ElemBasis> X_orig(Nelem*COORD_DIM);
  4763. for (Long i = 0; i < Nelem; i++) {
  4764. for (Long j = 0; j < Nnodes; j++) {
  4765. X_orig[i*COORD_DIM+0][j] = S.Elem(i,0)[j];
  4766. X_orig[i*COORD_DIM+1][j] = S.Elem(i,1)[j];
  4767. X_orig[i*COORD_DIM+2][j] = S.Elem(i,2)[j];
  4768. S.Elem(i,0)[j] += eps*nu[i][j] * normal[i*COORD_DIM+0][j];
  4769. S.Elem(i,1)[j] += eps*nu[i][j] * normal[i*COORD_DIM+1][j];
  4770. S.Elem(i,2)[j] += eps*nu[i][j] * normal[i*COORD_DIM+2][j];
  4771. }
  4772. }
  4773. compute_norm_area_elem(normal, area_elem);
  4774. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4775. S.quadrature_DxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_DxU , order_singular, order_direct, -1.0, comm);
  4776. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4777. S.quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm);
  4778. Real flux = 1.0, alpha;
  4779. Vector<ElemBasis> sigma;
  4780. compute_invA(sigma, alpha, flux);
  4781. Vector<ElemBasis> B = compute_half_n_plus_dG(sigma) + compute_B0(alpha);
  4782. Real g = compute_inner_prod(B, B);
  4783. for (Long i = 0; i < Nelem; i++) {
  4784. for (Long j = 0; j < Nnodes; j++) {
  4785. S.Elem(i,0)[j] = X_orig[i*COORD_DIM+0][j];
  4786. S.Elem(i,1)[j] = X_orig[i*COORD_DIM+1][j];
  4787. S.Elem(i,2)[j] = X_orig[i*COORD_DIM+2][j];
  4788. }
  4789. }
  4790. compute_norm_area_elem(normal, area_elem);
  4791. S.quadrature_FxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxU , order_singular, order_direct, -1.0, comm);
  4792. S.quadrature_DxU .template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_DxU , order_singular, order_direct, -1.0, comm);
  4793. S.quadrature_FxdU.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_FxdU, order_singular, order_direct, -1.0, comm);
  4794. S.quadrature_dUxF.template Setup<ElemBasis, ElemBasis>(S.GetElemList(), S.Laplace_dUxF, order_singular, order_direct, -1.0, comm);
  4795. return g;
  4796. };
  4797. {
  4798. Vector<ElemBasis> nu(Nelem);
  4799. nu = area_elem;
  4800. Real eps = 1e-4;
  4801. Real g0 = compute_g(nu,-eps);
  4802. Real g1 = compute_g(nu,eps);
  4803. std::cout<<"g = "<<g0<<" g = "<<g1<<" dg_dnu = "<<(g1-g0)/(2*eps)<<'\n';
  4804. std::cout<<"dg_dnu = "<<compute_inner_prod(nu, dg_dnu)<<'\n';
  4805. }
  4806. {
  4807. Vector<ElemBasis> nu(Nelem);
  4808. nu = 1;
  4809. Real eps = 1e-4;
  4810. Real g0 = compute_g(nu,-eps);
  4811. Real g1 = compute_g(nu,eps);
  4812. std::cout<<"g = "<<g0<<" g = "<<g1<<" dg_dnu = "<<(g1-g0)/(2*eps)<<'\n';
  4813. std::cout<<"dg_dnu = "<<compute_inner_prod(nu, dg_dnu)<<'\n';
  4814. }
  4815. {
  4816. Vector<ElemBasis> nu(Nelem);
  4817. nu = dg_dnu;
  4818. Real eps = 1e-4;
  4819. Real g0 = compute_g(nu,-eps);
  4820. Real g1 = compute_g(nu,eps);
  4821. std::cout<<"g = "<<g0<<" g = "<<g1<<" dg_dnu = "<<(g1-g0)/(2*eps)<<'\n';
  4822. std::cout<<"dg_dnu = "<<compute_inner_prod(nu, dg_dnu)<<'\n';
  4823. }
  4824. }
  4825. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4826. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4827. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4828. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4829. // dg_dnu
  4830. // dA_dnu_sigma
  4831. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4832. /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
  4833. //Profile::print(&comm);
  4834. }
  4835. private:
  4836. void InitSurf(Long l) {
  4837. const auto& nodes = ElemBasis::Nodes();
  4838. const Long Nt = NtNp_[l*2+0];
  4839. const Long Np = NtNp_[l*2+1];
  4840. for (Long i = 0; i < Nt; i++) {
  4841. for (Long j = 0; j < Np; j++) {
  4842. for (Long k = 0; k < ElemBasis::Size(); k++) {
  4843. Real theta = (i + nodes[0][k]) * 2*const_pi<Real>()/Nt;
  4844. Real phi = (j + nodes[1][k]) * 2*const_pi<Real>()/Np;
  4845. Real X,Y,Z;
  4846. SurfGeom(X,Y,Z,theta,phi);
  4847. Elem(ElemIdx(l,i,j),0)[k] = X;
  4848. Elem(ElemIdx(l,i,j),1)[k] = Y;
  4849. Elem(ElemIdx(l,i,j),2)[k] = Z;
  4850. }
  4851. }
  4852. }
  4853. }
  4854. static void SurfGeom(Real& X, Real& Y, Real& Z, Real theta, Real phi) {
  4855. sctl::Integer Nperiod = 5;
  4856. #if 0
  4857. Real Aspect_ratio = 10.27932548522949;
  4858. Real coeffmat[21][21] = { 0.00000478813217, 0.00000000000000, 0.00000351611652, 0.00000135354389, 0.00000061357832, 0.00000220091101, 0.00000423862912, -0.00003000058678, 0.00000064187111, -0.00024228452821, 0.00003116775770, 0.00000176210710, 0.00000289141326, -0.00000150300525, 0.00000772853855, 0.00000098855242, 0.00000316606793, 0.00000002168364, 0.00000212047939, 0.00000299016097, 0.00000443224508,
  4859. 0.00000028202930, 0.00000000000000, -0.00000249222421, -0.00000203136278, 0.00000131104809, 0.00000011987446, -0.00000370760154, 0.00004553918916, -0.00007711342914, -0.00004685295062, 0.00011049838213, -0.00000197486270, 0.00000395827146, 0.00000615046474, 0.00000755337123, 0.00000700606006, 0.00000922725030, -0.00000043310337, 0.00000107416383, 0.00000449787694, 0.00000305137178,
  4860. 0.00001226376662, 0.00000000000000, 0.00000270820692, 0.00000208059305, 0.00000521478523, 0.00001779037302, 0.00000846544117, 0.00001120913385, -0.00065816845745, -0.00085107452469, -0.00013171190221, -0.00005540943675, -0.00001835885450, 0.00000101879823, 0.00000209222071, 0.00000091532502, -0.00000521515358, -0.00000209227142, -0.00000678545939, -0.00000034963549, -0.00000015111488,
  4861. 0.00001560274177, 0.00000000000000, 0.00000350691471, -0.00001160475040, -0.00001763036562, 0.00003487367940, -0.00002787247831, -0.00000910982726, 0.00008818832430, -0.00524408789352, 0.00009378376126, 0.00004184526188, 0.00002849263365, -0.00002757280527, 0.00003388467667, 0.00000706207265, 0.00000625263419, -0.00003315929280, -0.00001181772132, 0.00000311426015, 0.00001875682574,
  4862. -0.00000398287420, 0.00000000000000, -0.00001524541040, 0.00001724056165, 0.00002245173346, 0.00002806861812, -0.00000388776925, 0.00008143573359, -0.00005900909309, 0.00110496615525, 0.00134626252111, 0.00005128383054, -0.00001372421866, 0.00003612563887, 0.00002236580076, -0.00002728391883, 0.00001981237256, 0.00000655450458, 0.00000985319002, 0.00001347597299, 0.00000645987802,
  4863. 0.00003304968050, 0.00000000000000, -0.00000530822217, 0.00001324870937, -0.00003610889689, -0.00005478735329, -0.00005818806312, -0.00037112057908, -0.00017812002625, -0.00093204283621, 0.00115969858598, -0.00033559172880, -0.00010441876657, -0.00001617923044, -0.00000555065844, 0.00007343527250, -0.00004408047607, 0.00000403802142, 0.00001843931204, 0.00001694047933, 0.00001213414362,
  4864. -0.00000751115658, 0.00000000000000, 0.00005457974839, -0.00000334614515, 0.00005845565465, 0.00015000770509, 0.00021849104087, 0.00002724147635, 0.00167233624961, 0.00011666602222, 0.00276563479565, -0.00085952825611, -0.00030217235326, -0.00008841593808, 0.00000997664119, -0.00015285826521, 0.00002517224675, 0.00003009161810, 0.00001883217556, 0.00002146127554, 0.00001822445302,
  4865. -0.00004128706860, 0.00000000000000, -0.00003496417776, 0.00001088761655, -0.00000298955979, -0.00005359326315, -0.00019021633489, -0.00017992728681, -0.00347794801928, 0.00064632791327, 0.00449698418379, -0.00017710507382, 0.00006126180233, 0.00018059254216, 0.00002354096432, 0.00008189838991, -0.00010060678323, -0.00017183290038, 0.00019413756672, 0.00021334811754, 0.00011263617489,
  4866. 0.00000853522670, -0.00000000000000, -0.00006544789358, 0.00005424076880, -0.00000679056529, -0.00001249735487, -0.00053082982777, 0.00035396864405, -0.00115020677913, 0.05894451215863, 0.06573092192411, 0.01498018857092, 0.00278125284240, 0.00145188067108, 0.00033717858605, 0.00000800427370, -0.00009335305367, 0.00024286781263, -0.00023916347709, 0.00031213948387, 0.00018134393031,
  4867. -0.00002521496390, -0.00000000000000, -0.00054337945767, 0.00012690725271, 0.00053313979879, 0.00064233405283, -0.00047686311882, 0.00176536326762, 0.00074157933705, -0.02684566564858, 1.00000000000000, 0.07176169008017, 0.00837037432939, -0.00000381640211, 0.00088998704450, -0.00049218931235, -0.00024546548957, -0.00036608282244, 0.00049480766756, 0.00031158892671, 0.00006898906577,
  4868. 0.00021280418150, 0.00028127161204, -0.00070030166535, 0.00022237010126, -0.00028713891516, -0.00013800295710, 0.00005912094275, 0.00172126013786, -0.00618684850633, 0.03608432412148, Aspect_ratio , 0.49896776676178, 0.00091372377938, -0.00085712829605, -0.00124801427592, -0.00007427225501, -0.00005245858847, 0.00002841771493, 0.00020249813679, -0.00014303345233, 0.00001406490901,
  4869. 0.00023699452868, 0.00008661757602, 0.00025744654704, -0.00022715188970, -0.00076146807987, 0.00055185536621, -0.00012325309217, -0.00072356045712, -0.00160693109501, 0.00246682553552, -0.14175094664097, -0.36207047104836, -0.04089594259858, 0.00060774467420, 0.00088646943914, 0.00004865296432, -0.00041878610500, -0.00023025234987, -0.00009676301852, -0.00000000000000, 0.00008409228758,
  4870. 0.00011432896281, -0.00000707848403, 0.00004698805787, -0.00043642931269, 0.00081384339137, -0.00065635429928, -0.00011831733718, 0.00017413357273, 0.00224463525228, 0.00478497287259, 0.03294761106372, 0.01078986655921, 0.10731782764196, 0.00075034319889, -0.00009241879889, 0.00055023463210, 0.00006596000458, 0.00005045382932, 0.00014874986664, 0.00000000000000, -0.00015369028552,
  4871. 0.00001037383754, 0.00009250180301, 0.00026204055757, 0.00007424291834, -0.00047751804232, 0.00029184055165, 0.00050921301590, -0.00004825839278, -0.00029933769838, 0.00279659987427, 0.00210463814437, -0.00618590926751, -0.02400829829276, -0.02316811867058, -0.00086368201301, -0.00032258985448, -0.00018304496189, 0.00008438774967, -0.00008305341908, 0.00000000000000, 0.00013047417451,
  4872. -0.00001376930322, -0.00001723831701, -0.00011543079017, -0.00022646733851, 0.00013467084500, -0.00004661652201, -0.00008419520600, 0.00035772417323, -0.00011815709877, 0.00028718306567, 0.00092207465786, -0.00317224999890, 0.00061770365573, 0.01017294172198, 0.00294739892706, 0.00014669894881, 0.00015702951350, 0.00003432080121, -0.00008555022214, -0.00000000000000, 0.00000454909878,
  4873. -0.00000196001542, -0.00003198397462, -0.00004425687075, -0.00004129848094, -0.00003789070615, -0.00027583551127, 0.00025874207495, -0.00002334945384, -0.00007259396807, -0.00008295358566, 0.00011360697681, -0.00101968157105, 0.00046784928418, -0.00208410434425, -0.00313158822246, -0.00046005158219, -0.00010552268213, -0.00005850767775, 0.00003971093611, 0.00000000000000, -0.00005275657168,
  4874. -0.00001065901233, -0.00001934838656, -0.00001220186732, -0.00002060524639, -0.00000225423423, -0.00001894621164, -0.00001533334580, -0.00001791087379, 0.00008156246622, -0.00008441298269, 0.00021060956351, -0.00030303673702, 0.00075949780876, -0.00010539998038, 0.00109045265708, 0.00068949378328, 0.00009268362192, 0.00003471063246, 0.00001204656473, -0.00000000000000, 0.00001500743110,
  4875. 0.00000105878155, -0.00000910870767, -0.00000172467264, -0.00000722095228, 0.00000699280463, -0.00002061720625, -0.00000889817693, -0.00001993474507, 0.00000370749740, -0.00000090311920, 0.00002677819793, 0.00043428712524, 0.00210293265991, 0.00018200518389, -0.00009621794743, -0.00035250501242, -0.00012996385340, -0.00002185157609, -0.00001116586463, -0.00000000000000, -0.00000451994811,
  4876. 0.00000424055270, -0.00000463139304, 0.00000301006116, -0.00000123974939, 0.00000632465435, -0.00002090823000, 0.00001773388794, 0.00000121050368, 0.00001886057362, -0.00001043497195, -0.00002269273500, -0.00021979617304, -0.00001043962493, -0.00116343051195, -0.00004193381756, 0.00007944958634, 0.00007301353617, 0.00002082651736, -0.00000119863023, -0.00000000000000, -0.00001440504820,
  4877. -0.00000391270805, -0.00000490489265, -0.00000504441778, -0.00000904507579, -0.00000111389932, 0.00000597532107, 0.00000047090245, -0.00001553130096, -0.00001524566323, -0.00000522222899, -0.00007707672921, -0.00004165665086, 0.00015764687851, 0.00035649110214, 0.00038701237645, 0.00002386798405, -0.00001946414341, -0.00000913835174, -0.00000489907188, 0.00000000000000, 0.00000172327657,
  4878. -0.00000015388650, -0.00000603232729, -0.00000397650865, 0.00000280493782, 0.00000463132073, -0.00000788678426, -0.00000471605335, -0.00000283715985, -0.00000422824724, 0.00000366817630, -0.00001159603562, -0.00001625759251, 0.00049116823357, 0.00005048640014, -0.00020234247495, -0.00006341376866, -0.00000807822744, 0.00000070463199, 0.00000014041755, 0.00000000000000, -0.00000718306910};
  4879. #else
  4880. Real Aspect_ratio = 5;
  4881. Real coeffmat[21][21] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4882. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4883. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4884. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4885. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4886. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4887. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4888. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4889. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4890. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4891. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, Aspect_ratio, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4892. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0.2, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4893. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4894. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4895. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4896. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4897. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4898. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4899. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4900. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0,
  4901. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 , 0, 0, 0, 0, 0, 0, 0, 0, 0};
  4902. #endif
  4903. Z = 0;
  4904. Real R = 0;
  4905. for (long i = -10; i <= 10; i++) {
  4906. for (long j = -10; j <= 10; j++) {
  4907. R += coeffmat[i+10][j+10] * sctl::cos(-i*phi + Nperiod*j*theta);
  4908. Z += coeffmat[i+10][j+10] * sctl::sin(-i*phi + Nperiod*j*theta);
  4909. }
  4910. }
  4911. X = R * sctl::cos(theta);
  4912. Y = R * sctl::sin(theta);
  4913. }
  4914. GenericKernel<BiotSavart3D > BiotSavart ;
  4915. GenericKernel<Laplace3D_FxU > Laplace_FxU ;
  4916. GenericKernel<Laplace3D_DxU > Laplace_DxU ;
  4917. GenericKernel<Laplace3D_FxdU> Laplace_FxdU;
  4918. GenericKernel<Laplace3D_dUxF> Laplace_dUxF;
  4919. GenericKernel<Laplace3D_Fxd2U> Laplace_Fxd2U;
  4920. GenericKernel<Laplace3D_dUxD> Laplace_dUxD;
  4921. GenericKernel<Laplace3D_DxdU> Laplace_DxdU;
  4922. Quadrature<Real> quadrature_FxU ;
  4923. Quadrature<Real> quadrature_DxU ;
  4924. Quadrature<Real> quadrature_FxdU;
  4925. Quadrature<Real> quadrature_dUxF;
  4926. Quadrature<Real> quadrature_Fxd2U;
  4927. Quadrature<Real> quadrature_dUxD;
  4928. ElemLst elements;
  4929. Vector<Long> NtNp_;
  4930. Vector<Long> elem_dsp;
  4931. };
  4932. template <class Real, Integer ORDER=5> class Spheres {
  4933. static constexpr Integer COORD_DIM = 3;
  4934. static constexpr Integer ELEM_DIM = COORD_DIM-1;
  4935. using PotentialBasis = Basis<Real, ELEM_DIM, ORDER>;
  4936. using DensityBasis = Basis<Real, ELEM_DIM, ORDER>;
  4937. using CoordBasis = Basis<Real, ELEM_DIM, ORDER>;
  4938. using ElemLst = ElemList<COORD_DIM, CoordBasis>;
  4939. public:
  4940. Spheres(Long N = 0) {
  4941. Vector<Real> X(N*COORD_DIM);
  4942. Vector<Real> R(N);
  4943. X=0;
  4944. R=1;
  4945. for (Long i = 0; i < N; i++) X[i*COORD_DIM] = (i==0?-1.015:1.015); ///////////
  4946. InitSpheres(X,R);
  4947. }
  4948. const ElemLst& GetElem() const {
  4949. return elements;
  4950. }
  4951. static void test() {
  4952. constexpr Integer order_singular = 35;
  4953. constexpr Integer order_direct = 35;
  4954. Comm comm = Comm::World();
  4955. Profile::Enable(true);
  4956. Long Ns = 2;
  4957. Spheres S(Ns);
  4958. S.quadrature_FxT.template Setup<DensityBasis, PotentialBasis>(S.GetElem(), S.Stokes_FxT, order_singular, order_direct, -1.0, comm);
  4959. S.quadrature_FxU.template Setup<DensityBasis, PotentialBasis>(S.GetElem(), S.Stokes_FxU, order_singular, order_direct, -1.0, comm);
  4960. S.quadrature_DxU.template Setup<DensityBasis, PotentialBasis>(S.GetElem(), S.Stokes_DxU, order_singular, order_direct, -1.0, comm);
  4961. const auto SetMotion = [&S](Vector<DensityBasis>& density, const Vector<Real>& force_avg, const Vector<Real>& torque_avg) {
  4962. Long Nelem = S.GetElem().NElem();
  4963. Long Nsurf = S.elem_cnt.Dim();
  4964. const auto& X = S.GetElem().ElemVector();
  4965. Vector<Real> area, Xc;
  4966. Vector<DensityBasis> one(Nelem);
  4967. for (Long i = 0; i < Nelem; i++) {
  4968. for (Long j = 0; j < DensityBasis::Size(); j++) {
  4969. one[i][j] = 1;
  4970. }
  4971. }
  4972. S.SurfInteg(area, one);
  4973. S.SurfInteg(Xc, S.GetElem().ElemVector());
  4974. for (Long i = 0; i < Nsurf; i++) {
  4975. for (Long k = 0; k < COORD_DIM; k++) {
  4976. Xc[i*COORD_DIM+k] /= area[i];
  4977. }
  4978. }
  4979. if (density.Dim() != Nelem*COORD_DIM) density.ReInit(Nelem*COORD_DIM);
  4980. Long elem_itr = 0;
  4981. for (Long i = 0; i < Nsurf; i++) {
  4982. for (Long j = 0; j < S.elem_cnt[i]; j++) {
  4983. for (Long k = 0; k < DensityBasis::Size(); k++) {
  4984. StaticArray<Real,COORD_DIM> dX;
  4985. dX[0] = (X[elem_itr*COORD_DIM+0][k] - Xc[i*COORD_DIM+0]);
  4986. dX[1] = (X[elem_itr*COORD_DIM+1][k] - Xc[i*COORD_DIM+1]);
  4987. dX[2] = (X[elem_itr*COORD_DIM+2][k] - Xc[i*COORD_DIM+2]);
  4988. density[elem_itr*COORD_DIM+0][k] = force_avg[i*COORD_DIM+0]*(1/area[i]) + (torque_avg[i*COORD_DIM+1] * dX[2] - torque_avg[i*COORD_DIM+2] * dX[1]) / (2*area[i]/3);
  4989. density[elem_itr*COORD_DIM+1][k] = force_avg[i*COORD_DIM+1]*(1/area[i]) + (torque_avg[i*COORD_DIM+2] * dX[0] - torque_avg[i*COORD_DIM+0] * dX[2]) / (2*area[i]/3);
  4990. density[elem_itr*COORD_DIM+2][k] = force_avg[i*COORD_DIM+2]*(1/area[i]) + (torque_avg[i*COORD_DIM+0] * dX[1] - torque_avg[i*COORD_DIM+1] * dX[0]) / (2*area[i]/3);
  4991. }
  4992. elem_itr++;
  4993. }
  4994. }
  4995. };
  4996. const auto GetMotion = [&S](Vector<Real>& force_avg, Vector<Real>& torque_avg, const Vector<DensityBasis>& density) {
  4997. Long Nelem = S.GetElem().NElem();
  4998. Long Nsurf = S.elem_cnt.Dim();
  4999. const auto& X = S.GetElem().ElemVector();
  5000. S.SurfInteg(force_avg, density);
  5001. Vector<Real> area, Xc;
  5002. Vector<DensityBasis> one(Nelem);
  5003. for (Long i = 0; i < Nelem; i++) {
  5004. for (Long j = 0; j < DensityBasis::Size(); j++) {
  5005. one[i][j] = 1;
  5006. }
  5007. }
  5008. S.SurfInteg(area, one);
  5009. S.SurfInteg(Xc, S.GetElem().ElemVector());
  5010. for (Long i = 0; i < Nsurf; i++) {
  5011. for (Long k = 0; k < COORD_DIM; k++) {
  5012. Xc[i*COORD_DIM+k] /= area[i];
  5013. }
  5014. }
  5015. { // Set torque_avg
  5016. Long elem_itr = 0;
  5017. Vector<DensityBasis> torque(Nelem*COORD_DIM);
  5018. for (Long i = 0; i < Nsurf; i++) {
  5019. for (Long j = 0; j < S.elem_cnt[i]; j++) {
  5020. for (Long k = 0; k < DensityBasis::Size(); k++) {
  5021. StaticArray<Real,COORD_DIM> dX;
  5022. dX[0] = (X[elem_itr*COORD_DIM+0][k] - Xc[i*COORD_DIM+0]);
  5023. dX[1] = (X[elem_itr*COORD_DIM+1][k] - Xc[i*COORD_DIM+1]);
  5024. dX[2] = (X[elem_itr*COORD_DIM+2][k] - Xc[i*COORD_DIM+2]);
  5025. torque[elem_itr*COORD_DIM+0][k] = dX[1] * density[elem_itr*COORD_DIM+2][k] - dX[2] * density[elem_itr*COORD_DIM+1][k];
  5026. torque[elem_itr*COORD_DIM+1][k] = dX[2] * density[elem_itr*COORD_DIM+0][k] - dX[0] * density[elem_itr*COORD_DIM+2][k];
  5027. torque[elem_itr*COORD_DIM+2][k] = dX[0] * density[elem_itr*COORD_DIM+1][k] - dX[1] * density[elem_itr*COORD_DIM+0][k];
  5028. }
  5029. elem_itr++;
  5030. }
  5031. }
  5032. S.SurfInteg(torque_avg, torque);
  5033. }
  5034. };
  5035. const auto BIOpL = [&GetMotion,&SetMotion](Vector<DensityBasis>& potential, const Vector<DensityBasis>& density) {
  5036. Vector<Real> force_avg, torque_avg;
  5037. GetMotion(force_avg, torque_avg, density);
  5038. SetMotion(potential, force_avg, torque_avg);
  5039. };
  5040. const auto BIOpK = [&S](Vector<DensityBasis>& potential, const Vector<DensityBasis>& density) {
  5041. Vector<DensityBasis> traction;
  5042. S.quadrature_FxT.Eval(traction, S.GetElem(), density, S.Stokes_FxT);
  5043. Vector<CoordBasis> dX;
  5044. const auto X = S.GetElem().ElemVector();
  5045. CoordBasis::Grad(dX, X);
  5046. Long Nelem = S.GetElem().NElem();
  5047. Long Nnodes = CoordBasis::Size();
  5048. potential.ReInit(Nelem * COORD_DIM);
  5049. for (Long i = 0; i < Nelem; i++) {
  5050. for (Long j = 0; j < Nnodes; j++) {
  5051. StaticArray<Real,COORD_DIM> Xn;
  5052. Xn[0] = dX[i*COORD_DIM*2+2][j]*dX[i*COORD_DIM*2+5][j] - dX[i*COORD_DIM*2+4][j]*dX[i*COORD_DIM*2+3][j];
  5053. Xn[1] = dX[i*COORD_DIM*2+4][j]*dX[i*COORD_DIM*2+1][j] - dX[i*COORD_DIM*2+0][j]*dX[i*COORD_DIM*2+5][j];
  5054. Xn[2] = dX[i*COORD_DIM*2+0][j]*dX[i*COORD_DIM*2+3][j] - dX[i*COORD_DIM*2+2][j]*dX[i*COORD_DIM*2+1][j];
  5055. Real AreaElem = sqrt<Real>(Xn[0]*Xn[0] + Xn[1]*Xn[1] + Xn[2]*Xn[2]);
  5056. Real OOAreaElem = 1 / AreaElem;
  5057. Xn[0] *= OOAreaElem;
  5058. Xn[1] *= OOAreaElem;
  5059. Xn[2] *= OOAreaElem;
  5060. potential[i*COORD_DIM+0][j] = traction[i*COORD_DIM*COORD_DIM+0][j]*Xn[0] + traction[i*COORD_DIM*COORD_DIM+1][j]*Xn[1] + traction[i*COORD_DIM*COORD_DIM+2][j]*Xn[2];
  5061. potential[i*COORD_DIM+1][j] = traction[i*COORD_DIM*COORD_DIM+3][j]*Xn[0] + traction[i*COORD_DIM*COORD_DIM+4][j]*Xn[1] + traction[i*COORD_DIM*COORD_DIM+5][j]*Xn[2];
  5062. potential[i*COORD_DIM+2][j] = traction[i*COORD_DIM*COORD_DIM+6][j]*Xn[0] + traction[i*COORD_DIM*COORD_DIM+7][j]*Xn[1] + traction[i*COORD_DIM*COORD_DIM+8][j]*Xn[2];
  5063. }
  5064. }
  5065. };
  5066. const auto BIOp_half_K_L = [&S,&BIOpK,&BIOpL](Vector<DensityBasis>& potential, const Vector<DensityBasis>& density) {
  5067. Vector<DensityBasis> potential_K;
  5068. Vector<DensityBasis> potential_L;
  5069. BIOpK(potential_K, density);
  5070. BIOpL(potential_L, density);
  5071. if (potential.Dim() != potential_K.Dim()) {
  5072. potential.ReInit(potential_K.Dim());
  5073. }
  5074. for (Long i = 0; i < potential_K.Dim(); i++) {
  5075. for (Long k = 0; k < DensityBasis::Size(); k++) {
  5076. potential[i][k] = -0.5*density[i][k] + potential_K[i][k] + potential_L[i][k];
  5077. }
  5078. }
  5079. };
  5080. const auto BIOp_half_K = [&S,&BIOpK,&BIOpL](Vector<DensityBasis>& potential, const Vector<DensityBasis>& density) {
  5081. Vector<DensityBasis> potential_K;
  5082. BIOpK(potential_K, density);
  5083. if (potential.Dim() != potential_K.Dim()) {
  5084. potential.ReInit(potential_K.Dim());
  5085. }
  5086. for (Long i = 0; i < potential_K.Dim(); i++) {
  5087. for (Long k = 0; k < DensityBasis::Size(); k++) {
  5088. potential[i][k] = -0.5*density[i][k] + potential_K[i][k];
  5089. }
  5090. }
  5091. };
  5092. const auto BIOp_half_S_D = [&S,&BIOpL](Vector<DensityBasis>& potential, const Vector<DensityBasis>& density) {
  5093. Vector<DensityBasis> U;
  5094. S.quadrature_DxU.Eval(U, S.GetElem(), density, S.Stokes_DxU);
  5095. Vector<PotentialBasis> U1;
  5096. Vector<DensityBasis> sigma1;
  5097. BIOpL(sigma1,density);
  5098. S.quadrature_FxU.Eval(U1, S.GetElem(), sigma1, S.Stokes_FxU);
  5099. Long Nelem = S.GetElem().NElem();
  5100. Long Nnodes = CoordBasis::Size();
  5101. potential.ReInit(Nelem * COORD_DIM);
  5102. for (Long i = 0; i < Nelem; i++) {
  5103. for (Long j = 0; j < Nnodes; j++) {
  5104. potential[i*COORD_DIM+0][j] = 0.5*density[i*COORD_DIM+0][j] + U[i*COORD_DIM+0][j] + U1[i*COORD_DIM+0][j];
  5105. potential[i*COORD_DIM+1][j] = 0.5*density[i*COORD_DIM+1][j] + U[i*COORD_DIM+1][j] + U1[i*COORD_DIM+1][j];
  5106. potential[i*COORD_DIM+2][j] = 0.5*density[i*COORD_DIM+2][j] + U[i*COORD_DIM+2][j] + U1[i*COORD_DIM+2][j];
  5107. }
  5108. }
  5109. };
  5110. Vector<PotentialBasis> U;
  5111. { // Rachh
  5112. Vector<DensityBasis> sigma0;
  5113. { // Set sigma0
  5114. srand48(comm.Rank());
  5115. Vector<Real> force(Ns*COORD_DIM), torque(Ns*COORD_DIM);
  5116. //for (auto& x : force) x = drand48();
  5117. //for (auto& x : torque) x = drand48();
  5118. force = 0;
  5119. torque = 0;
  5120. force[0] = 1;
  5121. //force[4] = 1;
  5122. SetMotion(sigma0, force, torque);
  5123. }
  5124. Vector<DensityBasis> rhs;
  5125. BIOp_half_K(rhs, sigma0);
  5126. Vector<DensityBasis> sigma;
  5127. { // Set sigma
  5128. Long Nnode = DensityBasis::Size();
  5129. Long Nelem = S.GetElem().NElem();
  5130. typename sctl::ParallelSolver<Real>::ParallelOp A = [&S,&BIOp_half_K_L](sctl::Vector<Real>* Ax, const sctl::Vector<Real>& x) {
  5131. Long Nnode = DensityBasis::Size();
  5132. Long Nelem = S.GetElem().NElem();
  5133. Ax->ReInit(Nelem*COORD_DIM*Nnode);
  5134. Vector<DensityBasis> x_(Nelem*COORD_DIM), Ax_(Nelem*COORD_DIM);
  5135. for (Long i = 0; i < Nelem*COORD_DIM; i++) { // Set x_
  5136. for (Long k = 0; k < Nnode; k++) {
  5137. x_[i][k] = x[i*Nnode+k];
  5138. }
  5139. }
  5140. BIOp_half_K_L(Ax_, x_);
  5141. for (Long i = 0; i < Nelem*COORD_DIM; i++) { // Set Ax
  5142. for (Long k = 0; k < Nnode; k++) {
  5143. (*Ax)[i*Nnode+k] = Ax_[i][k];
  5144. }
  5145. }
  5146. };
  5147. Vector<Real> sigma_(Nelem*COORD_DIM*Nnode), rhs_(Nelem*COORD_DIM*Nnode);
  5148. for (Long i = 0; i < Nelem*COORD_DIM; i++) {// Set rhs_
  5149. for (Long k = 0; k < Nnode; k++) {
  5150. rhs_[i*Nnode+k] = rhs[i][k];
  5151. }
  5152. }
  5153. sigma_ = 0;
  5154. ParallelSolver<Real> linear_solver(comm, true);
  5155. linear_solver(&sigma_, A, rhs_, 1e-6, 50);
  5156. sigma.ReInit(Nelem * COORD_DIM);
  5157. for (Long i = 0; i < Nelem*COORD_DIM; i++) {// Set sigma
  5158. for (Long k = 0; k < Nnode; k++) {
  5159. sigma[i][k] = sigma_[i*Nnode+k] - sigma0[i][k];
  5160. }
  5161. }
  5162. }
  5163. S.quadrature_FxU.Eval(U, S.GetElem(), sigma, S.Stokes_FxU);
  5164. { // Write VTU
  5165. VTUData vtu_sigma;
  5166. vtu_sigma.AddElems(S.elements, sigma, ORDER);
  5167. vtu_sigma.WriteVTK("sphere-sigma0", comm);
  5168. VTUData vtu_U;
  5169. vtu_U.AddElems(S.elements, U, ORDER);
  5170. vtu_U.WriteVTK("sphere-U0", comm);
  5171. }
  5172. }
  5173. { // Tornberg
  5174. Vector<DensityBasis> rhs;
  5175. BIOpL(rhs, U);
  5176. Vector<DensityBasis> sigma;
  5177. { // Set sigma
  5178. Long Nnode = DensityBasis::Size();
  5179. Long Nelem = S.GetElem().NElem();
  5180. typename sctl::ParallelSolver<Real>::ParallelOp A = [&S,&BIOp_half_S_D](sctl::Vector<Real>* Ax, const sctl::Vector<Real>& x) {
  5181. Long Nnode = DensityBasis::Size();
  5182. Long Nelem = S.GetElem().NElem();
  5183. Ax->ReInit(Nelem*COORD_DIM*Nnode);
  5184. Vector<DensityBasis> x_(Nelem*COORD_DIM), Ax_(Nelem*COORD_DIM);
  5185. for (Long i = 0; i < Nelem*COORD_DIM; i++) { // Set x_
  5186. for (Long k = 0; k < Nnode; k++) {
  5187. x_[i][k] = x[i*Nnode+k];
  5188. }
  5189. }
  5190. BIOp_half_S_D(Ax_, x_);
  5191. for (Long i = 0; i < Nelem*COORD_DIM; i++) { // Set Ax
  5192. for (Long k = 0; k < Nnode; k++) {
  5193. (*Ax)[i*Nnode+k] = Ax_[i][k];
  5194. }
  5195. }
  5196. };
  5197. Vector<Real> sigma_(Nelem*COORD_DIM*Nnode), rhs_(Nelem*COORD_DIM*Nnode);
  5198. for (Long i = 0; i < Nelem*COORD_DIM; i++) {// Set rhs_
  5199. for (Long k = 0; k < Nnode; k++) {
  5200. rhs_[i*Nnode+k] = rhs[i][k];
  5201. }
  5202. }
  5203. sigma_ = 0;
  5204. ParallelSolver<Real> linear_solver(comm, true);
  5205. linear_solver(&sigma_, A, rhs_, 1e-6, 50);
  5206. sigma.ReInit(Nelem * COORD_DIM);
  5207. for (Long i = 0; i < Nelem*COORD_DIM; i++) {// Set sigma
  5208. for (Long k = 0; k < Nnode; k++) {
  5209. sigma[i][k] = sigma_[i*Nnode+k];
  5210. }
  5211. }
  5212. }
  5213. Vector<PotentialBasis> U1;
  5214. BIOp_half_S_D(U1, sigma);
  5215. { // Write VTU
  5216. VTUData vtu_sigma;
  5217. vtu_sigma.AddElems(S.elements, sigma, ORDER);
  5218. vtu_sigma.WriteVTK("sphere-sigma1", comm);
  5219. VTUData vtu_U;
  5220. vtu_U.AddElems(S.elements, U1, ORDER);
  5221. vtu_U.WriteVTK("sphere-U1", comm);
  5222. }
  5223. }
  5224. Profile::print(&comm);
  5225. }
  5226. private:
  5227. template <class FnBasis> void SurfInteg(Vector<Real>& I, const Vector<FnBasis>& f) {
  5228. static_assert(std::is_same<FnBasis,CoordBasis>::value, "FnBasis is different from CoordBasis");
  5229. const Long Nelem = elements.NElem();
  5230. const Long dof = f.Dim() / Nelem;
  5231. SCTL_ASSERT(f.Dim() == Nelem * dof);
  5232. auto nodes = FnBasis::Nodes();
  5233. auto quad_wts = FnBasis::QuadWts();
  5234. const Long Nnodes = FnBasis::Size();
  5235. auto EvalOp = CoordBasis::SetupEval(nodes);
  5236. Vector<CoordBasis> dX;
  5237. const auto& X = elements.ElemVector();
  5238. SCTL_ASSERT(X.Dim() == Nelem * COORD_DIM);
  5239. CoordBasis::Grad(dX, X);
  5240. Matrix<Real> I_(Nelem, dof);
  5241. for (Long i = 0; i < Nelem; i++) {
  5242. for (Long k = 0; k < dof; k++) {
  5243. I_[i][k] = 0;
  5244. }
  5245. for (Long j = 0; j < Nnodes; j++) {
  5246. Real dA = 0;
  5247. StaticArray<Real,COORD_DIM> Xn;
  5248. Xn[0] = dX[i*COORD_DIM*2+2][j] * dX[i*COORD_DIM*2+5][j] - dX[i*COORD_DIM*2+3][j] * dX[i*COORD_DIM*2+4][j];
  5249. Xn[1] = dX[i*COORD_DIM*2+4][j] * dX[i*COORD_DIM*2+1][j] - dX[i*COORD_DIM*2+5][j] * dX[i*COORD_DIM*2+0][j];
  5250. Xn[2] = dX[i*COORD_DIM*2+0][j] * dX[i*COORD_DIM*2+3][j] - dX[i*COORD_DIM*2+1][j] * dX[i*COORD_DIM*2+2][j];
  5251. dA += sqrt<Real>(Xn[0]*Xn[0] + Xn[1]*Xn[1] + Xn[2]*Xn[2]) * quad_wts[j];
  5252. for (Long k = 0; k < dof; k++) {
  5253. I_[i][k] += dA * f[i*dof+k][j];
  5254. }
  5255. }
  5256. }
  5257. Long Ns = elem_cnt.Dim();
  5258. if (I.Dim() != Ns * dof) I.ReInit(Ns * dof);
  5259. I = 0;
  5260. Long elem_itr = 0;
  5261. for (Long i = 0; i < Ns; i++) {
  5262. for (Long j = 0; j < elem_cnt[i]; j++) {
  5263. for (Long k = 0; k < dof; k++) {
  5264. I[i*dof+k] += I_[elem_itr][k];
  5265. }
  5266. elem_itr++;
  5267. }
  5268. }
  5269. }
  5270. void InitSpheres(const Vector<Real> X, const Vector<Real>& R){
  5271. SCTL_ASSERT(X.Dim() == R.Dim() * COORD_DIM);
  5272. Long N = R.Dim();
  5273. elements.ReInit(2*COORD_DIM*N);
  5274. auto nodes = ElemLst::CoordBasis::Nodes();
  5275. for (Long l = 0; l < N; l++) {
  5276. for (Integer i = 0; i < COORD_DIM; i++) {
  5277. for (Integer j = 0; j < 2; j++) {
  5278. for (int k = 0; k < ElemLst::CoordBasis::Size(); k++) {
  5279. Real coord[COORD_DIM];
  5280. coord[(i+0)%COORD_DIM] = (j ? -1.0 : 1.0);
  5281. coord[(i+1)%COORD_DIM] = 2.0 * nodes[j?1:0][k] - 1.0;
  5282. coord[(i+2)%COORD_DIM] = 2.0 * nodes[j?0:1][k] - 1.0;
  5283. Real R0 = sqrt<Real>(coord[0]*coord[0] + coord[1]*coord[1] + coord[2]*coord[2]);
  5284. elements((l*COORD_DIM+i)*2+j,0)[k] = X[l*COORD_DIM+0] + R[l] * coord[0] / R0;
  5285. elements((l*COORD_DIM+i)*2+j,1)[k] = X[l*COORD_DIM+1] + R[l] * coord[1] / R0;
  5286. elements((l*COORD_DIM+i)*2+j,2)[k] = X[l*COORD_DIM+2] + R[l] * coord[2] / R0;
  5287. }
  5288. }
  5289. }
  5290. }
  5291. elem_cnt.ReInit(N);
  5292. elem_cnt = 6;
  5293. }
  5294. GenericKernel<Stokes3D_DxU> Stokes_DxU;
  5295. GenericKernel<Stokes3D_FxU> Stokes_FxU;
  5296. GenericKernel<Stokes3D_FxT> Stokes_FxT;
  5297. Quadrature<Real> quadrature_DxU;
  5298. Quadrature<Real> quadrature_FxU;
  5299. Quadrature<Real> quadrature_FxT;
  5300. ElemLst elements;
  5301. Vector<Long> elem_cnt;
  5302. };
  5303. } // end namespace
  5304. #endif //_SCTL_BOUNDARY_QUADRATURE_HPP_