• Corpus ID: 237572352

Graph-Theoretical Based Algorithms for Structural Optimization

  title={Graph-Theoretical Based Algorithms for Structural Optimization},
  author={Farzad Shafiei Dizaji and Mehrdad Shafiei Dizaji},
Five new algorithms were proposed in order to optimize well 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… 


Efficient finite element analysis by graph-theoretical force method; triangular and rectangular plate bending elements
The calculation of null basis for equilibrium matrix is the main part of finite elements analysis via force method. For an optimal analysis, the selected null basis matrices should be sparse and
Sparse null basis computations in structural optimization
SummaryWe study the computation of sparse null bases of equilibrium matrices in the context of the force method in structural optimization. Two classes of structural problems are considered. For the
Ill-Conditioned Stiffness Matrices
In practical applications of the stiffness matrix method to structural analysis problems, erroneous solutions are frequently obtained due to ill-conditioning of the stiffness matrix. In this study, a
Optimizing the conditioning of structural flexibility matrices
Abstract In order to improve the conditioning of flexibility matrices for skeletal structures, the relative stiffnesses of their members are incorporated in the process of selecting
Topological Aspects of Structural Linear Analysis: Improving the Conditioning of the Equations of Compatibility of a Multi‐Member Skeletal Structure by Use of the Knowledge of Topology
The selection of a system of cut releases which would render a continuous skeletal structure statically determinate is governed principally by the topological and geometric characteristics of the
Sparse self‐stress matrices for the finite element force method
A basic problem in the finite element force method is that of obtaining a sparse and banded self-stress matrix and a sparse and banded structure flexibility matrix.Traditionally the self-stress
On computational procedures for the force method
It is known that the matrix force method has certain advantages over the displacement method for a class of structural problems. It is also known that the force method, when carried out by the
The null space problem II. Algorithms
The Null Space Problem is that of finding a sparsest basis for the null space (null basis) of a $t \times n$ matrix of rank $t$. This problem was shown to be NP-hard in Coleman and Pothen (1985). In
Substructuring and Conditioning
In the numerical solution of any mathematical problem, the question of accuracy always arises. When a large system of equations is solved, no exact solution is usually available for making
SUMMARY The application of high speed digital computers in the rational analysis of statically indeterminate structures, and the significance of this application in airframe design, are discussed.