|
|
|
COMPUTER ALGEBRA 2006
Latest Advances in Symbolic Algorithms Proceedings of the Waterloo Workshop
Ontario, Canada 10 - 12 April 2006
edited by Ilias S Kotsireas & Eugene V Zima (Wilfrid Laurier University, Canada)
Table of Contents (66k) Chapter 1: Hypergeometric Summation Revisited (230k)
Written by world-renowned experts, the book is a collection of tutorial presentations and research papers catering to the latest advances in symbolic summation, factorization, symbolic-numeric linear algebra and linear functional equations. The papers were presented at a workshop celebrating the 60th birthday of Sergei Abramov (Russia), whose highly influential contributions to symbolic methods are adopted in many leading computer algebra systems.
Contents:
- Hypergeometric Summation Revisited (S A Abramov & M Petkovsek)
- Five
Applications of Wilf-Zeilberger Theory to Enumeration and Probability (M Apagodu & D Zeilberger)
- Factoring Systems of Linear Functional Equations Using Eigenrings (M A Barkatou)
- Modular Computation for Matrices of Ore Polynomials (H Cheng & G Labahn)
- Beta-Expansions of Pisot and Salem Numbers (K G Hare)
- Logarithmic Functional and the Weil Reciprocity Law (A Khovanskii)
- On Solutions of Linear Functional Systems and Factorization of Laurent–Ore Modules (M Wu & Z Li)
- The Vector Rational Function Reconstruction Problem (Z Olesh & A Storjohann)
- Fast Algorithm for Computing Multipole Matrix Elements with Legendre Polynomials (V Yu et al.)
- Recurrence Relations for the Coefficients in Hypergeometric Series Expansions (L Rebillard & H Zakrajsek)
- On Factorization and Solution of Multidimensional Linear Partial Differential Equations (S P Tsarev)
- Two Families of Algorithms for Symbolic Polynomials (S M Watt)
Readership: Academics and researchers in computer science, applied
mathematics, discrete mathematics, physics and engineering.
| 220pp |
Pub. date: Aug 2007 |
|
|