Numeric code optimization in computer algebra systems and recurrent relations technique

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Numeric code optimization in computer algebra systems and recurrent relations technique

Full text

Pdf (366 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1993 international symposium on Symbolic and algebraic computation table of contents

Kiev, Ukraine

Pages: 42 - 46

Year of Publication: 1993

ISBN:0-89791-604-2

Author

E. V. Zima

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/164081.164089 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	J. A. van Hulzen , B. J. Hulshof , B. L. Gates , M. C. van Heerwaarden, A code optimization package for REDUCE, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.163-170, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74561]
	2	K. O. Geddes , G. J. Fee, Hybrid symbolic-numeric integration in MAPLE, Papers from the international symposium on Symbolic and algebraic computation, p.36-41, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143262]
	3	Paul S. Wang, A System Independent Graphing Package for Mathematical Functions, Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, p.245-254, April 10-12, 1990
	4	Barbara L. Gates, Gentran: an automatic code generation facility for REDUCE, ACM SIGSAM Bulletin, v.19 n.3, p.24-42, August 1985 [doi>10.1145/1089411.1089415]
	5	Char B.W., Geddes K.O., Gonnet G.H., Leong B., Monagan M.B., Wat~ S.M Maple 5. Language Reference Manual, Springer-Verlag, 1991.
	6	Grant O. Cook, Jr., Code generation in ALPAL using symbolic techniques, Papers from the international symposium on Symbolic and algebraic computation, p.27-35, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143260]
	7	Alfred V. Aho , Jeffrey D. Ullman, Theory of Parsing, Translation and Compiling, Prentice Hall Professional Technical Reference, 1973
	8	E V Zima, Automatic construction of systems of recurrence relations, USSR Computational Mathematics and Mathematical Physics, v.24 n.11-12, p.193-197, March 1986
	9	Zima E. V. "Construction of Economical Computation Formulae in Computer Algebra Systems." Proc. 4th Intern. Conference on Computer Algebra in Phisical Research,(CAPR), Singapore: World Scientific, 1991, pp. 112-116.
	10	Char B.W., Geddes K.O., Gonnet G.H., Leong B., Monagau M.B., Watt S.M Maple 5. Library Reference Manual, Springer-Verlag, 1991.

CITED BY 2

	Eugene V. Zima, Simplification and optimization transformations of chains of recurrences, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.42-50, July 10-12, 1995, Montreal, Quebec, Canada
	V. Kislenkov , V. Mitrofanov , E. Zima, Multidimensional chains of recurrences, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.199-206, August 13-15, 1998, Rostock, Germany