A new computation scheme proposed to tackle commensurate problems is devel- oped by modifying the semi-analytic approach for minimizing computational complexity. Using the proposed scheme, the limit state equations, u...A new computation scheme proposed to tackle commensurate problems is devel- oped by modifying the semi-analytic approach for minimizing computational complexity. Using the proposed scheme, the limit state equations, usually referred to as the failure surface, are obtained from transformation of an interval variable to a normalized one. In order to minimize the computational cost, two algorithms for optimizing the calculation steps have been proposed. The monotonicity of the objective function can be determined from narrowing the scope of interval variables in normalized infinite space by incorporating the algorithms into the computational scheme. Two examples are used to illustrate the operation and computational efficiency of the approach. The results of these examples show that the proposed algorithms can greatly reduce the computation complexity without sacrificing the computational accuracy. The advantage of the proposed scheme can be even more efficient for analyzing sophistic structures.展开更多
基金supported by the National Natural Science Foundation of China (No.10972084)
文摘A new computation scheme proposed to tackle commensurate problems is devel- oped by modifying the semi-analytic approach for minimizing computational complexity. Using the proposed scheme, the limit state equations, usually referred to as the failure surface, are obtained from transformation of an interval variable to a normalized one. In order to minimize the computational cost, two algorithms for optimizing the calculation steps have been proposed. The monotonicity of the objective function can be determined from narrowing the scope of interval variables in normalized infinite space by incorporating the algorithms into the computational scheme. Two examples are used to illustrate the operation and computational efficiency of the approach. The results of these examples show that the proposed algorithms can greatly reduce the computation complexity without sacrificing the computational accuracy. The advantage of the proposed scheme can be even more efficient for analyzing sophistic structures.
