• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.119-133
• /
• 2011

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.5-9
• /
• 1995

In many cases of robust stability problems, the characteristic polynomial has real coefficients which or nonlinear functions of uncertain parameters. For this set of polynomials, a new stability easily checking algorithm for reducing the conservatism of the stability bound are given. It is the new stability theorem to determine the stability region just in parameter space. Illustrative example show that the presented method has larger stability bound in uncertain parameter space than others.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권7_8호
• /
• pp.387-396
• /
• 2003

본 논문은 STP-MSP을 위한 근사 알고리즘을 제안한다. 이 문제에 대해 근접한 최적 해법을 제공하는 PTAS를 가지는 것이 불가능하기 때문에, 본 논문의 연구는 $n^{O(1)}$의 실행 시간과 근사 비율 2를 가지는 하나의 대안을 제시한다. 본 연구의 중요성은 관련된 다른 미해결문제에 대하여 해결 가능성을 제시하는 것이다. 본 논문의 주요 제안내용은 문제 인스턴스에게 허용오차를 배분하는 것이다. 이로 인해 우리는 무한적 경우에서 다항적 범위로 실행시간을 줄일 수 있다. 관련연구[1,2]가 근사 비율이 2보다 크지만 보다 현실적인 실행시간을 갖는 근사 알고리즘들을 제시한 것이라면, 본 연구는 근사 비율이 2인 근사 알고리즘의 존재를 밝힌 것이다.

• 대한수학회논문집
• /
• 제31권4호
• /
• pp.869-878
• /
• 2016

This paper presents an ecient fractional shifted Legendre polynomial method to solve the fractional Volterra's model for population growth model. The fractional derivatives are described based on the Caputo sense by using Riemann-Liouville fractional integral operator. The theoretical analysis, such as convergence analysis and error bound for the proposed technique has been demonstrated. In applications, the reliability of the technique is demonstrated by the error function based on the accuracy of the approximate solution. The numerical applications have provided the eciency of the method with dierent coecients of the population growth model. Finally, the obtained results reveal that the proposed technique is very convenient and quite accurate to such considered problems.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제31권1호
• /
• pp.49-56
• /
• 2024

For a Polynomial P(z) = Σⁿ_j=0 a_jz^j with a_j ≥ a_j-1, a₀ > 0 (j = 1, 2, ..., n), a classical result of Enestrom-Kakeya says that all the zeros of P(z) lie in |z| ≤ 1. This result was generalized by A. Joyal et al. [3] where they relaxed the non-negative condition on the coefficents. This result was further generalized by Dewan and Bidkham [9] by relaxing the monotonicity of the coefficients. In this paper, we use some techniques to obtain some more generalizations of the results [3], [8], [9].

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.473-484
• /
• 2004

In this paper we give an expression for the kernel and remainder term of Gauss-Radau and Gauss-Lobatto quadratures and study on an error bound with end points of multiplicity γ.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.14-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• 대한수학회보
• /
• 제51권1호
• /
• pp.77-82
• /
• 2014

We prove that if ${\mid}a_1{\mid}$ is large and ${\mid}a_0{\mid}$ is small enough, then every approximate zero of power series equation ${\sum}^{\infty}_{n=0}a_nx^n$=0 can be approximated by a true zero within a good error bound. Further, we obtain Hyers-Ulam stability of zeros of the polynomial equation of degree n, $a_nz^n$ + $a_{n-1}z^{n-1}$ + ${\cdots}$ + $a_1z$ + $a_0$ = 0 for a given integer n > 1.