Binary splitting is a divide-and-conquer algorithm for evaluating finite sums or products by recursively dividing the index interval into nearly equal parts. Balanced numerator and denominator products reduce the cost of high-precision evaluation of many constants and special functions.
Binary Splitting
See also
Arbitrary Precision, SeriesExplore with Wolfram|Alpha
References
Brent, R. P. and Zimmermann, P. Modern Computer Arithmetic. Cambridge, England: Cambridge University Press, 2011.Cite this as:
Weisstein, Eric W. "Binary Splitting." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BinarySplitting.html