• Title/Summary/Keyword: Boundary Computation

Search Result 451, Processing Time 0.021 seconds

THE STUDY OF AERO-ACOUSTICS CHARACTERISTIC BY BOUNDARY CONDITIONS (경계조건에 따른 공력음향 특성에 관한 연구)

  • Lee, S.S.;Kim, J.S.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2009.04a
    • /
    • pp.75-80
    • /
    • 2009
  • The present paper focuses on the analysis of aero-acoustics characteristic by several boundary conditions. In this simulation, a high-order and high-resolution numerical schemes are used for the accurate computation of compressible flow with several boundary conditions including characteristic boundary conditions as well as extrapolation and zonal characteristic boundary condition. These boundary conditions are applied to the computation of two dimensional circular cylinder flows with Mach number of 0.3 and Reynolds number of 400. The computation results are validated with measurement datum and other computation results for the Strouhal frequency of vortex shedding, the mean drag coefficient and root-mean-square lift for the unsteady periodic flow regime. Secondary frequency is predicted by three kinds of boundary conditions characteristic.

  • PDF

THE STUDY OF AERO-ACOUSTICS CHARACTERISTICS BY THE BOUNDARY CONDITIONS OF HIGH ORDER SCHEME (고해상도 수치기법의 경계조건에 따른 공력음향 특성에 관한 연구)

  • Lee, S.S.;Kim, J.S.
    • Journal of computational fluids engineering
    • /
    • v.14 no.3
    • /
    • pp.25-32
    • /
    • 2009
  • The present paper focuses on the analysis of aero-acoustics characteristic by appling different four boundary conditions. The high-order and high-resolution numerical schemes are used for discrete accurate computation of compressible flow. The four boundary conditions include extrapolation, characteristic boundary condition, zonal characteristic boundary condition. These boundary conditions are applied to the computation of two dimensional circular cylinder flows with Mach number of 0.3 and Reynolds number of 400. The computation results are validated against measurement data and other computation results for the Strouhal frequency of vortex shedding, the mean drag coefficient and root-mean-square lift for the unsteady periodic flow regime. The characteristics of secondary frequency is predicted by three kinds of boundary conditions.

In-network Distributed Event Boundary Computation in Wireless Sensor Networks: Challenges, State of the art and Future Directions

  • Jabeen, Farhana;Nawaz, Sarfraz
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2804-2823
    • /
    • 2013
  • Wireless sensor network (WSN) is a promising technology for monitoring physical phenomena at fine-grained spatial and temporal resolution. However, the typical approach of sending each sensed measurement out of the network for detailed spatial analysis of transient physical phenomena may not be an efficient or scalable solution. This paper focuses on in-network physical phenomena detection schemes, particularly the distributed computation of the boundary of physical phenomena (i.e. event), to support energy efficient spatial analysis in wireless sensor networks. In-network processing approach reduces the amount of network traffic and thus achieves network scalability and lifetime longevity. This study investigates the recent advances in distributed event detection based on in-network processing and includes a concise comparison of various existing schemes. These boundary detection schemes identify not only those sensor nodes that lie on the boundary of the physical phenomena but also the interior nodes. This constitutes an event geometry which is a basic building block of many spatial queries. In this paper, we introduce the challenges and opportunities for research in the field of in-network distributed event geometry boundary detection as well as illustrate the current status of research in this field. We also present new areas where the event geometry boundary detection can be of significant importance.

Comparison of Computation Complexity for Digital Pulse Compressor (디지털 펄스압축기의 연산 양 비교)

  • 신현익;김상규;조태훈;김환우
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2196-2199
    • /
    • 2003
  • With the development of digital signal processor(DSP), digital pulse compressor (DPC) is commonly used in radar systems. A DPC is implemented by using finite impulse response(FIR) filter algorithm in time domain or fast Fourier transform(FFT) algorithm in frequency domain. This paper compares the computation complexity tot these two methods and calculates boundary Fm filter taps that determine which of the two methods is better based on computation amount. Also, it shows that the boundary FIR filter taps for DSP, ADSP21060, and those for computation complexity have similar characteristic.

  • PDF

Generation of inflow turbulent boundary layer for LES computation

  • Kondo, K.;Tsuchiya, M.;Mochida, A.;Murakami, S.
    • Wind and Structures
    • /
    • v.5 no.2_3_4
    • /
    • pp.209-226
    • /
    • 2002
  • When predicting unsteady flow and pressure fields around a structure in a turbulent boundary layer by Large Eddy Simulation (LES), velocity fluctuations of turbulence (inflow turbulence), which reproduce statistical characteristics of the turbulent boundary layer, must be given at the inflow boundary. However, research has just started on development of a method for generating inflow turbulence that satisfies the prescribed turbulence statistics, and many issues still remain to be resolved. In our previous study, we proposed a method for generating inflow turbulence and confirmed its applicability by LES of an isotropic turbulence. In this study, the generation method was applied to a turbulent boundary layer developed over a flat plate, and the reproducibility of turbulence statistics predicted by LES computation was examined. Statistical characteristics of a turbulent boundary layer developed over a flat plate were investigated by a wind tunnel test for modeling the cross-spectral density matrix for use as targets of inflow turbulence generation for LES computation. Furthermore, we investigated how the degree of correspondence of the cross-spectral density matrix of the generated inflow turbulence with the target cross-spectral density matrix estimated by the wind tunnel test influenced the LES results for the turbulent boundary layer. The results of this study confirmed that the reproduction of cross-spectra of the normal components of the inflow turbulence generation is very important in reproducing power spectra, spatial correlation and turbulence statistics of wind velocity in LES.

Numerical Simulation of Incipient Breaking Waves (초기 쇄파의 수치모사)

  • 김용직;김선기
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.39 no.4
    • /
    • pp.1-10
    • /
    • 2002
  • For the time-domain simulation of incipient breaking waves, usually the boundary integral method has been used so far, and it seems to be successful except a problem of too much computation time. The present paper shows a new computation technique for the simulation of breaking wave experiment. This technique uses the high-order spectral/boundary element method and the boundary integral method in sequence, and reduces the computation time remarkably. The wave generation and energy focusing process is efficiently simulated by the high-order spectral/boundary element method. Only the wave over-turning process is simulated by the boundary integral method. In the example calculation result, salient features of breaking waves such as high particle velocities and accelerations are shown.

THE COMPUTATION OF POSITIVE SOLUTIONS FOR A BOUNDARY VALUE PROBLEM OF THE LINEAR BEAM EQUATION

  • Ji, Jun;Yang, Bo
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.215-224
    • /
    • 2017
  • In this paper, we propose a method of order two for the computation of positive solutions to a boundary value problem of the linear beam equation. The method is based on the Power method for the eigenvector associated with the dominant eigenvalue and the Crout-like factorization algorithm for the banded system of linear equations. It is extremely fast due to the linear complexity of the linear system solver. Numerical result of a test problem is included.

Open Boundary Conditions in Parabolic Approximation Model (포물형 근사식 수치모형의 투과 경계조건)

  • Seo, Seung-Nam;Lee, Dong-Young
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.19 no.2
    • /
    • pp.170-178
    • /
    • 2007
  • Most of parabolic approximation models employ a relatively limited open boundary condition in which there is no depth variation in the longshore direction outside of the computation domain so that Snell's law may be presumed to hold. Existing Kirby's condition belongs to this category and in the paper both modified Kirby's method and Dirichlet boundary condition are presented in detail and numerical results of three methods were shown. Judging from computation to wave propagations over a circular shoal in a constant depth, the method based on present Dirichlet boundary condition with fictitious numerical adjusting regions in both sides of the computation domain gives the least distorted amplitude ratio distribution.

On boundary discretization and integration in frequency-domain boundary element method

  • Fu, Tia Ming;Nogami, Toyoaki
    • Structural Engineering and Mechanics
    • /
    • v.6 no.3
    • /
    • pp.339-345
    • /
    • 1998
  • The computation size and accuracy in the boundary element method are mutually coupled and strongly influenced by the formulations in boundary discretization and integration. This aspect is studied numerically for two-dimensional elastodynamic problems in the frequency-domain. The localized nature of error is observed in the computed results. A boundary discretization criterion is examined. The number of integration points in the boundary integration is studied to find the optimum number for accuracy. Useful information is obtained concerning the optimization in boundary discretization and integration.

Analyses of Computation Time on Snakes and Gradient Vector Flow

  • Kwak, Young-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.2
    • /
    • pp.439-445
    • /
    • 2007
  • GVF can solve two difficulties with Snakes that are on setting initial contour and have a hard time processing into boundary concavities. But GVF takes much longer computation time than the existing Snakes because of their edge map and partial derivatives. Therefore this paper analyzed the computation time between GVF and Snakes. As a simulation result, both algorithms took almost similar computation time in simple image. In real images, GVF took about two times computation than Snakes.

  • PDF