• Title/Summary/Keyword: Penalty Method

Search Result 479, Processing Time 0.026 seconds

Development of Finite Element Domain Decomposition Method Using Local and Mixed Lagrange Multipliers (국부 및 혼합 Lagrange 승수법을 이용한 영역분할 기반 유한요소 구조해석 기법 개발)

  • Kwak, Jun Young;Cho, Hae Seong;Shin, Sang Joon;Bauchau, Olivier A.
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.25 no.6
    • /
    • pp.469-476
    • /
    • 2012
  • In this paper, a finite element domain decomposition method using local and mixed Lagrange multipliers for a large scal structural analysis is presented. The proposed algorithms use local and mixed Lagrange multipliers to improve computational efficiency. In the original FETI method, classical Lagrange multiplier technique was used. In the dual-primal FETI method, the interface nodes are used at the corner nodes of each sub-domain. On the other hand, the proposed FETI-local analysis adopts localized Lagrange multipliers and the proposed FETI-mixed analysis uses both global and local Lagrange multipliers. The numerical analysis results by the proposed algorithms are compared with those obtained by dual-primal FETI method.

An Improved RSR Method to Obtain the Sparse Projection Matrix (희소 투영행렬 획득을 위한 RSR 개선 방법론)

  • Ahn, Jung-Ho
    • Journal of Digital Contents Society
    • /
    • v.16 no.4
    • /
    • pp.605-613
    • /
    • 2015
  • This paper addresses the problem to make sparse the projection matrix in pattern recognition method. Recently, the size of computer program is often restricted in embedded systems. It is very often that developed programs include some constant data. For example, many pattern recognition programs use the projection matrix for dimension reduction. To improve the recognition performance, very high dimensional feature vectors are often extracted. In this case, the projection matrix can be very big. Recently, RSR(roated sparse regression) method[1] was proposed. This method has been proved one of the best algorithm that obtains the sparse matrix. We propose three methods to improve the RSR; outlier removal, sampling and elastic net RSR(E-RSR) in which the penalty term in RSR optimization function is replaced by that of the elastic net regression. The experimental results show that the proposed methods are very effective and improve the sparsity rate dramatically without sacrificing the recognition rate compared to the original RSR method.

Robust Design Optimization for Reducing Cogging Torque of a BLDC Motor through an Enhanced Taguchi Method (개선된 다구찌 기법을 이용한 BLDC 전동기의 코깅 토크 저감을 위한 강건 최적설계)

  • Lee, Chang-Uk;Kim, Dong-Wook;Kim, Dong-Hun
    • Journal of the Korean Magnetics Society
    • /
    • v.24 no.5
    • /
    • pp.160-164
    • /
    • 2014
  • In this paper, an efficient robust design utilizing an enhanced Taguchi method is proposed to reduce cogging torque of a BLDC motor in the presence of design uncertainty. To overcome defects of the conventional Taguchi method in dealing with a generalized robust design problem, a penalty function and an optimal level searching technique are newly introduced. In order to verify the proposed method, a 5 kW, rated speed of 2,300 rpm, rated torque of 20 Nm BLDC motor for driving electric vehicles is optimized. Then, the robust design is compared with conceptual and deterministic ones in terms of the cogging torque, rated torque and torque ripple.

Multiscale Wavelet-Galerkin Method in General Two-Dimensional Problems (일반 형상의 2차원 영역에서의 멀티스케일 웨이블렛-갤러킨 기법)

  • Kim, Yun-Yeong;Jang, Gang-Won;Kim, Jae-Eun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.5
    • /
    • pp.939-951
    • /
    • 2002
  • We propose a new multiscale Galerkin method based on interpolation wavelets for two-dimensional Poisson's and plane elasticity problems. The major contributions of the present work are: 1) full multiresolution numerical analysis is carried out, 2) general boundaries are handled by a fictitious domain method without using a penalty term or the Lagrange multiplier, 3) no special integration rule is necessary unlike in the (bi-)orthogonal wavelet-based methods, and 4) an efficient adaptive scheme is easy to incorporate. Several benchmark-type problems are considered to show the effectiveness and the potentials of the present approach. is 1-2m/s and impact deformation of the electrode depends on the strain rate at that velocity, the dynamic behavior of the sinter-forged Cu-Cr is a key to investigate the impact characteristics of the electrodes. The dynamic response of the material at the high strain rate is obtained from the split Hopkinson pressure bar test using disc-type specimens. Experimental results from both quasi-static and dynamic compressive tests are Interpolated to construct the Johnson-Cook model as the constitutive relation that should be applied to simulation of the dynamic behavior of the electrodes. The impact characteristics of a vacuum interrupter are investigated with computer simulations by changing the value of five parameters such as the initial velocity of a movable electrode, the added mass of a movable electrode, the wipe spring constant, initial offset of a wipe spring and the virtual fixed spring constant.

CU-based Merge Candidate List Construction Method for HEVC (HEVC를 위한 CU기반 병합 후보 리스트 구성 방법)

  • Kim, Kyung-Yong;Kim, Sang-Min;Park, Gwang-Hoon;Kim, Hui-Yong;Lim, Sung-Chang;Lee, Jin-Ho
    • Journal of Broadcast Engineering
    • /
    • v.17 no.2
    • /
    • pp.422-425
    • /
    • 2012
  • This paper proposes the CU-based approach for merge candidate list construction for providing reduced complexity and improved parallelism compared to the PU-based one. In the proposed method, a CU can have only one merge candidate list. So, Only one common merge candidate list is used for all PUs in a CU regardless of the PU partition type. The simulation results of proposed method showed that the encoder computational complexity was decreased by 3% to 6% and the decoder computational complexity was negligible change with the penalty of roughly 0.2% - 0.5% coding loss. The proposed method has several advantages: it provides simpler design, reduced complexity, and improved parallelism.

Research on Variable Girder Types and Tendon Arrangement of PSC Box Girder Bridges by using the Optimum Design (최적설계에 의한 PSC 박스 거더교의 변단면 거더유형과 긴장재 배치에 관한 연구)

  • Kim, Ki-Wook
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.10 no.3
    • /
    • pp.175-185
    • /
    • 2006
  • This study performed the optimum design of balanced and unbalanced span length bridges with many variable Girder types by using the optimum design program to minimize the cost for PSC box girder bridge of the full staging method. The objective of this study is to present tendon's application direction about complicated construction hereafter by studying about optimum tendon arrangement that is worked in each variable Girder type. This program used SUMT procedure and Kavlie's extended penalty function to allow infeasible design points in the process. Powell's direct method was used in searching design points and Gradient Approximate Method was used to reduce design hours.

3D Modeling and Inversion of Magnetic Anomalies (자력이상 3차원 모델링 및 역산)

  • Cho, In-Ky;Kang, Hye-Jin;Lee, Keun-Soo;Ko, Kwang-Beom;Kim, Jong-Nam;You, Young-June;Han, Kyeong-Soo;Shin, Hong-Jun
    • Geophysics and Geophysical Exploration
    • /
    • v.16 no.3
    • /
    • pp.119-130
    • /
    • 2013
  • We developed a method for inverting magnetic data to recover the 3D susceptibility models. The major difficulty in the inversion of the potential data is the non-uniqueness and the vast computing time. The insufficient number of data compared with that of inversion blocks intensifies the non-uniqueness problem. Furthermore, there is poor depth resolution inherent in magnetic data. To overcome this non-uniqueness problem, we propose a resolution model constraint that imposes large penalty on the model parameter with good resolution; on the other hand, small penalty on the model parameter with poor resolution. Using this model constraint, the model parameter with a poor resolution can be effectively resolved. Moreover, the wavelet transform and parallel solving were introduced to save the computing time. Through the wavelet transform, a large system matrix was transformed to a sparse matrix and solved by a parallel linear equation solver. This procedure is able to enormously save the computing time for the 3D inversion of magnetic data. The developed inversion algorithm is applied to the inversion of the synthetic data for typical models of magnetic anomalies and real airborne data obtained at the Geumsan area of Korea.

Topology Optimization of Incompressible Flow Using P1 Nonconforming Finite Elements (P1 비순응 요소를 이용한 비압축성 유동 문제의 위상최적화)

  • Jang, Gang-Won;Chang, Se-Myong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.10
    • /
    • pp.1139-1146
    • /
    • 2012
  • An alternative approach for topology optimization of steady incompressible Navier-Stokes flow problems is presented by using P1 nonconforming finite elements. This study is the extended research of the earlier application of P1 nonconforming elements to topology optimization of Stokes problems. The advantages of the P1 nonconforming elements for topology optimization of incompressible materials based on locking-free property and linear shape functions are investigated if they are also valid in fluid equations with the inertia term. Compared with a mixed finite element formulation, the number of degrees of freedom of P1 nonconforming elements is reduced by using the discrete divergence-free property; the continuity equation of incompressible flow can be imposed by using the penalty method into the momentum equation. The effect of penalty parameters on the solution accuracy and proper bounds will be investigated. While nodes of most quadrilateral nonconforming elements are located at the midpoints of element edges and higher order shape functions are used, the present P1 nonconforming elements have P1, {1, x, y}, shape functions and vertex-wisely defined degrees of freedom. So its implentation is as simple as in the standard bilinear conforming elements. The effectiveness of the proposed formulation is verified by showing examples with various Reynolds numbers.

Kinematic Analysis of Drag Flick Shooting Motion for Training Shooters Specializing in Penalty Corners in Women's Field Hockey: A Case Study (여자 필드하키 페널티코너 전문 슈터 양성을 위한 Drag Flick 슈팅 동작의 운동학적 분석: 사례 연구)

  • Park, Jongchul;Byun, Kyungseok;Kim, Eonho
    • Korean Journal of Applied Biomechanics
    • /
    • v.29 no.2
    • /
    • pp.43-51
    • /
    • 2019
  • Objective: This study aims to propose an efficient technical model through a kinematic analysis of field hockey drag flick shooting motion in laboratory situations and game situations and to build up the basic data on drag flick shooting technique through a comparative analysis of a Korean specialized shooter and specialized shooters of competing Asian countries. Method: This study selected one Korean female national specialized shooter and seven specialized shooters of competing countries, China, Japan, India, and Malaysia, who participated in the 2018 Asian Hockey Champions Trophy as research subjects. In exercise situations, a 3-D motion analysis utilizing an infrared camera was conducted, while in game situations, an image-based 3-D motion analysis utilizing a digital camera was conducted. Results: The Korean specialized shooter had smaller changes in the angles of the trunk and the stick in game situations than in exercise situations. She had a high angular velocity of the trunk and the stick head, and the maximum speed of the ball was high. The Korean specialized shooter had the maximum angular velocity of the trunk higher than the specialized shooters of the competing countries did, and the angular velocity of the stick head and the maximum speed of the ball were in the average level. Conclusion: As for drag flick shooting in game situations, changes in the angle of the trunk and the stick were small, and the angular velocity was high due to the pressure that the shooters should perform the motion fast with the defenders' interruptions, and this high angular velocity of the trunk and the stick head affected the movement of the ball. Thus, the maximum speed of the ball was higher in game situations than in exercise situations. The Korean specialized shooter had the maximum angular velocity higher than the specialized shooters of the competing countries did; however, the maximum speed of the ball was average, and it turned out that the maximum speed of the ball was associated with the angular velocity of the stick head in P3. Therefore, Korean specialized shooters need complementary training for a change to the torque of the stick head, using the strong torque of the trunk.

An Adaptive Input Data Space Parting Solution to the Synthesis of N euro- Fuzzy Models

  • Nguyen, Sy Dzung;Ngo, Kieu Nhi
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.6
    • /
    • pp.928-938
    • /
    • 2008
  • This study presents an approach for approximation an unknown function from a numerical data set based on the synthesis of a neuro-fuzzy model. An adaptive input data space parting method, which is used for building hyperbox-shaped clusters in the input data space, is proposed. Each data cluster is implemented here as a fuzzy set using a membership function MF with a hyperbox core that is constructed from a min vertex and a max vertex. The focus of interest in proposed approach is to increase degree of fit between characteristics of the given numerical data set and the established fuzzy sets used to approximate it. A new cutting procedure, named NCP, is proposed. The NCP is an adaptive cutting procedure using a pure function $\Psi$ and a penalty function $\tau$ for direction the input data space parting process. New algorithms named CSHL, HLM1 and HLM2 are presented. The first new algorithm, CSHL, built based on the cutting procedure NCP, is used to create hyperbox-shaped data clusters. The second and the third algorithm are used to establish adaptive neuro- fuzzy inference systems. A series of numerical experiments are performed to assess the efficiency of the proposed approach.