• Korean Journal of Mathematics
• /
• 제18권3호
• /
• pp.253-259
• /
• 2010

In this paper we establish approximation of contraction C-semigroups on the extrapolation space $X^C$, by showing the equicontinuity of contraction C-semigroups on $X^C$.

• Kyungpook Mathematical Journal
• /
• 제54권2호
• /
• pp.321-332
• /
• 2014

In this article we introduce different types of multiplier I-convergent double sequence spaces. We study their different algebraic and topological properties like solidity, symmetricity, completeness etc. The decomposition theorem is established and some inclusion results are proved.

• 호남수학학술지
• /
• 제36권3호
• /
• pp.679-688
• /
• 2014

The notion of asymptotically negative dependence for collection of random variables is generalized to a Hilbert space and the almost sure convergence for these H-valued random variables is obtained. The result is also applied to a linear process generated by H-valued asymptotically negatively dependent random variables.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.127-143
• /
• 2015

In this paper, we consider a modified inexact Newton method for solving a nonlinear system F(x) = 0 where $F(x):R^n{\rightarrow}R^n$. The basic idea is to accelerate convergence. A semi-local convergence theorem for the modified inexact Newton method is established and an affine invariant version is also given. Moreover, we test three numerical examples which show that the modified inexact scheme is more efficient than the classical inexact Newton strategy.

• Nonlinear Functional Analysis and Applications
• /
• 제26권1호
• /
• pp.1-11
• /
• 2021

In this paper we study the weak and strong convergence to minimizers of convex function of proximal point algorithm SP-iteration of three multivalued nonexpansive mappings in a Hilbert space.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.1013-1016
• /
• 1999

Simple Genetic Algorithm(SGA) proposed by J. H. Holland is a population-based optimization method based on the principle of the Darwinian natural selection. The theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. Although GA does well in many applications as an optimization method, still it does not guarantee the convergence to a global optimum in GA-hard problems and deceptive problems. Therefore as an alternative scheme, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve. In this paper we propose an extended schema theorem associated with a schema co-evolutionary algorithm(SCEA), which explains why the co-evolutionary algorithm works better than SGA. The experimental results show that the SCEA works well in optimization problems including deceptive functions.

• Nonlinear Functional Analysis and Applications
• /
• 제26권2호
• /
• pp.411-432
• /
• 2021

In this paper, an inertial Halpern-type forward backward iterative algorithm for approximating solution of a monotone inclusion problem whose solution is also a fixed point of some nonlinear mapping is introduced and studied. Strong convergence theorem is established in a real Hilbert space. Furthermore, our theorem is applied to variational inequality problems, convex minimization problems and image restoration problems. Finally, numerical illustrations are presented to support the main theorem and its applications.

• International Journal of Contents
• /
• 제11권2호
• /
• pp.31-36
• /
• 2015

Recent years have seen a significant increase in demand for multimedia data over wireless sensor networks for monitoring applications that utilize sensor nodes to collect multimedia data, including sound and video. However, the multimedia streams generate a very large amount of data. When data transmission schemes for traditional wireless sensor networks are applied in wireless multimedia sensor networks, the network lifetime significantly decreases due to the excessive energy consumption of specific nodes. In this paper, we propose a data compression scheme that implements the Chinese remainder theorem to a wireless multimedia sensor network. The proposed scheme uses the Chinese Remainder Theorem (CRT) to compress and split multimedia data, and it then transmits the bit-pattern packets of the remainder to the base station. As a result, the amount of multimedia data that is transmitted is reduced. The superiority of our proposed scheme is demonstrated by comparing its performance to that of an existing scheme. The results of our experiment indicate that our proposed scheme significantly increased the compression ratio and reduced the compression operation in comparison to those of existing compression schemes.

• Journal of applied mathematics & informatics
• /
• 제8권2호
• /
• pp.345-360
• /
• 2001

Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the mth(m≥2 an integer). Radius of convergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover, we show that under hypotheses on the mth Frechet-derivative our radius of convergence can sometimes be larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also provided to show that our radius of convergence is larger than the one in [10].

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.393-406
• /
• 1999

Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the second. Radius of con-vergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivation our radius of convergence results are derived. Results involving superlinear convergence and known to be true or inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivative our radius of conver-gence is larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also pro-vided to show that our radius of convergence is larger then the one in [10].