• Title/Summary/Keyword: iterative equation

Search Result 328, Processing Time 0.035 seconds

Behavior of Poisson Bracket Mapping Equation in Studying Excitation Energy Transfer Dynamics of Cryptophyte Phycocyanin 645 Complex

  • Lee, Weon-Gyu;Kelly, Aaron;Rhee, Young-Min
    • Bulletin of the Korean Chemical Society
    • /
    • v.33 no.3
    • /
    • pp.933-940
    • /
    • 2012
  • Recently, it has been shown that quantum coherence appears in energy transfers of various photosynthetic lightharvesting complexes at from cryogenic to even room temperatures. Because the photosynthetic systems are inherently complex, these findings have subsequently interested many researchers in the field of both experiment and theory. From the theoretical part, simplified dynamics or semiclassical approaches have been widely used. In these approaches, the quantum-classical Liouville equation (QCLE) is the fundamental starting point. Toward the semiclassical scheme, approximations are needed to simplify the equations of motion of various degrees of freedom. Here, we have adopted the Poisson bracket mapping equation (PBME) as an approximate form of QCLE and applied it to find the time evolution of the excitation in a photosynthetic complex from marine algae. The benefit of using PBME is its similarity to conventional Hamiltonian dynamics. Through this, we confirmed the coherent population transfer behaviors in short time domain as previously reported with a more accurate but more time-consuming iterative linearized density matrix approach. However, we find that the site populations do not behave according to the Boltzmann law in the long time limit. We also test the effect of adding spurious high frequency vibrations to the spectral density of the bath, and find that their existence does not alter the dynamics to any significant extent as long as the associated reorganization energy is changed not too drastically. This suggests that adopting classical trajectory based ensembles in semiclassical simulations should not influence the coherence dynamics in any practical manner, even though the classical trajectories often yield spurious high frequency vibrational features in the spectral density.

Damage Estimation of Structures by Second Order Modal Perturbation (2차 모우드 섭동법에 의한 구조물의 손상도 추정)

  • 홍규선;윤정방;류정선
    • Computational Structural Engineering
    • /
    • v.5 no.3
    • /
    • pp.119-126
    • /
    • 1992
  • Most civil engineering structures such as bridges, power plants, and offshore platforms are apt to suffer structural damages over their service lives caused by adverse loadings, such as earthquakes, wind and wave forces. Accumulation of structural damages over a long period of time might cause catastrophic structural failure. Therefore, a methodology for monitoring the structural integrity is essential for assuring the safety of the existing structures. A method for the damage assessment of structures by the second order inverse modal perturbation technique is presented in this paper. Perturbation equation consists of a matrix equation involving matrices of structural changes(stiffness and mass matrix changes) and matrices of modal property changes(natural frequency and mode shape changes). The damages of a structure are represented as changes in the stiffness matrix. In this study, a second order perturbation equation is formulated for the damage assessment of structures, and solved by an iterative procedure. The effectiveness of the proposed method has been investigated through a series of example analysis. The estimated results for the structural damage indicated that the present method yields resonable estimates for the structural changes.

  • PDF

Obtaining 3-D Depth from a Monochrome Shaded Image (단시안 명암강도를 이용한 물체의 3차원 거리측정)

  • Byung Il Kim
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.7
    • /
    • pp.52-61
    • /
    • 1992
  • An iterative scheme for computing the three-dimensional position and the surface orientation of an opaque object from a singel shaded image is proposed. This method demonstrates that calculating the depth(distance) between the camera and the object from one shaded video image is possible. Most previous research works on $'Shape from Shading$' problem, even in the $'Photometric Stereo Method$', invoved the determination of surface orientation only. To measure the depth of an object, depth of the object, and the reflectance properties of the surface. Assuming that the object surface is uniform Lambertian the measured intensity level at a given image pixel*x,y0becomes a function of surface orientation and depth component of the object. Derived Image Irradiance Equation can`t be solved without further informations since three unknown variables(p,q and D) are in one nonlinear equation. As an additional constraints we assume that surface satisfy smoothness conditions. Then equation can be solved relaxatively using standard methods of TEX>$'Calculus of VariationTEX>$'. After checking the sensitivity of the algorithm to the errors ininput parameters, the theoretical results is tested by experiments. Three objects (plane, cylinder, and sphere)are used. Thees initial results are very encouraging since they match the theoretical calculations within 20$\%$ error in simple experiments.> error in simple experiments.

  • PDF

Design of a Low-Power LDPC Decoder by Reducing Decoding Iterations (반복 복호 횟수 감소를 통한 저전력 LDPC 복호기 설계)

  • Lee, Jun-Ho;Park, Chang-Soo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.801-809
    • /
    • 2007
  • LDPC Low Density Parity Check) code, which is an error correcting code determined to be applied to the 4th generation mobile communication systems, requires a heavy computational complexity due to iterative decodings to achieve a high BER performance. This paper proposes an algorithm to reduce the number of decoding iterations to increase performance of the decoder in decoding latency and power consumption. Measuring changes between the current decoded LLR values and previous ones, the proposed algorithm predicts directions of the value changes. Based on the prediction, the algorithm inverts the sign bits of the LLR values to speed up convergence, which means parity check equation is satisfied. Simulation results show that the number of iterations has been reduced by about 33% without BER performance degradation in the proposed decoder, and the power consumption has also been decreased in proportional to the amount of the reduced decoding iterations.

A comparative study of low-complexity MMSE signal detection for massive MIMO systems

  • Zhao, Shufeng;Shen, Bin;Hua, Quan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1504-1526
    • /
    • 2018
  • For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from ${\mathcal{O}}(K^3)$ to ${\mathcal{O}}(K^2)$ or ${\mathcal{O}}(NK)$ with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.

Computational Complexity of BiCGstab(l) in Multi-Level Fast Multipole Method(MLFMM) and Efficient Choice of l (MLFMM(Multi-Level Fast Multipole Method) 방법에 적용된 BiCGstab(l)반복법의 l값에 따른 연산량 분석 및 효율적인 l값)

  • Lee, Hyunsoo;Rim, Jae-Won;Koh, Il-Suek;Seo, Seung-Mo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.29 no.3
    • /
    • pp.167-170
    • /
    • 2018
  • The method of moments(MoM) is one of the most popular integral-equation-based full-wave simulation methods, and the multi-level fast multipole method(MLFMM) algorithm can be used for its efficient calculation. When calculating the surface current on the large scatterer in the MoM or MLFMM, iterative methods for the final matrix inversion are used. Among them, BiCGstab(l) has been widely adopted due to its good convergence rate. The number of iterations can be reduced when l becomes larger, but the number of operations per iteration is increased. Herein, we analyze the computational complexity of BiCGstab(l) in the MLFMM method and propose an optimum choice of l.

A Fully-implicit Velocity Pressure coupling Algorithm-IDEAL and Its Applications

  • SUN, Dong-Liang;QU, Zhi-Guo;He, Ya-Ling;Tao, Wen-Quan
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2008.03a
    • /
    • pp.1-13
    • /
    • 2008
  • An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method. VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

  • PDF

A Fully-implicit Velocity Pressure coupling Algorithm-IDEAL and Its Applications

  • Sun, Dong-Liang;Qu, Zhi-Guo;He, Ya-Ling;Tao, Wen-Quan
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2008.10a
    • /
    • pp.1-13
    • /
    • 2008
  • An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL (Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method -VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

  • PDF

Morphology-Based Step Response Extraction and Regularized Iterative Point Spread Function Estimation & Image Restoration (수리형태학적 분석을 통한 계단응답 추출 및 반복적 정칙화 방법을 이용한 점확산함수 추정 및 영상 복원)

  • Park, Young-Uk;Jeon, Jae-Hwan;Lee, Jin-Hee;Kang, Nam-Oh;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.6
    • /
    • pp.26-35
    • /
    • 2009
  • In this paper, we present morphology-based step region extraction and regularized iterative point-spread-function (PSF) estimation methods. The proposed PSF estimation method uses canny edge detector to extract the edge of the input image. We extract feasible vertical and horizontal edges using morphology analysis, such as the hit-or-miss transform. Given extracted edges we estimate the optimal step-response using flattening and normalization processes. The PSF is finally characterized by solving the equation which relates the optimal step response and the 2D isotropic PSF. We shows the restored image by the estimated PSF. The proposed algorithm can be applied a fully digital auto-focusing system without using mechanical focusing parts.

A Maximum Likelihood Estimator Based Tracking Algorithm for GNSS Signals

  • Won, Jong-Hoon;Pany, Thomas;Eissfeller, Bernd
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.15-22
    • /
    • 2006
  • This paper presents a novel signal tracking algorithm for GNSS receivers using a MLE technique. In order to perform a robust signal tracking in severe signal environments, e.g., high dynamics for navigation vehicles or weak signals for indoor positioning, the MLE based signal tracking approach is adopted in the paper. With assuming white Gaussian additive noise, the cost function of MLE is expanded to the cost function of NLSE. Efficient and practical approach for Doppler frequency tracking by the MLE is derived based on the assumption of code-free signals, i.e., the cost function of the MLE for carrier Doppler tracking is used to derive a discriminator function to create error signals from incoming and reference signals. The use of the MLE method for carrier tracking makes it possible to generalize the MLE equation for arbitrary codes and modulation schemes. This is ideally suited for various GNSS signals with same structure of tracking module. This paper proposes two different types of MLE based tracking method, i.e., an iterative batch processing method and a non-iterative feed-forward processing method. The first method is derived without any limitation on time consumption, while the second method is proposed for a time limited case by using a 1st derivative of cost function, which is proportional to error signal from discriminators of conventional tracking methods. The second method can be implemented by a block diagram approach for tracking carrier phase, Doppler frequency and code phase with assuming no correlation of signal parameters. Finally, a state space form of FLL/PLL/DLL is adopted to the designed MLE based tracking algorithm for reducing noise on the estimated signal parameters.

  • PDF