Fast Polynomial Dispersion Computation and Its Application to Indefinite Summation

  title={Fast Polynomial Dispersion Computation and Its Application to Indefinite Summation},
  author={Yiu-Kwong Man and Francis J. Wright},
An algorithm for computing the dispersion of one or two polynomials is described, based on irreducible factorization. It is demonstrated that in practice it is faster than the “conventional” resultant-based algorithm, at least for small problems. It can be applied to algorithms for indefinite summation and closed-form solution of linear difference equations. A brief survey of existing mostly resultant-based dispersion algorithms is given and the complexity of the resultant involved is analysed… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS
19 Citations
4 References
Similar Papers


Publications citing this paper.

52 Citations

Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-4 of 4 references

Algorithms for polynomial factorization, PhD Thesis and TR 134, University of Wisconsin

  • Musser, R D.
  • 1971
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…