time-to-botec

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

smeanwd.js (2600B)

      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 float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
     24 
     25 
     26 // MAIN //
     27 
     28 /**
     29 * Computes the arithmetic mean of a single-precision floating-point strided array using Welford's algorithm.
     30 *
     31 * ## Method
     32 *
     33 * -   This implementation uses Welford's algorithm for efficient computation, which can be derived as follows
     34 *
     35 *     ```tex
     36 *     \begin{align*}
     37 *     \mu_n &= \frac{1}{n} \sum_{i=0}^{n-1} x_i \\
     38 *           &= \frac{1}{n} \biggl(x_{n-1} + \sum_{i=0}^{n-2} x_i \biggr) \\
     39 *           &= \frac{1}{n} (x_{n-1} + (n-1)\mu_{n-1}) \\
     40 *           &= \mu_{n-1} + \frac{1}{n} (x_{n-1} - \mu_{n-1})
     41 *     \end{align*}
     42 *     ```
     43 *
     44 * ## References
     45 *
     46 * -   Welford, B. P. 1962. "Note on a Method for Calculating Corrected Sums of Squares and Products." _Technometrics_ 4 (3). Taylor & Francis: 419–20. doi:[10.1080/00401706.1962.10490022](https://doi.org/10.1080/00401706.1962.10490022).
     47 * -   van Reeken, A. J. 1968. "Letters to the Editor: Dealing with Neely's Algorithms." _Communications of the ACM_ 11 (3): 149–50. doi:[10.1145/362929.362961](https://doi.org/10.1145/362929.362961).
     48 *
     49 * @param {PositiveInteger} N - number of indexed elements
     50 * @param {Float32Array} x - input array
     51 * @param {integer} stride - stride length
     52 * @returns {number} arithmetic mean
     53 *
     54 * @example
     55 * var Float32Array = require( '@stdlib/array/float32' );
     56 *
     57 * var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
     58 * var N = x.length;
     59 *
     60 * var v = smeanwd( N, x, 1 );
     61 * // returns ~0.3333
     62 */
     63 function smeanwd( N, x, stride ) {
     64 	var mu;
     65 	var ix;
     66 	var n;
     67 	var i;
     68 
     69 	if ( N <= 0 ) {
     70 		return NaN;
     71 	}
     72 	if ( N === 1 || stride === 0 ) {
     73 		return x[ 0 ];
     74 	}
     75 	if ( stride < 0 ) {
     76 		ix = (1-N) * stride;
     77 	} else {
     78 		ix = 0;
     79 	}
     80 	mu = 0.0;
     81 	n = 0;
     82 	for ( i = 0; i < N; i++ ) {
     83 		n += 1;
     84 		mu = float64ToFloat32( mu + float64ToFloat32( float64ToFloat32( x[ix]-mu ) / n ) ); // eslint-disable-line max-len
     85 		ix += stride;
     86 	}
     87 	return mu;
     88 }
     89 
     90 
     91 // EXPORTS //
     92 
     93 module.exports = smeanwd;