• Title/Summary/Keyword: Domain Discretization

Search Result 78, Processing Time 0.026 seconds

Seismic Response Analysis of Steam Turbine-Generator Rotor System (2nd Report, Application of Wavelet Analysis) (증기터빈$\cdot$발전기축계의 지진응답해석 (제2보 : 웨이블렛 해석의 적용))

  • 양보석;김병욱;김용한
    • Journal of KSNVE
    • /
    • v.9 no.4
    • /
    • pp.813-821
    • /
    • 1999
  • This paper presents the technique using wavelet analysis to solve the seismic response of a steam turbine-generator rotor system subjected to earthquake excitations. A brief review of the wavelet transform and its discretization, time-frequency representation of the earthquake wave and the seismic response for a rotor system is presented. The Daubechies wavelet has been used for describing the time-frequency characteristics of the input and the response in case of a recorded accelerogram during 1995 Hyogoken Nanbu earthquake. Also, the results in the wavelet domain has been illustrated through comparison with the time domain simulation results.

  • PDF

A PARALLEL FINITE ELEMENT ALGORITHM FOR SIMULATION OF THE GENERALIZED STOKES PROBLEM

  • Shang, Yueqiang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.3
    • /
    • pp.853-874
    • /
    • 2016
  • Based on a particular overlapping domain decomposition technique, a parallel finite element discretization algorithm for the generalized Stokes equations is proposed and investigated. In this algorithm, each processor computes a local approximate solution in its own subdomain by solving a global problem on a mesh that is fine around its own subdomain and coarse elsewhere, and hence avoids communication with other processors in the process of computations. This algorithm has low communication complexity. It only requires the application of an existing sequential solver on the global meshes associated with each subdomain, and hence can reuse existing sequential software. Numerical results are given to demonstrate the effectiveness of the parallel algorithm.

Simulation of Voltage and Current Distributions in Transmission Lines Using State Variables and Exponential Approximation

  • Dan-Klang, Panuwat;Leelarasmee, Ekachai
    • ETRI Journal
    • /
    • v.31 no.1
    • /
    • pp.42-50
    • /
    • 2009
  • A new method for simulating voltage and current distributions in transmission lines is described. It gives the time domain solution of the terminal voltage and current as well as their line distributions. This is achieved by treating voltage and current distributions as distributed state variables (DSVs) and turning the transmission line equation into an ordinary differential equation. Thus the transmission line is treated like other lumped dynamic components, such as capacitors. Using backward differentiation formulae for time discretization, the DSV transmission line component is converted to a simple time domain companion model, from which its local truncation error can be derived. As the voltage and current distributions get more complicated with time, a new piecewise exponential with controllable accuracy is invented. A segmentation algorithm is also devised so that the line is dynamically bisected to guarantee that the total piecewise exponential error is a small fraction of the local truncation error. Using this approach, the user can see the line voltage and current at any point and time freely without explicitly segmenting the line before starting the simulation.

  • PDF

Parallelization of an Unstructured Implicit Euler Solver (내재적 방법을 이용한 비정렬 유동해석 기법의 병렬화)

  • Kim J. S.;Kang H. J.;Park Y. M.;Kwon O. J.
    • Journal of computational fluids engineering
    • /
    • v.5 no.2
    • /
    • pp.20-27
    • /
    • 2000
  • An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an upwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way n-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and 3-D F-5 wing were investigated.

  • PDF

Parallelization of an Unstructured Implicit Euler Solver (내재적 방법을 이용한 비정렬 유동해석 기법의 병렬화)

  • Kim J. S.;Kang H. J.;Park Y. M.;Kwon O. J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1999.11a
    • /
    • pp.193-200
    • /
    • 1999
  • An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an unpwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way N-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and a 3-D F-5 wing were investigated.

  • PDF

An improved Rankine source panel method for three dimensional water wave problems

  • Feng, Aichun;You, Yunxiang;Cai, Huayang
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.11 no.1
    • /
    • pp.70-81
    • /
    • 2019
  • An improved three dimensional Rankine source method is developed to solve numerically water wave problems in time domain. The free surface and body surface are both represented by continuous panels rather than a discretization by isolated points. The integral of Rankine source 1/r on free surface panel is calculated analytically instead of numerical approximation. Due to the exact algorithm of Rankine source integral applied on the free surface and body surface, a space increment free surface source distribution method is developed and much smaller amount of source panels are required to cover the fluid domain surface than other numerical approximation methods. The proposed method shows a higher accuracy and efficiency compared to other numerical methods for various water wave problems.

Ripple Analysis and Control of Electric Multiple Unit Traction Drives under a Fluctuating DC Link Voltage

  • Diao, Li-Jun;Dong, Kan;Yin, Shao-Bo;Tang, Jing;Chen, Jie
    • Journal of Power Electronics
    • /
    • v.16 no.5
    • /
    • pp.1851-1860
    • /
    • 2016
  • The traction motors in electric multiple unit (EMU) trains are powered by AC-DC-AC converters, and the DC link voltage is generated by single phase PWM converters, with a fluctuation component under twice the frequency of the input catenary AC grid, which causes fluctuations in the motor torque and current. Traditionally, heavy and low-efficiency hardware LC resonant filters parallel in the DC side are adopted to reduce the ripple effect. In this paper, an analytical model of the ripple phenomenon is derived and analyzed in the frequency domain, and a ripple control scheme compensating the slip frequency of rotor vector control systems without a hardware filter is applied to reduce the torque and current ripple amplitude. Then a relatively simple discretization method is chosen to discretize the algorithm with a high discrete accuracy. Simulation and experimental results validate the proposed ripple control strategy.

An Effective Orientation-based Method and Parameter Space Discretization for Defined Object Segmentation

  • Nguyen, Huy Hoang;Lee, GueeSang;Kim, SooHyung;Yang, HyungJeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3180-3199
    • /
    • 2013
  • While non-predefined object segmentation (NDOS) distinguishes an arbitrary self-assumed object from its background, predefined object segmentation (DOS) pre-specifies the target object. In this paper, a new and novel method to segment predefined objects is presented, by globally optimizing an orientation-based objective function that measures the fitness of the object boundary, in a discretized parameter space. A specific object is explicitly described by normalized discrete sets of boundary points and corresponding normal vectors with respect to its plane shape. The orientation factor provides robust distinctness for target objects. By considering the order of transformation elements, and their dependency on the derived over-segmentation outcome, the domain of translations and scales is efficiently discretized. A branch and bound algorithm is used to determine the transformation parameters of a shape model corresponding to a target object in an image. The results tested on the PASCAL dataset show a considerable achievement in solving complex backgrounds and unclear boundary images.

Rough Set Analysis for Stock Market Timing (러프집합분석을 이용한 매매시점 결정)

  • Huh, Jin-Nyung;Kim, Kyoung-Jae;Han, In-Goo
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.77-97
    • /
    • 2010
  • Market timing is an investment strategy which is used for obtaining excessive return from financial market. In general, detection of market timing means determining when to buy and sell to get excess return from trading. In many market timing systems, trading rules have been used as an engine to generate signals for trade. On the other hand, some researchers proposed the rough set analysis as a proper tool for market timing because it does not generate a signal for trade when the pattern of the market is uncertain by using the control function. The data for the rough set analysis should be discretized of numeric value because the rough set only accepts categorical data for analysis. Discretization searches for proper "cuts" for numeric data that determine intervals. All values that lie within each interval are transformed into same value. In general, there are four methods for data discretization in rough set analysis including equal frequency scaling, expert's knowledge-based discretization, minimum entropy scaling, and na$\ddot{i}$ve and Boolean reasoning-based discretization. Equal frequency scaling fixes a number of intervals and examines the histogram of each variable, then determines cuts so that approximately the same number of samples fall into each of the intervals. Expert's knowledge-based discretization determines cuts according to knowledge of domain experts through literature review or interview with experts. Minimum entropy scaling implements the algorithm based on recursively partitioning the value set of each variable so that a local measure of entropy is optimized. Na$\ddot{i}$ve and Booleanreasoning-based discretization searches categorical values by using Na$\ddot{i}$ve scaling the data, then finds the optimized dicretization thresholds through Boolean reasoning. Although the rough set analysis is promising for market timing, there is little research on the impact of the various data discretization methods on performance from trading using the rough set analysis. In this study, we compare stock market timing models using rough set analysis with various data discretization methods. The research data used in this study are the KOSPI 200 from May 1996 to October 1998. KOSPI 200 is the underlying index of the KOSPI 200 futures which is the first derivative instrument in the Korean stock market. The KOSPI 200 is a market value weighted index which consists of 200 stocks selected by criteria on liquidity and their status in corresponding industry including manufacturing, construction, communication, electricity and gas, distribution and services, and financing. The total number of samples is 660 trading days. In addition, this study uses popular technical indicators as independent variables. The experimental results show that the most profitable method for the training sample is the na$\ddot{i}$ve and Boolean reasoning but the expert's knowledge-based discretization is the most profitable method for the validation sample. In addition, the expert's knowledge-based discretization produced robust performance for both of training and validation sample. We also compared rough set analysis and decision tree. This study experimented C4.5 for the comparison purpose. The results show that rough set analysis with expert's knowledge-based discretization produced more profitable rules than C4.5.

Direct simulations on 2D mold-filling processes of particle-filled fluids

  • Hwang, Wook-Ryol;Kim, Worl-Yong;Kang, Shin-Hyun;Kim, See-Jo
    • Korea-Australia Rheology Journal
    • /
    • v.21 no.3
    • /
    • pp.193-200
    • /
    • 2009
  • We present a direct simulation technique for two-dimensional mold-filling simulations of fluids filled with a large number of circular disk-like rigid particles. It is a direct simulation in that the hydrodynamic interaction between particles and fluid is fully considered. We employ a pseudo-concentration method for the evolution of the flow front and the DLM (distributed Lagrangian multipliers)-like fictitious domain method for the implicit treatment of the hydrodynamic interaction. Both methods allow the use of a fixed regular discretization during the entire computation. The discontinuous Galerkin method has been used to solve the concentration evolution equation and the rigid-ring description has been introduced for freely suspended particles. A buffer zone, the gate region of a finite area subject to the uniform velocity profile, has been introduced to put discrete particles into the computational domain avoiding any artificial discontinuity. From example problems of 450 particles, we investigated the particle motion and effects of particles on the flow for both Newtonian and shear-thinning fluid media. We report the prolonged particle movement toward the wall in case of a shear-thinning fluid, which has been interpreted with the shear rate distribution.