A Bivariate Preprocessing Paradigm for Buchberger-Möller Algorithm

Details A Bivariate Preprocessing Paradigm for Buchberger-Möller Algorithm A Bivariate Preprocessing Paradigm for Buchberger-Möller Algorithm

2010-01-08

arxiv.org/abs/1001.1186v1

Mathematics

Commutative Algebra

24 pages, 7 figures, submitted to JCAM

Scientific paper

For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of bivariate polynomial interpolation on cartesian point sets that gives us related degree reducing interpolation monomial and Newton bases directly. Since the bases are involved in the computation process as well as contained in the final output of BM algorithm, our paradigm obviously simplifies the computation and accelerates the BM process. The experiments show that the paradigm is best suited for the computation over finite prime fields that have many applications.

Affiliated with

Also associated with

No associations

Rating

A Bivariate Preprocessing Paradigm for Buchberger-Möller Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Bivariate Preprocessing Paradigm for Buchberger-Möller Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Bivariate Preprocessing Paradigm for Buchberger-Möller Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-501678