• Title/Summary/Keyword: Zheng

Search Result 1,836, Processing Time 0.025 seconds

ASYMTOTIC BEHAVIOUR OF THE VISCOUS CAHN-HILLIARD EQUATION

  • Choo, S.M.;Chung, S.K.
    • Journal of applied mathematics & informatics
    • /
    • v.11 no.1_2
    • /
    • pp.143-154
    • /
    • 2003

  • Analytical solutions for the viscous Cahn-Hilliard equation are considered. Existence and uniqueness of the solution are shown. The exponential decay of the solution in H$^2$-norm, which is an improvement of the result in Elliott and Zheng[5]. We also compare the early stages of evolution of the viscous Cahn-Hilliard equation with that of the Cahn-Hilliard equation, which has been given as an open question in Novick-Cohen[8].

Boundary stress resolution and its application to adaptive finite element analysis

  • Deng, Jianhui;Zheng, Hong;Ge, Xiurun
    • Structural Engineering and Mechanics
    • /
    • v.6 no.1
    • /
    • pp.115-124
    • /
    • 1998

  • A novel boundary stress resolution method is suggested in this paper, which is based upon the displacements of finite element analysis and of high precision with stress boundary condition strictly satisfied. The method is used to modify the Zienkiewicz-Zhu ($Z^2$) a posteriori error estimator and for the h-version adaptive finite element analysis of crack problems. Successful results are obtained.

  • https://doi.org/10.12989/sem.1998.6.1.115 인용

Fast Implementation of the Progressive Edge-Growth Algorithm

  • Chen, Lin;Feng, Da-Zheng
    • ETRI Journal
    • /
    • v.31 no.2
    • /
    • pp.240-242
    • /
    • 2009

  • A computationally efficient implementation of the progressive edge-growth algorithm is presented. This implementation uses an array of red-black (RB) trees to manage the layered structure of check nodes and adopts a new strategy to expand the Tanner graph. The complexity analysis and the simulation results show that the proposed approach reduces the computational effort effectively. In constructing a low-density parity check code with a length of $10^4$, the RB-tree-array-based implementation takes no more 10% of the time required by the original method.

  • PDF