How fast can we compute products?

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

How fast can we compute products?

Full text

Pdf (891 KB)

Source

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

Vancouver, British Columbia, Canada

Pages: 75 - 82

Year of Publication: 1999

ISBN:1-58113-073-2

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

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): 9, Citation Count: 1

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/309831.309868 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	Dario Bini , Victor Y. Pan, Polynomial and matrix computations (vol. 1): fundamental algorithms, Birkhauser Verlag, Basel, Switzerland, 1994
	2	BORWEIN J., BORWEIN P. Pi and the AGM. Wiley, 1987.
	3	CHAR B.W., GEDDES K.O., GONNET G.H., LEONG B.L., MONAGAN M.B., VV'ATT S.M. Maple-V. Language Reference Manual. St)ringer-Verlag, 1991.
	4	Henri Cohen, A course in computational algebraic number theory, Springer-Verlag New York, Inc., New York, NY, 1995
	5	HAIBLE B.. PAPANIKOLAOU T. Fast multiprecision evaluation of series of rational numbers. Technical report TI-97/7. Tech. rep., University of Darmstadt. 1997.
	6	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 [doi>10.1145/281508.281613]
	7	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	8	SHOIJP V. http://www.cs.wisc.edu/-shoup/ntl/.
	9	ZIMA E. Recurrent relations technique to vectorize function evaluation in loops. In PARCELLA'94, Potsdam, Germany (1994), pp. 161--168.
	10	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
	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	ZIMA E.V. Safe numerical comt)utations with chains of recurrences. Programmiwvanie N 3 (1997), 36--42.