• Structural Engineering and Mechanics
• /
• v.72 no.2
• /
• pp.181-190
• /
• 2019

Topology optimization of structures seeking the best distribution of mass in a design space to improve the structural performance and reduce the weight of a structure is one of the most comprehensive issues in the field of structural optimization. In addition to structures stiffness as the most common objective function, frequency optimization is of great importance in variety of applications too. In this paper, an efficient multi-objective Bi-directional Evolutionary Structural Optimization (BESO) method is developed for topology optimization of frequency and stiffness in continuum structures simultaneously. A software package including a Matlab code and Abaqus FE solver has been created for the numerical implementation of multi-objective BESO utilizing the weighted function method. At the same time, by considering the weaknesses of the optimized structure in single-objective optimizations for stiffness or frequency problems, slight modifications have been done on the numerical algorithm of developed multi-objective BESO in order to overcome challenges due to artificial localized modes, checker boarding and geometrical symmetry constraint during the progressive iterations of optimization. Numerical results show that the proposed Multiobjective BESO method is efficient and optimal solutions can be obtained for continuum structures based on an existent finite element model of the structures.

• Journal of electromagnetic engineering and science
• /
• v.19 no.1
• /
• pp.6-12
• /
• 2019

An IE-FFT algorithm is implemented and applied to the electromagnetic (EM) solution of perfect electric conducting (PEC) scattering problems. The solution of the method of moments (MoM), based on the magnetic field integral equation (MFIE), is obtained for PEC objects with closed surfaces. The IE-FFT algorithm uses a uniform Cartesian grid to apply a global fast Fourier transform (FFT), which leads to significantly reduce memory requirement and speed up CPU with an iterative solver. The IE-FFT algorithm utilizes two discretizations, one for the unknown induced surface current on the planar triangular patches of 3D arbitrary geometries and the other on a uniform Cartesian grid for interpolating the free-space Green's function. The uniform interpolation of the Green's functions allows for a global FFT for far-field interaction terms, and the near-field interaction terms should be adequately corrected. A 3D block-Toeplitz structure for the Lagrangian interpolation of the Green's function is proposed. The MFIE formulation with the IE-FFT algorithm, without the help of a preconditioner, is converged in certain iterations with a generalized minimal residual (GMRES) method. The complexity of the IE-FFT is found to be approximately $O(N^{1.5})$and $O(N^{1.5}logN)$ for memory requirements and CPU time, respectively.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.395-411
• /
• 2012

Several methods with order higher than that of Newton methods which are of order 2 have been reported in literature for solving nonlinear equations. The focus of most of these methods was to economize on/minimize the number of function evaluations per iterations. We have demonstrated here that there are several computational pit-falls, such as the violation of fixed-point theorem, that one could encounter while using these methods. Further it was also shown that the overall computational complexity could be more in these high-order methods than that in the second-order Newton method.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.34D no.8
• /
• pp.15-25
• /
• 1997

The integration method of carier concentrations to redcue the discretization error of th box integratio method used in the discretization of the three-dimensional poisson's equation is presented. The carrier concentration is approximated in the closed form as an exponential function of the linearly varying potential in the element. The presented method is implemented in the three-dimensional poisson's equation solver running under the windows 95. The accuracy and the convergence chaacteristics of the three-dimensional poisson's equation solver are compared with those of DAVINCI for the PN junction diode and the n-MOSFET under the thermal equilibrium and the DC reverse bias. The potential distributions of the simulatied devices from the three-dimensional poisson's equation solver, compared with those of DAVINCI, has a relative error within 2.8%. The average number of iterations needed to obtain the solution of the PN junction diode and the n-MOSFET using the presented method are 11.47 and 11.16 while the those of DAVINCI are 21.73 and 23.0 respectively.

• Journal of computational fluids engineering
• /
• v.4 no.1
• /
• pp.34-40
• /
• 1999

Drag reduction on vehicles are the main concern for the body shape designers in order to lower the fuel consumption rate and to aid the driving stability. The drag of bluff bodies like transportation vehicles is mostly pressure drag due to the flow separation, which can be minimized by controlling the location and size of the separation bubble. In the present study, the TURBO-3D code is incorporated with optimal algorithm based on analytical approximation method to obtain an optimal afterbody shape of the MIRA Model corresponding to the lowest drag coefficient. For this purpose three mutually independent afterbody angles are chosen as design variables, while the drag coefficient is chosen as an objective function. It is demonstrated in the present study that an optimal body shape having the lowest drag coefficient which is about 6% lower than that of the original shape has been successfully obtained within number of iterations of tile optimal design loop.

• Research in Mathematical Education
• /
• v.8 no.4
• /
• pp.261-277
• /
• 2004

Julia sets, their variants and generalizations have been studied extensively by using the Picard iterations. The purpose of this paper is to introduce Mann iterative procedure in the study of Julia sets. Escape criterions with respect to this process are obtained for polynomials in the complex plane. New escape criterions are significantly much superior to their corresponding cousins. Further, new algorithms are devised to compute filled Julia sets. Some beautiful and exciting figures of new filled Julia sets are included to show the power and fascination of our new venture.

• Structural Engineering and Mechanics
• /
• v.37 no.5
• /
• pp.543-560
• /
• 2011

In structural engineering there are randomness inherently exist on determination of the loads, strength, geometry, and so on, and the manufacturing of the structural members, workmanship etc. Thus, objective and constraint functions of the optimization problem are functions that depend on those randomly natured components. The constraints being the function of the random variables are evaluated by using reliability index or performance measure approaches in the optimization process. In this study, the minimum weight of a space truss is obtained under the uncertainties on the load, material and cross-section areas with harmony search using reliability index and performance measure approaches. Consequently, optimization algorithm produces the same result when both the approaches converge. Performance measure approach, however, is more efficient compare to reliability index approach in terms of the convergence rate and iterations needed.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.05a
• /
• pp.67-74
• /
• 1998

Reducing drag of vehicles are the main concern for the body shape designers in order to lower fuel consumption rate and to aid the driving stability. The drag of bluff bodies like transportation vehicles is mostly pressure drag due to the flow separation, which can minimized by controlling the location and size of the separation bubble. In the present study, the TURBO-3D code is incorporated with optimal algorithm based on analytical approximation method to obtain optimal afterbody shape of the MIRA Model corresponding to the lowest drag coefficient. For this purpose three mutually independent afterbody angles are chosen as design variables, while the drag coefficient is chosen as an objective function. It is demonstrated in the present study that an optimal body shape having lowest drag coefficient which is about $6\%$ lower than that of the original shape has been successfully obtained within number of iterations of the optimal design loop.

• Korean Journal of Mathematics
• /
• v.16 no.4
• /
• pp.481-494
• /
• 2008

Iteration functions $K_m(z)$ and $U_m(z)$, $m{\geq}2$are defined recursively using the determinant of a matrix. We show that the fixed-iterations of $K_m(z)$ and $U_m(z)$ converge to a simple zero with order of convergence m and give closed form expansions of $K_m(z)$ and $U_m(z)$: To show the convergence, we derive a recursion formula for $L_m$ and then apply the idea of Ford or Pomentale. We also find a Toeplitz matrix whose determinant is $L_m(z)/(f^{\prime})^m$, and then we adapt the well-known results of Gerlach and Kalantari et.al. to give closed form expansions.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.15-20
• /
• 2015

In this paper, we propose a modified fuzzy clustering algorithm which can overcome the center deviation due to the Euclidean distance commonly used in fuzzy clustering. Among fuzzy clustering methods, Fuzzy C-Means (FCM) is the most well-known clustering algorithm and has been widely applied to various problems successfully. In FCM, however, cluster centers tend leaning to high density clusters because the Euclidean distance measure forces high density cluster to make more contribution to clustering result. Proposed is an enhanced algorithm which modifies the objective function of FCM by adding a center-scattering term to make centers not to be close due to the cluster density. The proposed method converges more to real centers with small number of iterations compared to FCM. All the strengths can be verified with experimental results.