Re:Fast exact summation using small and large superaccumulators
by crb002 on Thursday January 19, 2017 @04:56PM
(#13439823)
Sort/bucket the abosute value within some epsilon then merge pairwise in a binary tree.
Or split FloatMax into 32-2048 bins. Start all at zero. Add incoming numbers to the corresponding bin. If a bin goes out of range zero it and add the sum where it needs to go. When you are done keep adding the lowest magnitude bin to the next highest.
Or split FloatMax into 32-2048 bins. Start all at zero. Add incoming numbers to the corresponding bin. If a bin goes out of range zero it and add the sum where it needs to go. When you are done keep adding the lowest magnitude bin to the next highest.