time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

ndarray.js (2288B)

      1 /**
      2 * @license Apache-2.0
      3 *
      4 * Copyright (c) 2020 The Stdlib Authors.
      5 *
      6 * Licensed under the Apache License, Version 2.0 (the "License");
      7 * you may not use this file except in compliance with the License.
      8 * You may obtain a copy of the License at
      9 *
     10 *    http://www.apache.org/licenses/LICENSE-2.0
     11 *
     12 * Unless required by applicable law or agreed to in writing, software
     13 * distributed under the License is distributed on an "AS IS" BASIS,
     14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     15 * See the License for the specific language governing permissions and
     16 * limitations under the License.
     17 */
     18 
     19 'use strict';
     20 
     21 // MODULES //
     22 
     23 var isnan = require( '@stdlib/math/base/assert/is-nan' );
     24 var abs = require( '@stdlib/math/base/special/abs' );
     25 
     26 
     27 // MAIN //
     28 
     29 /**
     30 * Computes the sum of strided array elements, ignoring `NaN` values and using an improved Kahan–Babuška algorithm.
     31 *
     32 * ## Method
     33 *
     34 * -   This implementation uses an "improved Kahan–Babuška algorithm", as described by Neumaier (1974).
     35 *
     36 * ## References
     37 *
     38 * -   Neumaier, Arnold. 1974. "Rounding Error Analysis of Some Methods for Summing Finite Sums." _Zeitschrift Für Angewandte Mathematik Und Mechanik_ 54 (1): 39–51. doi:[10.1002/zamm.19740540106](https://doi.org/10.1002/zamm.19740540106).
     39 *
     40 * @param {PositiveInteger} N - number of indexed elements
     41 * @param {NumericArray} x - input array
     42 * @param {integer} stride - stride length
     43 * @param {NonNegativeInteger} offset - starting index
     44 * @returns {number} sum
     45 *
     46 * @example
     47 * var floor = require( '@stdlib/math/base/special/floor' );
     48 *
     49 * var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
     50 * var N = floor( x.length / 2 );
     51 *
     52 * var v = gnansumkbn( N, x, 2, 1 );
     53 * // returns 5.0
     54 */
     55 function gnansumkbn( N, x, stride, offset ) {
     56 	var sum;
     57 	var ix;
     58 	var v;
     59 	var t;
     60 	var c;
     61 	var i;
     62 
     63 	if ( N <= 0 ) {
     64 		return 0.0;
     65 	}
     66 	if ( N === 1 || stride === 0 ) {
     67 		if ( isnan( x[ offset ] ) ) {
     68 			return 0.0;
     69 		}
     70 		return x[ offset ];
     71 	}
     72 	ix = offset;
     73 	sum = 0.0;
     74 	c = 0.0;
     75 	for ( i = 0; i < N; i++ ) {
     76 		v = x[ ix ];
     77 		if ( isnan( v ) === false ) {
     78 			t = sum + v;
     79 			if ( abs( sum ) >= abs( v ) ) {
     80 				c += (sum-t) + v;
     81 			} else {
     82 				c += (v-t) + sum;
     83 			}
     84 			sum = t;
     85 		}
     86 		ix += stride;
     87 	}
     88 	return sum + c;
     89 }
     90 
     91 
     92 // EXPORTS //
     93 
     94 module.exports = gnansumkbn;