A Maple Package for Computing Groebner Bases for Linear Recurrence Relations

Details A Maple Package for Computing Groebner Bases for Linear Recurrence Relations A Maple Package for Computing Groebner Bases for Linear Recurrence Relations

2005-09-22

arxiv.org/abs/cs/0509070v2

Nucl.Instrum.Meth. A559 (2006) 215-219

Computer Science

Symbolic Computation

5 pages, presented at ACAT-2005

Scientific paper

10.1016/j.nima.2005.11.171

A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two possible applications are illustrated by simple examples of the Laplace equation and a one-loop scalar integral of propagator type

Affiliated with

Also associated with

No associations

Rating

A Maple Package for Computing Groebner Bases for Linear Recurrence Relations 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 Maple Package for Computing Groebner Bases for Linear Recurrence Relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Maple Package for Computing Groebner Bases for Linear Recurrence Relations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503179