Computer algebra: symbolic and algebraic computation (2nd ed.)
Computer algebra: symbolic and algebraic computation (2nd ed.)
Computer algebra: systems and algorithms for algebraic computation
Computer algebra: systems and algorithms for algebraic computation
Rational solutions of linear differential and difference equations with polynomial coefficients
USSR Computational Mathematics and Mathematical Physics
The method of creative telescoping
Journal of Symbolic Computation
Algebraic computing with REDUCE
Algebraic computing with REDUCE
Algorithms for computer algebra
Algorithms for computer algebra
On computing closed forms for indefinite summations
Journal of Symbolic Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
Journal of the ACM (JACM)
Multivariate Polynomial Factorization
Journal of the ACM (JACM)
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
Rational solutions of first order linear difference systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Rational solutions of matrix difference equations: the problem of equivalence and factorization
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Simplification of definite sums of rational functions by creative symmetrizing method
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Shiftless decomposition and polynomial-time rational summation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Fast computation of special resultants
Journal of Symbolic Computation
Factorization of polynomials and GCD computations for finding universal denominators
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
| Hi-index | 0.00 |
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. The effectiveness of the proposed algorithm applied to indefinite summation is demonstrated by some examples that are not easily summed by the standard facilities in several computer algebra systems.