• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.7
• /
• pp.664-672
• /
• 2010

This paper provides the target observability analysis of time-to-go polynomial guidance law with bearing-only measurement. In this study, a direct approach is used to analyze the target observability. Since the observability condition of a constant-velocity target is given by the function of LOS angle only, the target observability characteristic is determined by substituting the closed form solution of LOS angle to the observability condition directly. The analysis results show that the target observability is depended on the choice of guidance gain, initial intercept condition and guidance command shape. After that this mathematical analysis result is evaluated and demonstrated by number of simulation.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.539-545
• /
• 1994

Let $q = p^r$, where p is a prime. A polynomial $f(x) \in GF(q)[x]$ is called a permutation polynomial (PP) over GF(q) if the numbers f(a) where $a \in GF(Q)$ are a permutation of the a's. In other words, the equation f(x) = a has a unique solution in GF(q) for each $a \in GF(q)$. More generally, $f(x_1, \cdots, x_n)$ is a PP in n variables if $f(x_1,\cdots,x_n) = \alpha$ has exactly $q^{n-1}$ solutions in $GF(q)^n$ for each $\alpha \in GF(q)$. Mullen ([3], [4], [5]) has studied the concepts of local permutation polynomials (LPP's) over finite fields. A polynomial $f(x_i, x_2, \cdots, x_n) \in GF(q)[x_i, \codts,x_n]$ is called a LPP if for each i = 1,\cdots, n, f(a_i,\cdots,x_n]$ is a PP in $x_i$ for all $a_j \in GF(q), j \neq 1$.Mullen ([3],[4]) found a set of necessary and three variables over GF(q) in order that f be a LPP. As examples, there are 12 LPP's over GF(3) in two indeterminates ; $f(x_1, x_2) = a_{10}x_1 + a_{10}x_2 + a_{00}$ where $a_{10} = 1$ or 2, $a_{01} = 1$ or x, $a_{00} = 0,1$, or 2. There are 24 LPP's over GF(3) of three indeterminates ; $F(x_1, x_2, x_3) = ax_1 + bx_2 +cx_3 +d$ where a,b and c = 1 or 2, d = 0,1, or 2.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.159-164
• /
• 2022

The linear assignment problem (LAP) and linear bottleneck assignment problem (LBAP) has been unknown the algorithm to solve the optimal solution within polynomial-time. These problems are classified by NP-hard. Therefore, we can be apply metaheuristic methods or linear programming (LP) software package or Hungarian algorithm (HA) with O(m⁴) computational complexity. This paper suggests polynomial time algorithm with O(mn)=O(m²),m=n time complexity to LAP and LBAP. The select-delete method is simply applied to LAP, and the delete-select method is used to LBAP. For the experimental data without the unique algorithm can be apply to whole data, the proposed algorithm can be obtain the optimal solutions for whole data.

• Steel and Composite Structures
• /
• v.24 no.6
• /
• pp.659-670
• /
• 2017

In the present work, an analytical solution for the static analysis of laminated composites, functionally graded and sandwich singly and doubly curved panels on the rectangular plan-form, subjected to uniformly distributed transverse loading is presented. Mathematical formulation is based on the higher order shear deformation theory and principle of virtual work is applied to derive the equations of equilibrium subjected to small deformation. A solution methodology based on the fast converging finite double Chebyshev series is used to solve the linear partial differential equations along with the simply supported boundary condition. The effect of span to thickness ratio, radius of curvature to span ratio, stacking sequence, power index are investigated. The accuracy of the solution is checked by the convergence study of non-dimensional central deflection and moments. Present results are compared with those available in the literature.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.571-576
• /
• 2004

In this paper, by using Lagrange polynomial interpolation with a trick such that for $f(x)^{3}$ we shall use $f(x_i)^{3}I_i(x)^{3}$ instead of $I(x)^{3}$ where $I{x}{\;}={\;}\sum_{i}^{f}(x_i)I_i(x)$. We show the convergence and stability and calculate errors. These errors are approximately less than $C(\frac{1}{N})^{N-1} hN(N-1)(\frac{N}{2})^{N-1} /(\frac{N}{2})!$ where N is a polynomial degree.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.507-516
• /
• 1998

In this study we are concerned with the problem of ap-proximating a locally unique solution of an equation on a Banach space. A semilocal convergence theorem is given for the Super-Halley method in Banach spaces. Earlier results have shown that the order of convergence is four for a certain class of operators [4] [5] [8] These results were not given in affine invariant form and made use of a real quadratic majorizing polynomial. Here we provide our re-sults in affine invariant form showing that the order of convergence is at least four. In cases that it is exactly four the rate of convergence is improved. We achieve these results by using a cubic majorizing polynomial. Some numerical examples are given to show that our error bounds are better than earlier ones.

• Steel and Composite Structures
• /
• v.7 no.6
• /
• pp.441-456
• /
• 2007

In literature for thin-walled sections with L, [, +, I, and ${\Box}$- shapes the approximate torsion equations for stiffness are used which were proposed by Bach (Hsu 1984), p.30. New formulae for torsional stiffness of bars with L, [, +, I, and ${\Box}$ cross section valid not only for thin-walled sections are presented in this paper. These formulae are obtained by appropriate polynomial approximation of stiffness results obtained by means of method of fundamental solutions. On the base of obtained results the validity of Bach's formulae are verified when cross section is not thin-walled.

• Management Science and Financial Engineering
• /
• v.9 no.2
• /
• pp.47-68
• /
• 2003

We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1365-1388
• /
• 2019

In this paper we consider a class of nonlinear nonlocal parabolic equations involving p-Laplacian operator where the nonlocal quantity is present in the diffusion coefficient which depends on $L^p$-norm of the gradient and the nonlinear term is of polynomial type. We first prove the existence and uniqueness of weak solutions by combining the compactness method and the monotonicity method. Then we study the existence of global attractors in various spaces for the continuous semigroup generated by the problem. Finally, we investigate the existence and exponential stability of weak stationary solutions to the problem.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.137-143
• /
• 1992

The purpose of this paper is to provide the affirmative solution of the following conjecture due to Davis and Geramita. Conjecture; Let A=R[T] be a polynomial ring in one variable, where R is a regular local ring of dimension d. Then maximal ideals in A are complete intersection. Geramita has proved that the conjecture is true when R is a regular local ring of dimension 2. Whatwadekar has rpoved that conjecture is true when R is a formal power series ring over a field and also when R is a localization of an affine algebra over an infinite perfect field. Nashier also proved that conjecture is true when R is a local ring of D[ $X_{1}$,.., $X_{d-1}$] at the maximal ideal (.pi., $X_{1}$,.., $X_{d-1}$) where (D,(.pi.)) is a discrete valuation ring with infinite residue field. The methods to establish our results are following from Nashier's method. We divide this paper into three sections. In section 1 we state Theorems without proofs which are used in section 2 and 3. In section 2 we prove some lemmas and propositions which are used in proving our results. In section 3 we prove our main theorem.eorem.rem.