• Communications of the Korean Mathematical Society
• /
• v.26 no.3
• /
• pp.483-498
• /
• 2011

In this paper, we introduce a new class of uniformly point-wise R-subweakly commuting self-mappings and prove several common fixed point theorems and best approximation results for uniformly point-wise R-subweakly commuting asymptotically I-nonexpansive mappings in normed linear spaces. We also establish some results concerning strong convergence of nearest common fixed points of asymptotically I-non-expansive mappings in reflexive Banach spaces with a uniformly G$\^{a}$teaux differentiable norm. Our results unify and generalize various known results given by some authors to a more general class of noncommuting mappings.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.5
• /
• pp.344-353
• /
• 2007

In this paper, we address the problem of robust geometric modeling with emphasis on surface to surface intersections. We consider the topology and the numerical accuracy of an intersection curve to find the best approximation to the exact one. First, we perform the topological configuration of intersection curves, from which we determine the starting and ending points of each monotonic intersection curve segment along with its topological structure. Next, we trace each monotonic intersection curve segment using a validated ODE solver, which provides the error bounds containing the topological structure of the intersection curve and enclosing the exact root without a numerical instance. Then, we choose one approximation curve and adjust it within the bounds by minimizing an objective function measuring the errors from the exact one. Using this process, we can obtain an approximate intersection curve which considers the topology and the numerical accuracy for robust geometric modeling.

• Journal of Magnetics
• /
• v.20 no.2
• /
• pp.193-200
• /
• 2015

Direct-acting solenoid valves are used in the automotive industry due to their simple structure and quick response in controlling the flow of fluid. We performed an optimization study of response time in order to improve the dynamic performance of a direct-acting solenoid valve. For the optimal design process, we used the commercial optimization software PIAnO, which provides various tools for efficient optimization including design of experiments (DOE), approximation techniques, and a design optimization algorithm. 35 sampling points of computational experiments are performed to find the optimum values of the design variables. In all cases, ANSYS Maxwell electromagnetic analysis software was used to model the electromagnetic dynamics. An approximate model generated from the electromagnetic analysis was estimated and used for the optimization. The best optimization model was selected using the verified approximation model called the Kriging model, and an optimization algorithm called the progressive quadratic response surface method (PQRSM).

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.25-33
• /
• 1988

An efficient heuristic solution procedure is developed for the minimum location problems. The gradient direction method and modified gradient approach are developed due to the differentiability of the objective functions. Suboptimal step size is obtained analytically. A Modified Gradient Procedure (NGP) is presented and compared with the hyperboloid approximation procedure (HAP) which is one of the best known methods.

• East Asian mathematical journal
• /
• v.24 no.4
• /
• pp.369-375
• /
• 2008

In this paper, we first introduce inwards set valued maps in hyperconvex metric spaces. Then we present fixed point theory for continuous condensing inward set valued maps.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.847-851
• /
• 1990

In this paper we present a method of reducing controller design problem from LQG/LTR approach to H.inf. optimization. The condition of the existance of the optimal solution is derived. In order to derive the controller equation for NMP plant we reduce the H.inf. LTR problem to Nehari's extension problem and derive the optimal controller equation which is best approximation for this problem. Furthermore, we show that the controller obtained by presented method guarantee the asymptotic LTR condition and stability of closed loop system.

• Korean Journal of Mathematics
• /
• v.22 no.4
• /
• pp.671-681
• /
• 2014

In this paper, we consider general Beta operators, which is a general sequence of integral type operators including Beta function. We study the King type Beta operators which preserves the third test function $x^2$. We obtain some approximation properties, which include rate of convergence and statistical convergence. Finally, we show how to reach best estimation by these operators.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.743-753
• /
• 2000

In the space $C_1(X)$ of real-valued continuous functions with $L_1-norm$, every bounded set has a relative Chebyshev center in a finite-dimensional subspace S. Moreover, the set function $F\rightarrowZ_S(F)$ corresponding to F the set of its relative Chebyshev centers, in continuous on the space B[$C_1(X)$(X)] of nonempty bounded subsets of $C_1(X)$ (X) with the Hausdorff metric. In particular, every bounded set has a relative Chebyshev center in the closed convex set S(F) of S and the set function $F\rightarrowZ_S(F)$(F) is continuous on B[$C_1(X)$ (X)] with a condition that the sets S(.) are equal.

• The Journal of the Korean dental association
• /
• v.54 no.11
• /
• pp.850-864
• /
• 2016

The Generalized Estimating Equations (GEE) approach is a widely used statistical method for analyzing longitudinal data and clustered data in clinical studies. In dentistry, due to multiple outcomes obtained from one patient, the outcomes produced from an individual patient are correlated with one another. This study focused on the basic ideas of GEE and introduced the types of covariance matrix and working correlation matrix. The quasi-likelihood information criterion (QIC) and quasi-likelihood information criterion approximation ($QIC_u$) were used to select the best working correlation matrix and the best fitting model for the correlated outcomes. The purpose of this study is to show a detailed process for the GEE analysis using SPSS software along with an orthodontic miniscrew example, and to help understand how to use GEE analysis in dental research.