MPCR

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

MPCR: an efficient and flexible chains of recurrences server

Full text

Pdf (686 KB)

Source

ACM SIGSAM Bulletin archive
Volume 31 , Issue 1 (March 1997) table of contents

Pages: 15 - 21

Year of Publication: 1997

ISSN:0163-5824

Author

Olaf Bachmann

Department of Mathematics and Computer Science, Kent State University, Kent, OH

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract cited by index terms collaborative colleagues

Tools and Actions:	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/251586.251589 What is a DOI?

ABSTRACT

MPCR is a stand-alone, flexible, and efficient implementation of the Chains of Recurrences (CR) method. It can be used interactively, as a network-based server, or as a library. Using the CR method, MPCR evaluates closed-form expressions over regular grids with great efficiency --- often hundreds of times faster than comparable programs. MPCR also features an MP (Multi Protocol) interface for data exchange, conditional CR simplification, use of intermediate evaluation arrays and generation of C source code. Evaluation timings are given and compared with other programs, and the algorithms which result in the high efficiency of MPCR are discussed.

CITED BY

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

INDEX TERMS

Primary Classification:
I. Computing Methodologies
I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION