<!-- @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://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. --> # snansumkbn2 > Calculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm. <section class="intro"> </section> <!-- /.intro --> <section class="usage"> ## Usage ```javascript var snansumkbn2 = require( '@stdlib/blas/ext/base/snansumkbn2' ); ``` #### snansumkbn2( N, x, stride ) Computes the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm. ```javascript var Float32Array = require( '@stdlib/array/float32' ); var x = new Float32Array( [ 1.0, -2.0, NaN, 2.0 ] ); var N = x.length; var v = snansumkbn2( N, x, 1 ); // returns 1.0 ``` The function has the following parameters: - **N**: number of indexed elements. - **x**: input [`Float32Array`][@stdlib/array/float32]. - **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 Float32Array = require( '@stdlib/array/float32' ); var floor = require( '@stdlib/math/base/special/floor' ); var x = new Float32Array( [ 1.0, 2.0, NaN, -7.0, NaN, 3.0, 4.0, 2.0 ] ); var N = floor( x.length / 2 ); var v = snansumkbn2( 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. <!-- eslint-disable stdlib/capitalized-comments --> ```javascript var Float32Array = require( '@stdlib/array/float32' ); var floor = require( '@stdlib/math/base/special/floor' ); var x0 = new Float32Array( [ 2.0, 1.0, NaN, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); var x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element var N = floor( x0.length / 2 ); var v = snansumkbn2( N, x1, 2 ); // returns 5.0 ``` #### snansumkbn2.ndarray( N, x, stride, offset ) Computes the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics. ```javascript var Float32Array = require( '@stdlib/array/float32' ); var x = new Float32Array( [ 1.0, -2.0, NaN, 2.0 ] ); var N = x.length; var v = snansumkbn2.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 Float32Array = require( '@stdlib/array/float32' ); var floor = require( '@stdlib/math/base/special/floor' ); var x = new Float32Array( [ 2.0, 1.0, NaN, -2.0, -2.0, 2.0, 3.0, 4.0 ] ); var N = floor( x.length / 2 ); var v = snansumkbn2.ndarray( N, x, 2, 1 ); // returns 5.0 ``` </section> <!-- /.usage --> <section class="notes"> ## Notes - If `N <= 0`, both functions return `0.0`. </section> <!-- /.notes --> <section class="examples"> ## Examples <!-- eslint no-undef: "error" --> ```javascript var randu = require( '@stdlib/random/base/randu' ); var round = require( '@stdlib/math/base/special/round' ); var Float32Array = require( '@stdlib/array/float32' ); var snansumkbn2 = require( '@stdlib/blas/ext/base/snansumkbn2' ); var x; var i; x = new Float32Array( 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 = snansumkbn2( x.length, x, 1 ); console.log( v ); ``` </section> <!-- /.examples --> * * * <section class="references"> ## 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]. </section> <!-- /.references --> <section class="links"> [@stdlib/array/float32]: https://www.npmjs.com/package/@stdlib/array-float32 [mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray [@klein:2005a]: https://doi.org/10.1007/s00607-005-0139-x </section> <!-- /.links -->