• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.5-7
• /
• 2004

Significant progress has been achieved in the active control of civil-engineering structures, not only in the control algorithm, but also in control testing of the scaled model and full-scale building. At the present time, most algorithms used in the active control of civil engineering structures are based on the various active control techniques. In this paper represents active control method, by using pole assignment for reducing structural vibration under excited load. Numerical simulations are performed to assess the effectiveness of pole assignment control system. The relative displacement of structure system is significantly reduced.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10a
• /
• pp.450-455
• /
• 1998

In this paper, finite element with embedded discontinuous line is introduced in order to avoid the difficulties of adding new nodal points along with crack growth in discrete crack model. With the discontinuous element using discontinuous shape function, stiffness matrix of finite element is derived and dual mapping technique for numerical integration is employed. Using the finite element program made with employed algorithms, algorithm is verified and fracture analysis of simple concrete beam is performed.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.5-16
• /
• 1999

We introduce a new projector for accelerating convergence of a symmetric eigenvalue problem Ax = x, and devise a power/Lanczos hybrid algorithm. Acceleration can be achieved by removing the hard-to-annihilate nonsolution eigencomponents corresponding to the widespread eigenvalues with modulus close to 1, by estimating them accurately using the Lanczos method. However, the additional Lanczos results can be obtained without expensive matrix-vector multiplications but a very small amount of extra work, by utilizing simple power-Lanczos interconversion algorithms suggested. Numerical experiments are given at the end.

• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.813-827
• /
• 1997

Multigrid methods for two first-order system least squares (FOSLS) using bilinear finite elements are developed for the pure traction problem of planar linear elasticity. They are two-stage algorithms that first solve for the gradients of displacement, then for the displacement itself. In this paper, concentration is given on solving for the gradients of displacement only. Numerical results show that the convergences are uniform even as the material becomes nearly incompressible. Computations for convergence rates are included.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.429-437
• /
• 2001

In [1, 2], described a Chebyshev series method for the numerical solution of integral equations with three automatic algorithms for computing tow regularization parameters, C/sub f/ and r. Here we describe a Fourier series expansion method for a class singular integral equations with Hilbert kernel and constant coefficients with using a new automatic algorithm.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.90-96
• /
• 2004

In this paper, we consider the joint replenishment problem of a one-warehouse, n-retailer system. We introduce a joint replenishment and delivery strategy of a warehouse and develop a mathematical model based on the proposed strategy. Two efficient algorithms are presented and compared using numerical examples. The proposed strategy is compared with the common cycle strategy for 1,600 randomly generated problems, and has been proven to be superior to the common cycle strategy.

• Communications for Statistical Applications and Methods
• /
• v.11 no.1
• /
• pp.139-151
• /
• 2004

Kim et al. (2002) developed public use SAS-based software for two-way stratification design, which is called SOCSLP We describe the details of a new approach implemented using SOCSLP and key differences between the approach and the sampling schemes of Sitter and Skinner (1994) and Winkler (2001). In addition, a numerical example is given to compare those methods with respect to the probabilities of selecting sample arrays.

• Communications for Statistical Applications and Methods
• /
• v.6 no.1
• /
• pp.53-68
• /
• 1999

To improve the slow convergence property of the steepest ascent type algorithm for continuous D-optimal design problems. we develop a new algorithm. We apply the nonlinear system of equations as the necessary condition of optimality and develop the two-point algorithm that solves the problem of clustering. Because of the nature of the steepest coordinate ascent algorithm avoiding the problem of clustering itself helps the improvement of convergence speed. The numerical examples show the performances of the new method is better than those of various steepest ascent algorithms.

• Journal of the Korean Vacuum Society
• /
• v.5 no.2
• /
• pp.99-106
• /
• 1996

Two types of regularization method (singular system and HMP approaches) for generating depth-concentration profiles from angle-resolved XPS data were evaluated. Both approaches showed qualitatively similar results although they employed different numerical algorithms. The application of the regularization method to simulated data demonhstrates its excellent utility for the complex depth profile system . It includes the stable restoration of depth-concentration profiles from the data with considerable random error and the self choice of smoothing parameter that is imperative for the successful application of the regularization method. The self choice of smoothing parameter is based on generalized cross-validation method which lets the data themselves choose the optimal value of the parameter.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.85-88
• /
• 1996

We develop an efficient technique of controlling chaos using M-step ahead prediction with the OGY method. It has smaller transient time than the OGY method, and prevents burst phenomena that occur in noisy environment. This technique is very simple and needs small memory compared with targeting algorithms. Numerical examples show that the proposed algorithm has good performance, especially in noisy environment.