ngsolve 6.2.2501.post16.dev1__cp313-cp313-macosx_10_15_universal2.whl → 6.2.2501.post34.dev1__cp313-cp313-macosx_10_15_universal2.whl

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.


This version of ngsolve might be problematic. Click here for more details.

Files changed (286) hide show
  1. ngsolve/webgui.py +1 -1
  2. {ngsolve-6.2.2501.post16.dev1.dist-info → ngsolve-6.2.2501.post34.dev1.dist-info}/METADATA +2 -2
  3. ngsolve-6.2.2501.post34.dev1.dist-info/RECORD +25 -0
  4. netgen/include/arnoldi.hpp +0 -55
  5. netgen/include/bandmatrix.hpp +0 -334
  6. netgen/include/basematrix.hpp +0 -957
  7. netgen/include/basevector.hpp +0 -1268
  8. netgen/include/bdbequations.hpp +0 -2752
  9. netgen/include/bdbintegrator.hpp +0 -1659
  10. netgen/include/bessel.hpp +0 -1064
  11. netgen/include/bilinearform.hpp +0 -963
  12. netgen/include/bla.hpp +0 -29
  13. netgen/include/blockalloc.hpp +0 -95
  14. netgen/include/blockjacobi.hpp +0 -316
  15. netgen/include/bspline.hpp +0 -114
  16. netgen/include/calcinverse.hpp +0 -141
  17. netgen/include/cg.hpp +0 -368
  18. netgen/include/chebyshev.hpp +0 -44
  19. netgen/include/cholesky.hpp +0 -720
  20. netgen/include/clapack.h +0 -7254
  21. netgen/include/code_generation.hpp +0 -296
  22. netgen/include/coefficient.hpp +0 -2006
  23. netgen/include/coefficient_impl.hpp +0 -18
  24. netgen/include/coefficient_stdmath.hpp +0 -157
  25. netgen/include/commutingAMG.hpp +0 -106
  26. netgen/include/comp.hpp +0 -79
  27. netgen/include/compatibility.hpp +0 -41
  28. netgen/include/complex_wrapper.hpp +0 -73
  29. netgen/include/compressedfespace.hpp +0 -110
  30. netgen/include/contact.hpp +0 -231
  31. netgen/include/diagonalmatrix.hpp +0 -154
  32. netgen/include/differentialoperator.hpp +0 -276
  33. netgen/include/diffop.hpp +0 -1286
  34. netgen/include/diffop_impl.hpp +0 -326
  35. netgen/include/discontinuous.hpp +0 -84
  36. netgen/include/dump.hpp +0 -949
  37. netgen/include/eigen.hpp +0 -60
  38. netgen/include/eigensystem.hpp +0 -18
  39. netgen/include/elasticity_equations.hpp +0 -595
  40. netgen/include/elementbyelement.hpp +0 -195
  41. netgen/include/elementtopology.hpp +0 -1760
  42. netgen/include/elementtransformation.hpp +0 -339
  43. netgen/include/evalfunc.hpp +0 -405
  44. netgen/include/expr.hpp +0 -1655
  45. netgen/include/facetfe.hpp +0 -175
  46. netgen/include/facetfespace.hpp +0 -178
  47. netgen/include/facethofe.hpp +0 -111
  48. netgen/include/facetsurffespace.hpp +0 -112
  49. netgen/include/fe_interfaces.hpp +0 -32
  50. netgen/include/fem.hpp +0 -87
  51. netgen/include/fesconvert.hpp +0 -14
  52. netgen/include/fespace.hpp +0 -1445
  53. netgen/include/finiteelement.hpp +0 -286
  54. netgen/include/globalinterfacespace.hpp +0 -77
  55. netgen/include/globalspace.hpp +0 -115
  56. netgen/include/gridfunction.hpp +0 -525
  57. netgen/include/h1amg.hpp +0 -41
  58. netgen/include/h1hofe.hpp +0 -188
  59. netgen/include/h1hofe_impl.hpp +0 -1262
  60. netgen/include/h1hofefo.hpp +0 -148
  61. netgen/include/h1hofefo_impl.hpp +0 -185
  62. netgen/include/h1hofespace.hpp +0 -167
  63. netgen/include/h1lofe.hpp +0 -1237
  64. netgen/include/h1lumping.hpp +0 -35
  65. netgen/include/hcurl_equations.hpp +0 -1352
  66. netgen/include/hcurlcurlfe.hpp +0 -2221
  67. netgen/include/hcurlcurlfespace.hpp +0 -78
  68. netgen/include/hcurlfe.hpp +0 -259
  69. netgen/include/hcurlfe_utils.hpp +0 -107
  70. netgen/include/hcurlhdiv_dshape.hpp +0 -857
  71. netgen/include/hcurlhdivfes.hpp +0 -308
  72. netgen/include/hcurlhofe.hpp +0 -175
  73. netgen/include/hcurlhofe_impl.hpp +0 -1871
  74. netgen/include/hcurlhofespace.hpp +0 -193
  75. netgen/include/hcurllofe.hpp +0 -1146
  76. netgen/include/hdiv_equations.hpp +0 -865
  77. netgen/include/hdivdivfe.hpp +0 -2923
  78. netgen/include/hdivdivsurfacespace.hpp +0 -76
  79. netgen/include/hdivfe.hpp +0 -206
  80. netgen/include/hdivfe_utils.hpp +0 -716
  81. netgen/include/hdivfes.hpp +0 -75
  82. netgen/include/hdivhofe.hpp +0 -447
  83. netgen/include/hdivhofe_impl.hpp +0 -1107
  84. netgen/include/hdivhofefo.hpp +0 -229
  85. netgen/include/hdivhofespace.hpp +0 -175
  86. netgen/include/hdivhosurfacefespace.hpp +0 -106
  87. netgen/include/hdivlofe.hpp +0 -773
  88. netgen/include/hidden.hpp +0 -74
  89. netgen/include/householder.hpp +0 -181
  90. netgen/include/hypre_ams_precond.hpp +0 -123
  91. netgen/include/hypre_precond.hpp +0 -73
  92. netgen/include/integrator.hpp +0 -2024
  93. netgen/include/integratorcf.hpp +0 -253
  94. netgen/include/interpolate.hpp +0 -49
  95. netgen/include/intrule.hpp +0 -2541
  96. netgen/include/irspace.hpp +0 -49
  97. netgen/include/jacobi.hpp +0 -136
  98. netgen/include/l2hofe.hpp +0 -193
  99. netgen/include/l2hofe_impl.hpp +0 -564
  100. netgen/include/l2hofefo.hpp +0 -542
  101. netgen/include/l2hofespace.hpp +0 -344
  102. netgen/include/la.hpp +0 -38
  103. netgen/include/linearform.hpp +0 -266
  104. netgen/include/matrix.hpp +0 -2140
  105. netgen/include/memusage.hpp +0 -41
  106. netgen/include/meshaccess.hpp +0 -1358
  107. netgen/include/mgpre.hpp +0 -204
  108. netgen/include/mptools.hpp +0 -2145
  109. netgen/include/multigrid.hpp +0 -42
  110. netgen/include/multivector.hpp +0 -447
  111. netgen/include/mumpsinverse.hpp +0 -187
  112. netgen/include/mycomplex.hpp +0 -361
  113. netgen/include/ng_lapack.hpp +0 -1661
  114. netgen/include/ngblas.hpp +0 -1099
  115. netgen/include/ngs_defines.hpp +0 -30
  116. netgen/include/ngs_stdcpp_include.hpp +0 -106
  117. netgen/include/ngs_utils.hpp +0 -121
  118. netgen/include/ngsobject.hpp +0 -1019
  119. netgen/include/ngsstream.hpp +0 -113
  120. netgen/include/ngstd.hpp +0 -72
  121. netgen/include/nodalhofe.hpp +0 -96
  122. netgen/include/nodalhofe_impl.hpp +0 -141
  123. netgen/include/normalfacetfe.hpp +0 -223
  124. netgen/include/normalfacetfespace.hpp +0 -98
  125. netgen/include/normalfacetsurfacefespace.hpp +0 -84
  126. netgen/include/order.hpp +0 -251
  127. netgen/include/parallel_matrices.hpp +0 -222
  128. netgen/include/paralleldofs.hpp +0 -340
  129. netgen/include/parallelngs.hpp +0 -23
  130. netgen/include/parallelvector.hpp +0 -269
  131. netgen/include/pardisoinverse.hpp +0 -200
  132. netgen/include/periodic.hpp +0 -125
  133. netgen/include/plateaufespace.hpp +0 -25
  134. netgen/include/pml.hpp +0 -275
  135. netgen/include/pmltrafo.hpp +0 -631
  136. netgen/include/postproc.hpp +0 -142
  137. netgen/include/precomp.hpp +0 -60
  138. netgen/include/preconditioner.hpp +0 -602
  139. netgen/include/prolongation.hpp +0 -235
  140. netgen/include/python_comp.hpp +0 -107
  141. netgen/include/python_fem.hpp +0 -89
  142. netgen/include/python_linalg.hpp +0 -58
  143. netgen/include/python_ngstd.hpp +0 -385
  144. netgen/include/recursive_pol.hpp +0 -4844
  145. netgen/include/recursive_pol_tet.hpp +0 -395
  146. netgen/include/recursive_pol_trig.hpp +0 -492
  147. netgen/include/reorderedfespace.hpp +0 -81
  148. netgen/include/sample_sort.hpp +0 -105
  149. netgen/include/scalarfe.hpp +0 -335
  150. netgen/include/shapefunction_utils.hpp +0 -113
  151. netgen/include/simd_complex.hpp +0 -284
  152. netgen/include/smoother.hpp +0 -253
  153. netgen/include/solve.hpp +0 -89
  154. netgen/include/sparsecholesky.hpp +0 -313
  155. netgen/include/sparsematrix.hpp +0 -1038
  156. netgen/include/sparsematrix_dyn.hpp +0 -91
  157. netgen/include/sparsematrix_impl.hpp +0 -920
  158. netgen/include/special_matrix.hpp +0 -461
  159. netgen/include/specialelement.hpp +0 -125
  160. netgen/include/statushandler.hpp +0 -33
  161. netgen/include/stringops.hpp +0 -12
  162. netgen/include/superluinverse.hpp +0 -136
  163. netgen/include/symbolicintegrator.hpp +0 -849
  164. netgen/include/symmetricmatrix.hpp +0 -144
  165. netgen/include/tangentialfacetfe.hpp +0 -224
  166. netgen/include/tangentialfacetfespace.hpp +0 -106
  167. netgen/include/tensor.hpp +0 -522
  168. netgen/include/tensorcoefficient.hpp +0 -446
  169. netgen/include/tensorproductintegrator.hpp +0 -113
  170. netgen/include/thcurlfe.hpp +0 -128
  171. netgen/include/thcurlfe_impl.hpp +0 -380
  172. netgen/include/thdivfe.hpp +0 -80
  173. netgen/include/thdivfe_impl.hpp +0 -426
  174. netgen/include/tpdiffop.hpp +0 -461
  175. netgen/include/tpfes.hpp +0 -133
  176. netgen/include/tpintrule.hpp +0 -224
  177. netgen/include/triangular.hpp +0 -465
  178. netgen/include/tscalarfe.hpp +0 -245
  179. netgen/include/tscalarfe_impl.hpp +0 -1029
  180. netgen/include/umfpackinverse.hpp +0 -148
  181. netgen/include/vector.hpp +0 -1219
  182. netgen/include/voxelcoefficientfunction.hpp +0 -41
  183. netgen/include/vtkoutput.hpp +0 -198
  184. netgen/include/vvector.hpp +0 -208
  185. netgen/include/webgui.hpp +0 -92
  186. netgen/libngbla.dylib +0 -0
  187. netgen/libngcomp.dylib +0 -0
  188. netgen/libngfem.dylib +0 -0
  189. netgen/libngla.dylib +0 -0
  190. netgen/libngsolve.dylib +0 -0
  191. netgen/libngstd.dylib +0 -0
  192. ngsolve/__init__.pyi +0 -231
  193. ngsolve/bla.pyi +0 -1139
  194. ngsolve/bvp.pyi +0 -32
  195. ngsolve/cmake/NGSolveConfig.cmake +0 -102
  196. ngsolve/cmake/ngsolve-targets-release.cmake +0 -69
  197. ngsolve/cmake/ngsolve-targets.cmake +0 -163
  198. ngsolve/comp/__init__.pyi +0 -5382
  199. ngsolve/comp/pml.pyi +0 -89
  200. ngsolve/config/__init__.py +0 -1
  201. ngsolve/config/__init__.pyi +0 -43
  202. ngsolve/config/__main__.py +0 -4
  203. ngsolve/config/config.py +0 -60
  204. ngsolve/config/config.pyi +0 -45
  205. ngsolve/demos/TensorProduct/__init__.py +0 -0
  206. ngsolve/demos/TensorProduct/tp_dg_1d_1d.py +0 -80
  207. ngsolve/demos/TensorProduct/tp_dg_1d_2d.py +0 -73
  208. ngsolve/demos/TensorProduct/tp_dg_2d_1d.py +0 -72
  209. ngsolve/demos/TensorProduct/tp_dg_2d_2d.py +0 -66
  210. ngsolve/demos/__init__.py +0 -0
  211. ngsolve/demos/howto/__init__.py +0 -0
  212. ngsolve/demos/howto/hhj.py +0 -44
  213. ngsolve/demos/howto/hybrid_dg.py +0 -53
  214. ngsolve/demos/howto/mixed.py +0 -30
  215. ngsolve/demos/howto/nonlin.py +0 -29
  216. ngsolve/demos/howto/pickling.py +0 -26
  217. ngsolve/demos/howto/pml.py +0 -31
  218. ngsolve/demos/howto/taskmanager.py +0 -20
  219. ngsolve/demos/howto/tdnns.py +0 -47
  220. ngsolve/demos/howto/timeDG-skeleton.py +0 -45
  221. ngsolve/demos/howto/timeDG.py +0 -38
  222. ngsolve/demos/howto/timeDGlap.py +0 -42
  223. ngsolve/demos/howto/timeDGwave.py +0 -61
  224. ngsolve/demos/intro/__init__.py +0 -0
  225. ngsolve/demos/intro/adaptive.py +0 -123
  226. ngsolve/demos/intro/cmagnet.py +0 -62
  227. ngsolve/demos/intro/elasticity.py +0 -76
  228. ngsolve/demos/intro/navierstokes.py +0 -74
  229. ngsolve/demos/intro/poisson.ipynb +0 -170
  230. ngsolve/demos/intro/poisson.py +0 -41
  231. ngsolve/demos/mpi/__init__.py +0 -0
  232. ngsolve/demos/mpi/mpi_cmagnet.py +0 -87
  233. ngsolve/demos/mpi/mpi_navierstokes.py +0 -117
  234. ngsolve/demos/mpi/mpi_poisson.py +0 -89
  235. ngsolve/demos/mpi/mpi_timeDG.py +0 -82
  236. ngsolve/directsolvers.pyi +0 -18
  237. ngsolve/eigenvalues.pyi +0 -30
  238. ngsolve/fem.pyi +0 -1707
  239. ngsolve/krylovspace.pyi +0 -309
  240. ngsolve/la.pyi +0 -1218
  241. ngsolve/ngslib.so +0 -0
  242. ngsolve/ngstd.pyi +0 -58
  243. ngsolve/nonlinearsolvers.pyi +0 -98
  244. ngsolve/preconditioners.pyi +0 -6
  245. ngsolve/solve.pyi +0 -108
  246. ngsolve/solvers.pyi +0 -14
  247. ngsolve/timestepping.pyi +0 -34
  248. ngsolve/timing.pyi +0 -57
  249. ngsolve/utils.pyi +0 -279
  250. ngsolve-6.2.2501.post16.dev1.data/data/Netgen.icns +0 -0
  251. ngsolve-6.2.2501.post16.dev1.data/data/bin/ngscxx +0 -17
  252. ngsolve-6.2.2501.post16.dev1.data/data/bin/ngsld +0 -13
  253. ngsolve-6.2.2501.post16.dev1.data/data/bin/ngsolve.tcl +0 -648
  254. ngsolve-6.2.2501.post16.dev1.data/data/bin/ngspy +0 -2
  255. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/beam.geo +0 -17
  256. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/beam.vol +0 -240
  257. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/chip.in2d +0 -41
  258. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/chip.vol +0 -614
  259. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/coil.geo +0 -12
  260. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/coil.vol +0 -2560
  261. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/coilshield.geo +0 -24
  262. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/coilshield.vol +0 -3179
  263. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/cube.geo +0 -19
  264. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/cube.vol +0 -1832
  265. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d10_DGdoubleglazing.pde +0 -50
  266. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d11_chip_nitsche.pde +0 -40
  267. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d1_square.pde +0 -43
  268. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d2_chip.pde +0 -35
  269. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d3_helmholtz.pde +0 -22
  270. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d4_cube.pde +0 -46
  271. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d5_beam.pde +0 -74
  272. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d6_shaft.pde +0 -73
  273. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d7_coil.pde +0 -50
  274. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d8_coilshield.pde +0 -49
  275. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/d9_hybridDG.pde +0 -72
  276. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/doubleglazing.in2d +0 -27
  277. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/doubleglazing.vol +0 -737
  278. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/piezo2d40round4.vol.gz +0 -0
  279. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/shaft.geo +0 -73
  280. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/shaft.vol +0 -4291
  281. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/square.in2d +0 -17
  282. ngsolve-6.2.2501.post16.dev1.data/data/share/ngsolve/square.vol +0 -149
  283. ngsolve-6.2.2501.post16.dev1.dist-info/RECORD +0 -304
  284. {ngsolve-6.2.2501.post16.dev1.dist-info → ngsolve-6.2.2501.post34.dev1.dist-info}/LICENSE +0 -0
  285. {ngsolve-6.2.2501.post16.dev1.dist-info → ngsolve-6.2.2501.post34.dev1.dist-info}/WHEEL +0 -0
  286. {ngsolve-6.2.2501.post16.dev1.dist-info → ngsolve-6.2.2501.post34.dev1.dist-info}/top_level.txt +0 -0
@@ -1,224 +0,0 @@
1
- #ifndef TPINTRULE_HPP
2
- #define TPINTRULE_HPP
3
-
4
-
5
- #include "scalarfe.hpp"
6
- #include "coefficient.hpp"
7
-
8
- namespace ngfem
9
- {
10
- class TPIntegrationRule : public IntegrationRule
11
- {
12
- const ArrayMem< const IntegrationRule *,2> irs;
13
- public:
14
- INLINE TPIntegrationRule(const Array< const IntegrationRule *> & airs) : irs(airs)
15
- {
16
- this->size = irs[0]->GetNIP()*irs[1]->GetNIP();
17
- }
18
- INLINE TPIntegrationRule(int asize)
19
- {
20
- this->size = asize;
21
- }
22
- INLINE const IntegrationRule & operator() (int i) const {return *irs[i];}
23
- };
24
-
25
- ///////////////////////////////////////////////////////////////////////////////
26
-
27
- class NGS_DLL_HEADER TPMappedIntegrationRule : public BaseMappedIntegrationRule
28
- {
29
- ArrayMem<BaseMappedIntegrationRule *,2> irs;
30
- ArrayMem<int,2> dims;
31
- int facet = -1;
32
- public:
33
- INLINE TPMappedIntegrationRule(const IntegrationRule & ir, const ElementTransformation & eltrans ) : BaseMappedIntegrationRule(ir, eltrans) {
34
- }
35
- INLINE TPMappedIntegrationRule(BaseMappedIntegrationRule & mirx, BaseMappedIntegrationRule & miry, const IntegrationRule & tpir, const ElementTransformation & eltrans ) : BaseMappedIntegrationRule(tpir, eltrans) {
36
- irs[0] = &mirx;
37
- irs[1] = &miry;
38
- dims[0] = mirx.GetTransformation().SpaceDim();
39
- dims[1] = miry.GetTransformation().SpaceDim();
40
- }
41
- INLINE void SetFacet(int afacet) {
42
- facet = afacet;
43
- }
44
- virtual ~TPMappedIntegrationRule() {}
45
- virtual BaseMappedIntegrationRule & Range(int first, int next, LocalHeap & lh) const
46
- { throw Exception("TPMappedIntegrationRule::Range not implemented"); }
47
- virtual SliceMatrix<> GetPoints() const
48
- { throw Exception("TPMappedIntegrationRule::GetPoints not implemented"); }
49
- virtual SliceMatrix<> GetNormals() const
50
- { throw Exception("TPMappedIntegrationRule::GetNormals not implemented"); }
51
- virtual void ComputeNormalsAndMeasure (ELEMENT_TYPE et, int facetnr)
52
- { throw Exception("TPMappedIntegrationRule::ComputeNormalsAndMeasure not implemented"); }
53
- virtual bool IsComplex() const
54
- {
55
- return false;
56
- }
57
- INLINE void AppendDim(int adim) {
58
- dims.Append(adim);
59
- }
60
- INLINE void AppendIR(BaseMappedIntegrationRule * miri) {
61
- irs.Append(miri);
62
- }
63
- INLINE const Array<int> & GetDims() const {
64
- return dims;
65
- }
66
- INLINE Array<int> & GetDims() {
67
- return dims;
68
- }
69
- INLINE const Array<BaseMappedIntegrationRule *> & GetIRs() const {
70
- return irs;
71
- }
72
- INLINE Array<BaseMappedIntegrationRule *> & GetIRs() {
73
- return irs;
74
- }
75
- INLINE const int GetFacet() const {
76
- return facet;
77
- }
78
- virtual BaseMappedIntegrationRule & Range(size_t first, size_t next, LocalHeap & lh) const
79
- { throw Exception("TPMappedIntegrationRule::Range not implemented"); }
80
- };
81
-
82
- ///////////////////////////////////////////////////////////////////////////////////////
83
- class TPElementTransformation : public ElementTransformation
84
- {
85
- ElementId ei;
86
- ArrayMem<ElementTransformation*, 2> trafos;
87
-
88
- public:
89
- INLINE TPElementTransformation ( ElementId aei ) :
90
- ElementTransformation (ET_POINT, VOL, aei.Nr(), 0), ei(aei)
91
- {
92
- //trafos.SetSize(nmeshes);
93
- }
94
- INLINE ElementTransformation & GetTrafo(int i) const {return *trafos[i];}
95
- void SetTrafos(Array<ElementTransformation *> & atrafos) {trafos = atrafos;}
96
- virtual void CalcJacobian (const IntegrationPoint & ip, FlatMatrix<> dxdxi) const {
97
- throw Exception("TPElementTransformation::CalcJacobian not implemented");
98
- }
99
- virtual void CalcPoint (const IntegrationPoint & ip, FlatVector<> point) const {
100
- throw Exception("TPElementTransformation::CalcPoint not implemented");
101
- }
102
- virtual void CalcPointJacobian (const IntegrationPoint & ip, FlatVector<> point, FlatMatrix<> dxdxi) const {
103
- throw Exception("TPElementTransformation::CalcPointJacobian not implemented");
104
- }
105
- virtual void CalcMultiPointJacobian (const IntegrationRule & ir, BaseMappedIntegrationRule & bmir) const {
106
- throw Exception("TPElementTransformation::CalcMultiPointJacobian not implemented");
107
- }
108
- virtual void CalcMultiPointJacobian (const SIMD_IntegrationRule & ir, SIMD_BaseMappedIntegrationRule & mir) const {
109
- throw Exception("TPElementTransformation::CalcMultiPointJacobian not implemented");
110
- }
111
- virtual int SpaceDim () const {
112
- return trafos[0]->SpaceDim() + trafos[1]->SpaceDim();
113
- }
114
- virtual VorB VB() const {
115
- return VorB( (trafos[0]->VB()==BND) || (trafos[1]->VB() == BND) );
116
- }
117
- virtual BaseMappedIntegrationPoint & operator() (const IntegrationPoint & ip, Allocator & lh) const {
118
- throw Exception("TPElementTransformation::operator() not implemented"); }
119
-
120
- virtual BaseMappedIntegrationRule & operator() (const IntegrationRule & ir, Allocator & lh) const
121
- {
122
- const TPIntegrationRule & tpir = dynamic_cast<const TPIntegrationRule &>(ir);
123
- TPMappedIntegrationRule * mir = new (lh) TPMappedIntegrationRule(ir, *this);
124
- for(int i=0;i<2;i++)
125
- {
126
- BaseMappedIntegrationRule & miri = (*trafos[i])(tpir(i),lh);
127
- mir->AppendDim(trafos[i]->SpaceDim());
128
- mir->AppendIR(&miri);
129
- }
130
- return *mir;
131
- }
132
- };
133
- ////////////////////////////////////////////////////////////////////////////////////////////
134
-
135
-
136
- class TPHighOrderFE : public FiniteElement
137
- {
138
- public:
139
- ArrayMem<const FiniteElement *,2> elements;
140
- HD NGS_DLL_HEADER
141
- virtual void CalcShape (const IntegrationPoint & ip,
142
- SliceVector<> shape) const
143
- { cout << "calcshape ip" << endl; }
144
-
145
- /// compute dshape, matrix: ndof x spacedim
146
- HD NGS_DLL_HEADER
147
- virtual void CalcDShape (const IntegrationPoint & ip,
148
- SliceMatrix<> dshape) const
149
- { cout << "calcdshape ip" << endl; }
150
-
151
- HD NGS_DLL_HEADER
152
- virtual void CalcShape (const IntegrationRule & irbase, SliceMatrix<> shape) const
153
- {
154
- const TPIntegrationRule & ir = dynamic_cast<const TPIntegrationRule &>(irbase);
155
- int ndof0 = elements[0]->GetNDof();
156
- int ndof1 = elements[1]->GetNDof();
157
- int nip0 = ir(0).Size();
158
- int nip1 = ir(1).Size();
159
- Matrix<double> shape0( ndof0, ir(0).Size() );
160
- Matrix<double> shape1( ndof1, ir(1).Size() );
161
- dynamic_cast<const BaseScalarFiniteElement*>(elements[0])->CalcShape( ir(0), shape0 );
162
- dynamic_cast<const BaseScalarFiniteElement*>(elements[1])->CalcShape( ir(1), shape1 );
163
- int ii=0;
164
- for(int m=0;m<ndof0;m++)
165
- for(int n=0;n<ndof1;n++)
166
- {
167
- int ip=0;
168
- for(int i=0;i<nip0;i++)
169
- for(int j=0;j<nip1;j++)
170
- shape(ii,ip++) = shape0(m,i)*shape1(n,j);
171
- ii++;
172
- }
173
- }
174
- INLINE const FiniteElement* Elements(int i) { return elements[i]; }
175
- //int NElements() { return elements.Size();}
176
- HD virtual ELEMENT_TYPE ElementType() const { return ET_POINT; }
177
-
178
- INLINE TPHighOrderFE (Array<const FiniteElement *> & els)
179
- {
180
- //elements.SetSize(els.Size());
181
- elements = els;
182
- ndof = elements[0]->GetNDof()*elements[1]->GetNDof();
183
- order = max2(elements[0]->Order(),elements[1]->Order());
184
- }
185
- HD virtual NGS_DLL_HEADER ~TPHighOrderFE () { ; }
186
-
187
- };
188
-
189
- class ProlongateCoefficientFunction : public CoefficientFunction
190
- {
191
- private:
192
- shared_ptr<CoefficientFunction> coef;
193
- int prolongateto;
194
- int dimx,dimy;
195
- public:
196
- ///
197
- ProlongateCoefficientFunction(shared_ptr<CoefficientFunction> acoef,int aprolongateto,int adimension,int adimx,int adimy, bool ais_complex = false)
198
- : CoefficientFunction(adimension,ais_complex), coef(acoef), prolongateto(aprolongateto), dimx(adimx), dimy(adimy)
199
- { ; }
200
- ///
201
- virtual double Evaluate (const BaseMappedIntegrationPoint & ip) const;
202
- ///
203
- virtual void Evaluate (const BaseMappedIntegrationRule & ir, BareSliceMatrix<double> values) const;
204
- virtual void EvaluateStdRule (const BaseMappedIntegrationRule & ir, FlatMatrix<double> values) const;
205
- };
206
-
207
- class ProlongateCoefficientFunctionVisualization : public CoefficientFunction
208
- {
209
- private:
210
- const ProlongateCoefficientFunction & pcf;
211
- public:
212
- ///
213
- ProlongateCoefficientFunctionVisualization(const ProlongateCoefficientFunction & apcf)
214
- : CoefficientFunction(apcf.Dimension(),apcf.IsComplex()), pcf(apcf)
215
- { ; }
216
- ///
217
- using CoefficientFunction::Evaluate;
218
- virtual double Evaluate (const BaseMappedIntegrationPoint & ip) const { return pcf.Evaluate(ip); }
219
- ///
220
- virtual void Evaluate (const BaseMappedIntegrationRule & ir, FlatMatrix<double> values) const { pcf.EvaluateStdRule(ir,values); }
221
- };
222
-
223
- }
224
- #endif // TPINTRULE_HPP
@@ -1,465 +0,0 @@
1
- #ifndef FILE_TRIANGULAR
2
- #define FILE_TRIANGULAR
3
-
4
- /****************************************************************************/
5
- /* File: triangular.hpp */
6
- /* Author: Joachim Schoeberl */
7
- /* Date: Nov 2020 */
8
- /****************************************************************************/
9
-
10
- namespace ngbla
11
- {
12
-
13
-
14
- enum TRIG_SIDE { LowerLeft, UpperRight };
15
- enum TRIG_NORMAL { NonNormalized = 0, Normalized = 1 };
16
- constexpr TRIG_SIDE operator! (TRIG_SIDE s)
17
- { return (s == LowerLeft) ? UpperRight : LowerLeft; }
18
-
19
-
20
- // Solve T X = Y
21
- // rhs is overwritten by solution
22
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized,
23
- typename TT, typename TX, ORDERING OT, ORDERING OX>
24
- void TriangularSolve (BareSliceMatrix<TT,OT> T, SliceMatrix<TX,OX> X)
25
- {
26
- size_t n = X.Height();
27
-
28
- if (n == 0) return;
29
- if (n == 1)
30
- {
31
- if (NORM == NonNormalized)
32
- X.Row(0) *= 1.0/T(0.0);
33
- return;
34
- }
35
-
36
- if (n < 8)
37
- {
38
- if constexpr (SIDE == UpperRight)
39
- for (size_t i = n; i-- > 0; )
40
- {
41
- for (size_t j = i+1; j < n; j++)
42
- X.Row(i) -= T(i,j) * X.Row(j);
43
- if (NORM==NonNormalized)
44
- X.Row(i) *= 1.0/T(i,i);
45
- }
46
- else
47
- for (size_t i = 0; i < n; i++)
48
- {
49
- for (size_t j = 0; j < i; j++)
50
- X.Row(i) -= T(i,j) * X.Row(j);
51
- if (NORM==NonNormalized)
52
- X.Row(i) *= 1.0/T(i,i);
53
- }
54
- return;
55
- }
56
-
57
-
58
-
59
-
60
- if (X.Width() > 256)
61
- {
62
- size_t m = X.Width();
63
- IntRange r1(0,m/2), r2(m/2,m);
64
- TriangularSolve<SIDE,NORM> (T, X.Cols(r1));
65
- TriangularSolve<SIDE,NORM> (T, X.Cols(r2));
66
- return;
67
- }
68
-
69
-
70
- IntRange r1(0,n/2), r2(n/2,n);
71
- auto T11 = T.Rows(r1).Cols(r1);
72
- auto T12 = T.Rows(r1).Cols(r2).AddSize(r1.Size(), r2.Size());
73
- auto T21 = T.Rows(r2).Cols(r1).AddSize(r2.Size(), r1.Size());
74
- auto T22 = T.Rows(r2).Cols(r2);
75
- auto X1 = X.Rows(r1);
76
- auto X2 = X.Rows(r2);
77
-
78
- if (SIDE == LowerLeft)
79
- {
80
- TriangularSolve<SIDE,NORM> (T11.Bare(), X1);
81
- X2 -= T21 * X1;
82
- TriangularSolve<SIDE,NORM> (T22.Bare(), X2);
83
- }
84
- else
85
- {
86
- TriangularSolve<SIDE,NORM> (T22.Bare(), X2);
87
- X1 -= T12 * X2;
88
- TriangularSolve<SIDE,NORM> (T11.Bare(), X1);
89
- }
90
- }
91
-
92
- extern NGS_DLL_HEADER void TriangularSolveLL (BareSliceMatrix<double> T, SliceMatrix<double> X);
93
- template <> inline void TriangularSolve<LowerLeft,NonNormalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
94
- {
95
- TriangularSolveLL(T,X);
96
- }
97
- extern NGS_DLL_HEADER void TriangularSolveLLN (BareSliceMatrix<double> T, SliceMatrix<double> X);
98
- template <> inline void TriangularSolve<LowerLeft,Normalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
99
- {
100
- TriangularSolveLLN(T,X);
101
- }
102
-
103
- extern NGS_DLL_HEADER void TriangularSolveUR (BareSliceMatrix<double> T, SliceMatrix<double> X);
104
- template <> inline void TriangularSolve<UpperRight,NonNormalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
105
- {
106
- TriangularSolveUR(T,X);
107
- }
108
- extern NGS_DLL_HEADER void TriangularSolveURN (BareSliceMatrix<double> T, SliceMatrix<double> X);
109
- template <> inline void TriangularSolve<UpperRight,Normalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
110
- {
111
- TriangularSolveURN(T,X);
112
- }
113
-
114
-
115
-
116
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT, typename TX,
117
- typename enable_if<IsConvertibleToBareSliceMatrix<TT>(),int>::type = 0,
118
- typename enable_if<IsConvertibleToSliceMatrix<TX>(),int>::type = 0>
119
- void TriangularSolve (const TT & T, TX && X)
120
- {
121
- TriangularSolve<SIDE,NORM> (make_BareSliceMatrix(T), make_SliceMatrix(X));
122
- }
123
-
124
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT,
125
- typename enable_if<IsConvertibleToSliceMatrix<TT>(),int>::type = 0>
126
- void TriangularSolve (const TT & T, FlatVector<> x)
127
- {
128
- TriangularSolve<SIDE,NORM> (make_BareSliceMatrix(T), SliceMatrix<>(x.Size(),1,1,&x(0)));
129
- }
130
-
131
-
132
-
133
-
134
-
135
- // Y = T X
136
- // input X is overwritten
137
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized,
138
- typename TT, typename TX, ORDERING OT, ORDERING OX>
139
- void TriangularMult2 (BareSliceMatrix<TT,OT> T, SliceMatrix<TX,OX> X)
140
- {
141
- // static Timer t("TriangularMult generic, rec"); RegionTimer r(t);
142
-
143
- size_t n = X.Height();
144
-
145
- if (n == 0) return;
146
- if (n == 1)
147
- {
148
- if (NORM == NonNormalized)
149
- X.Row(0) *= T(0.0);
150
- return;
151
- }
152
-
153
- if (n < 8) {
154
- if constexpr (SIDE == UpperRight) {
155
- for (size_t i = 0; i < n; i++)
156
- {
157
- if (NORM==NonNormalized)
158
- X.Row(i) *= T(i,i);
159
- for (size_t j = i+1; j < n; j++)
160
- X.Row(i) += T(i,j) * X.Row(j);
161
- }
162
- }
163
- else {
164
- for (size_t i = n; i > 0; i--)
165
- {
166
- size_t im = i-1;
167
- if (NORM==NonNormalized)
168
- X.Row(im) *= T(im,im);
169
- for (size_t j = 0; j < im; j++)
170
- X.Row(im) += T(im,j) * X.Row(j);
171
- }
172
- }
173
- return;
174
- }
175
-
176
- size_t n2 = n/2;
177
- // if (n2 > 4) n2 = n2 - n2%4;
178
- IntRange r1(0,n2), r2(n2,n);
179
- auto T11 = T.Rows(r1).Cols(r1);
180
- auto T12 = T.Rows(r1).Cols(r2).AddSize(r1.Size(), r2.Size());;
181
- auto T21 = T.Rows(r2).Cols(r1).AddSize(r2.Size(), r1.Size());
182
- auto T22 = T.Rows(r2).Cols(r2);
183
- auto X1 = X.Rows(r1);
184
- auto X2 = X.Rows(r2);
185
-
186
- if (SIDE == LowerLeft)
187
- {
188
- TriangularMult2<SIDE,NORM> (T22.Bare(), X2);
189
- X2 += T21 * X1;
190
- TriangularMult2<SIDE,NORM> (T11.Bare(), X1);
191
- }
192
- else
193
- {
194
- TriangularMult2<SIDE,NORM> (T11.Bare(), X1);
195
- X1 += T12 * X2;
196
- TriangularMult2<SIDE,NORM> (T22.Bare(), X2);
197
- }
198
- }
199
-
200
- // Y = T X
201
- // input X is overwritten
202
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized,
203
- typename TT, typename TX, ORDERING OT, ORDERING OX>
204
- void TriangularMult (BareSliceMatrix<TT,OT> T, SliceMatrix<TX,OX> X)
205
- {
206
- static Timer t("TriangularMult generic"); RegionTimer r(t);
207
- size_t i = 0;
208
- constexpr size_t bw = 256;
209
- for ( ; i+bw <= X.Width(); i += bw)
210
- TriangularMult2<SIDE,NORM> (T, X.Cols(i,i+bw));
211
- if (i < X.Width())
212
- TriangularMult2<SIDE,NORM> (T, X.Cols(i,X.Width()));
213
- }
214
-
215
-
216
- extern NGS_DLL_HEADER void TriangularMultLL (BareSliceMatrix<double> T, SliceMatrix<double> X);
217
- extern NGS_DLL_HEADER void TriangularMultLLN (BareSliceMatrix<double> T, SliceMatrix<double> X);
218
- extern NGS_DLL_HEADER void TriangularMultLL (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X);
219
- extern NGS_DLL_HEADER void TriangularMultLLN (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X);
220
-
221
- template <> inline void TriangularMult<LowerLeft,NonNormalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
222
- {
223
- TriangularMultLL(T,X);
224
- }
225
-
226
- template <> inline void TriangularMult<LowerLeft,Normalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
227
- {
228
- TriangularMultLLN(T,X);
229
- }
230
-
231
- template <> inline void TriangularMult<LowerLeft,NonNormalized> (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X)
232
- {
233
- TriangularMultLL(T,X);
234
- }
235
-
236
- template <> inline void TriangularMult<LowerLeft,Normalized> (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X)
237
- {
238
- TriangularMultLLN(T,X);
239
- }
240
-
241
-
242
-
243
- extern NGS_DLL_HEADER void TriangularMultUR (BareSliceMatrix<double> T, SliceMatrix<double> X);
244
- extern NGS_DLL_HEADER void TriangularMultURN (BareSliceMatrix<double> T, SliceMatrix<double> X);
245
- extern NGS_DLL_HEADER void TriangularMultUR (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X);
246
- extern NGS_DLL_HEADER void TriangularMultURN (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X);
247
-
248
- template <> inline void TriangularMult<UpperRight,NonNormalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
249
- {
250
- TriangularMultUR(T,X);
251
- }
252
-
253
- template <> inline void TriangularMult<UpperRight,Normalized> (BareSliceMatrix<double> T, SliceMatrix<double> X)
254
- {
255
- TriangularMultURN(T,X);
256
- }
257
-
258
- template <> inline void TriangularMult<UpperRight,NonNormalized> (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X)
259
- {
260
- TriangularMultUR(T,X);
261
- }
262
- template <> inline void TriangularMult<UpperRight,Normalized> (BareSliceMatrix<double,ColMajor> T, SliceMatrix<double> X)
263
- {
264
- TriangularMultURN(T,X);
265
- }
266
-
267
-
268
-
269
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT, typename TX,
270
- typename enable_if<IsConvertibleToSliceMatrix<TT>(),int>::type = 0,
271
- typename enable_if<IsConvertibleToSliceMatrix<TX>(),int>::type = 0>
272
- void TriangularMult (const TT & T, TX & X)
273
- {
274
- TriangularMult<SIDE,NORM> (make_BareSliceMatrix(T), make_SliceMatrix(X));
275
- }
276
-
277
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT,
278
- typename enable_if<IsConvertibleToSliceMatrix<TT>(),int>::type = 0>
279
- void TriangularMult (const TT & T, FlatVector<> x)
280
- {
281
- TriangularMult<SIDE,NORM> (make_BareSliceMatrix(T), SliceMatrix<>(x.Size(),1,1,&x(0)));
282
- }
283
-
284
-
285
- // X = X * T
286
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT, typename TX,
287
- typename enable_if<IsConvertibleToSliceMatrix<TT>(),int>::type = 0,
288
- typename enable_if<IsConvertibleToSliceMatrix<TX>(),int>::type = 0>
289
- void MultTriangular (TX & X, const TT & T)
290
- {
291
- TriangularMult<!SIDE,NORM> (Trans(make_BareSliceMatrix(T)), Trans(make_SliceMatrix(X)));
292
- }
293
-
294
-
295
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized,
296
- typename TT, typename TX, ORDERING OT, ORDERING OX>
297
- void MultTriangular (SliceMatrix<TX,OX> X, SliceMatrix<TT,OT> T)
298
- {
299
- TriangularMult<!SIDE,NORM> (Trans(T), Trans(X));
300
- }
301
-
302
- extern NGS_DLL_HEADER void MultTriangularLLN (SliceMatrix<double> X, BareSliceMatrix<double> T);
303
- template <> inline void MultTriangular<LowerLeft,Normalized> (SliceMatrix<double> X, SliceMatrix<double> T)
304
- {
305
- MultTriangularLLN(X,T);
306
- }
307
- extern NGS_DLL_HEADER void MultTriangularUR (SliceMatrix<double> X, BareSliceMatrix<double> T);
308
- template <> inline void MultTriangular<UpperRight> (SliceMatrix<double> X, SliceMatrix<double> T)
309
- {
310
- MultTriangularUR(X,T);
311
- }
312
-
313
-
314
-
315
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, ORDERING OT, ORDERING OXY>
316
- extern NGS_DLL_HEADER void GeneralizedTriangularMult_SM (SliceMatrix<double, OT> T,
317
- SliceMatrix<double, OXY> X,
318
- SliceMatrix<double, OXY> Y);
319
-
320
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT, typename TX, typename TY>
321
- void GeneralizedTriangularMult (const TT & T,
322
- const TX & X,
323
- const TY & Y)
324
- {
325
- GeneralizedTriangularMult_SM<SIDE,NORM> (make_SliceMatrix(T), make_SliceMatrix(X), make_SliceMatrix(Y));
326
- }
327
-
328
-
329
-
330
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, ORDERING OT, ORDERING OXY>
331
- extern NGS_DLL_HEADER void GeneralizedTriangularSub_SM (SliceMatrix<double, OT> T,
332
- SliceMatrix<double, OXY> X,
333
- SliceMatrix<double, OXY> Y);
334
-
335
-
336
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT, typename TX, typename TY>
337
- void GeneralizedTriangularSub (const TT & T,
338
- const TX & X,
339
- const TY & Y)
340
- {
341
- GeneralizedTriangularSub_SM<SIDE,NORM> (make_SliceMatrix(T), make_SliceMatrix(X), make_SliceMatrix(Y));
342
- }
343
-
344
-
345
-
346
-
347
-
348
-
349
-
350
- /*
351
- static Timer triginv_loops ("TriangularInvert loops");
352
- static Timer triginv_L1 ("TriangularInvert L1");
353
- static Timer triginv_L2 ("TriangularInvert L2");
354
- static Timer triginv_R1 ("TriangularInvert R1");
355
- static Timer triginv_R2 ("TriangularInvert r2");
356
- */
357
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized,
358
- typename TT, ORDERING TO>
359
- void TriangularInvert (SliceMatrix<TT,TO> T)
360
- {
361
- size_t n = T.Height();
362
-
363
- if (n == 0) return;
364
- if (n == 1)
365
- {
366
- if (NORM == NonNormalized)
367
- T(0,0) = 1.0/T(0,0);
368
- return;
369
- }
370
-
371
- if (n < 16)
372
- {
373
- // RegionTimer reg(triginv_loops);
374
- for (size_t j = 0; j < n; j++)
375
- {
376
- auto rowj = T.Row(j);
377
- TT invdiag = 1.0;
378
- if constexpr (NORM == NonNormalized) {
379
- invdiag = 1.0/T(j,j);
380
-
381
- if constexpr (SIDE==LowerLeft) {
382
- rowj.Range(0,j) *= invdiag;
383
- }
384
- else
385
- rowj.Range(j+1,n) *= invdiag;
386
- rowj(j) = invdiag;
387
- }
388
-
389
- if constexpr (SIDE == UpperRight) {
390
- for (size_t k = 0; k < j; k++)
391
- {
392
- auto rowk = T.Row(k);
393
- TT help = rowk(j);
394
- rowk.Range(j+1,n) -= help * rowj.Range(j+1,n);
395
- rowk(j) = -help*invdiag;
396
- }
397
- }
398
- else
399
- for (size_t k = j+1; k < n; k++)
400
- {
401
- auto rowk = T.Row(k);
402
- TT help = rowk(j);
403
- rowk.Range(j) -= help * rowj.Range(j);
404
- rowk(j) = -help*invdiag;
405
- }
406
- }
407
-
408
- return;
409
- }
410
-
411
- size_t n2 = n/2;
412
- IntRange r1(0,n2), r2(n2,n);
413
- auto T11 = T.Rows(r1).Cols(r1);
414
- auto T12 = T.Rows(r1).Cols(r2);
415
- auto T21 = T.Rows(r2).Cols(r1);
416
- auto T22 = T.Rows(r2).Cols(r2);
417
-
418
- TriangularInvert<SIDE,NORM> (T11);
419
- TriangularInvert<SIDE,NORM> (T22);
420
-
421
- if (SIDE == LowerLeft)
422
- {
423
- T21 *= -1;
424
- // triginv_L1.Start();
425
- TriangularMult<SIDE,NORM> (T22, T21);
426
- // triginv_L1.Stop();
427
- // triginv_L2.Start();
428
- // TriangularMult<!SIDE,NORM> (Trans(T11), Trans(T21));
429
- MultTriangular<SIDE,NORM> (T21, T11);
430
- // triginv_L2.Stop();
431
- }
432
- else
433
- {
434
- T12 *= -1;
435
- // triginv_R1.Start();
436
- TriangularMult<SIDE,NORM> (T11, T12);
437
- // triginv_R1.Stop();
438
- // triginv_R2.Start();
439
- // TriangularMult<!SIDE,NORM> (Trans(T22), Trans(T12));
440
- MultTriangular<SIDE,NORM> (T12, T22);
441
- // triginv_R2.Stop();
442
- }
443
- }
444
-
445
- template <TRIG_SIDE SIDE, TRIG_NORMAL NORM=NonNormalized, typename TT,
446
- typename enable_if<IsConvertibleToSliceMatrix<TT>(),int>::type = 0>
447
- void TriangularInvert (const TT & T)
448
- {
449
- TriangularInvert<SIDE,NORM> (make_SliceMatrix(T));
450
- }
451
-
452
-
453
-
454
-
455
-
456
- extern NGS_DLL_HEADER void CalcLU (SliceMatrix<double> A, FlatArray<int> p);
457
- extern NGS_DLL_HEADER void InverseFromLU (SliceMatrix<double> A, FlatArray<int> p);
458
- extern NGS_DLL_HEADER void SolveFromLU (SliceMatrix<double> A, FlatArray<int> p, SliceMatrix<double,ColMajor> X);
459
- extern NGS_DLL_HEADER void SolveTransFromLU (SliceMatrix<double> A, FlatArray<int> p, SliceMatrix<double,ColMajor> X);
460
-
461
-
462
-
463
-
464
- }
465
- #endif