Multidimensional chains of recurrences

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multidimensional chains of recurrences

Full text

Pdf (307 KB)

Source

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

Rostock, Germany

Pages: 199 - 206

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

V. Kislenkov	Dept. of Comp. Math. & Cybernetics, MSU, Moscow 119899, Russia
V. Mitrofanov	Dept. of Comp. Math. & Cybernetics, MSU, Moscow 119899, Russia
E. Zima	Symbolic Computation Group, University of Waterloo, Waterloo, Canada

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
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): 18, Citation Count: 5

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/281508.281613 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	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	2	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	3	Dobkin D., Lipton R. Addition chain method for the evaluation of specific polynomials. SIAM J, Computing 9, 1980, pp.121-125.
	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	Zima E.V. System of Recurrence Relations and Loops Optimization. PhD thesis, Department of Computational Mathematics and Cybernetics, Moscow State University, 1985.
	6	Davenport J., Siret Y., Tournier E. Calcul formel, Masson, 1987.
	7	Richard Fateman, Honest plotting, global extrema, and interval arithmetic, Papers from the international symposium on Symbolic and algebraic computation, p.216-223, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143314]
	8	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
	9	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]
	10	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]
	11	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 [doi>10.1145/220346.220352]
	12	Ron Avitzur , Olaf Bachmann , Norbert Kajler, From honest to intelligent plotting, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.32-41, July 10-12, 1995, Montreal, Quebec, Canada [doi>10.1145/220346.220351]
	13	Eugene V. Zima , Karthi R. Vadivelu , Thomas L. Casavant, Mapping Techniques for Parallel Evaluation of Chains of Recurrences, Proceedings of the 10th International Parallel Processing Symposium, p.620-624, April 15-19, 1996
	14	Bachmann O. Chains of Recurrences for Functions of Two Variables and their Application to Surface Plotting. In N.Kajler, ed., Human Interaction for Symbolic Computation. Springer-Verlag, 1996.
	15	Olaf Bachmann, Chains of recurrences, Kent State University, Kent, OH, 1997
	16	Viazmitinov G.L., Zima E.V. A Portable Interpreter of Multidimensional Chains of Recurrences. Programmirovanie N 1, 1997, pp. 4-11.
	17	Olaf Bachmann, MPCR: an efficient and flexible chains of recurrences server, ACM SIGSAM Bulletin, v.31 n.1, p.15-21, March 1997 [doi>10.1145/251586.251589]
	18	Zima E.V. Safe Numerical Computations with Chains of Recurrences. Programmirovanie N 3, 1997, pp. 36- 42.
	19	http://www, openmath, org
	20	http://dsaka20.kushiro-ct .ac. jp/~yanto/java/surface/

CITED BY 5

	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
	Gautam , S. Rajopadhye, Simplifying reductions, ACM SIGPLAN Notices, v.41 n.1, p.30-41, January 2006
	V. V. Kislenkov, Grid-Oriented Computation: Integrated Library GridComp, Programming and Computing Software, v.30 n.2, p.100-104, March-April 2004
	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