• Communications of the Korean Mathematical Society
• /
• v.22 no.1
• /
• pp.53-64
• /
• 2007

In this paper, we apply the generalized quasilinearization technique to a forced Duffing equation with three-point mixed nonlinear nonlocal boundary conditions and obtain sequences of upper and lower solutions converging monotonically and quadratically to the unique solution of the problem.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.661-672
• /
• 2009

In this paper, we introduce a modified three-step iteration scheme with errors for asymptotically nonexpansive mappings in the framework of uniformly convex Banach spaces. Weak and strong convergence theorems are established.

• East Asian mathematical journal
• /
• v.31 no.3
• /
• pp.379-382
• /
• 2015

The purpose of this note is to study the estimation of errors of the implicit Mann iterative process with random errors.

• Communications of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.253-265
• /
• 2019

The aim of this paper is to study convergence behaviour of Thakur iteration scheme in CAT(0) spaces for generalized nonexpansive mappings. In process, several relevant results of the existing literature are generalized and improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.10 no.2 s.48
• /
• pp.21-29
• /
• 2006

It is impractical to install sensors on every floor of a tall building to measure the full state vector because of the large number of degrees of freedom. This makes it necessary to introduce reduced order control. A kind of system reduction scheme (dynamic condensation method) is proposed in this paper. This method is iterative and Guyan condensation is looked upon as an initial approximation of the iteration. Since the reduced order system is updated repeatedly until a desired one is obtained, the accuracy of the reduced order system resulting from the proposed method is much higher than that obtained from the Guyan condensation method. An eigenvalue shilling technique is applied to accelerate the convergence of Iteration. Two schemes to establish the reduced order system by using the proposed method are also presented and discussed in this paper. The results for a tail building with active tuned mass damper show that the proposed method is efficient for the reduced order modelling and the accuracy is very close to exact only after two iterations.

• The Pure and Applied Mathematics
• /
• v.11 no.4
• /
• pp.293-308
• /
• 2004

Let K be a nonempty convex subset of an arbitrary Banach space X and $T\;:\;K\;{\rightarrow}\;K$ be a uniformly continuous strictly hemi-contractive operator with bounded range. We prove that certain Ishikawa iteration scheme with errors both converges strongly to a unique fixed point of T and is almost T-stable on K. We also establish similar convergence and almost stability results for strictly hemi-contractive operator $T\;:\;K\;{\rightarrow}\;K$, where K is a nonempty convex subset of arbitrary uniformly smooth Banach space X. The convergence results presented in this paper extend, improve and unify the corresponding results in Chang [1], Chang, Cho, Lee & Kang [2], Chidume [3, 4, 5, 6, 7, 8], Chidume & Osilike [9, 10, 11, 12], Liu [19], Schu [25], Tan & Xu [26], Xu [28], Zhou [29], Zhou & Jia [30] and others.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.11
• /
• pp.880-885
• /
• 2017

In AD-MUSIC algorithm, DOD/DOA can be estimated without computationally expensive two-dimensional search. In this paper, to further reduce the computational complexity, the Newton type method has been applied to one-dimensional search. In this paper, we summarize the formulation of the AD-MUSIC algorithm, and present how to apply Newton-type iteration to AD-MUSIC algorithm for improvement of the accuracy of the DOD/DOA estimates. Numerical results are presented to show that the proposed scheme is efficient in the viewpoints of computational burden and estimation accuracy.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.38-44
• /
• 2001

An efficient Gauss-Seidel time integration scheme is developed for solving the Euler and Navier-Stokes equations on unstructured meshes. Roe's FDS is used for the explicit residual computations and van Leer's FVS for evaluating implicit flux Jacobian. To reduce the memory requirement to a minimum level, off-diagonal flux Jacobian contributions are repeatedly calculated during the Gauss-Seidel sub-iteration process. Computational results based on the present scheme show that approximately $15\%$ of CPU time reduction is achieved while maintaining the memory requirement level to $50-60\%$ of the original Gauss-Seidel scheme.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.1-10
• /
• 1994

In most application programs, loops usually contain most of the computation in a program and are the most improtant source of parallelism. When loops are executed on multiprocessors, the cross iteration data dependences need to be enforced by synchronization between processors. In this paper, we propose a new synchronization scheme(Free/Hold) for reducing overgeads occured by synchronization variables in data oriented scheme and delay of time occured by synchronization instruction in statement oriented scheme. The Free/Hold mechanism enforces the correct execution order by inserting synchronization instruction between each instance with data dependence relationship using the RD(Real dependence Distance). We also present an algorithm for removing unnecessary dependences in one-to-many dependences.