• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.267-280
• /
• 2009

In this paper we investigate a simple two-level additive Schwarz preconditioner for the P1 symmetric interior penalty Galerkin method of the Poisson equation on rectangular meshes. The construction is based on the decomposition of the global space of piecewise linear polynomials into the sum of local subspaces, each of which corresponds to an element of the underlying mesh, and the global coarse subspace consisting of piecewise constants. This preconditioner is a direct combination of the block Jacobi iteration and the cell-centered finite difference method, and thus very easy to implement. Explicit upper and lower bounds for the maximum and minimum eigenvalues of the preconditioned matrix system are derived and confirmed by some numerical experiments.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.4
• /
• pp.324-329
• /
• 2002

In this paper, the guaranteed cost filtering design method for linear time delay systems with convex bounded uncertainties in discrete-time case is presented. The uncertain parameters are assumed to be unknown but belonging to known convex compact set of polytotype less conservative than norm bounded parameter uncertainty. The main purpose is to design a stable filter which minimizes the guaranteed cost. The sufficient condition for the existence of filter, the guaranteed cost filter design method, and the upper bound of the guaranteed cost are proposed. Since the proposed sufficient conditions are LMI(linear matrix inequality) forms in terms of all finding variables, all solutions can be obtained simultaneously by means of powerful convex programming tools with global convergence assured. Finally, a numerical example is given to check the validity of the proposed method.

• Structural Engineering and Mechanics
• /
• v.69 no.1
• /
• pp.105-120
• /
• 2019

In this paper, a new efficient method for structural modal reanalysis is proposed, which can handle large finite element (FE) models requiring frequent design modifications. The global FE model is divided into a residual part not to be modified and a target part to be modified. Then, an automated matrix permutation and substructuring algorithm is applied to these parts independently. The reduced model for the residual part is calculated and saved in the initial analysis, and the target part is reduced repeatedly, whenever design modifications occur. Then, the reduced model for the target part is assembled with that of the residual part already saved; thus, the final reduced model corresponding to the new design is obtained easily and rapidly. Here, the formulation of the proposed method is derived in detail, and its computational efficiency and reanalysis ability are demonstrated through several engineering problems, including a topological modification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5507-5528
• /
• 2016

In computer vision, salient object is important to extract the useful information of foreground. With active contour analysis acting as the core in this paper, we propose a bottom-up saliency detection algorithm combining with the Bayesian model and the global color distribution. Under the supports of active contour model, a more accurate foreground can be obtained as a foundation for the Bayesian model and the global color distribution. Furthermore, we establish a contour-based selection mechanism to optimize the global-color distribution, which is an effective revising approach for the Bayesian model as well. To obtain an excellent object contour, we firstly intensify the object region in the source gray-scale image by a seed-based method. The final saliency map can be detected after weighting the color distribution to the Bayesian saliency map, after both of the two components are available. The contribution of this paper is that, comparing the Harris-based convex hull algorithm, the active contour can extract a more accurate and non-convex foreground. Moreover, the global color distribution can solve the saliency-scattered drawback of Bayesian model, by the mutual complementation. According to the detected results, the final saliency maps generated with considering the global color distribution and active contour are much-improved.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.6
• /
• pp.1542-1550
• /
• 2013

This paper presents new results on delay-dependent global exponential stability for uncertain linear systems with interval time-varying delay. Based on Lyapunov-Krasovskii functional approach, some novel delay-dependent stability criteria are derived in terms of linear matrix inequalities (LMIs) involving the minimum and maximum delay bounds. By using delay-partitioning method and the lower bound lemma, less conservative results are obtained with fewer decision variables than the existing ones. Numerical examples are given to illustrate the usefulness and effectiveness of the proposed method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.1
• /
• pp.23-32
• /
• 1998

A shape estimation is needed to control actively a smart structure. A method is, hence, proposed to predict the deformed shape of the structure subjected to unknown external load using the signal from sensors attached to the structure. The shape estimation is based on the relationship between the deformation of the structure and the signal from the sensors. The matrix containing the relationship between the deformation and signal is obtained using fictitious force or eigenvector of global stiffness matrix. Then the deformed shape can be predicted using the linear matrix and signal from sensors attached to the structure. To verify this method, experiment and FEM were performed and it was shown that the shape estimation method based on the fictitious force predicts deflections well and more accurately than that based on eigenvector.

• Steel and Composite Structures
• /
• v.22 no.2
• /
• pp.301-321
• /
• 2016

The objective of this paper is to investigate buckling behavior of composite laminated cylinders by using semi-analytical finite strip method. The shell is subjected to deformation-dependent loads which remain normal to the shell middle surface throughout the deformation process. The load stiffness matrix, which is responsible for variation of load direction, is also throughout the deformation process. The shell is divided into several closed strips with alignment of their nodal lines in the circumferential direction. The governing equations are derived based on the first-order shear deformation theory with Sanders-type of kinematic nonlinearity. Displacements and rotations of the shell middle surface are approximated by combining polynomial functions in the meridional direction and truncated Fourier series along with an appropriate number of harmonic terms in the circumferential direction. The load stiffness matrix, which is responsible for variation of load direction, is also derived for each strip and after assembling, global load stiffness matrix of the shell is formed. The numerical illustrations concern the pressure stiffness effect on buckling pressure under various conditions. The results indicate that considering pressure stiffness causes buckling pressure reduction which in turn depends on various parameters such as geometry and lay-ups of the shell.

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

The purpose of this thesis is to develop methods of designing robust LQR/LQG controllers for time-varying systems with real parametric uncertainties. Controller design that meet desired performance and robust specifications is one of the most important unsolved problems in control engineering. We propose a new framework to solve these problems using Linear Matrix Inequalities (LMls) which have gained much attention in recent years, for their computational tractability and usefulness in control engineering. In Robust LQR case, the formulation of LMI based problem is straightforward and we can say that the obtained solution is the global optimum because the transformed problem is convex. In Robust LQG case, the formulation is difficult because the objective function and constraint are all nonlinear, therefore these are not treatable directly by LMI. We propose a sequential solving method which consist of a block-diagonal approach and a full-block approach. Block-diagonal approach gives a conservative solution and it is used as a initial guess for a full-block approach. In full-block approach two LMIs are solved sequentially in iterative manner. Because this algorithm must be solved iteratively, the obtained solution may not be globally optimal.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.353-360
• /
• 2002

The objective of this study is to develop a technique that analyzes the global behavior of frame structures with local cracks. The technique is based on frame analysis and uses the stiffness matrix of cracked frame element. An algorithm proposed here analyzes a frame structure with local transverseedge cracks, considering the effects of crack length and location. Stress intensity factors are employed to calculate additional local compliance due to the cracks based on linear elastic fracture mechanics theory, and then this local compliance is utilized to derive the stiffness matrix of the cracked frame element. In order to verify the accuracy and reliability of the proposed approach, numerical results are compared with those of Finite Element Method for the cracked frame element, and the effects of single crack on the behavior of truss structure are also examined.

• Journal of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.1001-1016
• /
• 2019

We are concerned with optimization methods for the $L^2$-Wasserstein least squares problem of Gaussian measures (alternatively the n-coupling problem). Based on its equivalent form on the convex cone of positive definite matrices of fixed size and the strict convexity of the variance function, we are able to present an implementable (accelerated) gradient method for finding the unique minimizer. Its global convergence rate analysis is provided according to the derived upper bound of Lipschitz constants of the gradient function.