division of multivariate polynomials
- From: Jeremy Watts <jwatts1970@xxxxxxxxxxx>
- Date: Thu, 22 May 2008 03:43:05 -0700 (PDT)
Hello,
I am in the process of writing a small program that divides two
multivariate polynomials (both over the integers), but I have read
that there is a problem with dividing multivariates as you can often
get different answers depending upon the monomial ordering used?
I have thought of a scheme however of approaching this problem
numerically. That is to choose a variable common to both the dividend
polynomial and the divisor and to choose random values for the other
variables so as to convert them both into univariates. Then univariate
division is carried out, and this process repeated for other values,
enough times so that interpolation may be used over the coefficients
so as to 'build in' the other variables into the coefficients of the
univariates.
Is there any forseeable problem with using this sort of scheme?
Thanks
Jeremy Watts
.
- Follow-Ups:
- Re: division of multivariate polynomials
- From: Waldek Hebisch
- Re: division of multivariate polynomials
- Prev by Date: Is Gauss quadrature better than Clenshaw-Curtis?
- Next by Date: Re: division of multivariate polynomials
- Previous by thread: Is Gauss quadrature better than Clenshaw-Curtis?
- Next by thread: Re: division of multivariate polynomials
- Index(es):
Relevant Pages
|
|