Modular Algorithms in Symbolic Summation and Symbolic Integration [electronic resource] /by Jürgen Gerhard.
by Gerhard, Jürgen [author.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 3218Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: XVI, 224 p. Also available online. online resource.ISBN: 9783540301370.Subject(s): Computer science | Computer software | Electronic data processing | Algebra -- Data processing | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Numeric Computing | Symbolic and Algebraic Manipulation | Algorithms | Computational Science and EngineeringDDC classification: 005.1 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA76.9.A43 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
| QA76.9.A43 Design and Analysis of Randomized Algorithms | QA76.9.A43 Introduction to Reliable Distributed Programming | QA76.9.A43 Parameterized Complexity Theory | QA76.9.A43 Modular Algorithms in Symbolic Summation and Symbolic Integration | QA76.9.A43 Algorithms and Computation | QA76.9.A43 Graph-Theoretic Concepts in Computer Science | QA76.9.A43 Parallel and Distributed Processing and Applications |
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.
There are no comments for this item.