A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations

Computer Science – Symbolic Computation

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and aperiodic factors in the denominator, and we gave an algorithm for predicting the aperiodic ones. Now we extend this technique towards the periodic case and present a refined algorithm which also finds most of the periodic factors.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations 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 Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-79311

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.