• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.507-518
• /
• 2016

The aim of this paper is to prove some strong convergence theorems for the modified Ishikawa iteration process involving a pair of a generalized asymptotically nonexpansive single-valued mapping and a quasi-nonexpansive multi-valued mapping in the framework of $\mathbb{R}$-trees under the gate condition.

• Communications of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.183-194
• /
• 2007

For an irreducible binomial polynomial $f(x)=x^n-b{\in}K[x]$ with a field K, we ask when does the mth iteration $f_m$ is irreducible but $m+1th\;f_{m+1}$ is reducible over K. Let S(n, m) be the set of b's such that $f_m$ is irreducible but $f_{m+1}$ is reducible over K. We investigate the set S(n, m) by taking K as the rational number field.

• Journal of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.357-378
• /
• 2012

In this paper, we consider the convective Cahn-Hilliard equation. Based on the regularity estimates for the semigroups, iteration technique and the classical existence theorem of global attractors, we prove that the convective Cahn-Hilliard equation possesses a global attractor in $H^k$($k\geq0$) space, which attracts any bounded subset of $H^k({\Omega})$ in the $H^k$-norm.

• Journal of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.737-746
• /
• 1999

We consider a class of discrete parameter processes on a locally compact Banach space S arising from successive compositions of strictly stationary random maps with state space C(S,S), where C(S,S) is the collection of continuous functions on S into itself. Sufficient conditions for stationary solutions are found. Existence of pth moments and convergence of empirical distributions for trajectories are proved.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.187-200
• /
• 2012

In this paper, we introduced a new extended extragradient iteration algorithm for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of equilibrium problems for a monotone and Lipschitz-type continuous mapping. And we show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.114-116
• /
• 2012

Sparse한 신호 복원 방법으로 underdetermined system에서 greed 알고리듬은 간결함과 낮은 복잡도로 인해 활발히 연구되고 있다. 이에 본 논문은 기존 greed 알고리듬 기법에서 iteration 마다 다중 경로를 이용하여 스파스 신호를 복원하는 개선된 알고리듬을 제안한다. 모의 실험을 통해 제안된 알고리듬이 기존의 greedy 알고리듬보다 좋은 복원 성능을 가짐을 확인할 수 있다.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.383-405
• /
• 2004

We study the incomprssible Navier Stokes equations for the flow inside contraction geometry. The governing equations are expressed in the vorticity-stream function formulations. A rectangular computational domain is arised by elliptic grid generation technique. The numerical solution is based on a technique of automatic numerical generation of acurvilinear coordinate system by transforming the governing equation into computational plane. The transformed equations are approximated using central differences and solved simultaneously by successive over relaxation iteration. The time dependent of the vorticity equation solved by using explicit marching procedure. We will apply the technique on several irregular-shapes.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.195-205
• /
• 2004

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the quasi-Newton iteration pattern. We prove the global convergence properties of the algorithm associating with the general form of line search, and prove the quadratic convergence rate of the algorithm under some conditions.

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

In this paper, we present the three-step mean value iterative scheme and prove that the iteration sequence converge strongly to a common element of the set of fixed points of a nonexpansive mappings and the set of the solutions of the variational inclusions under some mild conditions. The results presented in this paper extend, generalize and improve the results of Noor and Huang and some others.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.823-835
• /
• 2010

In this paper, A FSQP algorithm for degenerate inequality constraints optimization problems is proposed. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving another quadratic programming subproblem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions. Finally, some preliminary numerical results are reported.