Unlike Kahan summation and similar methods this approach simply divides the set of numbers in half and sums each half separately. This is applied recursively until the local problem size drops below a certain size, at which point regular summation is applied
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real, | intent(in), | dimension(:) | :: | array |