• 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 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.

• Journal for History of Mathematics
• /
• v.29 no.6
• /
• pp.317-324
• /
• 2016

Since Jiuzhang Suanshu, mathematical structures in the traditional East Asian mathematics have been revealed by practical problems. Since then, polynomial equations are mostly the type of $p(x)=a_0$ where p(x) has no constant term and $a_0$ is a positive number. This restriction for the polynomial equations hinders the systematic development of theory of equations. Since tianyuanshu (天元術) was introduced in the 11th century, the polynomial equations took the form of p(x) = 0, but it was not universally adopted. In the mean time, East Asian mathematicians were occupied by kaifangfa so that the concept of zeros of polynomials was not materialized. We also show that Suanxue Qimeng inflicted distinct developments of the theory of equations in three countries of East Asia.

• 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.

• Journal for History of Mathematics
• /
• v.27 no.3
• /
• pp.165-182
• /
• 2014

After algebraic expressions for the roots of 3rd and 4th degree polynomial equations were given in the mid 16th century, seeking such a formula for the 5th and greater degree equations had been one main problem for algebraists for almost 200 years. Lagrange made careful and thorough investigation of various solving methods for equations with the purpose of finding a principle which could be applicable to general equations. In the process of doing this, he found a relation between the roots of the original equation and its auxiliary equation using permutations of the roots. Lagrange's ingenious idea of using permutations of roots of the original equation is regarded as the key factor of the Abel's proof of unsolvability by radicals of general 5th degree equations and of Galois' theory as well. This paper intends to examine Lagrange's contribution in the theory of polynomial equations, providing a detailed analysis of various solving methods of Lagrange and others before him.

• Kyungpook Mathematical Journal
• /
• v.60 no.4
• /
• pp.767-779
• /
• 2020

This paper primarily discusses and proves the Hyers-Ulam stability of three types of polynomial equations: xn+a1x+a0 = 0, anxn+⋯+a1x+a0 = 0, and the infinite series equation: ${\sum\limits_{i=0}^{\infty}}\;a_ix^i=0$, in dislocated quasi-metric spaces under certain conditions by constructing contraction mappings and using fixed-point methods. We present an example to illustrate that the Hyers-Ulam stability of polynomial equations in dislocated quasi-metric spaces do not work when the constant term is not equal to zero.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2431-2441
• /
• 1999

Equations are widely used in representing information. One of the basic questions about equations is to determine whether a given equation follows logically from the set of equations. Rewrite systems are one of the method to answer many instances of this problem. A rewrite system simplifies a given term by applying rewrite rules successively. Hence it is important that the process of simplification does not go on indefinitely. One of the methods to check whether a rewrite system terminates (that is, the rewrite system does not go on indefinitely) is polynomial orderings. A polynomial ordering assigns an appropriate polynomial to each function symbol. However, how to assign polynomials to function symbols is not known. We propose an automatic way of generating polynomial orderings using genetic algorithms.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.501-506
• /
• 2007

A generalized finite difference method for solving solid mechanics problems such as elasticity and crack problems is presented. The method is constructed in framework of Taylor polynomial based on the Moving Least Squares method and collocation scheme based on the diffuse derivative approximation. The governing equations are discretized into the difference equations and the nodal solutions are obtained by solving the system of equations. Numerical examples successfully demonstrate the robustness and efficiency of the proposed method.

• Journal for History of Mathematics
• /
• v.36 no.1
• /
• pp.1-17
• /
• 2023

Paper folding is a versatile tool that can be used not only as a mathematical model for analyzing the geometric properties of plane and spatial figures but also as a visual method for finding the real roots of polynomial equations. The historical evolution of origami's geometric and algebraic techniques has led to the discovery of definitions and properties that can enhance one's cognitive understanding of mathematical concepts and generate mathematical interest and motivation on an emotional level. This paper aims to examine the history of origami geometry, the utilization of origami for solving polynomial equations, and the process of determining the real roots of quadratic, cubic, and quartic equations through origami techniques.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.265-277
• /
• 2004

This article deals with the number of periodic solutions of the second order polynomial differential equation using the Riccati equation, and applies the property of the solutions of the Riccati equation to study the property of the solutions of the more complicated differential equations. Many valuable criterions are obtained to determine the number of the periodic solutions of these complex differential equations.