This is an outdated version published on 2022-01-10. Read the most recent version.
Preprint / Version 1

Breadth-First Search Multi-Dimensional Binary Search Tree based Algorithms for Structural

##article.authors##

DOI:

https://doi.org/10.31224/osf.io/3xkm8

Keywords:

Binary search tree, Breadth-first search, Limit state surface, Performance function, Reliability index, Structural reliability estimation

Abstract

This research proposes a set of novel algorithms for structural reliability estimation based on muti-dimensional binary search tree and breadth-first search, namely the reliability accuracy supervised searching algorithm, the limit-state surface resolution supervised searching algorithm and the reliability index precision supervised fast searching algorithm. The proposed algorithms have the following strengths: 1, all the proposed algorithms have satisfactory computational efficiency by reducing redundant samplings; 2, their computational costs are stable and computable; 3, performance functions of high non-linearity can be will handled; 4, the reliability accuracy supervised searching algorithm can adapt its computational cost according to a prescribed accuracy; 5, the limit-state surface resolution supervised searching algorithm is able to probe sharp changes on limit-state surfaces; 6, the reliability index precision supervised fast searching algorithm computes the reliability index with sufficient precision in a fast way.

Downloads

Download data is not yet available.

Downloads

Posted

2022-01-10

Versions