3D EM based on Schur decomposition
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

EMSchur3DBase.h 14KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442
  1. // ===========================================================================
  2. //
  3. // Filename: EMSchur3DBase.h
  4. //
  5. // Created: 09/20/2013 04:35:57 PM
  6. // Compiler: Tested with g++, icpc, and MSVC 2010
  7. //
  8. // Author: Trevor Irons (ti)
  9. //
  10. // Organisation: University of Utah,
  11. // Colorado School of Mines
  12. // US Geological Survey
  13. //
  14. // Email: Trevor.Irons@utah.edu
  15. //
  16. // ===========================================================================
  17. /**
  18. @file
  19. @author Trevor Irons
  20. @date 09/20/2013
  21. @version $Id$
  22. **/
  23. #pragma once
  24. #ifndef EMSCHUR3DBASE_INC
  25. #define EMSCHUR3DBASE_INC
  26. #include <LemmaCore>
  27. #include "EMSchur3DConfig.h"
  28. #include <FDEM1D>
  29. //#include "LemmaObject.h"
  30. //#include "rectilineargrid.h"
  31. //#include "RectilinearGridVTKExporter.h"
  32. //#include "ASCIIParser.h"
  33. //#include "AEMSurvey.h"
  34. //#include "receiverpoints.h"
  35. //#include "layeredearthem.h"
  36. //#include "emearth1d.h"
  37. #include "timer.h"
  38. #include <Eigen/Sparse>
  39. //#include "bicgstab.h"
  40. // Solvers
  41. #ifdef HAVE_PASTIX
  42. #include <Eigen/PaStiXSupport>
  43. #endif
  44. #ifdef HAVE_METIS
  45. #include <Eigen/MetisSupport>
  46. #endif
  47. #ifdef HAVE_SUPERLU
  48. #include <Eigen/SuperLUSupport>
  49. #endif
  50. #ifdef HAVE_SUPERLUMT
  51. #include <Eigen/SuperLUMTSupport>
  52. #endif
  53. #ifdef HAVE_SPQR
  54. #include <Eigen/SPQRSupport>
  55. #endif
  56. // Cholmod Support won't compile typedef issue
  57. // #ifdef HAVE_CHOLMOD
  58. // #include <Eigen/CholmodSupport>
  59. // #endif
  60. //
  61. // // Cholmod Support won't compile
  62. // #ifdef HAVE_UMFPACK
  63. // #include <Eigen/UmfPackSupport>
  64. // #endif
  65. namespace Lemma {
  66. enum SOLVER{ SPARSELU, SimplicialLLT, SimplicialLDLT, BiCGStab, SparseQR };
  67. /**
  68. \ingroup EMSchur3D
  69. \brief Provides a 3D solution to Maxwell's equations.
  70. \details 3D finite difference solution to maxwells equations
  71. using a SCHUR decomposition on a staggered grid.
  72. Performs a Schur decomposition on the vector scalar formulation of
  73. Maxwell's equations.
  74. \f[
  75. -\nabla^2 (\mathbf{A}) - \jmath \omega \mu \sigma \mathbf{A} - \mu \sigma \nabla (\phi) = - \mu \mathbf{J}_s
  76. \f]
  77. Which can be written in the functional form
  78. \f[ \begin{pmatrix}
  79. -\nabla^2 + \jmath \omega \mu \sigma & \mu \sigma \nabla \\
  80. \nabla \cdot & 0
  81. \end{pmatrix}
  82. \begin{pmatrix} \mathbf{A} \\ \phi \end{pmatrix}
  83. = \begin{pmatrix} \mathbf{s}_E \\ 0 \end{pmatrix}
  84. \f]
  85. Using the notation
  86. \f[ \begin{pmatrix}
  87. \mathbf{C} & \mathbf{B} \\
  88. \mathbf{D} & \mathbf{0}
  89. \end{pmatrix} \begin{pmatrix} \mathbf{A} \\ \phi \end{pmatrix} =
  90. \begin{pmatrix} \mathbf{s}_E \\ 0 \end{pmatrix}
  91. \f]
  92. Which is decomposed for seperate solutions to \f$ \mathbf{A}, \phi \f$ using a Schur decomposition
  93. \f[ \begin{matrix}
  94. \mathbf{D}\mathbf{C}^{-1}\mathbf{B} \phi & = \mathbf{D} \mathbf{C}^{-1} \mathbf{s}_E \\
  95. \mathbf{C}\mathbf{A} & = \mathbf{s}_E - \mathbf{G} \phi
  96. \end{matrix}
  97. \f]
  98. Where \f$ \mathbf{B} = \mu \sigma \mathbf{D}^T \f$. Additional algorithmic details may be found at
  99. @verbatim
  100. @inproceedings{doi:10.1190/segam2012-0896.1,
  101. author = {Trevor Irons and Yaoguo Li and Jason R. McKenna},
  102. title = {3D frequency-domain electromagnetics modeling using decoupled scalar and vector potentials},
  103. booktitle = {SEG Technical Program Expanded Abstracts 2012},
  104. chapter = {112},
  105. year = {2012},
  106. pages = {1-6},
  107. doi = {10.1190/segam2012-0896.1},
  108. URL = {http://library.seg.org/doi/abs/10.1190/segam2012-0896.1},
  109. eprint = {http://library.seg.org/doi/pdf/10.1190/segam2012-0896.1}
  110. }
  111. @endverbatim
  112. */
  113. //template< class Solver >
  114. class EMSchur3DBase : public LemmaObject {
  115. friend std::ostream &operator<<(std::ostream &stream,
  116. const EMSchur3DBase &ob);
  117. protected:
  118. //template<typename U>
  119. //friend class EMSchur3D;
  120. public:
  121. // ==================== LIFECYCLE =======================
  122. /** Default protected constructor, use New */
  123. explicit EMSchur3DBase ( const ctor_key& );
  124. /** Default protected constructor, use New */
  125. explicit EMSchur3DBase ( const YAML::Node& node, const ctor_key& );
  126. /** Default protected destructor, use Delete */
  127. virtual ~EMSchur3DBase ( );
  128. /**
  129. * Initialises antenna to contain no points, with no current
  130. * and no frequency. NumberOfTurns set to 1
  131. */
  132. static std::shared_ptr<EMSchur3DBase> NewSP();
  133. /*
  134. * Provides deep copy
  135. */
  136. //virtual std::shared_ptr<EMSchur3DBase> Clone() const ;
  137. /**
  138. * Uses YAML to serialize this object.
  139. * @return a YAML::Node
  140. */
  141. YAML::Node Serialize() const;
  142. /**
  143. * Constructs an object from a YAML::Node.
  144. */
  145. static std::shared_ptr<EMSchur3DBase> DeSerialize( const YAML::Node& node );
  146. // ==================== OPERATORS =======================
  147. // ==================== OPERATIONS =======================
  148. /* Performs the solution
  149. * This is thread safe. TODO, but where should the results go? Just to file?
  150. * Who does the parsing? Actually I think this method is the wrong place to talk
  151. * about that. This is just a big red button. The details should be worked out in private
  152. * methods, that this could well call. Still though, where should the damn results go. What if
  153. * someone wants to use them *right now*, and not go through file IO. This is a good cause for
  154. * fixing the model class. So the result will be a final RectGrid (or Model) where the results live.
  155. * THEN users can call a seperate WriteToVTK or whatever based on that.
  156. */
  157. void Solve( );
  158. // ==================== ACCESS =======================
  159. /** Sets the RectilinearGrid to use
  160. * @param[in] Grid is a pointer to the Grid to be used.
  161. */
  162. void SetRectilinearGrid( std::shared_ptr<RectilinearGrid> Grid);
  163. /** Sets the RectilinearGrid to use
  164. * @param[in] Grid is a pointer to the Grid to be used.
  165. */
  166. void SetRectilinearGrid( vtkRectilinearGrid* vtkGrid );
  167. /** Sets the RectilinearGrid to use
  168. * @param[in] Grid is a pointer to the Grid to be used.
  169. */
  170. void SetAEMSurvey( std::shared_ptr<AEMSurvey> Survey);
  171. /** Sets the prefix for results files (.log and .vtr) the source fiducial is added as well
  172. */
  173. void SetResFileName(const std::string& filename);
  174. /** Sets the solver to use to invert the C matrix. This is done many times. If you are reusing the same matrix
  175. for numerous simulations, it may be benefitial to use the direct (SPARSELU) solver. For one off calculations the BiCGSTAB
  176. is a good choice. Default is SPARSELU.
  177. */
  178. void SetCSolver(const SOLVER& CSOLVER);
  179. /**
  180. * Sets the LayredEarthEM model that will be used for the primary field calculation as well as deterimining the
  181. * bacground conductivity file.
  182. @ @param[in] LayModel is a pointer to the LayeredEarthEM model to use.
  183. */
  184. void SetLayeredEarthEM( std::shared_ptr<LayeredEarthEM> LayModel );
  185. /**
  186. * Loads a MeshTools conductivity model.
  187. * @param[in] fname is the file to load.
  188. */
  189. void LoadMeshToolsConductivityModel( const std::string& fname );
  190. /**
  191. * Writes out results to into a vtkRectilinearGrid file
  192. * @param[in] fname is the file name that is created, the .vtr suffix is added.
  193. */
  194. void WriteVTKResults( const std::string& fname, Eigen::Ref<VectorXcr> A,
  195. Eigen::Ref<VectorXcr> Se, Eigen::Ref<VectorXcr> E0, Eigen::Ref<VectorXcr> E,
  196. Eigen::Ref<VectorXcr> Phi, Eigen::Ref<VectorXcr> ADiv, Eigen::Ref<VectorXcr> ADiv2,
  197. Eigen::Ref<VectorXcr> B
  198. );
  199. // ==================== INQUIRY =======================
  200. /** Returns the name of the underlying class, similiar to Python's type */
  201. virtual std::string GetName() const {
  202. return this->CName;
  203. }
  204. protected:
  205. // ==================== LIFECYCLE =======================
  206. //private:
  207. /** Builds the C matrix */
  208. void BuildC( Real*** sigmax, Real*** sigmay, Real*** sigmaz, const int& iw);
  209. /* Builds the C matrix as a block real system. Benefits of this are the availability of an
  210. * LDL^T decomposition. Also, as complex number in C++ are templates and will necessarily have
  211. * real and imaginary parts, this formulation will have a reduced cost, due to less computations
  212. * with the zero valued imaginary parts (off-diagonals)
  213. * The \f$C \in I^3\f$ matrix is instead written as
  214. * [ C_r C_i ] [ x_r ] = [ b_r ]
  215. * [ C_i -C_r ] [ x_i ] [ b_i ]
  216. */
  217. //void BuildCReal( Real*** sigmax, Real*** sigmay, Real*** sigmaz, const int& iw);
  218. /** Builds the C matrix */
  219. void BuildCPreconditioner( const int& iw);
  220. /** Builds the C matrix */
  221. virtual void BuildCDirectSolver( )=0;
  222. /** Fills the actual points on the grid that 1D primary field calculations need to be made.
  223. @todo This is a little stupid as all threads share the same points. Stupid in that right now
  224. this is done for every calculation. Not a huge amount of time is spent here, I suppose some extra memory
  225. though. We need to extend
  226. EmEARTH to be able to input a grid so that points are not explicitly needed like
  227. this. This requires some care as calcs are made on faces.
  228. Alternatively, the bins function of FieldPoints could be extended quite easily.
  229. This may be the way to do this.
  230. */
  231. void FillPoints( std::shared_ptr<FieldPoints> Points );
  232. /** Builds D/G
  233. */
  234. void BuildD( );
  235. /** Used to manage tradititional C 3D array */
  236. template <typename T>
  237. void Allocate3DScalar(T ***&Array, T init) {
  238. Array = new T**[nx];
  239. for (int ix=0; ix<nx; ix++){
  240. Array[ix] = new T*[ny];
  241. for (int iy=0; iy<ny; iy++){
  242. Array[ix][iy] = new T[nz];
  243. for (int iz=0; iz<nz; iz++) Array[ix][iy][iz] = init;
  244. }
  245. }
  246. return;
  247. }
  248. /** Used to manage tradititional C 3D array */
  249. template <typename T>
  250. void Delete3DScalar(T ***&Array) {
  251. for (int ix=0; ix<nx; ix++){
  252. for (int iy=0; iy<ny; iy++){
  253. delete [] Array[ix][iy];
  254. }
  255. delete [] Array[ix];
  256. }
  257. delete [] Array;
  258. Array = NULL;
  259. return;
  260. }
  261. /**
  262. * This is called just before solve and gets all shared objects ready to go
  263. */
  264. void Setup( );
  265. /** Solves a single source problem. This method is thread safe.
  266. * @param[in] Source is the source term for generating primary fields
  267. * @param[in] isource is the source index
  268. */
  269. virtual void SolveSource( std::shared_ptr< DipoleSource > Source , const int& isource)=0;
  270. /** Computes the primary field
  271. */
  272. void PrimaryField( std::shared_ptr<DipoleSource> Source, std::shared_ptr<FieldPoints> dpoint);
  273. /**
  274. * Fills the vectors that are called in
  275. */
  276. void FillSourceTerms( Eigen::Ref<VectorXcr> ms,
  277. Eigen::Ref<VectorXcr> Se, Eigen::Ref<VectorXcr> E0,
  278. std::shared_ptr<FieldPoints> dpoint, const Real& omega );
  279. /** Computes the curl of A on the staggered grid
  280. */
  281. VectorXcr StaggeredGridCurl(Eigen::Ref<VectorXcr> A);
  282. // ==================== DATA MEMBERS =========================
  283. /** Grid over which operators are active */
  284. std::shared_ptr<RectilinearGrid> Grid;
  285. /* Used to help dump results */
  286. //std::shared_ptr<RectilinearGridVTKExporter> VTKGridExporter;
  287. /** Class containing information about the AEM survey */
  288. std::shared_ptr<AEMSurvey> Survey;
  289. std::shared_ptr<LayeredEarthEM> LayModel;
  290. /** Matrix objects representing discrete operators
  291. */
  292. Eigen::SparseMatrix<Complex, Eigen::RowMajor>* Cvec;
  293. Eigen::SparseMatrix<Complex, Eigen::RowMajor> D;
  294. /** Squeezed matrices for reduced phi grid
  295. */
  296. Eigen::SparseMatrix<Complex, Eigen::RowMajor>* Cvec_s;
  297. Eigen::SparseMatrix<Complex, Eigen::RowMajor> D_s;
  298. /** number of cells in x, set when RectilinearGrid is attached */
  299. int nx;
  300. /** number of cells in y, set when RectilinearGrid is attached */
  301. int ny;
  302. /** number of cells in z, set when RectilinearGrid is attached */
  303. int nz;
  304. /** number of fields/faces in x, unwrapped x */
  305. int unx;
  306. /** number of fields/faces in y, unwrapped y */
  307. int uny;
  308. /** number of fields/faces in z, unwrapped z */
  309. int unz;
  310. /** number of cell centres, unwrapped scalars */
  311. int uns;
  312. /** name for log files and VTK files */
  313. std::string ResFile;
  314. /** frequency of source */
  315. VectorXr Omegas;
  316. /** Conductivity model */
  317. //Complex ***sigma_jwe;
  318. Real ***sigma;
  319. /** Conductivity model minus reference model */
  320. //Complex ***sigmap;
  321. Real ***sigmap;
  322. /** rectilinear grid spacing in x */
  323. VectorXr hx;
  324. /** rectilinear grid spacing in y */
  325. VectorXr hy;
  326. /** rectilinear grid spacing in z */
  327. VectorXr hz;
  328. /** inverse of hx */
  329. VectorXr ihx;
  330. /** inverse of hx squared */
  331. VectorXr ihx2;
  332. /** inverse of hy */
  333. VectorXr ihy;
  334. /** inverse of hy squared */
  335. VectorXr ihy2;
  336. /** inverse of hz */
  337. VectorXr ihz;
  338. /** inverse of hz squared */
  339. VectorXr ihz2;
  340. /** Marker for air cells */
  341. VectorXi MAC;
  342. /** Marker for air cells */
  343. std::vector<int> idx;
  344. private:
  345. static constexpr auto CName = "EMSchur3DBase";
  346. }; // ----- end of class EMSchur3DBase -----
  347. }
  348. #endif // ----- #ifndef EMSCHUR3BASE_INC -----