• Title/Summary/Keyword: Problem Decomposition

Search Result 585, Processing Time 0.024 seconds

A Refined Semi-Analytic Sensitivity Study Based on the Mode Decomposition and Neumann Series Expansion (I) - Static Problem - (강체모드분리와 급수전개를 통한 준해석적 민감도 계산 방법의 개선에 관한 연구(I) - 정적 문제 -)

  • Cho, Maeng-Hyo;Kim, Hyun-Gi
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.4
    • /
    • pp.585-592
    • /
    • 2003
  • Among various sensitivity evaluation techniques, semi-analytical method(SAM) is quite popular since this method is more advantageous than analytical method(AM) and global finite difference method(FDM). However, SAM reveals severe inaccuracy problem when relatively large rigid body motions are identified fur individual elements. Such errors result from the numerical differentiation of the pseudo load vector calculated by the finite difference scheme. In the present study, an iterative method combined with mode decomposition technique is proposed to compute reliable semi-analytical design sensitivities. The improvement of design sensitivities corresponding to the rigid body mode is evaluated by exact differentiation of the rigid body modes and the error of SAM caused by numerical difference scheme is alleviated by using a Von Neumann series approximation considering the higher order terms for the sensitivity derivatives.

Proportional-Fair Downlink Resource Allocation in OFDMA-Based Relay Networks

  • Liu, Chang;Qin, Xiaowei;Zhang, Sihai;Zhou, Wuyang
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.633-638
    • /
    • 2011
  • In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

SEMI-HYPERBOLIC PATCHES ARISING FROM A TRANSONIC SHOCK IN SIMPLE WAVES INTERACTION

  • Song, Kyungwoo
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.5
    • /
    • pp.945-957
    • /
    • 2013
  • In this paper we consider a Riemann problem, in particular, the case of the presence of the semi-hyperbolic patches arising from a transonic shock in simple waves interaction. Under this circumstance, we construct global solutions of the two-dimensional Riemann problem of the pressure gradient system. We approach the problem as a Goursat boundary value problem and a mixed initial-boundary value problem, where one of the boundaries is the transonic shock.

An Application of Tucker Decomposition for Detecting Epilepsy EEG signals

  • Thieu, Thao Nguyen;Yang, Hyung-Jeong
    • Journal of Multimedia Information System
    • /
    • v.2 no.2
    • /
    • pp.215-222
    • /
    • 2015
  • Epileptic Seizure is a popular brain disease in the world. It affects the nervous system and the activities of brain function that make a person who has seizure signs cannot control and predict his actions. Based on the Electroencephalography (EEG) signals which are recorded from human or animal brains, the scientists use many methods to detect and recognize the abnormal activities of brain. Tucker model is investigated to solve this problem. Tucker decomposition is known as a higher-order form of Singular Value Decomposition (SVD), a well-known algorithm for decomposing a matric. It is widely used to extract good features of a tensor. After decomposing, the result of Tucker decomposition is a core tensor and some factor matrices along each mode. This core tensor contains a number of the best information of original data. In this paper, we used Tucker decomposition as a way to obtain good features. Training data is primarily applied into the core tensor and the remained matrices will be combined with the test data to build the Tucker base that is used for testing. Using core tensor makes the process simpler and obtains higher accuracies.

Estimation of Displacement Responses from the Measured Dynamic Strain Signals Using Mode Decomposition Technique (모드분해기법을 이용한 동적 변형률신호로부터 변위응답추정)

  • Kim, Sung-Wan;Chang, Sung-Jin;Kim, Nam-Sik
    • Proceedings of the KSR Conference
    • /
    • 2008.06a
    • /
    • pp.109-117
    • /
    • 2008
  • In this study, a method predicting the displacement responseof structures from the measured dynamic strain signal is proposed by using a mode decomposition technique. Dynamic loadings including wind and seismic loadings could be exerted to the bridge. In order to examine the bridge stability against these dynamic loadings, the prediction of displacement response is very important to evaluate bridge stability. Because it may be not easy for the displacement response to be acquired directly on site, an indirect method to predict the displacement response is needed. Thus, as an alternative for predicting the displacement response indirectly, the conversion of the measured strain signal into the displacement response is suggested, while the measured strain signal can be obtained using fiber optic Bragg-grating (FBG) sensors. To overcome such a problem, a mode decomposition technique was used in this study. The measured strain signal is decomposed into each modal component by using the empirical mode decomposition(EMD) as one of mode decomposition techniques. Then, the decomposed strain signals on each modal component are transformed into the modal displacement components. And the corresponding mode shapes can be also estimated by using the proper orthogonal decomposition(POD) from the measured strain signal. Thus, total displacement response could be predicted from combining the modal displacement components.

  • PDF

An Approach to Optimal Dispatch Scheduling Incorporating Transmission Security Constraints

  • Chung, Koo-Hyung;Kang, Dong-Joo;Kim, Balho H.;Kim, Tai-Hoon;Oh, Tae-Kyoo
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.2
    • /
    • pp.199-206
    • /
    • 2008
  • The introduction of competition in electricity markets emphasizes the importance of sufficient transmission capacities to guarantee effective power transactions. Therefore, for the economic and stable electric power system operation, transmission security constrains should be incorporated into the dispatch scheduling problem. With the intent to solve this problem, we decompose a dispatch scheduling problem into a master problem(MP) and several subproblems(SPs) using Benders decomposition. The MP solves a general optimal power flow(OPF) problem while the SPs inspect the feasibility of OPF solution under respective transmission line contingencies. If a dispatch scheduling solution given by the MP violates transmission security constraints, then additional constraints corresponding to the violations are imposed to the MP. Through this iterative process between the MP and SPs, we derive an optimal dispatch schedule incorporating the post-contingency corrective rescheduling. In addition, we consider interruptible loads as active control variables since the interruptible loads can participate as generators in competitive electricity markets. Numerical examples demonstrate the efficiency of the proposed algorithm.

An Index of Applicability for the Decomposition of Multivariable Fuzzy Control Rules (제어규칙 분해법에 의한 다변수 퍼지 시스템 제어의 적용기준지수)

  • 이평기;이균경;전기준
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.7
    • /
    • pp.79-86
    • /
    • 1992
  • Recent research on the application of fuzzy set theory to the design of control systems has led to interest in the theory of decomposition of multivariable fuzzy systems. Decomposition of multivariable control rules is preperable since it alleviates the complexity of the problem. However inference error is inevitable because of its approximate nature. In this paper we define an index of applicability which can classify whether the Gupta et. al's method can be applied to multivariable fuzzy system or not. We also propose a modified version of the decomposition which can reduce inference error and improve performance of the system.

  • PDF

Block-triangular Decomposition of a Linear Discrete Large-Scale Systems via the Generalized Matrix Sign Function (행렬부호 함수에 의한 선형 이산치 대규모 계통의 블럭 삼각화 분해)

  • Park, Gwi-Tae;Lee, Chang-Hoon;Yim, In-sung
    • Proceedings of the KIEE Conference
    • /
    • 1987.07a
    • /
    • pp.185-189
    • /
    • 1987
  • An analysis and design of large-scale linear multivariable systems often requires to be block triangularized form for good sensitivity of the systems when their poles and zeros are varied. But the decomposition algorithms presented up to now need a procedure of permutation, rescaling and a solution of nonlinear algebraic equations, which are usually burden. To avoid these problem, in this paper we develop a newly alternative block triangular decomposition algorithm which used the generalized matrix sign function on the Z-plane. Also, the decomposition algorithm demonstrated using the fifth order linear model of a distillation tower system.

  • PDF

Blind signal separation for coprime planar arrays: An improved coupled trilinear decomposition method

  • Zhongyuan Que;Xiaofei Zhang;Benzhou Jin
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.138-149
    • /
    • 2023
  • In this study, the problem of blind signal separation for coprime planar arrays is investigated. For coprime planar arrays comprising two uniform rectangular subarrays, we link the signal separation to the tensor-based model called coupled canonical polyadic decomposition (CPD) and propose an improved coupled trilinear decomposition approach. The output data of coprime planar arrays are modeled as a coupled tensor set that can be further interpreted as a coupled CPD model, allowing a signal separation to be achieved using coupled trilinear alternating least squares (TALS). Furthermore, in the procedure of the coupled TALS, a Vandermonde structure enforcing approach is explicitly applied, which is shown to ensure fast convergence. The results of Monto Carlo simulations show that our proposed algorithm has the same separation accuracy as the basic coupled TALS but with a faster convergence speed.

A NON-OVERLAPPING DOMAIN DECOMPOSITION METHOD FOR A DISCONTINUOUS GALERKIN METHOD: A NUMERICAL STUDY

  • Eun-Hee Park
    • Korean Journal of Mathematics
    • /
    • v.31 no.4
    • /
    • pp.419-431
    • /
    • 2023
  • In this paper, we propose an iterative method for a symmetric interior penalty Galerkin method for heterogeneous elliptic problems. The iterative method consists mainly of two parts based on a non-overlapping domain decomposition approach. One is an intermediate preconditioner constructed by understanding the properties of the discontinuous finite element functions and the other is a preconditioning related to the dual-primal finite element tearing and interconnecting (FETI-DP) methodology. Numerical results for the proposed method are presented, which demonstrate the performance of the iterative method in terms of various parameters associated with the elliptic model problem, the finite element discretization, and non-overlapping subdomain decomposition.