• 대한수학회보
• /
• 제38권4호
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• 대한수학회지
• /
• 제38권3호
• /
• pp.657-667
• /
• 2001

We propose a statistical interpolation approximate solution for a nonlinear stochastic integral equation of a stock price process. The proposed method has the order O(h$^2$) of local error under the weaker conditions of $\mu$ and $\sigma$ than those of Milstein' scheme.

• 대한수학회지
• /
• 제38권6호
• /
• pp.1235-1243
• /
• 2001

We obtain bounds relating to Eulers formula for the case of a function with higher-order convexity properties. These are used to derive estimates of the error involved in the use of the trapezoidal formula for integrating such a function.

• 호남수학학술지
• /
• 제32권1호
• /
• pp.53-60
• /
• 2010

The concept of discrete curvature is a discretization of the curvature. Many literatures introduce discrete curvatures derived from arc length of circular arcs. We propose a new concept of discrete curvature of a polygon at each vertex, which is derived from area of fan shapes. We estimate the error of the discrete curvature and compare the discrete curvature with old one.

• 대한수학회보
• /
• 제38권2호
• /
• pp.231-236
• /
• 2001

In this note we construct a sequence of Picard iterates suitable for the approximation of solutions of K-positive definite operator equations in arbitrary real Banach spaces. Explicit error estimate is obtained and convergence is shown to be as fast as a geometric progression.

• 대한수학회논문집
• /
• 제32권3호
• /
• pp.565-566
• /
• 2017

An error in the proof of Theorem 1 of "On partition congruences for overcubic partition pairs" [Commun. Korean Math. Soc. 27 (2012), no. 3, 477-482] is corrected.

• 대한수학회논문집
• /
• 제35권4호
• /
• pp.1193-1202
• /
• 2020

We consider the integral ${{\int}_{0}^{\infty}}(\frac{sin\;x}{x})^n\;dx$ as a function of the positive integer n. We show that there exists an asymptotic series in ${\frac{1}{n}}$ and compute the first terms of this series together with an explicit error bound.

• East Asian mathematical journal
• /
• 제26권3호
• /
• pp.365-370
• /
• 2010

A local convergence result is provided for the continuous analog of Newton's method in a Banach space setting. The radius of convergence is larger, the error bounds tighter, and under the same or weaker hypotheses than before [12].

• 대한수학회보
• /
• 제48권1호
• /
• pp.95-104
• /
• 2011

We improve some inequalities of Ostrowski-like type and further generalize them.

• 충청수학회지
• /
• 제27권4호
• /
• pp.753-762
• /
• 2014

A three-step sextic simple-root finder is constructed with the use of weighting functions of derivative-to-derivative ratios. Their convergence and computational properties are investigated along with concrete numerical examples to verify the theoretical analysis.