-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sapxsumkbn2.js
105 lines (95 loc) · 2.74 KB
/
sapxsumkbn2.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/**
* @license Apache-2.0
*
* Copyright (c) 2020 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http:https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
// MODULES //
var float64ToFloat32 = require( '@stdlib/number-float64-base-to-float32' );
var abs = require( '@stdlib/math-base-special-abs' );
// MAIN //
/**
* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
*
* ## Method
*
* - This implementation uses a second-order iterative Kahan–Babuška algorithm, as described by Klein (2005).
*
* ## References
*
* - Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x).
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} alpha - constant
* @param {Float32Array} x - input array
* @param {integer} stride - stride length
* @returns {number} sum
*
* @example
* var Float32Array = require( '@stdlib/array-float32' );
*
* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
* var N = x.length;
*
* var v = sapxsumkbn2( N, 5.0, x, 1 );
* // returns 16.0
*/
function sapxsumkbn2( N, alpha, x, stride ) {
var sum;
var ccs;
var ix;
var cs;
var cc;
var v;
var t;
var c;
var i;
if ( N <= 0 ) {
return 0.0;
}
if ( N === 1 || stride === 0 ) {
return float64ToFloat32( alpha + x[ 0 ] );
}
if ( stride < 0 ) {
ix = (1-N) * stride;
} else {
ix = 0;
}
sum = 0.0;
ccs = 0.0; // second order correction term for lost low order bits
cs = 0.0; // first order correction term for lost low order bits
for ( i = 0; i < N; i++ ) {
v = float64ToFloat32( alpha + x[ ix ] );
t = float64ToFloat32( sum+v );
if ( abs( sum ) >= abs( v ) ) {
c = float64ToFloat32( float64ToFloat32( sum-t ) + v );
} else {
c = float64ToFloat32( float64ToFloat32( v-t ) + sum );
}
sum = t;
t = float64ToFloat32( cs+c );
if ( abs( cs ) >= abs( c ) ) {
cc = float64ToFloat32( float64ToFloat32( cs-t ) + c );
} else {
cc = float64ToFloat32( float64ToFloat32( c-t ) + cs );
}
cs = t;
ccs = float64ToFloat32( ccs+cc );
ix += stride;
}
return float64ToFloat32( sum + float64ToFloat32( cs+ccs ) );
}
// EXPORTS //
module.exports = sapxsumkbn2;