• Title/Summary/Keyword: iterative schemes

Search Result 170, Processing Time 0.026 seconds

Classification of Land Cover over the Korean Peninsula using MODIS Data (MODIS 자료를 이용한 한반도 지면피복 분류)

  • Kang, Jeon-Ho;Suh, Myoung-Seok;Kwak, Chong-Heum
    • Atmosphere
    • /
    • v.19 no.2
    • /
    • pp.169-182
    • /
    • 2009
  • To improve the performance of climate and numerical models, concerns on the land-atmosphere schemes are steadily increased in recent years. For the realistic calculation of land-atmosphere interaction, a land surface information of high quality is strongly required. In this study, a new land cover map over the Korean peninsula was developed using MODIS (MODerate resolution Imaging Spectroradiometer) data. The seven phenological data set (maximum, minimum, amplitude, average, growing period, growing and shedding rate) derived from 15-day normalized difference vegetation index (NDVI) were used as a basic input data. The ISOData (Iterative Self-Organizing Data Analysis), a kind of unsupervised non-hierarchical clustering method, was applied to the seven phenological data set. After the clustering, assignment of land cover type to the each cluster was performed according to the phenological characteristics of each land cover defined by USGS (US. Geological Survey). Most of the Korean peninsula are occupied by deciduous broadleaf forest (46.5%), mixed forest (15.6%), and dryland crop (13%). Whereas, the dominant land cover types are very diverse in South-Korea: evergreen needleleaf forest (29.9%), mixed forest (26.6%), deciduous broadleaf forest (16.2%), irrigated crop (12.6%), and dryland crop (10.7%). The 38 in-situ observation data-base over South-Korea, Environment Geographic Information System and Google-earth are used in the validation of the new land cover map. In general, the new land cover map over the Korean peninsula seems to be better classified compared to the USGS land cover map, especially for the Savanna in the USGS land cover map.

On the Vorticity and Pressure Boundary Conditions for Viscous Incompressible Flows (비압축성 점성유동의 와도와 압력 경계조건)

  • Suh J.-C.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1998.05a
    • /
    • pp.15-28
    • /
    • 1998
  • As an alternative for solving the incompressible Navier-Stokes equations, we present a vorticity-based integro-differential formulation for vorticity, velocity and pressure variables. One of the most difficult problems encountered in the vorticity-based methods is the introduction of the proper value-value of vorticity or vorticity flux at the solid surface. A practical computational technique toward solving this problem is presented in connection with the coupling between the vorticity and the pressure boundary conditions. Numerical schemes based on an iterative procedure are employed to solve the governing equations with the boundary conditions for the three variables. A finite volume method is implemented to integrate the vorticity transport equation with the dynamic vorticity boundary condition . The velocity field is obtained by using the Biot-Savart integral derived from the mathematical vector identity. Green's scalar identity is used to solve the total pressure in an integral approach similar to the surface panel methods which have been well-established for potential flow analysis. The calculated results with the present mettled for two test problems are compared with data from the literature in order for its validation. The first test problem is one for the two-dimensional square cavity flow driven by shear on the top lid. Two cases are considered here: (i) one driven both by the specified non-uniform shear on the top lid and by the specified body forces acting through the cavity region, for which we find the exact solution, and (ii) one of the classical type (i.e., driven only by uniform shear). Secondly, the present mettled is applied to deal with the early development of the flow around an impulsively started circular cylinder.

  • PDF

CONSEQUENCE OF BACKWARD EULER AND CRANK-NICOLSOM TECHNIQUES IN THE FINITE ELEMENT MODEL FOR THE NUMERICAL SOLUTION OF VARIABLY SATURATED FLOW PROBLEMS

  • ISLAM, M.S.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.19 no.2
    • /
    • pp.197-215
    • /
    • 2015
  • Modeling water flow in variably saturated, porous media is important in many branches of science and engineering. Highly nonlinear relationships between water content and hydraulic conductivity and soil-water pressure result in very steep wetting fronts causing numerical problems. These include poor efficiency when modeling water infiltration into very dry porous media, and numerical oscillation near a steep wetting front. A one-dimensional finite element formulation is developed for the numerical simulation of variably saturated flow systems. First order backward Euler implicit and second order Crank-Nicolson time discretization schemes are adopted as a solution strategy in this formulation based on Picard and Newton iterative techniques. Five examples are used to investigate the numerical performance of two approaches and the different factors are highlighted that can affect their convergence and efficiency. The first test case deals with sharp moisture front that infiltrates into the soil column. It shows the capability of providing a mass-conservative behavior. Saturated conditions are not developed in the second test case. Involving of dry initial condition and steep wetting front are the main numerical complexity of the third test example. Fourth test case is a rapid infiltration of water from the surface, followed by a period of redistribution of the water due to the dynamic boundary condition. The last one-dimensional test case involves flow into a layered soil with variable initial conditions. The numerical results indicate that the Crank-Nicolson scheme is inefficient compared to fully implicit backward Euler scheme for the layered soil problem but offers same accuracy for the other homogeneous soil cases.

Cooperative Diversity Performance Using Duo-Binary Turbo Codes (Duo-Binary 터보 부호를 이용한 협동 다이버시티 성능 분석)

  • Yeo, Sung-Moon;Kim, Soo-Young
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.2
    • /
    • pp.38-45
    • /
    • 2009
  • In this paper, we propose an efficient cooperative diversity technique, which partition the codewords of each mobile and transmit portions of each codeword through independent fading channels using duo-binary turbo codes. A coded diversity technique can achieve high cooperative diversity gain by decoding and transmitting of the re-encoded signal, while this can also cause high performance degradation due to failure of the decoding. In this paper, we introduce various coded diversity technique using duo-binary turbo codes which are defined as channel coding schemes in the IEEE WiMax specification, and also demonstrate performance simulation results with the analysis. We also propose a cooperative diversity technique using rate-compatible duo-binary turbo codes, where user terminals with different parity symbols cooperate each other. Simulation results investigated in this paper reveal that the proposed scheme show high diversity gain at a reasonal SNR range.

A Novel Transmission Scheme with Spatial Modulation for Coded OFDM Systems (채널 부호화된 OFDM 시스템을 위한 공간 변조를 이용한 새로운 전송 기법)

  • Hwang, Soon-Up;Kim, Young-Ki;Jeon, Sung-Ho;Kang, Woo-Seok;Seo, Jong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7A
    • /
    • pp.515-522
    • /
    • 2009
  • In this paper, a novel transmission scheme with spatial modulation is proposed for coded orthogonal frequency division multiplexing (OFDM). The multiple-input multiple-output (MIMO) technique, so-called spatial modulation (SM), divides input data into antenna index and data signals, transmitting data signals through the specific antenna chosen by the antenna index. In order to retrieve data stream at the receiver, SM needs to detect the antenna index which means that data signals are transmitted via a certain antenna. For this reason, it should be guaranteed that channel matrix is orthogonal. For the real environment, a MIMO channel has difficulty in maintaining orthogonality due to spatial correlation. Moreover, the receiver of the conventional SM is operated by hard decision, so that this scheme has a limit to be adopted for practical systems. Therefore, soft-output demappers for the conventional and proposed schemes are derived to detect antenna index and data stream by soft decision, and a novel transmission scheme combined with spatial modulation is proposed to improve the bit error rate (BER) performance of the conventional scheme.

MBO-Tree: A Hierarchical Representation Scheme for Shapes with Natural Approximation and Effective Localization (MBO-Tree: 형상의 자연스러운 근사화와 효과적인 지역화를 지원하는 계층적 표현 방법)

  • 허봉식;김동규;김민환
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.1
    • /
    • pp.18-27
    • /
    • 2002
  • A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.

  • PDF

Stochastic hygrothermoelectromechanical loaded post buckling analysis of piezoelectric laminated cylindrical shell panel

  • Lal, Achchhe;Saidane, Nitesh;Singh, B.N.
    • Smart Structures and Systems
    • /
    • v.9 no.6
    • /
    • pp.505-534
    • /
    • 2012
  • The present work deals with second order statistics of post buckling response of piezoelectric laminated composite cylindrical shell panel subjected to hygro-thermo-electro-mechanical loading with random system properties. System parameters such as the material properties, thermal expansion coefficients and lamina plate thickness are assumed to be independent of the temperature and electric field and modeled as random variables. The piezoelectric material is used in the forms of layers surface bonded on the layers of laminated composite shell panel. The mathematical formulation is based on higher order shear deformation shell theory (HSDT) with von-Karman nonlinear kinematics. A efficient $C^0$ nonlinear finite element method based on direct iterative procedure in conjunction with a first order perturbation approach (FOPT) is developed for the implementation of the proposed problems in random environment and is employed to evaluate the second order statistics (mean and variance) of the post buckling load of piezoelectric laminated cylindrical shell panel. Typical numerical results are presented to examine the effect of various environmental conditions, amplitude ratios, electrical voltages, panel side to thickness ratios, aspect ratios, boundary conditions, curvature to side ratios, lamination schemes and types of loadings with random system properties. It is observed that the piezoelectric effect has a significant influence on the stochastic post buckling response of composite shell panel under various loading conditions and some new results are presented to demonstrate the applications of present work. The results obtained using the present solution approach is validated with those results available in the literature and also with independent Monte Carlo Simulation (MCS).

New Beamforming Schemes with Optimum Receive Combining for Multiuser MIMO Downlink Channels (다중사용자 다중입출력 하향링크 시스템을 위한 최적 수신 결합을 이용한 새로운 빔 형성 기법)

  • Lee, Sang-Rim;Park, Seok-Hwan;Moon, Sung-Hyun;Lee, In-Kyu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.8
    • /
    • pp.15-26
    • /
    • 2011
  • In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a block-diagonalization (BD) algorithm has been proposed for the multiuser MIMO downlink where both a base station and each user have multiple antennas. However, the BD algorithm is not efficient when the number of supported streams per user is smaller than that of receive antennas. Since the BD method utilizes the space based on the channel matrix without considering the receive combining, the degree of freedom for beamforming cannot be fully exploited at the transmitter. In this paper, we optimize the receive beamforming vector under a zero forcing (ZF) constraint, where all inter-user interference is driven to zero. We propose an efficient algorithm to find the optimum receive vector by an iterative procedure. The proposed algorithm requires two phase values feedforward information for the receive combining vector. Also, we present another algorithm which needs only one phase value by using a decomposition of the complex general unitary matrix. Simulation results show that the proposed beamforming scheme outperforms the conventional BD algorithm in terms of error probability and obtains the diversity enhancement by utilizing the degree of freedom at the base station.

Review on the Three-Dimensional Magnetotelluric Modeling (MT 법의 3차원 모델링 개관)

  • Kim, Hee-Joon;Nam, Myung-Jin;Song, Yoon-Ho;Suh, Jung-Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.7 no.2
    • /
    • pp.148-154
    • /
    • 2004
  • This article reviews the development of three-dimensional (3-D) magnetotelluric (MT) modeling. The 3-D modeling of electromagnetic fields is essential in understanding the physics of MT soundings, and in implementing an inversion method to reconstruct a 3-D resistivity image. Although various numerical schemes have been developed over the last two decades, practical methods have been quite limited. However, the recent rapid improvement in computer speed and memory, as well as the advance in iterative solution algorithms for a large system of equations, makes it possible to model the MT responses of complex 3-D structures, which have been very difficult to simulate before. The use of staggered grids in finite difference method has become popular, conserving a magnetic flux and an electric current and allowing for realistic discontinuous fields. The convergence of numerical solutions has been greatly accelerated by adopting Krylov subspace methods, proper preconditioning techniques, and static divergence corrections. The vector finite-element method using edge elements is also free from the discontinuity problem, and seems a natural choice for modeling complex structures including irregular topography because its flexibility allows one to capture full geometric complexity.

A Comparative Study of Subset Construction Methods in OSEM Algorithms using Simulated Projection Data of Compton Camera (모사된 컴프턴 카메라 투사데이터의 재구성을 위한 OSEM 알고리즘의 부분집합 구성법 비교 연구)

  • Kim, Soo-Mee;Lee, Jae-Sung;Lee, Mi-No;Lee, Ju-Hahn;Kim, Joong-Hyun;Kim, Chan-Hyeong;Lee, Chun-Sik;Lee, Dong-Soo;Lee, Soo-Jin
    • Nuclear Medicine and Molecular Imaging
    • /
    • v.41 no.3
    • /
    • pp.234-240
    • /
    • 2007
  • Purpose: In this study we propose a block-iterative method for reconstructing Compton scattered data. This study shows that the well-known expectation maximization (EM) approach along with its accelerated version based on the ordered subsets principle can be applied to the problem of image reconstruction for Compton camera. This study also compares several methods of constructing subsets for optimal performance of our algorithms. Materials and Methods: Three reconstruction algorithms were implemented; simple backprojection (SBP), EM, and ordered subset EM (OSEM). For OSEM, the projection data were grouped into subsets in a predefined order. Three different schemes for choosing nonoverlapping subsets were considered; scatter angle-based subsets, detector position-based subsets, and both scatter angle- and detector position-based subsets. EM and OSEM with 16 subsets were performed with 64 and 4 iterations, respectively. The performance of each algorithm was evaluated in terms of computation time and normalized mean-squared error. Results: Both EM and OSEM clearly outperformed SBP in all aspects of accuracy. The OSEM with 16 subsets and 4 iterations, which is equivalent to the standard EM with 64 iterations, was approximately 14 times faster in computation time than the standard EM. In OSEM, all of the three schemes for choosing subsets yielded similar results in computation time as well as normalized mean-squared error. Conclusion: Our results show that the OSEM algorithm, which have proven useful in emission tomography, can also be applied to the problem of image reconstruction for Compton camera. With properly chosen subset construction methods and moderate numbers of subsets, our OSEM algorithm significantly improves the computational efficiency while keeping the original quality of the standard EM reconstruction. The OSEM algorithm with scatter angle- and detector position-based subsets is most available.