• The Pure and Applied Mathematics
• /
• v.15 no.2
• /
• pp.111-120
• /
• 2008

A semi local convergence analysis is provided for Newton's method in a Banach space setting. The operators involved are only locally Holderian. We make use of a point-based approximation and center-Holderian hypotheses. This approach can be used to approximate solutions of equations involving nonsmooth operators.

• Korean Journal of Geomatics
• /
• v.4 no.1
• /
• pp.31-37
• /
• 2004

The aim of this research is comparing the existing approximation models (e.g. Affine Transformation and Direct Linear Transformation) with Rational Function Model as a substitute of rigorous sensor model of linear array scanner, especially push-broom sensor. To do so, this research investigates the mathematical model of each approximation method. This is followed by the assessments of accuracy of transformation from object space to image space by using simulated data generated by collinearity equations which incorporate or depict the physical aspects of linear array sensor.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.1
• /
• pp.165-175
• /
• 2021

In this article we derive some best approximation theorems for multimaps in abstract convex metric spaces. We are based on generalized KKM maps due to Kassay-Kolumbán, Chang-Zhang, and studied by Park, Kim-Park, Park-Lee, and Lee. Our main results are extensions of a recent work of Mitrović-Hussain-Sen-Radenović on G-convex metric spaces to partial KKM metric spaces. We also recall known works related to single-valued maps, and introduce new partial KKM metric spaces which can be applied our new results.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.801-810
• /
• 2023

The aim of this paper, investigated of weighted space which contained the unbounded functions which is to be approximated by linear operators in terms some Well-known approximation tools such as the modulus of smoothness and K-functional. The characteristics of the identical theorem between modulus of smoothness and K-functional are consider. In addition to the establish the direct, converse and identical theorem by using some linear operators in terms modulus Ditzian-Totik.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.2
• /
• pp.495-504
• /
• 2015

The Gaussian geostatistical model has been widely used for modeling spatial data. However, this model suffers from a severe difficulty in computation because inference requires to invert a large covariance matrix in evaluating log-likelihood. In addressing this computational challenge, three strategies have been employed: likelihood approximation, lower dimensional space approximation, and Markov random field approximation. In this paper, we reviewed statistical approaches attacking the computational challenge. As an illustration, we also applied integrated nested Laplace approximation (INLA) technology, one of Markov approximation approach, to real data to provide an example of its use in practice dealing with large spatial data.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.69-78
• /
• 2005

It is crucial to compute the Euclidean distance between two vectors efficiently in high dimensional space for multimedia information retrieval. In this paper, we propose an effective method for approximating the Euclidean distance between two high-dimensional vectors. For this approximation, a previous method, which simply employs norms of two vectors, has been proposed. This method, however, ignores the angle between two vectors in approximation, and thus suffers from large approximation errors. Our method introduces an additional vector called a reference vector for estimating the angle between the two vectors, and approximates the Euclidean distance accurately by using the estimated angle. This makes the approximation errors reduced significantly compared with the previous method. Also, we formally prove that the value approximated by our method is always smaller than the actual Euclidean distance. This implies that our method does not incur any false dismissal in multimedia information retrieval. Finally, we verify the superiority of the proposed method via performance evaluation with extensive experiments.

• Journal of Satellite, Information and Communications
• /
• v.5 no.2
• /
• pp.50-56
• /
• 2010

Most mission trajectory design technologies for space exploration have been utilized the Patched Conic Approximation which is based on Hohmann transfer in two-body problem. The Hohmann transfer trajectory is basically an elliptic trajectory, and Patched Conic Approximation consists of Hohmann transfer trajectories in which each trajectory are patched to the next one. This technology is the most efficient method when considering only one major planet at each patch trajectory design. The disadvantages of the conventional Patched Conic Approach are more fuel (or mass) needed and only conic trajectories are designed. Recent space exploration missions need to satisfy more various scientific or engineering goals, and mission utilizing smaller satellites are needed for cost reduction. The geometrical characteristics of three-body dynamics could change the paradigm of the conventional solar system. In this theoretical concept, one can design a trajectory connecting around the solar system with comparably very small energy. In this paper, the basic three-body dynamics are introduced and a spacecraft mission trajectory is designed utilizing the three-body dynamics.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.537-545
• /
• 2007

Necessary conditions for the existence of common fixed points for noncommuting mappings satisfying generalized contractive conditions in the setup of certain metrizable topological vector spaces are obtained. As applications, related results on best approximation are derived. Our results extend, generalize and unify various known results in the literature.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.467-482
• /
• 2000

Testing equality of two and k distributions has long been an interesting issue in statistical inference. To overcome the sparseness of data points in high-dimensional space and deal with the general cases, we suggest several projection pursuit type statistics. Some results on the limiting distributions of the statistics are obtained, some properties of Bootstrap approximation are investigated. Furthermore, for computational reasons an approximation for the statistics the based on Number theoretic method is applied. Several simulation experiments are performed.

• East Asian mathematical journal
• /
• v.28 no.5
• /
• pp.543-552
• /
• 2012

The aim of this paper is to prove a common fixed point theorem in normed linear spaces for discontinuous, occasionally weakly biased mappings without assuming completeness of the space. We give an example to illustrare our theorem. We also give an application of our theorem to best approximation theory. Our theorem improve the results of Gregus [9], Jungck [12], Pathak, Cho and Kang [22], Sharma and Deshpande [26]-[28].