Simplification and optimization transformations of chains of recurrences

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Simplification and optimization transformations of chains of recurrences

Full text

Pdf (806 KB)

Source

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

Montreal, Quebec, Canada

Pages: 42 - 50

Year of Publication: 1995

ISBN:0-89791-699-9

Author

Eugene V. Zima

Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119899, Russia

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/220346.220352 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	Eugene V. Zima, Recurrent Relations and Speed-up of Computations Using Computer Algebra Systems, Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, p.152-161, April 13-15, 1992
	2	E. V. Zima, Numeric code optimization in computer algebra systems and recurrent relations technique, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.42-46, July 06-08, 1993, Kiev, Ukraine [doi>10.1145/164081.164089]
	3	Olaf Bachmann , Paul S. Wang , Eugene V. Zima, Chains of recurrences—a method to expedite the evaluation of closed-form functions, Proceedings of the international symposium on Symbolic and algebraic computation, p.242-249, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190423]
	4	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
	5	Davenport J., Siret Y., Tournier E. Calcul formel, Masson, 1987.
	6	Zima E.V. Transformations of expressions associated with systems of recursive relations. Moscow Univ. Computat. Maths. and Cybernetics, 1985, N 1, pp.60-66 (translation from Russian).
	7	van Hulzen J.A. SCOPE, a Source-Code Optimization Package for REDUCE, Twente Univ., The Netherlands, 1994.
	8	Char B.W., Geddes K.O. (and others) Maple-V. Language Reference Manual. Springer-Verlag, 1991.

CITED BY 10

	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
	Howard Cheng , Eugene Zima, On accelerated methods to evaluate sums of products of rational numbers, Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.54-61, July 2000, St. Andrews, Scotland
	V. Kislenkov , V. Mitrofanov , E. Zima, How fast can we compute products?, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.75-82, July 28-31, 1999, Vancouver, British Columbia, Canada
	Eugene V. Zima, On computational properties of chains of recurrences, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.345, July 2001, London, Ontario, Canada
	Eugene V, Zima, Mixed representation of polynomials oriented towards fast parallel shift, Proceedings of the second international symposium on Parallel symbolic computation, p.150-155, July 20-22, 1997, Maui, Hawaii, United States
	Robert A. van Engelen , J. Birch , Y. Shou , B. Walsh , Kyle A. Gallivan, A unified framework for nonlinear dependence testing and symbolic analysis, Proceedings of the 18th annual international conference on Supercomputing, June 26-July 01, 2004, Malo, France
	Howard Cheng , Barry Gergel , Ethan Kim , Eugene Zima, Space-efficient evaluation of hypergeometric series, ACM SIGSAM Bulletin, v.39 n.2, June 2005
	V. V. Kislenkov, Approaches to Expedite Function Computation on Dense Grids, Programming and Computing Software, v.28 n.2, p.88-91, March-April 2002
	J. Birch , R.A. van Engelen , K.A. Gallivan , Y. Shou, An empirical evaluation of chains of recurrences for array dependence testing, Proceedings of the 15th international conference on Parallel architectures and compilation techniques, September 16-20, 2006, Seattle, Washington, USA
	Manuel Arenaz , Juan Touriño , Ramon Doallo, XARK: An extensible framework for automatic recognition of computational kernels, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.6, p.1-56, October 2008