Modular Algorithms in Symbolic Summation and Symbolic Integration
This work brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of computer science, theanalysisof- gorithms–placedintothe limelightbyDonKnuth’stalkat the 1970ICM –provides...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2005.
|
Σειρά: | Lecture Notes in Computer Science,
3218 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.