iam-git / WellMet (public) (License: MIT) (since 2021-08-31) (hash sha1)
WellMet is pure Python framework for spatial structural reliability analysis. Or, more specifically, for "failure probability estimation and detection of failure surfaces by adaptive sequential decomposition of the design domain".
Clone URLs: https://rocketgit.com/user/iam-git/WellMet ssh://rocketgit@ssh.rocketgit.com/user/iam-git/WellMet git://git.rocketgit.com/user/iam-git/WellMet
release trunk
List of commits:
Subject Hash Author Date (UTC)
simplex._Sense: one more performance trick 59b423cca53b9975da67d876110927f233506de8 I am 2023-02-24 08:03:23
simplex: implement separability-based sensibility analysis (new brand _Sense class) 9c5d58f2301893ceaec1b0e90bff76035cfa15b2 I am 2023-02-23 18:49:11
dicebox.circumtri.CirQTri: switch to GaussCubatureIntegration 5b52dd25cb7a997af4953230116deb9efc577d56 I am 2023-02-11 04:32:48
simplex: implement GaussCubatureIntegration in the most memory-friendly way 689d253ae7e2a22242258fd5bef0a069caf7cf75 I am 2023-02-11 04:31:11
convex_hull.QHullCubature: implement memory-friendly outside (chi) integration ad8210a04b1e0903de7435cad16b1304707d0e6e I am 2023-02-09 22:22:05
qt_gui.qt_plot: require box recommendation to show next point 6f726047f7f08e884359020eaa1eac6f6cc125d2 I am 2023-02-09 11:51:44
dicebox.circumtri.CirQTri.get_circum_node: limit circumcenter by explore radius, not by just R 136ec73bb06da16c1f2bce64b3c349be4c8ba975 I am 2023-02-09 03:09:51
dicebox.circumtri: implement new brand CirQTri box 5879b8ad6317c65aa9481b59f76b6159f19e247a I am 2023-02-09 01:29:10
simplex.FullCubatureIntegration: store simplex probabilities in sorted dicts c0da90731ff3ede47d9b4eec0ad9b28a29027167 I am 2023-02-09 01:23:14
dicebox.circumtri: exploratory: even better idea 811ab11cd7172ff4a3807992f4928be2e8068ec0 I am 2023-02-08 15:31:23
dicebox.circumtri: exploratory, new idea 526d3f6185887ff48a341b0705d74dde4d15ca87 I am 2023-02-08 03:03:41
dicebox.circumtri: exploratory 806063d2e223c812280dc4845153450dd47faed3 I am 2023-02-06 17:15:15
dicebox.circumtri: exploratory efed2589f642d502f30e80f0e9b45dfeecd1c7c7 I am 2023-02-06 13:40:24
dicebox.circumtri: exploratory - again 34d3f4e47420e1c1e26b09570fb44d3270194751 I am 2023-02-06 12:50:45
qt_gui.qt_dicebox: change default q of circumtri classes 9fd5855e5d7cacf80d27fb383dd18a92d60e138b I am 2023-02-06 12:30:27
dicebox.circumtri: tune up exploratory rule one more time bfaa8d65bd13956252a6a25382c621aca7a33e3f I am 2023-02-06 12:05:00
convex_hull.QHull.is_outside: mark everything as outside until convex hull is created beecd924a63603868807a8a603cbeb04857e5cde I am 2023-02-06 12:03:35
dicebox.circumtri: get_exploratory_radius: turn it up some more ecd638ca90bac88df515cf803a103e350b08041e I am 2023-02-03 10:58:37
mplot: ongoing ad-hoc changes fd71b93abee959231ffd76324cf2fbc0b3bbbdfe I am 2023-02-02 17:59:27
dicebox.circumtri: change default q setting 2a9bdc6604113462a935d409bca429b49ac52cbc I am 2023-02-02 11:55:41
Commit 59b423cca53b9975da67d876110927f233506de8 - simplex._Sense: one more performance trick
Author: I am
Author date (UTC): 2023-02-24 08:03
Committer name: I am
Committer date (UTC): 2023-02-24 08:03
Parent(s): 9c5d58f2301893ceaec1b0e90bff76035cfa15b2
Signer:
Signing key:
Signing status: N
Tree: c2e665c7825a987b1490ceec1e9c49e88f8a4630
File Lines added Lines deleted
wellmet/simplex.py 19 8
File wellmet/simplex.py changed (mode: 100644) (index 78b03d6..a8edf6e)
... ... class _Sense:
298 298 self.A_ub[:, -1] = self.b_ub self.A_ub[:, -1] = self.b_ub
299 299 self.A_ub *= (self.failsi * 2 - 1).reshape(-1, 1) self.A_ub *= (self.failsi * 2 - 1).reshape(-1, 1)
300 300
301 simplices = sx.tri.simplices
302 self.mixed_mask = mixed_mask = sx.is_mixed(simplices)
301 303
302 304 event_ids = np.empty(sx.tri.nsimplex + 1, dtype=np.int8) event_ids = np.empty(sx.tri.nsimplex + 1, dtype=np.int8)
303 305 event_ids[:-1] = sx.get_events() event_ids[:-1] = sx.get_events()
304 306 event_ids[-1] = -1 event_ids[-1] = -1
305 307
306 self.neighbors_mask = event_ids[sx.tri.neighbors] == 2
308 neighbors = sx.tri.neighbors
309 neighbors_mask = event_ids[neighbors] == 2
310
311 #č v těch otačkách budeme potřebovat pořad dokola
312 self.neighbors_masked = neighbors_masked = dict() #defaultdict(list)
313 zip_iter = zip(range(len(mixed_mask)), mixed_mask, neighbors, neighbors_mask)
314 for id, is_mixed, neis, neis_mask in zip_iter:
315 if not is_mixed:
316 continue
317
318 neighbors_masked[id] = neis[neis_mask]
307 319
308 320
309 321
 
... ... class _Sense:
331 343 self._init() self._init()
332 344
333 345 simplices = sx.tri.simplices simplices = sx.tri.simplices
334 mixed_mask = sx.is_mixed(simplices)
346 mixed_mask = self.mixed_mask
335 347 #nmixed = np.count_nonzero(mixed_mask) #nmixed = np.count_nonzero(mixed_mask)
336 348
337 349
 
... ... class _Sense:
449 461 parsed.clear() parsed.clear()
450 462
451 463 simplices = sx.tri.simplices simplices = sx.tri.simplices
452 neighbors = sx.tri.neighbors
453 neighbors_mask = self.neighbors_mask
464 neighbors_masked = self.neighbors_masked
454 465
455 466 point_mask = self._point_mask point_mask = self._point_mask
456 467 point_mask[:] = False point_mask[:] = False
457 468
458 to_parse.update(neighbors[simplex_id][neighbors_mask[simplex_id]])
469 to_parse.update(neighbors_masked[simplex_id])
459 470 point_mask[simplices[simplex_id]] = True point_mask[simplices[simplex_id]] = True
460 471
461 472 for __i in range(depth): for __i in range(depth):
 
... ... class _Sense:
466 477 to_parse, parsed = parsed, to_parse to_parse, parsed = parsed, to_parse
467 478 to_parse.clear() to_parse.clear()
468 479 for id in parsed: # meant to be parsed in the cycle's end for id in parsed: # meant to be parsed in the cycle's end
469 to_parse.update(neighbors[id][neighbors_mask[id]])
480 to_parse.update(neighbors_masked[id])
470 481 point_mask[simplices[id]] = True point_mask[simplices[id]] = True
471 482 local_scope[id] = 0 local_scope[id] = 0
472 483
 
... ... class _Sense:
474 485 assert local_scope[simplex_id] == depth assert local_scope[simplex_id] == depth
475 486
476 487 npoints_now = np.count_nonzero(point_mask) npoints_now = np.count_nonzero(point_mask)
477 assert self.is_separable(vector, point_mask)
488 #assert self.is_separable(vector, point_mask)
478 489
479 490 #č běh smyčky je podmíněn tím, že má co dělat #č běh smyčky je podmíněn tím, že má co dělat
480 491 to_parse -= local_scope.keys() to_parse -= local_scope.keys()
 
... ... class _Sense:
485 496 to_parse, parsed = parsed, to_parse to_parse, parsed = parsed, to_parse
486 497 to_parse.clear() to_parse.clear()
487 498 for id in parsed: # meant to be parsed in the cycle's end for id in parsed: # meant to be parsed in the cycle's end
488 to_parse.update(neighbors[id][neighbors_mask[id]])
499 to_parse.update(neighbors_masked[id])
489 500 point_mask[simplices[id]] = True point_mask[simplices[id]] = True
490 501 local_scope[id] = -1 local_scope[id] = -1
491 502
Hints:
Before first commit, do not forget to setup your git environment:
git config --global user.name "your_name_here"
git config --global user.email "your@email_here"

Clone this repository using HTTP(S):
git clone https://rocketgit.com/user/iam-git/WellMet

Clone this repository using ssh (do not forget to upload a key first):
git clone ssh://rocketgit@ssh.rocketgit.com/user/iam-git/WellMet

Clone this repository using git:
git clone git://git.rocketgit.com/user/iam-git/WellMet

You are allowed to anonymously push to this repository.
This means that your pushed commits will automatically be transformed into a merge request:
... clone the repository ...
... make some changes and some commits ...
git push origin main