• 한국컴퓨터정보학회논문지
• /
• 제21권9호
• /
• pp.79-84
• /
• 2016

In this paper we consider the problem of finding the triplet (S,${\pi}$,f), where $S{\subseteq}V$, ${\pi}$ is a sequence of nodes in S and $f:V{\backslash}S{\rightarrow}S$ for a given complete graph G=(V,E). In particular, there exist two costs, $c^V_{uv}$ and $c^D_{uv}$ for $(u,v){\in}E$, and the cost of triplet (S,${\pi}$,f) is defined as $\sum_{i=1}^{{\mid}S{\mid}}c^V_{{\pi}(i){\pi}(i+1)}+2$ ${\sum_{u{\in}V{\backslash}S}c^D_{uf(u)}$. This problem is motivated by the integrated routing of the vehicle and drone for urban delivery services. Since a well-known NP-complete TSP (Traveling Salesman Problem) is a special case of our problem, we cannot expect to have any polynomial-time algorithm unless P=NP. Furthermore, for practical purposes, we may not rely on time-exhaustive enumeration method such as branch-and-bound and branch-and-cut. This paper suggests the simple heuristic which is motivated by the MST (minimum spanning tree)-based approximation algorithm and neighborhood search heuristic for TSP.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1823-1827
• /
• 1991

The problem regarding nonlinear systems has come to occupy an important position. In order to solve a nonlinear problem we have methods of linearization which are developed through linear approximation to adapt linear system theories. In this paper we present a formal linearization of nonlinear systems based on the discrete-Fourier transform (D.F.T.).

• 정보처리학회논문지D
• /
• 제11D권1호
• /
• pp.219-228
• /
• 2004

지금까지 비율(proportion)에 대한 신뢰구간의 근사적 추정량(approximate estimator)에 대한 여러 기법들이 제안되었으나, 시뮬레이션 결과에 대한 coverage 분석을 수행할 경우에는 정규분포에 기반 한 신뢰구간 추정량이 주로 이용되었다. 그 이유는 정규분포에 대한 근사법이 다른 근사법들 보다 실제 구현하는데 쉽게 여겨졌기 때문이다. 하지만, 최근에 arcsin 변환에 기반한 coverage 분석을 위한 근사법이 [12]에서 시뮬레이션 수행 시에 최종결과에 요구되는 정확도의 조절과 비율을 추정하기 위해서 사용되었다. 본 논문에서는 세 개의 신뢰구간 추정량 근사법(정규분포 기반 근사법, arcsin 변환 기반 근사법, 그리고 F-분포 기반 근사법)을 비교 분석하였다. 세 신뢰구간에 대한 추정량을 단일 프로세서와 다중 프로세서 상에서 참조모델(reference model)로 M/M/1/$\infty$와 W/D/l/$\infty$ 큐잉 시스템을 활용하여 정상상태(steady-state)에서의 평균치를 추정하는 시뮬레이션에 적용하였다.

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

In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.

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

In this paper, we prove the global existence and uniqueness of the dissipative Kirchhoff equation $$u_{tt}-M({\parallel}{\nabla}u{\parallel}^2){\triangle}u+{\alpha}u_t+f(u)=0\;in\;{\Omega}{\times}[0,{\infty}),\\u(x,t)=0\;on\;{\Gamma}_1{\times}[0,{\infty}),\\{\frac{{\partial}u}{\partial{\nu}}}+g(u_t)=0\;on\;{\Gamma}_0{\times}[0,{\infty}),\\u(x,0)=u_0,u_t(x,0)=u_1\;in\;{\Omega}$$ with nonlinear boundary damping by Galerkin approximation benefited from the ideas of Zhang et al. [33]. Furthermore,we overcome some difficulties due to the presence of nonlinear terms $M({\parallel}{\nabla}u{\parallel}^2)$ and $g(u_t)$ by introducing a new variables and we can transform the boundary value problem into an equivalent one with zero initial data by argument of compacity and monotonicity.

• Structural Engineering and Mechanics
• /
• 제4권1호
• /
• pp.61-72
• /
• 1996

The time-stepping boundary element method has been so far applied by the authors to transient heat conduction in isotropic solids as well as in orthotropic solids. In this paper, attempt is made to extend the method to 2-D transient heat conduction in arbitrarily anisotropic solids. The resulting boundary integral equation is discretized by means of the boundary element with quadratic interpolation. The final system of equations thus obtained is solved by advancing the time step from the given initial state to the final state. Through numerical compuation of a few examples the potential usefulness of the proposed method is demonstrated.

• Journal of applied mathematics & informatics
• /
• 제7권1호
• /
• pp.41-60
• /
• 2000

In this paper we consider a series of algorithms for calculating radicals of matrix polynomial equations. A particular aspect of this problem arise in author's work. concerning parameter identification of linear dynamic stochastic system. Special attention is given of searching the solution of an equation in a neighbourhood of some initial approximation. The offered approaches and algorithms allow us to receive fast and quite exact solution. We give some recommendations for application of given algorithms.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.6-6
• /
• 2003

In this work we consider the mathematical formulation and numerical resolution of the linear feedback control problem for Boussinesq equations. The controlled Boussinesq equations is given by $$\frac{{\partial}u}{{\partial}t}-{\nu}{\Delta}u+(u{\cdot}{\nabla}u+{\nabla}p={\beta}{\theta}g+f+F\;\;in\;(0,\;T){\times}\;{\Omega}$$, $${\nabla}{\cdot}u=0\;\;in\;(0,\;T){\times}{\Omega}$$, $$u|_{{\partial}{\Omega}=0,\;u(0,x)=\;u_0(x)$$ $$\frac{{\partial}{\theta}}{{\partial}t}-k{\Delta}{\theta}+(u{\cdot}){\theta}={\tau}+T,\;\;in(0,\;T){\times}{\Omega}$$ $${\theta}|_{{\partial}{\Omega}=0,\;\;{\theta}(0,X)={\theta}_0(X)$$, where $\Omega$ is a bounded open set in $R^{n}$, n=2 or 3 with a $C^{\infty}$ boundary ${\partial}{\Omega}$. The control is achieved by means of a linear feedback law relating the body forces to the velocity and temperature field, i.e., $$f=-{\gamma}_1(u-U),\;\;{\tau}=-{\gamma}_2({\theta}-{\Theta}}$$ where (U,$\Theta$) are target velocity and temperature. We show that the unsteady solutions to Boussinesq equations are stabilizable by internal controllers with exponential decaying property. In order to compute (approximations to) solution, semi discrete-in-time and full space-time discrete approximations are also studied. We prove that the difference between the solution of the discrete problem and the target solution decay to zero exponentially for sufficiently small time step.

• 대한수학회보
• /
• 제37권1호
• /
• pp.153-169
• /
• 2000

Let E be a real q-uniformly smooth Banach space which admits a weakly sequentially continuous duality map, and K a nonempty closed convex subset of E. Let T : K -> K be a mapping such that $F(T)\;=\;{x\;{\in}\;K\;:\;Tx\;=\;x}\;{\neq}\;0$ and (I - T) satisfies the accretive-type condition: $\;{\geq}\;{\lambda}$\mid$$\mid$x-Tx$\mid$$\mid$^2$, for all $x\;{\in}\;K,\;x^*\;{\in}\;F(T)$ and for some ${\lambda}\;>\;0$. The weak and strong convergence of the Ishikawa iteration method to a fixed point of T are investigated. An application of our results to the approximation of a solution of a certain linear operator equation is also given. Our results extend several important known results from the Mann iteration method to the Ishikawa iteration method. In particular, our results resolve in the affirmative an open problem posed by Naimpally and Singh (J. Math. Anal. Appl. 96 (1983), 437-446).