ngsolve 6.2.2501__cp312-cp312-macosx_10_15_universal2.whl → 6.2.2501.post37.dev1__cp312-cp312-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.dist-info → ngsolve-6.2.2501.post37.dev1.dist-info}/METADATA +2 -2
  3. ngsolve-6.2.2501.post37.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 -15
  237. ngsolve/eigenvalues.pyi +0 -30
  238. ngsolve/fem.pyi +0 -1707
  239. ngsolve/krylovspace.pyi +0 -301
  240. ngsolve/la.pyi +0 -1218
  241. ngsolve/ngslib.so +0 -0
  242. ngsolve/ngstd.pyi +0 -58
  243. ngsolve/nonlinearsolvers.pyi +0 -97
  244. ngsolve/preconditioners.pyi +0 -6
  245. ngsolve/solve.pyi +0 -108
  246. ngsolve/solvers.pyi +0 -14
  247. ngsolve/timestepping.pyi +0 -27
  248. ngsolve/timing.pyi +0 -54
  249. ngsolve/utils.pyi +0 -279
  250. ngsolve-6.2.2501.data/data/Netgen.icns +0 -0
  251. ngsolve-6.2.2501.data/data/bin/ngscxx +0 -17
  252. ngsolve-6.2.2501.data/data/bin/ngsld +0 -13
  253. ngsolve-6.2.2501.data/data/bin/ngsolve.tcl +0 -648
  254. ngsolve-6.2.2501.data/data/bin/ngspy +0 -2
  255. ngsolve-6.2.2501.data/data/share/ngsolve/beam.geo +0 -17
  256. ngsolve-6.2.2501.data/data/share/ngsolve/beam.vol +0 -240
  257. ngsolve-6.2.2501.data/data/share/ngsolve/chip.in2d +0 -41
  258. ngsolve-6.2.2501.data/data/share/ngsolve/chip.vol +0 -614
  259. ngsolve-6.2.2501.data/data/share/ngsolve/coil.geo +0 -12
  260. ngsolve-6.2.2501.data/data/share/ngsolve/coil.vol +0 -2560
  261. ngsolve-6.2.2501.data/data/share/ngsolve/coilshield.geo +0 -24
  262. ngsolve-6.2.2501.data/data/share/ngsolve/coilshield.vol +0 -3179
  263. ngsolve-6.2.2501.data/data/share/ngsolve/cube.geo +0 -19
  264. ngsolve-6.2.2501.data/data/share/ngsolve/cube.vol +0 -1832
  265. ngsolve-6.2.2501.data/data/share/ngsolve/d10_DGdoubleglazing.pde +0 -50
  266. ngsolve-6.2.2501.data/data/share/ngsolve/d11_chip_nitsche.pde +0 -40
  267. ngsolve-6.2.2501.data/data/share/ngsolve/d1_square.pde +0 -43
  268. ngsolve-6.2.2501.data/data/share/ngsolve/d2_chip.pde +0 -35
  269. ngsolve-6.2.2501.data/data/share/ngsolve/d3_helmholtz.pde +0 -22
  270. ngsolve-6.2.2501.data/data/share/ngsolve/d4_cube.pde +0 -46
  271. ngsolve-6.2.2501.data/data/share/ngsolve/d5_beam.pde +0 -74
  272. ngsolve-6.2.2501.data/data/share/ngsolve/d6_shaft.pde +0 -73
  273. ngsolve-6.2.2501.data/data/share/ngsolve/d7_coil.pde +0 -50
  274. ngsolve-6.2.2501.data/data/share/ngsolve/d8_coilshield.pde +0 -49
  275. ngsolve-6.2.2501.data/data/share/ngsolve/d9_hybridDG.pde +0 -72
  276. ngsolve-6.2.2501.data/data/share/ngsolve/doubleglazing.in2d +0 -27
  277. ngsolve-6.2.2501.data/data/share/ngsolve/doubleglazing.vol +0 -737
  278. ngsolve-6.2.2501.data/data/share/ngsolve/piezo2d40round4.vol.gz +0 -0
  279. ngsolve-6.2.2501.data/data/share/ngsolve/shaft.geo +0 -73
  280. ngsolve-6.2.2501.data/data/share/ngsolve/shaft.vol +0 -4291
  281. ngsolve-6.2.2501.data/data/share/ngsolve/square.in2d +0 -17
  282. ngsolve-6.2.2501.data/data/share/ngsolve/square.vol +0 -149
  283. ngsolve-6.2.2501.dist-info/RECORD +0 -304
  284. {ngsolve-6.2.2501.dist-info → ngsolve-6.2.2501.post37.dev1.dist-info}/LICENSE +0 -0
  285. {ngsolve-6.2.2501.dist-info → ngsolve-6.2.2501.post37.dev1.dist-info}/WHEEL +0 -0
  286. {ngsolve-6.2.2501.dist-info → ngsolve-6.2.2501.post37.dev1.dist-info}/top_level.txt +0 -0
@@ -1,720 +0,0 @@
1
- #ifndef FILE_CHOLESKY
2
- #define FILE_CHOLESKY
3
-
4
- /****************************************************************************/
5
- /* File: cholesky.hpp */
6
- /* Author: Joachim Schoeberl */
7
- /* Date: 25. Mar. 2000, 16. June 2002 */
8
- /****************************************************************************/
9
-
10
- #include "matrix.hpp"
11
-
12
- namespace ngbla
13
- {
14
-
15
- /**
16
- The Cholesky-factorization of a symmetric dense matrix.
17
- A = L D L^T
18
- */
19
- template <class T>
20
- class FlatCholeskyFactors
21
- {
22
- protected:
23
- /// matrix size
24
- int n;
25
- /// left factor
26
- T * lfact;
27
- /// inverse diagonal
28
- T * diag;
29
- public:
30
- // typedef typename mat_traits<T>::TV_COL TV;
31
- /// Factor the matrix A
32
- FlatCholeskyFactors (const FlatMatrix<T> & a, T * data)
33
- {
34
- diag = data;
35
- Factor (a);
36
- }
37
-
38
- /// Factor the matrix A
39
- FlatCholeskyFactors (const FlatMatrix<T> & a, LocalHeap & lh)
40
- {
41
- diag = (T*)lh.Alloc(sizeof(T)*RequiredMem(a.Height()));
42
- Factor (a);
43
- }
44
-
45
- ///
46
- NGS_DLL_HEADER void Factor (const FlatMatrix<T> & a);
47
- /// Multiply with the inverse of A
48
- template <typename TV1, typename TV2>
49
- // NGS_DLL_HEADER void Mult (SliceVector<TV> x, SliceVector<TV> y) const
50
- void Mult (TV1 && x, TV2 && y) const
51
- {
52
- // TV sum, val;
53
- // decltype (y(0)) sum, val;
54
-
55
-
56
- const T *pj;
57
-
58
- for (int i = 0; i < n; i++)
59
- y(i) = x(i);
60
-
61
- for (int i = 0; i < n; i++)
62
- {
63
- auto sum = y(i);
64
-
65
- pj = PRow(i);
66
- for (int j = 0; j < i; ++j)
67
- sum -= pj[j] * y(j);
68
-
69
- y(i) = sum;
70
- }
71
-
72
- for (int i = 0; i < n; i++)
73
- {
74
- auto sum = diag[i] * y(i);
75
- y(i) = sum;
76
- }
77
-
78
- for (int i = n-1; i >= 0; i--)
79
- {
80
- pj = PRow(i);
81
- auto val = y(i);
82
- for (int j = 0; j < i; ++j)
83
- y(j) -= pj[j] * val;
84
- }
85
- }
86
-
87
- /// Print factorization
88
- NGS_DLL_HEADER ostream & Print (ostream & ost) const;
89
-
90
-
91
- /// computes required memory
92
- static int RequiredMem (int n)
93
- { return n*(n+1)/2; }
94
-
95
- private:
96
- /// first element in row
97
- T * PRow (int i) const { return lfact + (i*(i-1)) / 2; }
98
- };
99
-
100
-
101
- /// output operator.
102
- template<typename T>
103
- inline std::ostream & operator<< (std::ostream & s, const FlatCholeskyFactors<T> & m)
104
- {
105
- m.Print (s);
106
- return s;
107
- }
108
-
109
-
110
-
111
- template <class T>
112
- class CholeskyFactors : public FlatCholeskyFactors<T>
113
- {
114
- public:
115
- /// Factor the matrix A
116
- CholeskyFactors (const FlatMatrix<T> & a)
117
- : FlatCholeskyFactors<T> (a, new T[this->RequiredMem(a.Height())])
118
- { ; }
119
- /// Delete memory
120
- ~CholeskyFactors ()
121
- {
122
- delete [] this->diag;
123
- }
124
- };
125
-
126
-
127
-
128
-
129
-
130
-
131
-
132
-
133
- // high performance LDL factorization as used for SparseCholesky
134
- /*
135
- template <typename T, ORDERING ORD>
136
- INLINE void MySubABt (SliceMatrix<T,ORD> a,
137
- SliceMatrix<T,ORD> b,
138
- SliceMatrix<T,ORD> c)
139
- {
140
- static Timer timer1("SparseCholesky::Factor gemm 1", NoTracing);
141
- static Timer timer2("SparseCholesky::Factor gemm 2", NoTracing);
142
- static Timer timer3("SparseCholesky::Factor gemm 3", NoTracing);
143
-
144
- // if (c.Height() < 10 && c.Width() < 10) // && a.Width() < 10)
145
- if (c.Height() < 10 || c.Width() < 10 || a.Width() < 10)
146
- // if (false)
147
- {
148
- // timer1.Start();
149
- c -= a * Trans(b);
150
- // timer1.Stop();
151
- // timer1.AddFlops(c.Height()*c.Width()*a.Width());
152
- }
153
- else
154
- {
155
- if (c.Height() < 128 && c.Width() < 128)
156
- // if (true)
157
- {
158
- // timer2.Start();
159
- // c -= a * Trans(b) | Lapack;
160
- ngbla::SubABt(a,b,c);
161
- // timer2.Stop();
162
- // timer2.AddFlops(c.Height()*c.Width()*a.Width());
163
- }
164
- else
165
- {
166
- timer3.Start();
167
- int nr = c.Height()/128+1;
168
- int nc = c.Width()/128+1;
169
- task_manager -> CreateJob
170
- ( [&] (const TaskInfo & ti)
171
- {
172
- int br = ti.task_nr % nr;
173
- int bc = ti.task_nr / nr;
174
- auto rowr = Range(c.Height()).Split (br, nr);
175
- auto colr = Range(c.Width()).Split (bc, nc);
176
- // c.Rows(rowr).Cols(colr) -= a.Rows(rowr) * Trans(b.Rows(colr)) | Lapack;
177
- ngbla::SubABt(a.Rows(rowr),b.Rows(colr), c.Rows(rowr).Cols(colr));
178
- }, nr*nc);
179
- timer3.AddFlops(c.Height()*c.Width()*a.Width());
180
- timer3.Stop();
181
- }
182
- }
183
- }
184
- */
185
-
186
-
187
- /*
188
- A B^t = L1 D1 0 L1^t B1
189
- B C = B1 L2 0 D2 L2^t
190
- */
191
-
192
- /*
193
- template <typename T, ORDERING ORD>
194
- void MySubADBt (SliceMatrix<T,ORD> A,
195
- SliceVector<T> diag,
196
- SliceMatrix<T,ORD> B,
197
- SliceMatrix<T,ORD> C)
198
- {
199
- Matrix<T,ORD> hB(B.Height(), B.Width());
200
- for (int i = 0; i < hB.Width(); i++)
201
- hB.Col(i) = diag(i) * B.Col(i);
202
- C -= A * Trans(hB);
203
- }
204
- */
205
-
206
-
207
- template <typename T, ORDERING ORD>
208
- INLINE void MySubADBt (SliceMatrix<T,ORD> a,
209
- SliceVector<T> diag,
210
- SliceMatrix<T,ORD> b,
211
- SliceMatrix<T,ORD> c,
212
- bool symmetric)
213
- {
214
- // static Timer timer1("SparseCholesky::Factor gemm 1", NoTracing);
215
- // static Timer timer2("SparseCholesky::Factor gemm 2", NoTracing);
216
- // static Timer timer3("SparseCholesky::Factor gemm 3", NoTracing);
217
-
218
- /*
219
- // if (c.Height() < 10 && c.Width() < 10) // && a.Width() < 10)
220
- if (c.Height() < 10 && c.Width() < 10 && a.Width() < 10)
221
- // if (false)
222
- {
223
- // timer1.Start();
224
- T hmem[100];
225
- FlatMatrix<T,ORD> hb(b.Height(), b.Width(), &hmem[0]);
226
- for (int i = 0; i < hb.Width(); i++)
227
- hb.Col(i) = diag(i) * b.Col(i);
228
- c -= a * Trans(hb);
229
- // timer1.Stop();
230
- // timer1.AddFlops(c.Height()*c.Width()*a.Width());
231
- }
232
- else
233
- */
234
- {
235
- if ( (c.Height() < 128 && c.Width() < 128) ||
236
- (size_t(c.Height())*c.Width()*a.Width() < 10000) )
237
- // if (true)
238
- {
239
- // timer2.Start();
240
- ngbla::SubADBt(a,diag,b,c);
241
- // timer2.Stop();
242
- // timer2.AddFlops(size_t(c.Height())*c.Width()*a.Width());
243
- }
244
- else
245
- {
246
- // timer3.Start();
247
- // int nr = c.Height()/128+1;
248
- // int nc = c.Width()/128+1;
249
-
250
- // constexpr int BH = 96;
251
- // constexpr int BW = 128;
252
- // avoid warning for capturing constexpr int, but still needed on MSVC 19.16
253
- IC<96> BH;
254
- IC<128> BW;
255
- int nr = (c.Height()+BH-1) / BH;
256
- int nc = (c.Width()+BW-1) / BW;
257
- task_manager -> CreateJob
258
- ( [a,b,c,diag,nr,symmetric,BH,BW] (const TaskInfo & ti)
259
- {
260
- size_t br = ti.task_nr % nr;
261
- size_t bc = ti.task_nr / nr;
262
- // auto rowr = Range(c.Height()).Split (br, nr);
263
- // auto colr = Range(c.Width()).Split (bc, nc);
264
- auto rowr = Range(BH*br, min(BH*(br+1), c.Height()));
265
- auto colr = Range(BW*bc, min(BW*(bc+1), c.Width()));
266
- if (symmetric)
267
- if (rowr.Next() <= colr.First())
268
- return; // need only lower half
269
-
270
- // c.Rows(rowr).Cols(colr) -= a.Rows(rowr) * Trans(b.Rows(colr)) | Lapack;
271
- ngbla::SubADBt(a.Rows(rowr),diag, b.Rows(colr), c.Rows(rowr).Cols(colr));
272
- }, nr*nc);
273
- // timer3.AddFlops(size_t(c.Height())*c.Width()*a.Width());
274
- // timer3.Stop();
275
- }
276
- }
277
- }
278
-
279
- template <typename T, ORDERING ORD>
280
- INLINE void MySubADBh (SliceMatrix<T,ORD> a,
281
- SliceVector<T> diag,
282
- SliceMatrix<T,ORD> b,
283
- SliceMatrix<T,ORD> c,
284
- bool symmetric)
285
- {
286
- Matrix<T,ORD> bconj(b.Height(), b.Width());
287
- bconj = Conj(b);
288
- MySubADBt (a, diag, SliceMatrix<T,ORD>(bconj), c, false); // symmetric);
289
- }
290
-
291
-
292
-
293
-
294
- // Solve for B1: B1 D1 L1^t = B
295
- template <typename T, ORDERING ORD>
296
- void CalcLDL_SolveL (SliceMatrix<T,ORD> L, SliceMatrix<T,ORD> B)
297
- {
298
- size_t n = L.Height();
299
- if (n == 1) return;
300
-
301
- if (n >= 2)
302
- {
303
- IntRange r1(0,n/2), r2(n/2,n);
304
- auto L1 = L.Rows(r1).Cols(r1);
305
- auto L21 = L.Rows(r2).Cols(r1);
306
- auto L2 = L.Rows(r2).Cols(r2);
307
- auto B1 = B.Cols(r1);
308
- auto B2 = B.Cols(r2);
309
-
310
- CalcLDL_SolveL(L1, B1);
311
- MySubADBt (B1, L1.Diag(), L21, B2, false);
312
- CalcLDL_SolveL(L2, B2);
313
- return;
314
- }
315
-
316
- static Timer t("LDL - Solve L work", NoTracing);
317
- t.Start();
318
- /*
319
- for (int i = 0; i < L.Height(); i++)
320
- for (int j = i+1; j < L.Height(); j++)
321
- for (int k = 0; k < B.Height(); k++)
322
- B(k,j) -= L(j,i) * B(k,i);
323
- // B.Col(j) -= L(j,i) * B.Col(i);
324
- */
325
- /*
326
- for (int k = 0; k < B.Height(); k++)
327
- for (int i = 0; i < L.Height(); i++)
328
- for (int j = i+1; j < L.Height(); j++)
329
- B(k,j) -= L(j,i) * B(k,i);
330
- */
331
- auto solve_row = [&] (size_t k)
332
- {
333
- auto Brow = B.Row(k);
334
- for (size_t i = 0; i < L.Height(); i++)
335
- for (size_t j = i+1; j < L.Height(); j++)
336
- Brow(j) -= L(j,i) * Brow(i);
337
- };
338
- if (B.Height() < 1000)
339
- for (size_t k = 0; k < B.Height(); k++)
340
- solve_row(k);
341
- else
342
- ParallelFor (B.Height(), solve_row);
343
-
344
- t.Stop();
345
- }
346
-
347
- // calc new A22-block
348
- // A2 -= B D B^t
349
- template <typename T, ORDERING ORD>
350
- void CalcLDL_A2 (SliceVector<T> diag, SliceMatrix<T,ORD> B, SliceMatrix<T,ORD> A2)
351
- {
352
- MySubADBt (B, diag, B, A2, true);
353
- }
354
-
355
- // calc new A22-block hermitsch
356
- // A2 -= B D B^h
357
- template <typename T, ORDERING ORD>
358
- void CalcLDL_A2H (SliceVector<T> diag, SliceMatrix<T,ORD> B, SliceMatrix<T,ORD> A2)
359
- {
360
- MySubADBh (B, diag, B, A2, true);
361
- }
362
-
363
-
364
-
365
- // Calc A = L D L^t
366
- template <typename T, ORDERING ORD>
367
- void CalcLDL (SliceMatrix<T,ORD> mat)
368
- {
369
- size_t n = mat.Height();
370
-
371
- if (n >= 2)
372
- {
373
- size_t n1 = n/2;
374
- auto L1 = mat.Rows(0,n1).Cols(0,n1);
375
- auto L2 = mat.Rows(n1,n).Cols(n1,n);
376
- auto B = mat.Rows(n1,n).Cols(0,n1);
377
- CalcLDL (L1);
378
- CalcLDL_SolveL (L1,B);
379
- CalcLDL_A2 (L1.Diag(),B,L2);
380
- CalcLDL (L2);
381
- return;
382
- }
383
-
384
- if (n == 1)
385
- {
386
- // auto hm = mat(0,0);
387
- // CalcInverse (hm, mat(0,0));
388
- mat(0,0) = Inv(mat(0,0));
389
- return;
390
- }
391
-
392
- /*
393
- not working anymore
394
- for (size_t i = 0; i < n; i++)
395
- {
396
- T dii = mat(i,i);
397
- T inv_dii;
398
- CalcInverse (dii, inv_dii);
399
- for (size_t j = i+1; j < n; j++)
400
- {
401
- T hji = mat(j,i);
402
- T hjiD = hji * inv_dii;
403
- mat(j,i) = hjiD;
404
- for (size_t k = i+1; k <= j; k++)
405
- mat(j,k) -= hji * Trans(mat(k,i));
406
- }
407
- }
408
- */
409
- }
410
-
411
-
412
- // Calc A = L D L^h
413
- template <typename T, ORDERING ORD>
414
- void CalcLDLH (SliceMatrix<T,ORD> mat)
415
- {
416
- size_t n = mat.Height();
417
-
418
- if (n >= 2)
419
- {
420
- size_t n1 = n/2;
421
- auto L1 = mat.Rows(0,n1).Cols(0,n1);
422
- auto L2 = mat.Rows(n1,n).Cols(n1,n);
423
- auto B = mat.Rows(n1,n).Cols(0,n1);
424
- CalcLDLH (L1);
425
- CalcLDL_SolveL (L1,B);
426
- CalcLDL_A2H (L1.Diag(),B,L2);
427
- CalcLDLH (L2);
428
- return;
429
- }
430
-
431
- if (n == 1)
432
- {
433
- // auto hm = mat(0,0);
434
- // CalcInverse (hm, mat(0,0));
435
- mat(0,0) = Inv(mat(0,0));
436
- return;
437
- }
438
- }
439
-
440
-
441
-
442
- template <typename T, ORDERING ORD>
443
- void SolveLDL (SliceMatrix<T,ORD> mat, FlatVector<T> sol)
444
- {
445
- size_t n = mat.Height();
446
-
447
- for (size_t i = 0; i < n; i++)
448
- {
449
- T tmp = mat(i,i)*sol(i);
450
- for (size_t j = i+1; j < n; j++)
451
- sol(j) -= mat(j,i) * tmp;
452
- }
453
-
454
- for (size_t i = 0; i < n; i++)
455
- sol(i) *= mat(i,i);
456
-
457
- for (size_t i = n; i--> 0; )
458
- {
459
- T hsum{0};
460
- for (size_t j = i+1; j < n; j++)
461
- hsum += mat(j,i)*sol(j);
462
- sol(i) -= mat(i,i) * hsum;
463
- }
464
- }
465
-
466
- template <typename T, ORDERING ORD>
467
- void SolveLDLH (SliceMatrix<T,ORD> mat, FlatVector<T> sol)
468
- {
469
- size_t n = mat.Height();
470
-
471
- for (size_t i = 0; i < n; i++)
472
- {
473
- T tmp = mat(i,i)*sol(i);
474
- for (size_t j = i+1; j < n; j++)
475
- sol(j) -= mat(j,i) * tmp;
476
- }
477
-
478
- for (size_t i = 0; i < n; i++)
479
- sol(i) *= mat(i,i);
480
-
481
- for (size_t i = n; i--> 0; )
482
- {
483
- T hsum{0};
484
- for (size_t j = i+1; j < n; j++)
485
- hsum += Conj(mat(j,i))*sol(j);
486
- sol(i) -= mat(i,i) * hsum;
487
- }
488
- }
489
-
490
-
491
-
492
-
493
-
494
-
495
- // invert lower left matrix
496
- template <typename T, ORDERING ORD>
497
- void CalcInverseL (FlatMatrix<T,ORD> mat)
498
- {
499
- // M = L^{-1}
500
- // i>j: (M L)(i,j) = M_ik L_kj = 0 j <= k <= i
501
- // M_ij L_jj + M_ik L_kj = 0 j < k <= i
502
- // M_ij = -1/{L_jj} sum j < k <= i: M_ik L_kj
503
-
504
- int n = mat.Height();
505
- STACK_ARRAY(T, mem, n);
506
- FlatVector<T> dinv(n, &mem);
507
-
508
- for (size_t i = 0; i < n; i++)
509
- // CalcInverse (mat(i,i), dinv(i));
510
- dinv(i) = Inv(mat(i,i));
511
-
512
- for (int i = n-1; i >= 0; i--)
513
- {
514
- mat(i,i) = dinv(i);
515
- for (int j = i-1; j >= 0; j--)
516
- {
517
- T sum(0.0);
518
- for (int k = j+1; k <= i; k++)
519
- sum += mat(i,k) * mat(k,j);
520
- mat(i,j) = -dinv(j) * sum;
521
- }
522
- }
523
- }
524
-
525
- // calculate inverse from LDL factorization
526
- template <typename T, ORDERING ORD>
527
- void CalcInverseLDL (FlatMatrix<T,ORD> mat)
528
- {
529
- size_t n = mat.Height();
530
- STACK_ARRAY(T,mem, n);
531
- FlatVector<T> dinv(n, &mem);
532
-
533
- for (size_t i = 0; i < n; i++)
534
- {
535
- // CalcInverse (mat(i,i), dinv(i));
536
- dinv(i) = Inv(mat(i,i));
537
- mat(i,i) = dinv(i);
538
- }
539
-
540
- CalcInverseL (mat);
541
-
542
- for (size_t i = 0; i < n; i++)
543
- for (size_t j = 0; j <= i; j++)
544
- {
545
- T sum = mat(i,j);
546
- for (int k = i+1; k < n; k++)
547
- sum += Trans(mat(k,i)) * dinv(k) * mat(k,j);
548
- mat(i,j) = sum;
549
- }
550
- for (size_t i = 0; i < n; i++)
551
- for (size_t j = i+1; j < n; j++)
552
- mat(i,j) = mat(j,i);
553
- }
554
-
555
-
556
-
557
-
558
-
559
-
560
- // Solve for B1: B1 D1 L1^t = B
561
- template <typename T, ORDERING ORD>
562
- void CalcLDLNew_SolveL (SliceMatrix<T,ORD> L, SliceMatrix<T,ORD> B)
563
- {
564
- size_t n = L.Height();
565
- if (n <= 1) return;
566
-
567
- IntRange r1(0,n/2), r2(n/2,n);
568
- auto L1 = L.Rows(r1).Cols(r1);
569
- auto L21 = L.Rows(r2).Cols(r1);
570
- auto L2 = L.Rows(r2).Cols(r2);
571
- auto B1 = B.Cols(r1);
572
- auto B2 = B.Cols(r2);
573
-
574
- CalcLDLNew_SolveL(L1, B1);
575
- // MySubADBt (B1, L1.Diag(), L21, B2, false);
576
- B2 -= B1 * Trans(L21);
577
- CalcLDLNew_SolveL(L2, B2);
578
- }
579
-
580
-
581
- // Calc A = L D^{-1} L^t
582
- template <typename T, ORDERING ORD>
583
- void CalcLDLNew (SliceMatrix<T,ORD> mat)
584
- {
585
- size_t n = mat.Height();
586
- if (n == 0) return;
587
- if (n == 1)
588
- {
589
- mat(0,0) = Inv(mat(0,0));
590
- // CalcInverse (mat(0,0));
591
- return;
592
- }
593
-
594
- size_t n1 = n/2;
595
- auto L1 = mat.Rows(0,n1).Cols(0,n1);
596
- auto L2 = mat.Rows(n1,n).Cols(n1,n);
597
- auto B = mat.Rows(n1,n).Cols(0,n1);
598
- CalcLDLNew (L1);
599
- CalcLDLNew_SolveL (L1,B);
600
- auto diag = L1.Diag();
601
- MySubADBt (B, diag, B, L2, true);
602
- /*
603
- for (int i = 0; i < B.Height(); i++)
604
- for (int j = 0; j < B.Height(); j++)
605
- for (int k = 0; k < B.Width(); k++)
606
- L2(i,j) -= diag(k)*B(i,k)*B(j,k);
607
- */
608
- CalcLDLNew (L2);
609
- ScaleCols(B, diag);
610
- /*
611
- for (int i = 0; i < B.Width(); i++)
612
- B.Col(i) *= diag(i);
613
- */
614
- }
615
-
616
-
617
-
618
- /*
619
- template <typename T, ORDERING ORD>
620
- void SolveLDLNew (SliceMatrix<T,ORD> mat, FlatVector<T> sol)
621
- {
622
- size_t n = mat.Height();
623
-
624
- for (size_t i = 0; i < n; i++)
625
- {
626
- T tmp = sol(i);
627
- for (size_t j = i+1; j < n; j++)
628
- sol(j) -= mat(j,i) * tmp;
629
- }
630
-
631
- for (size_t i = 0; i < n; i++)
632
- sol(i) *= mat(i,i);
633
-
634
- for (size_t i = n; i--> 0; )
635
- {
636
- T hsum{0};
637
- for (size_t j = i+1; j < n; j++)
638
- hsum += mat(j,i)*sol(j);
639
- sol(i) -= hsum;
640
- }
641
- }
642
- */
643
-
644
- template <typename T, ORDERING ORD>
645
- void SolveL (SliceMatrix<T,ORD> mat, FlatVector<T> sol)
646
- {
647
- size_t n = mat.Height();
648
- if (n <= 1) return;
649
-
650
- if (n < 32)
651
- {
652
- for (size_t i = 0; i < n; i++)
653
- {
654
- T tmp = sol(i);
655
- for (size_t j = i+1; j < n; j++)
656
- sol(j) -= mat(j,i) * tmp;
657
- }
658
- return;
659
- }
660
-
661
- IntRange r1(0,n/2), r2(n/2,n);
662
- auto L1 = mat.Rows(r1).Cols(r1);
663
- auto L21 = mat.Rows(r2).Cols(r1);
664
- auto L2 = mat.Rows(r2).Cols(r2);
665
- auto sol1 = sol.Range(r1);
666
- auto sol2 = sol.Range(r2);
667
-
668
- SolveL (L1, sol1);
669
- sol2 -= L21 * sol1;
670
- SolveL (L2, sol2);
671
- }
672
-
673
- template <typename T, ORDERING ORD>
674
- void SolveLT (SliceMatrix<T,ORD> mat, FlatVector<T> sol)
675
- {
676
- size_t n = mat.Height();
677
-
678
- if (n <= 1) return;
679
-
680
- if (n < 32)
681
- {
682
- for (size_t i = n; i--> 0; )
683
- {
684
- T hsum{0};
685
- for (size_t j = i+1; j < n; j++)
686
- hsum += mat(j,i)*sol(j);
687
- sol(i) -= hsum;
688
- }
689
- return;
690
- }
691
-
692
- IntRange r1(0,n/2), r2(n/2,n);
693
- auto L1 = mat.Rows(r1).Cols(r1);
694
- auto L21 = mat.Rows(r2).Cols(r1);
695
- auto L2 = mat.Rows(r2).Cols(r2);
696
- auto sol1 = sol.Range(r1);
697
- auto sol2 = sol.Range(r2);
698
-
699
- SolveLT (L2, sol2);
700
- sol1 -= Trans(L21) * sol2;
701
- SolveLT (L1, sol1);
702
- }
703
-
704
- template <typename T, ORDERING ORD>
705
- void SolveLDLNew (SliceMatrix<T,ORD> mat, FlatVector<T> sol)
706
- {
707
- size_t n = mat.Height();
708
-
709
- SolveL (mat, sol);
710
-
711
- auto diag = mat.Diag();
712
- for (size_t i = 0; i < n; i++)
713
- sol(i) *= diag(i);
714
-
715
- SolveLT (mat, sol);
716
- }
717
-
718
- }
719
-
720
- #endif