This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Calmet and M. Bergman. Some Design Principles of a New System for Algebraic and Symbolic Manipulations. These proceedings.
E.L. Lafferty. Hypergeometric Function Reduction — An Adventure in Pattern Matching. Proc. 1979 MACSYMA User's Conference. MIT Lab. Pub., 465–481.
R.W. Gosper Jr., Computer-assisted Strip Mining in Abandoned Ore Fields of the 19-th Century Mathematics. Talk at the Conference on Computer Algebra as a Tol for Research in Mathematics and Physics. New York, April 5–6, 1984.
J. Ivie.Some MACSYMA Programs for Solving Difference Equations. Proc. 1977 MACSYMA User's Conference. MIT Lab Pub.
R.W. Gosper Jr., Indefinite Hypergeometric Sums. Proc. 1977 MACSYMA User's Conference. MIT Lab Pub.
P. Verbaeten. The Automatic Construction of Pure Recurrence Relations. ACM-SIGSAM Bulletin 8, 96–98, 1974.
J. Calmet and I Cohen. Symbolic Manipulation of RR: an Approach to the Manipulation of Special Functions. In The Second RIKEN Int. Symp. on Symbolic and Algebraic Computation by Computers. Ed. N. Inada and T. Soma. World Scientific, 55–65, 1985.
C. Brezinski. Accélération de la convergence en Analyse Numérique. Lecture Notes in Math. 584, Springer-Verlag, 1977.
N.J.A. Sloane. A Handbook of Integer Sequences. Academic Press, N.Y., 1973.
D. Jarden. Recurring Sequences. Riveon Lematematika, Jerusalem, 1966.
G. Szegö. Orthogonal Polynomials. AMS Colloquium Pub. 23, 1939.
L.Ya. Geronimus. Orthogonal Polynomials. Consultant Bureau, N.Y., 1966.
A. Erdélyi et al.. Higher Transcendental Functions. Bateman Manuscript Project, vol. I, II. McGraw-Hill, N.Y., 1953.
R.A. Askey. Orthogonal Polynomials and Special Functions. Proc. Regional Conf. on Applied Math., SIAM, 1975.
E.T. Whittaker and G.N. Watson. A Course in Modern Analysis. 4th ed., Cambridge Univ. Press, 1952.
D. Bessis et al.. Orthogonal Polynomial on a Family .... Lett. Math. Phys. 6, 123–140, 1982.
W. Gautschi. Talk at the Journal CAM Conference. Leuven, July 1984. Proceedings to appear.
S.O. Rice. Some properties of3F2(−n, n+1, ς;1, p;v). Duke Math. J. 6, 108–119, 1940.
H. Bateman. Two Systems of Polynomials for the Solution of Laplace's Integral Equation. Duke Math. J. 2, 559–577, 1936.
L.J. Slater. Generalized Hypergeometric Functions. Cambridge Univ. Press, 1966.
H. Buchholz. The Confluent Hypergeometric Function. Springer Tracts in Natural Philosophy 15, 1969.
Sis. M.C. Fasenmyer. A Note on Pure Recurrence Relations. Am. Math. Monthly 56, 14–17, 1949.
P. Verbaeten. Recurrence Formulae for Linear Hypergeometric Functions. Rep. TW 35, Katholieke Univ. Leuven, 1977.
A. Petrossi and R.M. Burstall. Deriving Efficient Algorithms .... Acta Informatica 18, 181–206, 1982.
G.S. Lueker. Some Techniques for Solving RR. ACM Comp. Surv. 12, 419–436, 1980.
W. Gautschi. Computational Methods in Special Functions — A Survey. In Theory and Applications of Special Functions. Ed. R.A. Askey. Academic Press. 1–98, 1975.
C.L. Liu. Introduction to Combinatorial Mathematics. McGraw-Hill, N.Y., 1968.
H.T. Kung. The Structure of Parallel Algorithms. Advances in Computer 19, 65–112, 1980.
E. Papon. Algorithmes de détection de relations de récurrences .... Thèse de 3ième Cycle. Univ. Paris-Sud Orsay, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calmet, J. (1986). Manipulation of recurrence relations in computer algebra. In: Poli, A. (eds) Applied Algebra, Algorithmics and Error-Correcting Codes. AAECC 1984. Lecture Notes in Computer Science, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16767-6_68
Download citation
DOI: https://doi.org/10.1007/3-540-16767-6_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16767-9
Online ISBN: 978-3-540-38813-5
eBook Packages: Springer Book Archive