Differential elimination with Dixon resultants

نویسندگان

  • Lu Yang
  • Zhenbing Zeng
  • Weinian Zhang
چکیده

In this paper we apply the idea of Dixon resultant to algebraic differential equations and introduce the Dixon differential resultant. We prove that a necessary condition for the existence of a common solution of two algebraic differential equations is that the differential resultant is equal to zero, which actually provides a method of elimination and reduces a system of multi-variate differential equations to a system of single-variate differential equations. This result is also generalized to the system of n differential polynomials. We give algorithms to realize our method of elimination for systems of differential equations. Our results and algorithms are demonstrated by some examples. 2012 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Variable Elimination Using Resultants

A new method for eliminating variables from polynomial equations is proposed, analyzed, evaluated and applied. Problems from many applications involve computation of resultants { polynomials obtained after eliminating variables from polynomials. Therefore e ective elimination procedures require e cient methods to compute resultants, especially those exploiting sparsity which typically exists in...

متن کامل

Automated Geometric Reasoning : Dixon Resultants

Three diierent methods for automated geometry theorem proving|a generalized version of Dixon resultants, Grr obner bases and characteristic sets|are reviewed. The main focus is, however, on the use of the generalized Dixon resultant formulation for solving geometric problems and determining geometric quantities.

متن کامل

Cayley-Dixon construction of Resultants of Multi-Univariate Composed Polynomials

The Cayley-Dixon formulation for multivariate resultants have been shown to be efficient (both experimentally and theoretically) for computing resultants by simultaneously eliminating many variables from a polynomial system. In this paper, the behavior of Cayley-Dixon resultant construction and the structure of Dixon matrices is analyzed for composed polynomial systems constructed from a multiv...

متن کامل

Hybrid Dixon Resultants

Dixon 1908] describes three distinct homogeneous determinant representations for the resultant of three bivariate polynomials of bidegree (m; n). These Dixon resultants are the determinants of matrices of orders 6mn, 3mn and 2mn, and the entries of these matrices are respectively homogeneous of degrees 1, 2, and 3 in the coeecients of the original three polynomial equations. Here we mix and mat...

متن کامل

Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation

Structural conditions on the support of a multivariate polynomial system are developed for which the Dixon-based resultant methods compute exact resultants. For cases when this cannot be done, an upper bound on the degree of the extraneous factor in the projection operator can be determined a priori, thus resulting in quick identification of the extraneous factor in the projection operator. (Fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 218  شماره 

صفحات  -

تاریخ انتشار 2012