Novel computational mathematical algorithms for structural optimization using graph-theoretical methods

Abstract

Purpose

The purpose is to reduce round-off errors in numerical simulations. In the numerical simulation, different kinds of errors may be created during analysis. Round-off error is one of the sources of errors. In numerical analysis, sometimes handling numerical errors is challenging. However, by applying appropriate algorithms, these errors are manageable and can be reduced. In this study, five novel topological algorithms were proposed in setting up a structural flexibility matrix, and five different examples were used in applying the proposed algorithms. In doing so round-off errors were reduced remarkably.

Design/methodology/approach

Five new algorithms were proposed in order to optimize the conditioning of structural matrices. Along with decreasing the size and duration of analyses, minimizing analytical errors is a critical factor in the optimal computer analysis of skeletal structures. Appropriate matrices with a greater number of zeros (sparse), a well structure and a well condition are advantageous for this objective. As a result, a problem of optimization with various goals will be addressed. This study seeks to minimize analytical errors such as rounding errors in skeletal structural flexibility matrixes via the use of more consistent and appropriate mathematical methods. These errors become more pronounced in particular designs with ill-suited flexibility matrixes; structures with varying stiffness are a frequent example of this. Due to the usage of weak elements, the flexibility matrix has a large number of non-diagonal terms, resulting in analytical errors. In numerical analysis, the ill-condition of a matrix may be resolved by moving or substituting rows; this study examined the definition and execution of these modifications prior to creating the flexibility matrix. Simple topological and algebraic features have been mostly utilized in this study to find fundamental cycle bases with particular characteristics. In conclusion, appropriately conditioned flexibility matrices are obtained, and analytical errors are reduced accordingly.

Findings

(1) Five new algorithms were proposed in order to optimize the conditioning of structural flexibility matrices. (2) A JAVA programming language was written for all five algorithms and a friendly GUI software tool is developed to visualize sub-optimal cycle bases. (3) Topological and algebraic features of the structures were utilized in this study.

Research limitations/implications

This is a multi-objective optimization problem which means that sparsity and well conditioning of a matrix cannot be optimized simultaneously. In conclusion, well-conditioned flexibility matrices are obtained, and analytical errors are reduced accordingly.

Practical implications

Engineers always finding mathematical modeling of real-world problems and make them as simple as possible. In doing so, lots of errors will be created and these errors could cause the mathematical models useless. Applying decent algorithms could make the mathematical model as precise as possible.

Social implications

Errors in numerical simulations should reduce due to the fact that they are toxic for real-world applications and problems.

Originality/value

This is an original research. This paper proposes five novel topological mathematical algorithms in order to optimize the structural flexibility matrix.

Citation

Shafiei Dizaji, F. and Shafiei Dizaji, M. (2022), "Novel computational mathematical algorithms for structural optimization using graph-theoretical methods", Engineering Computations, Vol. 39 No. 6, pp. 2391-2423. https://doi.org/10.1108/EC-09-2021-0547