Search published articles

Showing 3 results for Mehanpour

H. Rahami, A. Kaveh, H. Mehanpour,
Volume 2, Issue 2 (6-2012)
Abstract

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the non-regular part of such model are ordered followed by ordering the nodes of the regular part. With this ordering the graph matrices will be separated into two blocks. The eigensolution of the non-regular part can be performed by an iterative method, and those of the regular part can easily be calculated using decomposition approaches studied in our previous articles. Some numerical examples are included to illustrate the efficiency of the new method.
H. Rahami, A. Kaveh , H. Mehanpour,
Volume 3, Issue 3 (9-2013)
Abstract

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the non-regular part of such model are ordered followed by ordering the nodes of the regular part. With this ordering the graph matrices will be separated into two blocks. The eigensolution of the non-regular part can be performed by an iterative method, and those of the regular part can easily be calculated using decomposition approaches studied in our previous articles. Some numerical examples are included to illustrate the efficiency of the new method.
P. Hosseini, H. R. Hoseini Vaez, M. A. Fathali, H. Mehanpour,
Volume 10, Issue 3 (6-2020)
Abstract

Due to the random nature of the variables affecting the analysis and design of structures, the reliability method is considered as one of the most important and widely used topics in structural engineering. Despite the simplicity of moment methods, the answer to problems with multiple design points (the point with the highest probability of failure) such as transmission line towers depends a lot on the starting point of the search; and it may converge to the local optima answer which is not desirable. Simulation methods also require a large number of evaluations of the limit state function and increase the volume and time of calculations. Also, the design point is not calculated in most of these methods. In this study, the reliability index of four transmission line towers was calculated with four metaheuristic algorithms in which the limit state function was defined based on the displacement of nodes and the results were compared with the results of Monte Carlo Simulation (MCS) method. For this purpose, the objective function was defined as the geometric distance between the point on the function of the boundary condition to the origin in the standard normal coordinate system and the constraint of the problem (the limit state function) based on the displacement of the nodes. Random variables in these problems consisting of the cross-sectional area of the members, the modulus of elasticity, and the nodal loads.

 Page 1 from 1

© 2023 CC BY-NC 4.0 | Iran University of Science & Technology

Designed & Developed by : Yektaweb