3D EM based on Schur decomposition
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

EMSchur3D.h 35KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819
  1. /* This file is part of Lemma, a geophysical modelling and inversion API.
  2. * More information is available at http://lemmasoftware.org
  3. */
  4. /* This Source Code Form is subject to the terms of the Mozilla Public
  5. * License, v. 2.0. If a copy of the MPL was not distributed with this
  6. * file, You can obtain one at http://mozilla.org/MPL/2.0/.
  7. */
  8. /**
  9. * @file
  10. * @date 02/19/2015 01:10:39 PM
  11. * @version $Id$
  12. * @author Trevor Irons (ti)
  13. * @email Trevor.Irons@Lemmasoftware.org
  14. * @copyright Copyright (c) 2015, XRI Geophysics, LLC
  15. * @copyright Copyright (c) 2011, 2015, 2017, 2018 Trevor Irons
  16. * @copyright Copyright (c) 2011, Colorado School of Mines
  17. */
  18. #ifndef EMSCHUR3D_INC
  19. #define EMSCHUR3D_INC
  20. #include "EMSchur3DBase.h"
  21. #include "bicgstab.h"
  22. #ifdef HAVE_SUPERLU
  23. #include "Eigen/SuperLUSupport"
  24. #endif
  25. #ifdef HAVE_UMFPACK
  26. #include <Eigen/UmfPackSupport>
  27. #endif
  28. #ifdef HAVE_PASTIX
  29. #include <Eigen/PaStiXSupport>
  30. #endif
  31. #ifdef HAVE_PARDISO
  32. #include <Eigen/PardisoSupport>
  33. #endif
  34. //#include "CSymSimplicialCholesky.h"
  35. namespace Lemma {
  36. /**
  37. \brief Templated concrete classes of EMSChur3DBase.
  38. \details
  39. */
  40. template < class Solver >
  41. class EMSchur3D : public EMSchur3DBase {
  42. friend std::ostream &operator << (std::ostream &stream, const EMSchur3D &ob) {
  43. stream << ob.Serialize() << "\n"; // End of doc
  44. return stream;
  45. }
  46. //friend std::ostream &operator<<(std::ostream &stream,
  47. // const EMSchur3D &ob);
  48. public:
  49. // ==================== LIFECYCLE =======================
  50. /**
  51. * @copybrief LemmaObject::New()
  52. * @copydetails LemmaObject::New()
  53. */
  54. static std::shared_ptr< EMSchur3D > NewSP() {
  55. return std::make_shared< EMSchur3D<Solver> >( ctor_key() );
  56. }
  57. /** Default protected constructor, use New */
  58. explicit EMSchur3D ( const ctor_key& key ) : EMSchur3DBase( key ), CSolver( nullptr ) {
  59. }
  60. /** Locked DeDerializing constructor, use factory DeSerialize method*/
  61. EMSchur3D (const YAML::Node& node, const ctor_key& key): EMSchur3DBase(node, key), CSolver( nullptr ) {
  62. }
  63. /** Default protected destructor, use Delete */
  64. virtual ~EMSchur3D () {
  65. // TODO delete arrays
  66. }
  67. /**
  68. * Uses YAML to serialize this object.
  69. * @return a YAML::Node
  70. */
  71. YAML::Node Serialize() const {
  72. YAML::Node node = EMSchur3DBase::Serialize();
  73. //node["NumberOfLayers"] = NumberOfLayers;
  74. node.SetTag( this->GetName() );
  75. return node;
  76. }
  77. /**
  78. * Constructs an object from a YAML::Node.
  79. */
  80. static EMSchur3D* DeSerialize(const YAML::Node& node);
  81. // ==================== OPERATORS =======================
  82. // ==================== OPERATIONS =======================
  83. /** Solves a single source problem. This method is thread safe.
  84. * @param[in] Source is the source term for generating primary fields
  85. * @param[in] isource is the source index
  86. */
  87. void SolveSource( std::shared_ptr<DipoleSource> Source , const int& isource);
  88. /** Builds the solver for the C matrix */
  89. void BuildCDirectSolver( );
  90. // ==================== ACCESS =======================
  91. virtual std::string GetName() const {
  92. return this->CName;
  93. }
  94. // ==================== INQUIRY =======================
  95. protected:
  96. // ==================== LIFECYCLE =======================
  97. private:
  98. /** Copy constructor */
  99. EMSchur3D( const EMSchur3D& ) = delete;
  100. // ==================== DATA MEMBERS =========================
  101. /** The templated solver for C */
  102. Solver* CSolver;
  103. Eigen::SparseMatrix<Complex> Csym;
  104. static constexpr auto CName = "EMSchur3D";
  105. }; // ----- end of class EMSchur3D -----
  106. ////////////////////////////////////////////////////////////////////////////////////////
  107. // Implimentation and Specialisations //
  108. ////////////////////////////////////////////////////////////////////////////////////////
  109. //--------------------------------------------------------------------------------------
  110. // Class: EMSchur3D
  111. // Method: SolveSource
  112. //--------------------------------------------------------------------------------------
  113. template < class Solver >
  114. void EMSchur3D<Solver>::SolveSource ( std::shared_ptr<DipoleSource> Source, const int& isource ) {
  115. std::cout << "In vanilla SolveSource" << std::endl;
  116. // figure out which omega we are working with
  117. int iw = -1;
  118. for (int iiw=0; iiw<Omegas.size(); ++iiw) {
  119. if (Omegas[iiw] - Source->GetAngularFrequency(0) < 1e-3 ) {
  120. iw = iiw;
  121. }
  122. }
  123. if (iw == -1) {
  124. std::cerr << "FREQUENCY DOOM IN EMSchur3D::SolveSource \n";
  125. exit(EXIT_FAILURE);
  126. }
  127. ///////////////////////////////////
  128. // Set up primary fields
  129. // TODO, this is a little stupid as they all share the same points. We need to extend
  130. // EmEARTH to be able to input a grid so that points are not explicitly needed like
  131. // this. This requires some care as calcs are made on faces.
  132. // Alternatively, the bins function of ReceiverPoints could be extended quite easily.
  133. // This may be the way to do this.
  134. //Lemma::ReceiverPoints* dpoint = Lemma::ReceiverPoints::New();
  135. std::shared_ptr< FieldPoints > dpoint = FieldPoints::NewSP();
  136. FillPoints(dpoint);
  137. PrimaryField(Source, dpoint);
  138. std::cout << "Done with primary field" << std::endl;
  139. // Allocate a ton of memory
  140. VectorXcr Phi = VectorXcr::Zero(uns);
  141. VectorXcr ms(unx+uny+unz); // mu sigma
  142. // Vector potential (A) Vector and phi
  143. VectorXcr Se = VectorXcr::Zero(unx+uny+unz);
  144. //VectorXcr A = VectorXcr::Zero(unx+uny+unz);
  145. VectorXcr E = VectorXcr::Zero(unx+uny+unz);
  146. VectorXcr E0 = VectorXcr::Zero(unx+uny+unz);
  147. // Lets get cracking
  148. std::cout << "Filling source terms" << std::endl;
  149. FillSourceTerms(ms, Se, E0, dpoint, Omegas[iw]);
  150. std::cout << "Done source terms" << std::endl;
  151. /////////////////////////////////////////////////
  152. // LOG File
  153. std::string logfile (ResFile);
  154. logfile += to_string(isource) + std::string(".log");
  155. ofstream logio(logfile.c_str());
  156. std::cout << "just logging, TODO fix source" << std::endl;
  157. // logio << *Source << std::endl;
  158. logio << *Grid << std::endl;
  159. logio << *LayModel << std::endl;
  160. std::cout << "dun logging" << std::endl;
  161. // solve for RHS
  162. int max_it(nx*ny*nz), iter_done(0);
  163. Real tol(3e-16), errorn(0);
  164. logio << "solving RHS for source " << isource << std::endl;
  165. // TODO, this is stupid, try and get rid of this copy!
  166. //Eigen::SparseMatrix<Complex> Cc = Cvec[iw];
  167. jsw_timer timer;
  168. jsw_timer timer2;
  169. timer.begin();
  170. timer2.begin();
  171. /////////////////////////////////////////
  172. // Solve for RHS
  173. //CSolver[iw].setMaxIterations(750);
  174. VectorXcr A = CSolver[iw].solve(Se);
  175. // // Solve Real system instead
  176. // The Real system is quasi-definite, though an LDLT decomposition exists, CHOLMOD doesn't find it.
  177. // An LU can be done on this, but compute performance is very similiar to the complex system, and diagonal pivoting
  178. // cannot be assumed to be best, hurting solve time.
  179. // /* EXPERIMENTAL */
  180. // VectorXr b2 = VectorXr::Zero(2*(unx+uny+unz));
  181. // b2.head(unx+uny+unz) = Se.real();
  182. // b2.tail(unx+uny+unz) = Se.imag();
  183. // VectorXr A2 = CReSolver[iw].solve(b2);
  184. // A.real() = A2.head( unx+uny+unz );
  185. // A.imag() = -A2.tail( unx+uny+unz ); // Due to decomp. negative!
  186. // /* END EXPERIMENTAL */
  187. VectorXcr ADiv = D*A; // ADiv == RHS == D C^I Se
  188. //VectorXcr Error = ((Cc.selfadjointView<Eigen::Lower>()*A).array() - Se.array());
  189. VectorXcr Error = ((Cvec[iw]*A).array() - Se.array());
  190. /*
  191. #if LOWER==1
  192. std::cout << "Using Eigen::Lower to calculate Error" << std::endl;
  193. VectorXcr Error = ((Cvec[iw].selfadjointView<Eigen::Lower>()*A).array() - Se.array());
  194. #elif UPPER==1
  195. std::cout << "Using Eigen::Upper to calculate Error" << std::endl;
  196. VectorXcr Error = ((Cvec[iw].selfadjointView<Eigen::Upper>()*A).array() - Se.array());
  197. #endif
  198. */
  199. logio << "|| Div(A) || = " << ADiv.norm()
  200. << "\tInital solution error="<< Error.norm() // Iteritive info
  201. // << "\tSolver reported error="<< CSolver[iw].error() // Iteritive info
  202. << "\ttime " << timer.end() / 60. << " [m] "
  203. // << CSolver[iw].iterations() << " iterations"
  204. << std::endl;
  205. //VectorXcr ADivMAC = ADiv.array() * MAC.array().cast<Complex>();
  206. //logio << "|| Div(A) || on MAC grid " << ADivMAC.norm() << std::endl;
  207. /////////////////////
  208. // Solve for Phi
  209. logio << "Solving for Phi " << std::flush;
  210. timer.begin();
  211. tol = 1e-30;
  212. int success(2);
  213. success = implicitbicgstab(D, idx, ms, ADiv, Phi, CSolver[iw], max_it, tol, errorn, iter_done, logio);
  214. //Phi.array() *= MAC.array().cast<Complex>(); // remove phi from air regions
  215. /* Restart if necessary */
  216. int nrestart(1);
  217. // TODO send MAC to implicitbicgstab?
  218. while (success == 2 && nrestart < 18 && iter_done > 1) {
  219. success = implicitbicgstab(D, idx, ms, ADiv, Phi, CSolver[iw], max_it, tol, errorn, iter_done, logio);
  220. //Phi.array() *= MAC.array().cast<Complex>(); // remove phi from air regions
  221. nrestart += 1;
  222. }
  223. logio << "Implicit BiCGStab solution in " << iter_done << " iterations."
  224. << " with error " << std::setprecision(8) << std::scientific << errorn << std::endl;
  225. logio << "time "<< timer.end()/60. << " [m]" << std::endl;
  226. E = ms.array()*(D.transpose()*Phi).array(); // Temp, field due to charge
  227. /////////////////////////////////////
  228. // Compute A
  229. /////////////////////////////////////
  230. logio << "Solving for A using phi" << std::endl;
  231. std::cout << "Solving for A" << std::endl;
  232. max_it = nx*ny*nz;
  233. tol = 5e-16;
  234. errorn = 0;
  235. iter_done = 0;
  236. timer.begin();
  237. A = CSolver[iw].solve( (Se-E).eval() ); // UmfPack requires eval?
  238. VectorXcr ADiv2 = D*A;
  239. //logio << "|| Div(A) || = " << ADiv2.norm() ;
  240. //" in " << iter_done << " iterations"
  241. //<< " with error " << errorn << "\t";
  242. // Report error of solutions
  243. //Error = ((Cc.selfadjointView<Eigen::Lower>()*A).array() + E.array() - Se.array());
  244. /*
  245. #if LOWER==1
  246. std::cout << "Using Eigen::Lower to calculate Error" << std::endl;
  247. Error = ((Cvec[iw].selfadjointView<Eigen::Lower>()*A).array() + E.array() - Se.array());
  248. #elif UPPER==1
  249. std::cout << "Using Eigen::Upper to calculate Error" << std::endl;
  250. Error = ((Cvec[iw].selfadjointView<Eigen::Upper>()*A).array() + E.array() - Se.array());
  251. #endif
  252. */
  253. Error = ((Cvec[iw]*A).array() + E.array() - Se.array());
  254. // << "\tSolver reported error="<< CSolver[iw].error() // Iteritive info
  255. // << "\ttime " << timer.end() / 60. << " [m] "
  256. // << CSolver[iw].iterations() << " iterations"
  257. logio << "|| Div(A) || = " << ADiv2.norm()
  258. << "\tSolution error="<< Error.norm() // Iteritive info
  259. // << "\tSolver reported error="<< CSolver[iw].error() // Iteritive info
  260. << "\ttime " << timer.end() / 60. << " [m] "
  261. // << CSolver[iw].iterations() << " iterations"
  262. << std::endl << std::endl;
  263. logio << std::fixed << std::setprecision(2) << "\ttime " << timer.end()/60. << "\ttotal time " << timer2.end()/60. << std::endl;
  264. logio.close();
  265. //////////////////////////////////////
  266. // Update Fields and report
  267. E.array() = Complex(0,-Omegas[iw])*A.array() - (D.transpose()*Phi).array(); // Secondary Field Only
  268. VectorXcr B = StaggeredGridCurl(A);
  269. WriteVTKResults( ResFile+ to_string(isource), A, Se, E0, E , Phi, ADiv, ADiv2, B);
  270. //dpoint->Delete();
  271. return ;
  272. } // ----- end of method EMSchur3D::SolveSource -----
  273. //--------------------------------------------------------------------------------------
  274. // Class: EMSchur3DBase
  275. // Method: BuildCDirectSolver
  276. //--------------------------------------------------------------------------------------
  277. template < class Solver >
  278. void EMSchur3D<Solver>::BuildCDirectSolver ( ) {
  279. CSolver = new Solver[Omegas.size()];
  280. for (int iw=0; iw<Omegas.size(); ++iw) {
  281. jsw_timer timer;
  282. timer.begin();
  283. /* Complex system */
  284. /*
  285. std::cout << "Generic solver pattern analyzing C_" << iw << ",";
  286. std::cout.flush();
  287. CSolver[iw].analyzePattern( Cvec[iw].selfadjointView< Eigen::Lower>() );
  288. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  289. // factorize
  290. timer.begin();
  291. std::cout << "Generic solver factorising C_" << iw << ", ";
  292. std::cout.flush();
  293. CSolver[iw].factorize( Cvec[iw].selfadjointView< Eigen::Lower>() );
  294. */
  295. std::cerr << "No solver Specified!" << iw << ",";
  296. exit(EXIT_FAILURE);
  297. //CSolver[iw].compute( Cvec[iw].selfadjointView< Eigen::Lower>() );
  298. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  299. }
  300. }
  301. #ifdef HAVE_SUPERLU
  302. template<>
  303. void EMSchur3D< Eigen::SuperLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor> > >::BuildCDirectSolver() {
  304. CSolver = new Eigen::SuperLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor> > [Omegas.size()];
  305. for (int iw=0; iw<Omegas.size(); ++iw) {
  306. jsw_timer timer;
  307. timer.begin();
  308. /* SuperLU */
  309. // Recommended values for symmetric mode
  310. CSolver[iw].options().DiagPivotThresh = 0.01;
  311. CSolver[iw].options().SymmetricMode = YES;
  312. CSolver[iw].options().ColPerm = MMD_AT_PLUS_A;
  313. //CSolver[iw].options().Trans = NOTRANS;
  314. //CSolver[iw].options().ConditionNumber = NO;
  315. //std::cout << "SuperLU options:\n";
  316. //std::cout << "\tPivot Threshold: " << CSolver[iw].options().DiagPivotThresh << std::endl;
  317. //std::cout << "\tSymmetric mode: " << CSolver[iw].options().SymmetricMode << std::endl;
  318. //std::cout << "\tEquilibrate: " << CSolver[iw].options().Equil << std::endl;
  319. //std::cout << "\tCol Permutation: " << CSolver[iw].options().ColPerm << std::endl;
  320. //std::cout << "\tTrans: " << CSolver[iw].options().Trans << std::endl;
  321. //std::cout << "\tCondition Number: " << CSolver[iw].options().ConditionNumber << std::endl;
  322. /* Complex system */
  323. std::cout << "SuperLU pattern analyzing C_" << iw << ",";
  324. std::cout.flush();
  325. CSolver[iw].analyzePattern( Cvec[iw].selfadjointView< Eigen::Lower>() );
  326. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  327. // factorize
  328. timer.begin();
  329. std::cout << "SuperLU factorising C_" << iw << ", ";
  330. std::cout.flush();
  331. CSolver[iw].factorize( Cvec[iw].selfadjointView< Eigen::Lower>() );
  332. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  333. }
  334. }
  335. #endif
  336. template<>
  337. void EMSchur3D< Eigen::SparseLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::COLAMDOrdering<int> > >::BuildCDirectSolver() {
  338. CSolver = new Eigen::SparseLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::COLAMDOrdering<int> > [Omegas.size()];
  339. for (int iw=0; iw<Omegas.size(); ++iw) {
  340. jsw_timer timer;
  341. timer.begin();
  342. //CSolver[iw].isSymmetric(true);
  343. //CSolver[iw].setPivotThreshold(0.0); // OK for symmetric complex systems with real and imaginary positive definite parts.
  344. // // but our imaginary part is negative definite
  345. //http://www.ams.org/journals/mcom/1998-67-224/S0025-5718-98-00978-8/S0025-5718-98-00978-8.pdf
  346. /* Complex system */
  347. std::cout << "SparseLU pattern analyzing C_" << iw << ",";
  348. std::cout.flush();
  349. //CSolver[iw].analyzePattern( Cvec[iw].selfadjointView< Eigen::Lower>() );
  350. CSolver[iw].analyzePattern( Cvec[iw] );
  351. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  352. // factorize
  353. timer.begin();
  354. std::cout << "SparseLU factorising C_" << iw << ", ";
  355. std::cout.flush();
  356. //CSolver[iw].factorize( Cvec[iw].selfadjointView< Eigen::Lower>() );
  357. CSolver[iw].factorize( Cvec[iw] ); //.selfadjointView< Eigen::Lower>() );
  358. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  359. }
  360. }
  361. #ifdef HAVE_PARDISO
  362. template<>
  363. void EMSchur3D< Eigen::PardisoLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor> > >::BuildCDirectSolver() {
  364. CSolver = new Eigen::PardisoLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor> > [Omegas.size()];
  365. for (int iw=0; iw<Omegas.size(); ++iw) {
  366. jsw_timer timer;
  367. timer.begin();
  368. //CSolver[iw].pardisoParameterArray()[2] = 28; // OMP_NUM_THREADS?
  369. /* Complex system */
  370. std::cout << "PardisoLU pattern analyzing C_" << iw << ",";
  371. std::cout.flush();
  372. CSolver[iw].analyzePattern( Cvec[iw].selfadjointView< Eigen::Lower>() );
  373. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  374. // factorize
  375. timer.begin();
  376. std::cout << "PardisoLU factorising C_" << iw << ", ";
  377. std::cout.flush();
  378. CSolver[iw].factorize( Cvec[iw].selfadjointView< Eigen::Lower>() );
  379. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  380. }
  381. }
  382. template<>
  383. void EMSchur3D< Eigen::PardisoLDLT<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Symmetric > >::BuildCDirectSolver() {
  384. CSolver = new Eigen::PardisoLDLT<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Symmetric > [Omegas.size()];
  385. for (int iw=0; iw<Omegas.size(); ++iw) {
  386. jsw_timer timer;
  387. timer.begin();
  388. //CSolver[iw].pardisoParameterArray()[2] = 28; // OMP_NUM_THREADS?
  389. //Eigen::SparseMatrix<Complex> Csym = Cvec[iw].selfadjointView< Eigen::Lower >();
  390. /* Complex system */
  391. std::cout << "PardisoLDLT pattern analyzing C_" << iw << ",";
  392. std::cout.flush();
  393. //CSolver[iw].analyzePattern( Cvec[iw].selfadjointView< Eigen::Lower>() );
  394. CSolver[iw].analyzePattern( Cvec[iw] );
  395. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  396. // factorize
  397. timer.begin();
  398. std::cout << "PardisoLDLT factorising C_" << iw << ", ";
  399. std::cout.flush();
  400. //CSolver[iw].factorize( Cvec[iw].selfadjointView< Eigen::Lower>() );
  401. CSolver[iw].factorize( Cvec[iw] );
  402. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  403. }
  404. }
  405. #endif
  406. #ifdef HAVE_UMFPACK
  407. // Umfpack only seems to work when LOWER and UPPER are set to 1. Workarounds this have not been found.
  408. template<>
  409. void EMSchur3D< Eigen::UmfPackLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor> > >::BuildCDirectSolver() {
  410. CSolver = new Eigen::UmfPackLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor> > [Omegas.size()];
  411. for (int iw=0; iw<Omegas.size(); ++iw) {
  412. jsw_timer timer;
  413. timer.begin();
  414. /* Complex system */
  415. std::cout << "UmfPackLU pattern analyzing C_" << iw << ",";
  416. std::cout.flush();
  417. // Doesn't work, seg faults in solve
  418. //Eigen::SparseMatrix<Complex> Csym = Cvec[iw].selfadjointView< Eigen::Lower >();
  419. // Compiler errors get thrown with the view setting, good performance if LOWER and UPPER are set
  420. // CSolver[iw].analyzePattern( Cvec[iw].selfadjointView< Eigen::Lower>() ); // Compiler error
  421. CSolver[iw].analyzePattern( Cvec[iw] ); // requires LOWER=1 UPPER=1, double memory
  422. // CSolver[iw].analyzePattern( Csym ); // seg faults
  423. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  424. // factorize
  425. timer.begin();
  426. std::cout << "UmfPackLU factorising C_" << iw << ", ";
  427. std::cout.flush();
  428. // CSolver[iw].factorize( Cvec[iw].selfadjointView< Eigen::Lower>() );
  429. CSolver[iw].factorize( Cvec[iw] );
  430. // CSolver[iw].factorize( Csym );
  431. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  432. }
  433. }
  434. #endif
  435. // template<>
  436. // void EMSchur3D< Eigen::CholmodSupernodalLLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > > ::BuildCDirectSolver() {
  437. // CSolver = new Eigen::CholmodSupernodalLLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > [Omegas.size()];
  438. // for (int iw=0; iw<Omegas.size(); ++iw) {
  439. // Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  440. // jsw_timer timer;
  441. // timer.begin();
  442. // /* Complex system */
  443. // std::cout << "CholmodSupernodalLLT pattern analyzing C_" << iw << ",";
  444. // std::cout.flush();
  445. // CSolver[iw].analyzePattern( Csym );
  446. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  447. // /* factorize */
  448. // timer.begin();
  449. // std::cout << "CholmodSupernodalLLT factorising C_" << iw << ", ";
  450. // std::cout.flush();
  451. // CSolver[iw].factorize( Csym );
  452. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  453. // }
  454. // }
  455. // template<>
  456. // void EMSchur3D< Eigen::CSymSimplicialLLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::NaturalOrdering<int> > > ::BuildCDirectSolver() {
  457. // CSolver = new Eigen::CSymSimplicialLLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::NaturalOrdering<int> > [Omegas.size()];
  458. // for (int iw=0; iw<Omegas.size(); ++iw) {
  459. // Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  460. // jsw_timer timer;
  461. // timer.begin();
  462. // /* Complex system */
  463. // std::cout << "CSymSimplicialLLT<NaturalOrdering> pattern analyzing C_" << iw << ",";
  464. // std::cout.flush();
  465. // CSolver[iw].analyzePattern( Csym );
  466. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  467. // /* factorize */
  468. // timer.begin();
  469. // std::cout << "CSymSimplicialLLT<NaturalOrdering> factorising C_" << iw << ", ";
  470. // std::cout.flush();
  471. // CSolver[iw].factorize( Csym );
  472. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  473. // }
  474. // }
  475. //
  476. // template<>
  477. // void EMSchur3D< Eigen::CSymSimplicialLLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::AMDOrdering<int> > > ::BuildCDirectSolver() {
  478. // CSolver = new Eigen::CSymSimplicialLLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::AMDOrdering<int> > [Omegas.size()];
  479. // for (int iw=0; iw<Omegas.size(); ++iw) {
  480. // //Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  481. // jsw_timer timer;
  482. // timer.begin();
  483. // /* Complex system */
  484. // std::cout << "CSymSimplicialLLT<AMDOrdering> pattern analyzing C_" << iw << ",";
  485. // std::cout.flush();
  486. // CSolver[iw].analyzePattern( Cvec[iw] );
  487. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  488. // /* factorize */
  489. // timer.begin();
  490. // std::cout << "CSymSimplicialLLT<AMDOrdering> factorising C_" << iw << ", ";
  491. // std::cout.flush();
  492. // CSolver[iw].factorize( Cvec[iw] );
  493. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  494. // }
  495. // }
  496. //
  497. // template<>
  498. // void EMSchur3D< Eigen::CSymSimplicialLDLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::AMDOrdering<int> > > ::BuildCDirectSolver() {
  499. // CSolver = new Eigen::CSymSimplicialLDLT< Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::AMDOrdering<int> > [Omegas.size()];
  500. // for (int iw=0; iw<Omegas.size(); ++iw) {
  501. // Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  502. // jsw_timer timer;
  503. // timer.begin();
  504. // /* Complex system */
  505. // std::cout << "CSymSimplicialLDLT<AMDOrdering> pattern analyzing C_" << iw << ",";
  506. // std::cout.flush();
  507. // CSolver[iw].analyzePattern( Csym );
  508. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  509. // /* factorize */
  510. // timer.begin();
  511. // std::cout << "CSymSimplicialLDLT<AMDOrdering> factorising C_" << iw << ", ";
  512. // std::cout.flush();
  513. // CSolver[iw].factorize( Csym );
  514. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  515. // }
  516. // }
  517. template<>
  518. void EMSchur3D< Eigen::BiCGSTAB<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::IncompleteLUT<Complex> > > ::BuildCDirectSolver() {
  519. CSolver = new Eigen::BiCGSTAB<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::IncompleteLUT<Complex> > [Omegas.size()];
  520. for (int iw=0; iw<Omegas.size(); ++iw) {
  521. Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  522. CSolver[iw].preconditioner().setDroptol(1e-6); //1e-5); // 1e-12
  523. CSolver[iw].preconditioner().setFillfactor(5e1); // 1e2
  524. jsw_timer timer;
  525. timer.begin();
  526. /* Complex system */
  527. std::cout << "BiCGSTAB(ILU) pattern analyzing C_" << iw << ",";
  528. std::cout.flush();
  529. CSolver[iw].analyzePattern( Csym );
  530. //CSolver[iw].analyzePattern( Cvec[iw]);
  531. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  532. /* factorize */
  533. timer.begin();
  534. std::cout << "BiCGSTAB(ILU) factorising C_" << iw << ", ";
  535. std::cout.flush();
  536. CSolver[iw].factorize( Csym );
  537. //CSolver[iw].factorize( Cvec[iw] );
  538. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  539. }
  540. }
  541. template<>
  542. void EMSchur3D< Eigen::BiCGSTAB< Eigen::SparseMatrix<Complex, Eigen::ColMajor> > > ::BuildCDirectSolver() {
  543. CSolver = new Eigen::BiCGSTAB< Eigen::SparseMatrix<Complex, Eigen::ColMajor> > [Omegas.size()];
  544. for (int iw=0; iw<Omegas.size(); ++iw) {
  545. Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  546. jsw_timer timer;
  547. timer.begin();
  548. /* Complex system */
  549. std::cout << "BiCGSTAB pattern analyzing C_" << iw << ",";
  550. std::cout.flush();
  551. CSolver[iw].analyzePattern( Csym );
  552. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  553. // factorize
  554. timer.begin();
  555. std::cout << "BiCGSTAB factorising C_" << iw << ", ";
  556. std::cout.flush();
  557. CSolver[iw].factorize( Csym );
  558. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  559. }
  560. }
  561. template<>
  562. void EMSchur3D< Eigen::LeastSquaresConjugateGradient< Eigen::SparseMatrix<Complex, Eigen::ColMajor> > > ::BuildCDirectSolver() {
  563. CSolver = new Eigen::LeastSquaresConjugateGradient< Eigen::SparseMatrix<Complex, Eigen::ColMajor> > [Omegas.size()];
  564. for (int iw=0; iw<Omegas.size(); ++iw) {
  565. Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  566. jsw_timer timer;
  567. timer.begin();
  568. /* Complex system */
  569. std::cout << "LeastSquaresConjugateGradient pattern analyzing C_" << iw << ",";
  570. std::cout.flush();
  571. CSolver[iw].analyzePattern( Csym );
  572. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  573. // factorize
  574. timer.begin();
  575. std::cout << "LeastSquaresConjugateGradient factorising C_" << iw << ", ";
  576. std::cout.flush();
  577. CSolver[iw].factorize( Csym );
  578. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  579. }
  580. }
  581. template<>
  582. void EMSchur3D< Eigen::ConjugateGradient<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > > ::BuildCDirectSolver() {
  583. CSolver = new Eigen::ConjugateGradient<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > [Omegas.size()];
  584. for (int iw=0; iw<Omegas.size(); ++iw) {
  585. //Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  586. jsw_timer timer;
  587. timer.begin();
  588. /* Complex system */
  589. std::cout << "ConjugateGradient pattern analyzing C_" << iw << ",";
  590. std::cout.flush();
  591. CSolver[iw].analyzePattern( Cvec[iw] );
  592. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  593. // factorize
  594. timer.begin();
  595. std::cout << "ConjugateGradient factorising C_" << iw << ", ";
  596. std::cout.flush();
  597. CSolver[iw].factorize( Cvec[iw] );
  598. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  599. }
  600. }
  601. template<>
  602. void EMSchur3D< Eigen::ConjugateGradient<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::IncompleteCholesky<Complex> > > ::BuildCDirectSolver() {
  603. CSolver = new Eigen::ConjugateGradient<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower, Eigen::IncompleteCholesky<Complex> > [Omegas.size()];
  604. for (int iw=0; iw<Omegas.size(); ++iw) {
  605. //Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  606. jsw_timer timer;
  607. timer.begin();
  608. /* Complex system */
  609. std::cout << "ConjugateGradient<IncompleteCholesky> pattern analyzing C_" << iw << ",";
  610. std::cout.flush();
  611. CSolver[iw].analyzePattern( Cvec[iw] );
  612. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  613. // factorize
  614. timer.begin();
  615. std::cout << "ConjugateGradient<IncompleteCholesky> factorising C_" << iw << ", ";
  616. std::cout.flush();
  617. CSolver[iw].factorize( Cvec[iw] );
  618. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  619. }
  620. }
  621. // template<>
  622. // void EMSchur3D< Eigen::PastixLLT<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > > ::BuildCDirectSolver() {
  623. // CSolver = new Eigen::PastixLLT<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > [Omegas.size()];
  624. // //MPI_Init(NULL, NULL);
  625. // for (int iw=0; iw<Omegas.size(); ++iw) {
  626. // //Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  627. // jsw_timer timer;
  628. // timer.begin();
  629. // /* Complex system */
  630. // std::cout << "PaStiX LLT pattern analyzing C_" << iw << ",";
  631. // std::cout.flush();
  632. // CSolver[iw].analyzePattern( Cvec[iw] );
  633. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  634. // // factorize
  635. // timer.begin();
  636. // std::cout << "PaStiX LLT factorising C_" << iw << ", ";
  637. // std::cout.flush();
  638. // CSolver[iw].factorize( Cvec[iw] );
  639. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  640. // }
  641. // }
  642. //
  643. // template<>
  644. // void EMSchur3D< Eigen::PastixLDLT<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > > ::BuildCDirectSolver() {
  645. // CSolver = new Eigen::PastixLDLT<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, Eigen::Lower > [Omegas.size()];
  646. // //MPI_Init(NULL, NULL);
  647. // for (int iw=0; iw<Omegas.size(); ++iw) {
  648. // //Csym = Cvec[iw].selfadjointView<Eigen::Lower>();
  649. // jsw_timer timer;
  650. // timer.begin();
  651. // /* Complex system */
  652. // std::cout << "PaStiX LDLT pattern analyzing C_" << iw << ",";
  653. // std::cout.flush();
  654. // CSolver[iw].analyzePattern( Cvec[iw] );
  655. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  656. // // factorize
  657. // timer.begin();
  658. // std::cout << "PaStiX LDLT factorising C_" << iw << ", ";
  659. // std::cout.flush();
  660. // CSolver[iw].factorize( Cvec[iw] );
  661. // std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  662. // std::cout << "INFO " << CSolver[iw].info( ) << std::endl;
  663. // }
  664. // }
  665. //
  666. #ifdef HAVE_PASTIX
  667. template<>
  668. void EMSchur3D< Eigen::PastixLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, true > > ::BuildCDirectSolver() {
  669. CSolver = new Eigen::PastixLU<Eigen::SparseMatrix<Complex, Eigen::ColMajor>, true > [Omegas.size()];
  670. for (int iw=0; iw<Omegas.size(); ++iw) {
  671. jsw_timer timer;
  672. timer.begin();
  673. /* Complex system */
  674. std::cout << "PastixLU pattern analyzing C_" << iw << ",";
  675. std::cout.flush();
  676. CSolver[iw].analyzePattern( Cvec[iw].selfadjointView< Eigen::Lower>() );
  677. //CSolver[iw].analyzePattern( Cvec[iw] );
  678. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  679. // factorize
  680. timer.begin();
  681. std::cout << "PastixLU factorising C_" << iw << ", ";
  682. std::cout.flush();
  683. CSolver[iw].factorize( Cvec[iw].selfadjointView< Eigen::Lower>() );
  684. //CSolver[iw].factorize( Cvec[iw] );
  685. std::cout << " done in " << timer.end() / 60. << " [m]" << std::endl;
  686. }
  687. }
  688. #endif
  689. } // ----- end of Lemma name -----
  690. #endif // ----- #ifndef EMSCHUR3D_INC -----