• 한국위성정보통신학회논문지
• /
• 제7권1호
• /
• pp.53-58
• /
• 2012

본 논문에서는 sparse 채널에서 대표적인 채널 추정 기법들의 오차 성능을 비교 및 분석한다. 오차 성능을 비교하기 위해 크라머-라오 경계를 이용하여 최소평균자승오차 추정기법의 하한 경계를 구하고 이를 정합 추적 기법의 상한 경계와 분석한다. 분석 결과로부터 추정 탭 개수와 신호 대 잡음비에 따라 기존에 sparse 채널에서 효율적인 추정기법으로 알려진 정합 추적 기법보다 최소평균 자승오차 추정기법의 오차가 적을 수 있음을 보인다. 레일리이 페이딩 분포를 갖는 두 개의 sparse 채널에 대한 전산모의실험 결과 신호 대 잡음비에 따라 두 추정 기법의 오차 성능이 반전되는 경우를 보였다.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.231-242
• /
• 2001

We showed in [2] that if r≤2, zero mean Gaussian of average error of the Trapezoidal rule is proportional to h/sub i//sup 2r+3/ on the interval [0,1]. In this paper, if r≥3, we show that zero mean Gaussian of average error of the Trapezoidal rule is bounded by Ch⁴/sub i/h⁴/sub j/.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.245-259
• /
• 2007

This paper studies some properties of the value functions and gives some sufficient and necessary conditions about the presented global error and local error. And it leads to one kind of relationship between iterative points and optimal solution or K-T point.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권4호
• /
• pp.245-271
• /
• 2023

In this paper we discuss some recovery of H(div)-conforming flux approximations from the equilibrated fluxes of Ainsworth and Oden for quadratic finite element methods of second-order elliptic problems. Combined with the hypercircle method of Prager and Synge, these flux approximations lead to a posteriori error estimators which provide guaranteed upper bounds on the numerical error. Furthermore, we prove some superconvergence results for the flux approximations and asymptotic exactness for the error estimator under proper conditions on the triangulation and the exact solution. The results extend those of the previous paper for linear finite element methods.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.615-622
• /
• 2005

In this paper, we discuss the average case errors of some numerical quadratures, namely Trapezoidal and Simpson's, in the numerical integration problem. Our integrands are r-fold Wiener functions from the interval [0,1] and only at finite number of points the function values are evaluated. We study average case errors of these quadratures theoretically and then compare it with our practical (a posteriori) researches. Monte-Carlo simulation is used to perform these empirical researches. Finally we empirically compute the error bounds of studied quadratures for the higher degrees of Wiener functions.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.990-993
• /
• 2005

This paper presents new results on designing a robust adaptive direct controller for a class of non-linear first order systems. The designing method based on the use of dead zone in the parameters' update law. It is shown that the size of the dead zone does not depend on the upper bounds of the disturbances. That means that even if the bounds are large, the tracking error will always converge to a set of the dead zone size. However, in the ideal case, when the exogenous signal functions and the function represents un-modeled dynamics of the systems equal to zero, the proposed controller does nt mean the convergence to zero of the tracking error. Computer simulation results show the effectiveness of the controller in dealing with the stated problems.

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

In this paper, a fifth order extension of Potra's third order iterative method is proposed for solving nonlinear equations. A convergence theorem along with the error bounds is established. The method takes three functions and one derivative evaluations giving its efficiency index equals to 1.495. Some numerical examples are also solved and the results obtained are compared with some other existing fifth order methods. Next, the interval extension of both third and fifth order Potra's method are developed by using the concepts of interval analysis. Convergence analysis of these methods are discussed to establish their third and fifth orders respectively. A number of numerical examples are worked out using INTLAB in order to demonstrate the efficacy of the methods. The results of the proposed methods are compared with the results of the interval Newton method.

• 대한수학회지
• /
• 제48권3호
• /
• pp.655-667
• /
• 2011

A class of functions involving divided differences of the psi and tri-gamma functions and originating from Kershaw's double inequality are proved to be completely monotonic. As applications of these results, the monotonicity and convexity of a function involving the ratio of two gamma functions and originating from the establishment of the best upper and lower bounds in Kershaw's double inequality are derived, two sharp double inequalities involving ratios of double factorials are recovered, the probability integral or error function is estimated, a double inequality for ratio of the volumes of the unit balls in $\mathbb{R}^{n-1}$ and $\mathbb{R}^n$ respectively is deduced, and a symmetrical upper and lower bounds for the gamma function in terms of the psi function is generalized.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권1호
• /
• pp.101-107
• /
• 2000

In this paper we establish an upper bound for the estimation error variance of a continuous stream with a stationary variogram V which is assumed to be of the r-Holder type (Lipschitzian) on [-d, d]. Functional properties for the mapping ${\xi}(t):=E[(X-X(t))^2]$, $t{\in}[0,d]$, are also given.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.