|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Jürgen GerhardPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2005 ed. Volume: 3218 Dimensions: Width: 15.50cm , Height: 1.20cm , Length: 23.50cm Weight: 0.760kg ISBN: 9783540240617ISBN 10: 3540240616 Pages: 228 Publication Date: 01 December 2004 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1. 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-Petkovsek Form.- 9. Polynomial Solutions of Linear First Order Equations.- 10. Modular Gosper and Almkvist & Zeilberger Algorithms.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |