# gnansumkbn2
> Calculate the sum of strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm.
## Usage
```javascript
var gnansumkbn2 = require( '@stdlib/blas/ext/base/gnansumkbn2' );
```
#### gnansumkbn2( N, x, stride )
Computes the sum of strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm.
```javascript
var x = [ 1.0, -2.0, NaN, 2.0 ];
var N = x.length;
var v = gnansumkbn2( N, x, 1 );
// returns 1.0
```
The function has the following parameters:
- **N**: number of indexed elements.
- **x**: input [`Array`][mdn-array] or [`typed array`][mdn-typed-array].
- **stride**: index increment for `x`.
The `N` and `stride` parameters determine which elements in `x` are accessed at runtime. For example, to compute the sum of every other element in `x`,
```javascript
var floor = require( '@stdlib/math/base/special/floor' );
var x = [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0, NaN, NaN ];
var N = floor( x.length / 2 );
var v = gnansumkbn2( N, x, 2 );
// returns 5.0
```
Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views.
```javascript
var Float64Array = require( '@stdlib/array/float64' );
var floor = require( '@stdlib/math/base/special/floor' );
var x0 = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
var N = floor( x0.length / 2 );
var v = gnansumkbn2( N, x1, 2 );
// returns 5.0
```
#### gnansumkbn2.ndarray( N, x, stride, offset )
Computes the sum of strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
```javascript
var x = [ 1.0, -2.0, NaN, 2.0 ];
var N = x.length;
var v = gnansumkbn2.ndarray( N, x, 1, 0 );
// returns 1.0
```
The function has the following additional parameters:
- **offset**: starting index for `x`.
While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying `buffer`, the `offset` parameter supports indexing semantics based on a starting index. For example, to calculate the sum of every other value in `x` starting from the second value
```javascript
var floor = require( '@stdlib/math/base/special/floor' );
var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN, NaN ];
var N = floor( x.length / 2 );
var v = gnansumkbn2.ndarray( N, x, 2, 1 );
// returns 5.0
```
## Notes
- If `N <= 0`, both functions return `0.0`.
- Depending on the environment, the typed versions ([`dnansumkbn2`][@stdlib/blas/ext/base/dnansumkbn2], [`snansumkbn2`][@stdlib/blas/ext/base/snansumkbn2], etc.) are likely to be significantly more performant.
## Examples
```javascript
var randu = require( '@stdlib/random/base/randu' );
var round = require( '@stdlib/math/base/special/round' );
var Float64Array = require( '@stdlib/array/float64' );
var gnansumkbn2 = require( '@stdlib/blas/ext/base/gnansumkbn2' );
var x;
var i;
x = new Float64Array( 10 );
for ( i = 0; i < x.length; i++ ) {
if ( randu() < 0.2 ) {
x[ i ] = NaN;
} else {
x[ i ] = round( randu()*100.0 );
}
}
console.log( x );
var v = gnansumkbn2( x.length, x, 1 );
console.log( v );
```
* * *
## References
- Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x][@klein:2005a].
[mdn-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
[@stdlib/blas/ext/base/dnansumkbn2]: https://www.npmjs.com/package/@stdlib/blas/tree/main/ext/base/dnansumkbn2
[@stdlib/blas/ext/base/snansumkbn2]: https://www.npmjs.com/package/@stdlib/blas/tree/main/ext/base/snansumkbn2
[@klein:2005a]: https://doi.org/10.1007/s00607-005-0139-x