• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.8
• /
• pp.1281-1286
• /
• 2003

A line search algorithm to increase a convergence in Newton's method is developed and applied to nonlinear finite element analysis. The algorithm is based on the slack line search theory which is an efficient algorithm to determine initial acceleration coefficient, variable backtracking algorithm proposed by some researchers, and convergence criterion based on residual norm. Also, it is capable of avoiding exceptional diverging conditions. Developed program is tested in metal forming simulation such as forging and ring rolling. Numerical result shows the validity of the algorithm for a highly nonlinear system .

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.10a
• /
• pp.115-124
• /
• 2000

An efficient multi-level (EML) optimization algorithm using discrete variables of framed structures is proposed in this paper. For the efficiency of the proposed algorithm multi-level optimization techniques using a decomposition method that separates both system-level and element-level are incorporated in the algorithm In the system-level, to save the numerical efforts an efficient reanalysis technique through approximated structural responses such as moments and frequencies with respect to intermediate variables is proposed in the paper. Sensitivity analysis of dynamic structural response is executed by automatic differentiation (AD) that is a powerful technique for computing complex or implicit derivatives accurately and efficiently with minimal human effort. In the element-level, to use AISC W-sections a section search algorithm is introduced. The efficiency and robustness of the EML algorithm, compared with a conventional multi-level (CML) algorithm and single-level genetic algorithm is successfully demonstrated in the numerical examples.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.187-200
• /
• 2012

In this paper, we introduced a new extended extragradient iteration algorithm for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of equilibrium problems for a monotone and Lipschitz-type continuous mapping. And we show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Structural Engineering and Mechanics
• /
• v.3 no.3
• /
• pp.289-297
• /
• 1995

A finite element algorithm for consideration of contact constraints is presented. It is characterized by introducing the geometric constraints, resulting from contact conditions, directly into the algebraic system of equations for the incremental displacements of an incremental iterative solution procedure. The usefulness of the proposed algorithm for efficient solutions of contact problems involving large displacements and large strains is demonstrated in the numerical investigation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.3
• /
• pp.373-384
• /
• 2000

To assess the safety of nonlinear steel frame structures subjected to short duration dynamic loadings, especially seismic loading, a nonlinear time domain reliability analysis procedure is proposed in the context of the stochastic finite element concept. In the proposed algorithm, the finite element formulation is combined with concepts of the response surface method, the first order reliability method, and the iterative linear interpolation scheme. This leads to the stochastic finite element concept. Actual earthquake loading time-histories are used to excite structures, enabling a realistic representation of the loading conditions. The assumed stress-based finite element formulation is used to increase its efficiency. The algorithm also has the potential to evaluate the risk associated with any linear or nonlinear structure that can be represented by a finite element algorithm subjected to seismic loading or any short duration dynamic loading. The algorithm is explained with help of an example and verified using the Monte Carlo simulation technique.

• Agricultural and Biosystems Engineering
• /
• v.1 no.1
• /
• pp.22-29
• /
• 2000

The development of bio-response feedback control system known as the speaking plant approach has been a challenging task for plant production engineers and scientists. In order to achieve the aim of developing such a bio-response feedback control system, the primary concern should be to develop a practical non-invasive technique for monitoring plant growth. Those who are skilled in raising plants can sense whether their plants are under adequate water conditions or not, for example, by merely observing minor color and tone changes before the plants wilt. Consequently, using machine vision, it may be possible to recognize changes in indices that describe plant conditions based on the appearance of growing plants. The interpretation of image information of plants may be based on image features extracted from the original pictorial image. In this study, the performance of a finite element retina was optimized by a genetic algorithm. The optimized finite element retina was evaluated based on the performance of neural plant growth monitor that requires input data given by the finite element retina.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.270-277
• /
• 2003

In two dimensional mechanical design analysis, quadrilateral element mesh is preferred because it provides more accurate result than triangular element mesh. However, automation of quadrilateral element mesh generation is much more complex because of its geometrical complexities. In this study, an automatic quadrilateral element mesh generation algorithm based on the boundary normal offsetting method and the boundary decomposition method is developed. In so doing, nodes are automatically placed using the boundary normal offsetting method and the decomposition method is applied to decompose the designed domain into a set of convex subdomains. The generated elements are improved by relocation of the existing nodes based on the four criteria - uniformity, aspect ratio, skewness and taper degree. The developed algorithm requires minimal user inputs such as boundary data and the distance between nodes.

• Journal of Ocean Engineering and Technology
• /
• v.11 no.4
• /
• pp.90-101
• /
• 1997

A hybrid element method is presented for two-dimensional diffraction problem of water waves. In this method, only a limited fluid domain close to irregular bodies is discretized into conventional finite elements, while the remaining infinite domain is treated as one element with analytical representations of high accuracy. A finite element grid is automatically generated by using Dealunay triangulation based on the Bowyer's algorithm and a linear system of equations is approximately solved with the ILU-CGS algorithm. To validate the present scheme, Computational results are compared with the existing experimental data and other numerical solutions.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.412-417
• /
• 2008

In a traditional topology optimization method, material properties are usually distributed by finite element density and visualized by a gray level image. The distribution method based on element density is adequate for a great mass of 2-D topology optimization problems. However, when it is used for 3-D topology optimization, it is always difficult to obtain a smooth model representation, and easily appears a virtualconnect phenomenon especially in a low-density domain. The 3-D structural topology optimization method has been developed using the node density instead of the element density that is based on SIMP (solid isotropic microstructure with penalization) algorithm. A computer code based on Matlab was written to validate the proposed method. When it was compared to the element density as design variable, this method could get a more uniform density distribution. To show the usefulness of this method, several typical examples of structure topology optimization are presented.

• Computers and Concrete
• /
• v.23 no.5
• /
• pp.311-320
• /
• 2019

The substructuring technique is one of the efficient methods for reducing computational effort and memory usage in the finite element method, especially in large-scale structures. Proper mesh partitioning plays a key role in the efficiency of the technique. In this study, new algorithms are proposed for mesh partitioning based on an element search technique. The computational cost function is optimized by aligning each element of the structure to a proper substructure. The genetic algorithm is employed to minimize the boundary nodes of the substructures. Since the boundary nodes have a vital performance on the mesh partitioning, different strategies are proposed for the few number of substructures and higher number ones. The mesh partitioning is optimized considering both computational and memory requirements. The efficiency and robustness of the proposed algorithms is demonstrated in numerous examples for different size of substructures.