A case study in interlanguage communication

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A case study in interlanguage communication: Fast LISP polynomial operations written in 'C'

Full text

Pdf (299 KB)

Source

Symposium on Symbolic and Algebraic Manipulation archive
Proceedings of the fourth ACM symposium on Symbolic and algebraic computation table of contents

Snowbird, Utah, United States

Pages: 122 - 125

Year of Publication: 1981

ISBN:0-89791-047-8

Author

Richard J. Fateman

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 9, Citation Count: 3

Additional Information:

abstract 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/800206.806381 What is a DOI?

ABSTRACT

It is shown that a simple program, written in the “C” programming language, can be interfaced to a Lisp algebraic manipulation system with substantial performance improvement as a result.

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	Richard J. Bonneau, Polynomial operations using the fast Fourier transform, Ph.D. thesis, Dept. of Mathematics, Mass. Inst. of Tech., Cambridge, Mass., 1974.
	2	J. W. Cooley and J. W. Tukey, "An algorithm for machine calculation of complex Fourier series," Math. Comp. 19 (1965) pp. 297-301..
	3	John K. Foderaro, Franz Lisp Manual, 3rd Berkeley Software Distribution, Computer Science Division, EECS, University of Calif., Berkeley. (1979)
	4	Richard J. Fateman, "Polynomial multiplication, powers, and asymptotic analysis, some comments," SIAM Journal on Computing, (3). no. 3, September 1974, pp. 145-155.
	5	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	6	The Mathlab Group, Macsyma, Reference Manual, Version 9. MIT Laboratory for Computer Science, 1977.
	7	Robert T. Moenck, Practical fast polynomial multiplication, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.136-148, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806332]
	8	David A. Moon, Maclisp Manual, Lab for Comp. Sci. Mass. Inst. of Tech., 1974.
	9	J. M. Pollard, "The fast Fourier transform in a finite field," Math. Comp. 25 no. 114 (1971), pp. 365-374.
	10	Guy L. Steele Jr., "Fast arithmetic in Maclisp," Proc. 1977 MACSYMA Users' Conf. NASA CP-2012, July, 1977, pp. 215-224.
	11	S. Winograd, "On computing the discrete Fourier transform," Proc. Nat. Acad. Scien. USA, vol. 73, no. 4 April, 1976, pp. 1005-1006.
	12	Richard Zippel, Probabilistic algorithms for sparse polynomials, Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, p.216-226, June 01, 1979

CITED BY 3

	Vangalur S. Alagar , David K. Probst, A fast, low-space algorithm for multiplying dense multivariate polynomials, ACM Transactions on Mathematical Software (TOMS), v.13 n.1, p.35-57, March 1987
	James H. Davenport, Fast reduce: the trade-off between efficiency and generality, ACM SIGSAM Bulletin, v.16 n.1, p.8-11, February 1982
	James H. Davenport, What do we want from a high-level language?, ACM SIGSAM Bulletin, v.16 n.4, p.6-9, November 1982