• East Asian mathematical journal
• /
• 제28권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
• /
• 제16권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.

• 대한수학회보
• /
• 제38권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
• /
• 제7권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.

• 한국전자통신학회논문지
• /
• 제6권1호
• /
• pp.20-26
• /
• 2011

본 논문에서는 NM(node monitoring) 알고리듬과 NP(Piecewise Linear Function Approximation)를 사용해서 LDPC 코드 복호의 복잡도를 감소시키기 위한 효율적인 알고리듬을 제안한다. 이 NM 알고리듬은 새로운 node-threshold 방법과 message passing 알고리듬에 근거해서 제안되었는데, 이에 NP 방법을 사용해서 알고리듬의 복잡도를 더 줄일 수 있었다. 이 알고리듬의 효율성을 입증하기 위해서 모의 실험을 하였다. 모의실험결과, 기존에 잘 알려진 방법에 비해서 20% 정도 더 효율적이었다.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제8권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
• /
• 제18권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
• /
• 제15권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
• /
• 제24권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.

• 한국전자파학회논문지
• /
• 제20권12호
• /
• pp.1333-1339
• /
• 2009

지상기동 장비에 장착되는 미사일 경고 레이더는 탐지된 표적에 의한 위협을 효과적으로 판단해야 한다. 본 논문에서는 위협 판단 기법인 선형 근사 알고리즘과 가중 선형 근사 알고리즘에 대해 확률 모델을 적용한 시뮬레이션을 통해 성능을 평가하였다. 또한 실제 측정을 통해 위협 판단 알고리즘의 타당성을 확인하였다.