Modular Algorithms in Symbolic Summation and Symbolic Integration /
by Jürgen Gerhard.
- xvI, 224 páginas Also available online. recurso en línea.
- Lecture Notes in Computer Science, 3218 0302-9743 ; .
Springer eBooks
1. Introduction -- 2. Overview -- 3. Technical Prerequisites -- 4. Change of Basis -- 5. Modular Squarefree and Greatest Factorial Factorization -- 6. Modular Hermite Integration -- 7. Computing All Integral Roots of the Resultant -- 8. Modular Algorithms for the Gosper-Petkovšek Form -- 9. Polynomial Solutions of Linear First Order Equations -- 10. Modular Gosper and Almkvist & Zeilberger Algorithms.
This book brings together two streams of computer algebra: symbolic summation and integration on the one hand, and fast algorithmics on the other hand. In symbolic integration and summation, not too many algorithms with analyzed run times are known, and until now the mathematically oriented world of integration and summation and the computer science world of algorithm analysis have not had much to say to each other. The progress presented in this work towards overcoming this situation is threefold: - a clear framework for algorithm analysis with the appropriate parameters is provided, - modular algorithmic techniques are introduced in this area, and - almost optimal algorithms are presented for the basic problems.