• Title/Summary/Keyword: Multiple Relaxation Time

Search Result 25, Processing Time 0.022 seconds

NUMERICAL STUDY ON TURBULENT FLOW OVER CYLINDER USING IMMERSED BOUNDARY LATTICE BOLTZMANN METHOD WITH MULTI RELAXATION TIME (다중완화시간 가상경계볼쯔만법을 이용한 실린더 주위의 난류유동해석)

  • Kim, Hyung-Min
    • Journal of computational fluids engineering
    • /
    • v.15 no.2
    • /
    • pp.21-27
    • /
    • 2010
  • Immersed boundary lattice Boltzmann method (IBLBM) has been applied to simulate a turbulent flow over circular cylinder in a flow field effectively. Although IBLBM is very effective method to simulate the flow over a complex shape of obstacle in the flow field regardless of the constructed grids in the calculation domain, the results, however, become numerically unstable in high reynolds number flow. The most effective suggestion to archive the numerical stability in high Reynolds number flow is applying the multiple relaxation time (MRT) model instead of single relaxation time(SRT) model in the collision term of lattice Boltzmann equation. In the research MRT model for IBLBM was introduced and comparing the numerical results obtained by applying SRT and MRT. The hydraulic characteristic of cylinder in a flow field between two parallel plate at the range of $Re{\leqq}2000$represented and it is also compared the drag and lifting coefficients of the cylinder calculated by IBLBM with SRT and MRT model.

Feedback Semi-Definite Relaxation for near-Maximum Likelihood Detection in MIMO Systems (MIMO 시스템에서 최적 검출 기법을 위한 궤환 Semi-Definite Relaxation 검출기)

  • Park, Su-Bin;Lee, Dong-Jin;Byun, Youn-Shik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1082-1087
    • /
    • 2008
  • Maximum Likelihood (ML) detection is well known to exhibit better bit-error-rate (BER) than many other detectors for multiple-input multiple-output (MIMO) channel. However, ML detection has been shown a difficult problem due to its NP-hard problem. It means that there is no known algorithm which can find the optimal solution in polynomial-time. In this paper, Semi-Definite relaxation (SDR) is iteratively applied to ML detection problem. The probability distribution can be obtained by survival eigenvector out of the dominant eigenvalue term of the optimal solution. The probability distribution which is yielded by SDR is recurred to the received signal. Our approach can reach to nearly ML performance.

A Theoretical Representation of Relaxation Processes in Complex Spin System Using Liouville Space Method

  • Kyunglae Park
    • Bulletin of the Korean Chemical Society
    • /
    • v.14 no.1
    • /
    • pp.21-29
    • /
    • 1993
  • For the study of relaxation processes in complex spin system, a general master equation, which can be used to simulate a vast range of pulse experiments, has been formulated using the Liouville representation of quantum mechanics. The state of a nonequilibrium spin system in magnetic field is described by a density vector in Liouville space and the time evolution of the system is followed by the application of a linear master operator to the density vector in this Liouville space. In this master equation the nuclear spin relaxation due to intramolecular dipolar interaction or randomly fluctuating field interaction is explicitly implemented as a relaxation supermatrix for a strong coupled two-spin (1/2) system. The whole dynamic information inherent in the spin system is thus contained in the density vector and the master operator. The radiofrequency pulses are applied in the same space by corresponding unitary rotational supertransformations of the density vector. If the resulting FID is analytically Fourier transformed, it is possible to represent the final nonstationary spectrum using a frequency dependent spectral vector and intensity determining shape vector. The overall algorithm including relaxation interactions is then translated into an ANSIFORTRAN computer program, which can simulate a variety of two dimensional spectra. Furthermore a new strategy is tested by simulation of multiple quantum signals to differentiate the two relaxation interaction types.

SIMULATION OF LID DRIVEN CAVITY FLOW WITH DIFFERENT ASPECT RATIOS BY MULTI-RELAXATION-TIME LATTICE BOLTZMANN METHOD (다중완화시간 격자 볼츠만기법을 이용한 다양한 종횡비의 리드드리븐 공동유동 수치해석연구)

  • Huang, Tingting;Song, Juhun;Lim, Hee-Chang
    • Journal of the Korean Society of Visualization
    • /
    • v.18 no.3
    • /
    • pp.42-51
    • /
    • 2020
  • This study performs a numerical simulation of lid driven rectangular cavity flow with different aspect ratios of k = 0.5 to 4 under Reynolds 100, 1,000, 10,000 by using multi-relaxation time (MRT) Lattice Boltzmann Method (LBM). In order to achieve better convergence, well-posed boundary conditions in the domain should be defined such as no-slip condition on side and bottom solid wall surfaces and uniform horizontal velocity on the top of the cavity. This study focuses on the flow inside different shape of rectangular cavity with the aim to observe the effect of the Reynolds number and aspect ratio on the flow characteristics and primary/secondary vortex formation. In order to validate the study, the results have been compared with existing works. The result shows that the Reynolds number and the aspect ratio both has substantial effects on the flow inside the lid-driven rectangular cavity.

Determination of Bulk Density and Internal Structure of Red Ginseng Root Using NMR (NMR을 이용한 홍삼의 용적밀도 측정 및 내부 조직 판별)

  • ;R. Ruan
    • Journal of Ginseng Research
    • /
    • v.22 no.2
    • /
    • pp.96-101
    • /
    • 1998
  • This paper describes the determination of bulk density and the discrimination of internal structure of red ginseng by nuclear magnetic resonance (NMR). The 102 red ginseng roots were tested for bulk density. The NMR properties measured by NMR parameters such as spin-lattice relaxation time ($T_1$) and spin-spin relaxation time ($T_2$) were determined using the low field proton NMR analyzer. Bulk density of red ginseng root showed a highly negative significant correlation (r=-0.8934) with the value of $T_1$, but a highly positive significant correlation (r=0.7672 and 0.5909) with the value of T21 (short T2) and T22 (long T2), respectively. Multiple regression equation, Y=-0.0069.$T_1$+0.3044.$T_{21}$-0.0156.$T_{22}$-0.6368, using the MNR parameter values of 80 red ginseng roots can effectively predict the bulk density of 22 red ginseng roots with the correlation coefficient of 0.9396 and the standard error of 0.086. The differences in the internal structure of normal and inside white part of red ginseng were easily found by the signal intensity of NMR image based on magnetic properties of proton nucleus.

  • PDF

Constitutive Model of Tendon Responses to Multiple Cyclic Demands (II) -Theory and Comparison-

  • Chun, Keyoung-Jin;Robert P. Hubbard
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.9
    • /
    • pp.1281-1291
    • /
    • 2001
  • The hereditary integral form of a quasi-linear viscoelastic law has been employed. Four new concepts have been employed: 1. a reduced relaxation function with a non-linear exponential function of time, 2. an inverse method to determine the scale factor of the elastic response, 3. an instant elastic recovery strain during unloading, and 4. the results of a constitutive model for cyclic tests may be a function of the Heavyside class. These concepts have been supported by agreement between measured and predicted responses of soft connective tissue to three types of multiple cyclic tests which include rest periods of no extension and alternations between different strain levels. Such agreement has not been attained in the previous studies. Chun and Hubbard (2001) is our companion experimental analysis paper.

  • PDF

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.

K-Way Graph Partitioning: A Semidefinite Programming Approach (Semidefinite Programming을 통한 그래프의 동시 분할법)

  • Jaehwan, Kim;Seungjin, Choi;Sung-Yang, Bang
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.697-699
    • /
    • 2004
  • Despite many successful spectral clustering algorithm (based on the spectral decomposition of Laplacian(1) or stochastic matrix(2) ) there are several unsolved problems. Most spectral clustering Problems are based on the normalized of algorithm(3) . are close to the classical graph paritioning problem which is NP-hard problem. To get good solution in polynomial time. it needs to establish its convex form by using relaxation. In this paper, we apply a novel optimization technique. semidefinite programming(SDP). to the unsupervised clustering Problem. and present a new multiple Partitioning method. Experimental results confirm that the Proposed method improves the clustering performance. especially in the Problem of being mixed with non-compact clusters compared to the previous multiple spectral clustering methods.

  • PDF

Multiple Path Based Vehicle Routing in Dynamic and Stochastic Transportation Networks

  • Park, Dong-joo
    • Proceedings of the KOR-KST Conference
    • /
    • 2000.02a
    • /
    • pp.25-47
    • /
    • 2000
  • In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

  • PDF

Optimal Buffer and Timeslot Allocation Scheme for Broadband Satellite Networks (광대역 위성 네트워크를 위한 최적 버퍼 및 타임슬롯 할당 체계)

  • Chang Kun-Nyeong;Park You-Jin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.1
    • /
    • pp.117-129
    • /
    • 2006
  • In this paper, we consider broadband satellite networks using MF-TDMA (Multi-Frequency Time Division Multiple Access) scheme. We analyze the number of expected lost packets in each terminal, and mathematically formulate optimal buffer and timeslot allocation model to minimize the weighted sum of the numbers of expected lost packets. We also suggest optimal buffer and timeslot allocation scheme based on Lagrangean relaxation technique to solve the proposed model in a fast time. Extensive experiments show that the proposed scheme provides encouraging results.