The problem of computing a closed form for sums of special functions arises in many parts of mathematical and computer science, especially in combinatorics and complexity analysis. Here we discuss two algorithms for indefinite summation of rational functions, due to Abramov (1975) and Paule (1993).
The Computation and Application of the Generalized Inverse via Maple
β Scribed by Jon Jones; N.P KARAMPETAKIS; A.C PUGH
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 495 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
In Karampetakis (1995) an algorithm for computing the generalized inverse of a singular polynomial matrix A(s) β R[s] nΓm has been presented. In this paper the algorithm is extended to that of the singular rational matrix, A(s) β R(s) nΓm , and the algorithm is subsequently implemented in the symbolic computational package Maple. Several applications of its use are given.
π SIMILAR VOLUMES
## Abstract An efficient and robust method of solving Laplace inverse ransform is proposed based on the wavelet theory. The inverse function is expressed as a wavelet expansion with rapid convergence. Several examples are provided to demonstrate the methodology. As an example of application, the pr