On Acceleration of Multiprecision Computation of Products and Sums of Products of Rational Numbers

Eugene V. Zima ()
Additional contact information
Eugene V. Zima: University of Waterloo, Symbolic Computation Group

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 775-784 from Springer

Abstract: Abstract In this paper we consider the problem of fast computation of n-ary products (and also sums of such products), for large n, over arbitrary precision integer or rational number domains. We analyze the complexity of different algorithms for such computations and point out computational framework for which such computations can be accelerated. A combination of binary splitting algorithm, accelerating algorithm based on the chains of recurrences technique and predicted cancellation is described.

Keywords: Decimal Digit; Integer Coefficient; Arbitrary Precision; Binary Splitting; Multiple Precision (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_76

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_76

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().