• Title/Summary/Keyword: Iterative scheme

Search Result 544, Processing Time 0.028 seconds

A Boundary Element Solution Approach for the Conjugate Heat Transfer Problem in Thermally Developing Region of a Thick Walled Pipe

  • Choi, Chang-Yong
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.12
    • /
    • pp.2230-2241
    • /
    • 2006
  • This paper presents a sole application of boundary element method to the conjugate heat transfer problem of thermally developing laminar flow in a thick walled pipe when the fluid velocities are fully developed. Due to the coupled mechanism of heat conduction in the solid region and heat convection in the fluid region, two separate solutions in the solid and fluid regions are sought to match the solid-fluid interface continuity condition. In this method, the dual reciprocity boundary element method (DRBEM) with the axial direction marching scheme is used to solve the heat convection problem and the conventional boundary element method (BEM) of axisymmetric model is applied to solve the heat conduction problem. An iterative and numerically stable BEM solution algorithm is presented, which uses the coupled interface conditions explicitly instead of uncoupled conditions. Both the local convective heat transfer coefficient at solid-fluid interface and the local mean fluid temperature are initially guessed and updated as the unknown interface thermal conditions in the iterative solution procedure. Two examples imposing uniform temperature and heat flux boundary conditions are tested in thermally developing region and compared with analytic solutions where available. The benchmark test results are shown to be in good agreement with the analytic solutions for both examples with different boundary conditions.

Super-Resolution Image Reconstruction Using Multi-View Cameras (다시점 카메라를 이용한 초고해상도 영상 복원)

  • Ahn, Jae-Kyun;Lee, Jun-Tae;Kim, Chang-Su
    • Journal of Broadcast Engineering
    • /
    • v.18 no.3
    • /
    • pp.463-473
    • /
    • 2013
  • In this paper, we propose a super-resolution (SR) image reconstruction algorithm using multi-view images. We acquire 25 images from multi-view cameras, which consist of a $5{\times}5$ array of cameras, and then reconstruct an SR image of the center image using a low resolution (LR) input image and the other 24 LR reference images. First, we estimate disparity maps from the input image to the 24 reference images, respectively. Then, we interpolate a SR image by employing the LR image and matching points in the reference images. Finally, we refine the SR image using an iterative regularization scheme. Experimental results demonstrate that the proposed algorithm provides higher quality SR images than conventional algorithms.

(Frequency Weighted Reduction Using Iterative Approach of BMI) (BMI의 반복적 해법을 이용한 주파수하중 차수축소)

  • Kim, Yong-Tae;O, Do-Chang;Park, Hong-Bae
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.39 no.1
    • /
    • pp.33-41
    • /
    • 2002
  • In this paper, we present a frequency weighted model reduction using LMIs for minimizing the H$\infty$ weighted model error compared with the methods of frequency weighted balanced truncation and frequency weighted Hankel norm approximation. The proposed algorithm, its form is equal to the sufficient condition of performance preserving controller approximation, is based on an iterative two-step LMI scheme induced from bound real lemma. So, it can be applied to the problem of the performance preserving controller approximation. The controller reduction is useful in a practical control design and ensures its easy implementation and high reliability The validity of the proposed algorithm is shown through numerical examples. Additionaly, we extend the proposed algorithm to performance preserving controller approximation by applying to the HIMAT(highly maneuverable aircraft technology) system.

Numerical Analysis of 3-D Turbulent Flows Around a High Speed Train Including Cross-Wind Effects (측풍영향을 고려한 고속전철 주위의 3차원 난류유동 해석)

  • Jung Y. R.;Park W. G.;Ha S. D.
    • Journal of computational fluids engineering
    • /
    • v.1 no.1
    • /
    • pp.71-80
    • /
    • 1996
  • An iterative time marching procedure for solving incompressible turbulent flow has been applied to the flows around a high speed train including cross-wind effects. This procedure solves three-dimensional unsteady incompressible Reynolds-averaged Navier-Stokes equations on a non-orthogonal curvilinear coordinate system using first-order accurate schemes for the time derivatives and third/second-order accurate schemes for the spatial derivatives. Turbulent flows have been modeled by Baldwin-Lomax turbulent model. To validate present procedure, the flow around a high speed train at zero yaw angle was simulated and compared with experimental data. Generally good agreement with experiments was achieved. The flow fields around the high speed train at 9.2°, 16.7°, and 45° of yaw angle were also simulated.

  • PDF

A VISCOSITY APPROXIMATIVE METHOD TO CES$\`{A}$RO MEANS FOR SOLVING A COMMON ELEMENT OF MIXED EQUILIBRIUM, VARIATIONAL INEQUALITIES AND FIXED POINT PROBLEMS

  • Jitpeera, Thanyarat;Katchang, Phayap;Kumam, Poom
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.227-245
    • /
    • 2011
  • In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

Fast Millimeter-Wave Beam Training with Receive Beamforming

  • Kim, Joongheon;Molisch, Andreas F.
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.512-522
    • /
    • 2014
  • This paper proposes fast millimeter-wave (mm-wave) beam training protocols with receive beamforming. Both IEEE standards and the academic literature have generally considered beam training protocols involving exhaustive search over all possible beam directions for both the beamforming initiator and responder. However, this operation requires a long time (and thus overhead) when the beamwidth is quite narrow such as for mm-wave beams ($1^{\circ}$ in the worst case). To alleviate this problem, we propose two types of adaptive beam training protocols for fixed and adaptive modulation, respectively, which take into account the unique propagation characteristics of millimeter waves. For fixed modulation, the proposed protocol allows for interactive beam training, stopping the search when a local maximum of the power angular spectrum is found that is sufficient to support the chosen modulation/coding scheme. We furthermore suggest approaches to prioritize certain directions determined from the propagation geometry, long-term statistics, etc. For adaptive modulation, the proposed protocol uses iterative multi-level beam training concepts for fast link configuration that provide an exhaustive search with significantly lower complexity. Our simulation results verify that the proposed protocol performs better than traditional exhaustive search in terms of the link configuration speed for mobile wireless service applications.

Simplification and Scaling of Iterative Learning Control Command (반복학습제어 명령의 간단화와 스케일링)

  • Chae, Hui-Chang;Lee, Sang-Hoon;Park, Myung-Kwan;Suh, Il-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2390-2392
    • /
    • 2003
  • ILC(Iterative Learning Control: 이하 ILC)는 현재 기계, 전기, 화학 등 많은 분야에 널리 적용되고 있다. ILC는 특히 반복적인 trajectory tracking Control 문제에 아주 효과적인 방법 중의 하나이다. 하지만 ILC는 메모리 기반의 scheme로서 trajectory tracking을 위해서는 많은 메모리를 요구하게 된다. 한편, 자세한 관찰에 의하면 인간의 팔, 다리 등의 관절의 움직임은 아주 정확하지가 않다. 이러한 사실로 미루어 인간이 정화한 모션을 취하는데 드는 비용을 줄이고자 모션 명령을 간단히 한다는 가정을 추론 해 낼 수 있다. 이러한 가정에 기초하여 우리는 ILC 명령을 간단히 하기 위해서 약간의 trajectory tracking의 정확성을 회생하는 메커니즘을 제안한다. 간단해진 ILC 명령은 적은 메모리 공간에 저장될 것이다. 또한, 로봇의 trajectory tracking을 위한 기존의 방법들은 아주 복잡할 뿐만 아니라 하나의 task의 수행만이 가능할 뿐 어떤 일반화의 방법도 제시하지 못하고 있다. 그래서 본 논문에서는 ILC 명령의 scaling에 대한 메커니즘을 제공하여 하나의 trajectory에 대해서 비슷한 모양이지만 다른 크기와 속도를 가지는 trajectory를 구현 할 수 있도록 하였다.

  • PDF

A Consideration on ML Blind Signal Estimation based on Finite-Alphabet Characteristic in QPSK Modulation (QPSK 신호 입력시스템에서의 유한 알파벹 기반 ML 블라인드 신호 추정 비교)

  • Kwon, S.M.;Kim, S.J.;Lee, J.M.;Kim, C.K.;Cheon, J.M.
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.685-688
    • /
    • 2003
  • In this paper, a performance comparison between two blind signal estimation algorithms in a LTI channel is considered. The two algorithms, Iterative Least-Squares with Projection (ILSP) and a modified ILSP, are based on the finite-alphabet property of input symbols. This case typically arises in a multiple access system with a sensor array antenna at the receiving end. We start with the formulation of a maximum-likelihood (ML) estimation problem under an additive white Gaussian noise assumption. A blind ML estimator is derived with its iterative algorithm for calculation. Then we narrow down the consideration of this problem to QPSK case so that a modified algorithm is proposed for $\pi$/4-QPSK case. The modified version is compared with the original ILSP algorithm in terms of the rate of the convergence to global minima. A computer simulation shows that the modified algorithm gives a better performance. This result implies that the performance of the blind separation algorithms may be greatly improved by adopting a smart coding scheme with rich structure.

  • PDF

A Flexible Network Access Scheme for M2M Communications in Heterogeneous Wireless Networks

  • Tian, Hui;Xie, Wei;Xu, Youyun;Xu, Kui;Han, Peng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3789-3809
    • /
    • 2015
  • In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

Delta-form-based method of solving high order spatial discretization schemes for neutron transport

  • Zhou, Xiafeng;Zhong, Changming;Li, Fu
    • Nuclear Engineering and Technology
    • /
    • v.53 no.7
    • /
    • pp.2084-2094
    • /
    • 2021
  • Delta-form-based methods for solving high order spatial discretization schemes are introduced into the reactor SN transport equation. Due to the nature of the delta-form, the final numerical accuracy only depends on the residuals on the right side of the discrete equations and have nothing to do with the parts on the left side. Therefore, various high order spatial discretization methods can be easily adopted for only the transport term on the right side of the discrete equations. Then the simplest step or other robust schemes can be adopted to discretize the increment on the left hand side to ensure the good iterative convergence. The delta-form framework makes the sweeping and iterative strategies of various high order spatial discretization methods be completely the same with those of the traditional SN codes, only by adding the residuals into the source terms. In this paper, the flux limiter method and weighted essentially non-oscillatory scheme are used for the verification purpose to only show the advantages of the introduction of delta-form-based solving methods and other high order spatial discretization methods can be also easily extended to solve the SN transport equations. Numerical solutions indicate the correctness and effectiveness of delta-form-based solving method.