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 optimization a51f4ba65ad4a55ecc74fd82a6e011a4eeed8a5d I am 2023-02-26 15:21:23
qt_gui.qt_plot: implement sensitivity-related Arrows class b5365ae3ca3ab0ed8018e60d4e8711c5c30e4d96 I am 2023-02-26 14:31:10
simplex._Sense: rename "sensibility" to sensitivity a9d56d5386730263eb27e6e31f07b99bab0620fb I am 2023-02-26 14:29:54
g_models: add quadratic 013b4ddc108b94061eaebc1a10d18427f10a34d4 I am 2023-02-24 08:04:12
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
Commit a51f4ba65ad4a55ecc74fd82a6e011a4eeed8a5d - simplex._Sense: one more optimization
Author: I am
Author date (UTC): 2023-02-26 15:21
Committer name: I am
Committer date (UTC): 2023-02-26 15:21
Parent(s): b5365ae3ca3ab0ed8018e60d4e8711c5c30e4d96
Signer:
Signing key:
Signing status: N
Tree: dc4a3443a49e250db86614b7a6d68dece63074e7
File Lines added Lines deleted
wellmet/simplex.py 20 13
File wellmet/simplex.py changed (mode: 100644) (index f90847c..af2c23e)
... ... class _Sense:
285 285 self.failsi = sx.sample_box.failsi self.failsi = sx.sample_box.failsi
286 286 self.non_failsi = ~self.failsi self.non_failsi = ~self.failsi
287 287 self._point_mask = np.empty_like(self.failsi) self._point_mask = np.empty_like(self.failsi)
288 self._scalars = np.empty(len(self.failsi))
288 #self._scalars = np.empty(len(self.failsi))
289 289 self._boolmask = np.empty_like(self.failsi) self._boolmask = np.empty_like(self.failsi)
290 290
291 291
 
... ... class _Sense:
371 371 # in case of separation axis # in case of separation axis
372 372 # i.e. we should ignore it anyway # i.e. we should ignore it anyway
373 373 depth = depths[simplex_id] depth = depths[simplex_id]
374 if depth:
375 vector = vectors[simplex_id]
374 if simplex_id in vectors:
375 vector, scalars = vectors[simplex_id]
376 376 else: else:
377 377 vector = sx.get_simplex_normal(indices)[:-1] vector = sx.get_simplex_normal(indices)[:-1]
378 scalars = None
378 379
379 scope, normal = self.process_simplex(simplex_id, depth, vector)
380 scope, normal, scalars = self.process_simplex(simplex_id, depth, vector, scalars)
380 381
381 382 # scale to unit length # scale to unit length
382 383 length = np.sqrt(np.inner(normal, normal)) length = np.sqrt(np.inner(normal, normal))
 
... ... class _Sense:
388 389 global_gradient += normal * p_mixed global_gradient += normal * p_mixed
389 390 sensitivities += np.square(normal) * p_mixed sensitivities += np.square(normal) * p_mixed
390 391
392 #č tak. Teď do projděných simplexu píšeme jen vektor,
393 #č do těch, co ještě musíme projít - vektor a skalární součin
391 394 vectors[simplex_id] = normal vectors[simplex_id] = normal
392 395 new_depth = scope[simplex_id] new_depth = scope[simplex_id]
393 396 depths[simplex_id] = new_depth depths[simplex_id] = new_depth
394 397
395 398 if new_depth > depth: if new_depth > depth:
396 399 for id, new_depth in scope.items(): for id, new_depth in scope.items():
397 if (id > simplex_id) and (new_depth > depths[id]):
398 vectors[id] = normal
400 if (id > simplex_id) and (new_depth >= depths[id]):
401 vectors[id] = normal, scalars
399 402 depths[id] = new_depth depths[id] = new_depth
400 403
401 404
 
... ... class _Sense:
415 418
416 419
417 420
418 def is_separable(self, vector, point_mask):
421 def is_separable(self, scalars, point_mask):
419 422 #č postup se míří na 5-6D, #č postup se míří na 5-6D,
420 423 #č kde je mou snahou zbytečně nealokovat #č kde je mou snahou zbytečně nealokovat
421 424 #č na každém kolečku #č na každém kolečku
422 scalars = self._scalars
425 #scalars = self._scalars
423 426 #č vector je již bez poslední složky #č vector je již bez poslední složky
424 np.matmul(self.points, vector, out=scalars)
427 #np.matmul(self.points, vector, out=scalars)
425 428 mask = self._boolmask mask = self._boolmask
426 429
427 430 np.logical_and(point_mask, self.failsi, out=mask) np.logical_and(point_mask, self.failsi, out=mask)
 
... ... class _Sense:
444 447 return max_red < min_green return max_red < min_green
445 448
446 449
447 def process_simplex(self, simplex_id, depth, vector):
450 def process_simplex(self, simplex_id, depth, vector, scalars):
448 451 # self for this class, sensitivity-related things # self for this class, sensitivity-related things
449 452 # sx for general Triangulation class related attributes # sx for general Triangulation class related attributes
450 453 sx = self sx = self
451 454
455 points = self.points
452 456
453 457 local_scope = self._local_scope local_scope = self._local_scope
454 458 local_scope.clear() local_scope.clear()
 
... ... class _Sense:
506 510 npoints_before, npoints_now = npoints_now, np.count_nonzero(point_mask) npoints_before, npoints_now = npoints_now, np.count_nonzero(point_mask)
507 511 #if npoints_now == npoints_before: print("Sense: no new points to separate") #if npoints_now == npoints_before: print("Sense: no new points to separate")
508 512 if npoints_now > npoints_before: if npoints_now > npoints_before:
509 if not self.is_separable(vector, point_mask):
513 if scalars is None:
514 scalars = np.matmul(points, vector)
515 if not self.is_separable(scalars, point_mask):
510 516 result = self.get_separation_axis(point_mask) result = self.get_separation_axis(point_mask)
511 517 if not result.success: #č konec, zde končíme if not result.success: #č konec, zde končíme
512 518 if result.status != 2: # Problem appears to be infeasible. if result.status != 2: # Problem appears to be infeasible.
513 519 print("Sense: linprog ended with status %s" % result.status) print("Sense: linprog ended with status %s" % result.status)
514 return local_scope, vector
520 return local_scope, vector, scalars
515 521
516 522 #č hned odřízneme poslední složku - #č hned odřízneme poslední složku -
517 523 #č bude tam posunutí b aka offcet aka bias #č bude tam posunutí b aka offcet aka bias
518 524 vector = result.x[:-1] vector = result.x[:-1]
525 scalars = None
519 526
520 527 #č pokud jsme tu, tak vzorky byly separabilní, #č pokud jsme tu, tak vzorky byly separabilní,
521 528 #č je na čase "navysit" hloubku #č je na čase "navysit" hloubku
 
... ... class _Sense:
526 533 to_parse -= local_scope.keys() to_parse -= local_scope.keys()
527 534
528 535
529 return local_scope, vector
536 return local_scope, vector, scalars
530 537
531 538
532 539
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