meankbn.js (1706B)
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 gsumkbn = require( '@stdlib/blas/ext/base/gsumkbn' ); 24 25 26 // MAIN // 27 28 /** 29 * Computes the arithmetic mean of a strided array using an improved Kahan–Babuška algorithm. 30 * 31 * ## Method 32 * 33 * - This implementation uses an "improved Kahan–Babuška algorithm", as described by Neumaier (1974). 34 * 35 * ## References 36 * 37 * - 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). 38 * 39 * @param {PositiveInteger} N - number of indexed elements 40 * @param {NumericArray} x - input array 41 * @param {integer} stride - stride length 42 * @returns {number} arithmetic mean 43 * 44 * @example 45 * var x = [ 1.0, -2.0, 2.0 ]; 46 * var N = x.length; 47 * 48 * var v = meankbn( N, x, 1 ); 49 * // returns ~0.3333 50 */ 51 function meankbn( N, x, stride ) { 52 if ( N <= 0 ) { 53 return NaN; 54 } 55 if ( N === 1 || stride === 0 ) { 56 return x[ 0 ]; 57 } 58 return gsumkbn( N, x, stride ) / N; 59 } 60 61 62 // EXPORTS // 63 64 module.exports = meankbn;