• Kyungpook Mathematical Journal
• /
• v.28 no.2
• /
• pp.185-196
• /
• 1988

We study existence of polynomial integrating factors and solutions F(x, y)=c of first order nonlinear differential equations. We characterize the homogeneous case, and give algorithms for finding existence of and a basis for polynomial solutions of linear difference and differential equations and rational solutions or linear differential equations with polynomial coefficients. We relate singularities to nature of the solution. Solution of differential equations in closed form to some degree might be called more an art than a science: The investigator can try a number of methods and for a number of classes of equations these methods always work. In particular integrating factors are tricky to find. An analogous but simpler situation exists for integrating inclosed form, where for instance there exists a criterion for when an exponential integral can be found in closed form. In this paper we make a beginning in several directions on these problems, for 2 variable ordinary differential equations. The case of exact differentials reduces immediately to quadrature. The next step is perhaps that of a polynomial integrating factor, our main study. Here we are able to provide necessary conditions based on related homogeneous equations which probably suffice to decide existence in most cases. As part of our investigations we provide complete algorithms for existence of and finding a basis for polynomial solutions of linear differential and difference equations with polynomial coefficients, also rational solutions for such differential equations. Our goal would be a method for decidability of whether any differential equation Mdx+Mdy=0 with polynomial M, N has algebraic solutions(or an undecidability proof). We reduce the question of all solutions algebraic to singularities but have not yet found a definite procedure to find their type. We begin with general results on the set of all polynomial solutions and integrating factors. Consider a differential equation Mdx+Ndy where M, N are nonreal polynomials in x, y with no common factor. When does there exist an integrating factor u which is (i) polynomial (ii) rational? In case (i) the solution F(x, y)=c will be a polynomial. We assume all functions here are complex analytic polynomial in some open set.

• Journal of applied mathematics & informatics
• /
• v.7 no.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.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.379-391
• /
• 2015

We investigate the existence of solutions of the nonlinear biharmonic equation with variable coefficient polynomial growth nonlinear term and Dirichlet boundary condition. We get a theorem which shows that there exists a bounded solution and a large norm solution depending on the variable coefficient. We obtain this result by variational method, generalized mountain pass geometry and critical point theory.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.83.4-83
• /
• 2001

The paper presents a new closed-form, not a polynomial-form, solution of the direct kinematics of the 3-6 (Stewart-Gough) Platform. Many research works have presented a single high-order polynomial equation of the direct kinematics. However the polynomial equation causes potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots, which results in time-consuming task and heavy computational burden. Thus, to overcome these problems, we use a new formulation approach, based on the Tetrahedron Approach, to derive easily a closed-form nonlinear equation of the direct kinematics and use not the Newton-Raphson method, but the Secant method to obtain quickly the solution from ...

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.101-112
• /
• 2010

In [3] we showed that a polynomial over a Noetherian ring is divisible by some other polynomial by looking at the matrix formed by the coefficients of the polynomials which we called the resultant matrix. In this paper, we consider the polynomials with coefficients in a field and divisibility of a polynomial by a polynomial with a certain degree is equivalent to the existence of common solution to a system of Diophantine equations. As an application we construct a family of irreducible quartics over $\mathbb{Q}$ which are not of Eisenstein type.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.217-223
• /
• 2002

The paper presents a single constraint equation of the direct kinematic solution of 6-dof (Stewart-Gough) platforms. Many research works have presented a single polynomial of the direct kinematics for several 6-dof platforms. However, the formulation of the polynomial has potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots. This results in heavy computational burden and time-consuming task. Thus, to overcome these problems, we use a new formulation approach, called the Tetrahedron Approach, to easily derive a single constraint equation, not a polynomial one, of the direct kinematics and use two well-known numerical iterative methods to find the solution of the single constraint equation. Their performance and characteristics are investigated through a series of simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.47-53
• /
• 2016

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.119-122
• /
• 1986

An algorithm is proposed to find a stable rational function, which is frequently used in the linear system theory, by curve-fitting a given data. This problem is essentially a nonolinear optimization problem. In order to converge faster to the solution, the following method is used. First, the coefficients of the denominator polynomial are fixed and only the coefficients of the numerator polynomial are adjusted by its linear relationships. Then the coefficients of the numerator are fixed and the coefficients of the denominator polynomial are adjusted by nonlinear programming. This whole process is repeated until a convergent solution is found. The solution obtained by this method converges better than by other algorithms and its versatility is demonstrated by applying it to the design of a feedback control system and a low pass filter.

• Kyungpook Mathematical Journal
• /
• v.51 no.3
• /
• pp.251-260
• /
• 2011

The aim of this paper is to obtain a solution of a certain multidimensional convolution integral equation of Fredholm type whose kernel involves a generalized polynomial set. A number of results follow as special cases from the main theorem by specifying the parameters of the generalized polynomial set.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.58-65
• /
• 2021

Meta-heuristic algorithms have been developed to efficiently solve difficult problems and obtain a global optimal solution. A common feature mimics phenomenon occurring in nature and reliably improves the solution through repetition. And at the same time, the probability is used to deviate from the regional optimal solution and approach the global optimal solution. This study compares the algorithm created based on the above common points with existed SA and HS to show advantages in time and accuracy of results. Existing algorithms have problems of low accuracy, high memory, long runtime, and ignorance. In a two-variable polynomial, the existing algorithms show that the memory increases and the accuracy decrease. In order to improve the accuracy, the new algorithm increases the number of initial inputs and increases the efficiency of the search by introducing a direction using vectors. And, in order to solve the optimization problem, the results of the last experiment were learned to show the learning effect in the next experiment. The new algorithm found a solution in a short time under the experimental conditions of long iteration counts using a two-variable polynomial and showed high accuracy. And, it shows that the learning effect is effective in repeated experiments.