• East Asian mathematical journal
• /
• v.28 no.5
• /
• pp.533-541
• /
• 2012

A common fixed point result of Gregus type for subcompatible mappings defined on a complete linear metric space is obtained. The considered underlying space is generalized from Banach space to complete linear metric spaces, which include Banach space and complete metrizable locally convex spaces. Invariant approximation results have also been determined as its application.

• East Asian mathematical journal
• /
• v.16 no.2
• /
• pp.205-214
• /
• 2000

In this paper, we shall give new characterizations of best approximation element in linear 2-normed spaces in terms of bounded linear 2-functionals and 2-hyperplanes.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.293-302
• /
• 2001

We improve the greedy algorithm which is one of the general convergence criterion for certain iterative sequence in a given space by building a constructive greedy algorithm on a normed linear space using an arithmetic average of elements. We also show the degree of approximation order is still $Ο(1\sqrt{\n}$) by a bounded linear functional defined on a bounded subset of a normed linear space which offers a good approximation method for neural networks.

• Coupled systems mechanics
• /
• v.7 no.1
• /
• pp.61-77
• /
• 2018

This paper establish a high concentration ratio approximation of linear elastic properties of materials with periodic microstructure with cubic inclusions. The approximation is derived using first few terms of power series expansion of the solution of the equivalent eigenstrain problem with a homogeneous eigenstrain approximation. Viability of the approximation at high concentration ratios is proved by comparison with a numerical solution of the homogenization problem. To this end some theoretical result of symmetry properties of the homogenization problem are given. Using these results efficient numerical computation on a reduced computational domain is presented.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.20-26
• /
• 2011

In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.

• The Pure and Applied Mathematics
• /
• v.8 no.2
• /
• pp.153-162
• /
• 2001

In this Paper, the notion of $\varepsilon$-Birkhoff orthogonality introduced by Dragomir [An. Univ. Timisoara Ser. Stiint. Mat. 29(1991), no. 1, 51-58] in normed linear spaces has been extended to metric linear spaces and a decomposition theorem has been proved. Some results of Kainen, Kurkova and Vogt [J. Approx. Theory 105 (2000), no. 2, 252-262] proved on e-near best approximation in normed linear spaces have also been extended to metric linear spaces. It is shown that if (X, d) is a convex metric linear space which is pseudo strictly convex and M a boundedly compact closed subset of X such that for each $\varepsilon$>0 there exists a continuous $\varepsilon$-near best approximation $\phi$ : X → M of X by M then M is a chebyshev set .

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.97-114
• /
• 2022

Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need to develop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of the ECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has the disadvantage of high complexity using memoization. In this paper, the calculation area and memory usage are improved using a linear approximated template. The proposed algorithm reduces the calculation area required for dynamic programming through local optimization around the vertices of the template. In addition, it minimizes the storage space required by expressing the time information using the error from the vertices of the template, which is more compact than the time difference between vertices. When the length of the signal is L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL) to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 ms to 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square difference confirms that the proposed algorithm is a stable approximation.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.251-264
• /
• 2004

We introduce a semidiscrete mixed finite element approximation for the single-phase linear Stefan problem and show the unique existence of the approximation. And the optimal rate of convergence in $L^2$ and $H^1$ norms are derived.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.179-187
• /
• 2013

Bates and Watts (1981) have discussed the problems of reparameterizing nonlinear models in obtaining accurate linear approximation confidence regions for the parameters. A similar problem exists with computing confidence curves for fitted values or predictions. The statistical behavior of fitted values does not depend on the parameterization. Thus, as long as the intrinsic curvature is small, standard Wald intervals for fitted values are likely to be sufficient. Accuracy of linear approximation for fitted values is investigated using confidence curves.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.12
• /
• pp.1333-1339
• /
• 2009

A MWR(Missile Warning Radar) of GVES(Ground Vehicle Equipment System) has to effectively decide the threat for a detected target. Linear Approximation Fitting(LAF) and Weighted Linear Approximation Fitting(WLAF) algorithm is proposed as algorithm for a threat decision method. The target is classified into a threat or non-threat using a boundary condition of the angular rate, and the boundary condition is determined using probability model simulation. This paper confirms the performance of proposed threat decision algorithm using measurement.