نتایج جستجو برای: polynomial equations system pes

تعداد نتایج: 2475541  

Journal: :Appl. Math. Lett. 2012
Valery A. Gaiko

In this work, applying a canonical system with field rotation parameters and using geometric properties of the spirals filling the interior and exterior domains of limit cycles, we solve the limit cycle problem for a general Liénard polynomial systemwith an arbitrary (but finite) number of singular points. © 2012 Elsevier Ltd. All rights reserved.

Journal: :J. Symb. Comput. 2015
Alexander Esterov Gleb Gusev

We classify generic systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the single solution of such a system.

Journal: :J. Symb. Comput. 2010
Sonia L. Rueda J. Rafael Sendra

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of n linear differential polynomial parametric equations in n− 1 differential parameters. We give necessary conditions to ensure properness of the system of differential polynom...

2008
Yuichi UENO

Recently, a quantum version of Painlevé equations from the point of view of their symmetries was proposed by H. Nagoya. These quantum Painlevé equations can be written as Hamiltonian systems with a (noncommutative) polynomial Hamiltonian HJ. We give a characterization of the quantum Painlevé equations by certain holomorphic properties. Namely, we introduce canonical transformations such that th...

L Yazdanparast Sh Dastjerdi,

The bending analysis of moderately thick elliptic plates weakened by an eccentric circular hole has been investigated in this article. The nonlinear governing equations have been presented by considering the von-Karman assumptions and the first-order shear deformation theory in cylindrical coordinates system. Semi-analytical polynomial method (SAPM) which had been presented by the author before...

2013
A. L. CHISTOV

Let AN (K̄) denote the affine space of homogeneous polynomials of degree d in n + 1 variables with coefficients from the algebraic closure K̄ of a field K of arbitrary characteristic; so N = (n+d n ) . It is proved that the variety of all reducible polynomials in this affine space can be given by a system of polynomial equations of degree less than 56d7 in N variables. This result makes it possib...

Journal: :international journal of advanced design and manufacturing technology 0
sedigheh shahmirzaee jeshvaghany department of mechanical and aerospace engineering, science and research branch, islamic azad university, tehran, iran farshad pazooki department of mechanical and aerospace engineering, science and research branch, islamic azad university, tehran, iran. alireza basohbat novinzaddeh department of aerospace engineering, k.n.toosi university of technology, tehran, iran

in this study, the problem of determining an optimal trajectory of a nonlinear injection into orbit problem with minimum time was investigated. the method was based on orthogonal polynomial approximation. this method consists of reducing the optimal control problem to a system of algebraic equations by expanding the state and control vector as chebyshev or legendre polynomials with undetermined...

Journal: :Journal for History of Mathematics 2014

ژورنال: علوم آب و خاک 2018

The most important factor in determining crop water requirement is estimation of evapotranspiration (ET). Majority of the methodsestimate ET apply series of relatively complex formula,which is then used to determine crop evapotranspiration (ETc). The parameters used in aforesaid methods are: Solar radiation, wind speed, humidity, etc. Unfortunately, in Iran and many countries, long-term records...

Journal: :Soft Comput. 2002
Li Chen Paul P. Wang

In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathematical logic representation of all minimal solutions. Next, we design a new universal algorithm to get them. Two simplification rules are found to simplify the solution-base-matrix. We show that a polynomial time algor...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید