time-to-botec/js/node_modules/@stdlib/stats/base/dnanmeanpw/README.md
NunoSempere b6addc7f05 feat: add the node modules
Necessary in order to clearly see the squiggle hotwiring.
2022-12-03 12:44:49 +00:00

6.2 KiB
Raw Blame History

dnanmeanpw

Calculate the arithmetic mean of a double-precision floating-point strided array, ignoring NaN values and using pairwise summation.

The arithmetic mean is defined as

Equation for the arithmetic mean.

Usage

var dnanmeanpw = require( '@stdlib/stats/base/dnanmeanpw' );

dnanmeanpw( N, x, stride )

Computes the arithmetic mean of a double-precision floating-point strided array x, ignoring NaN values and using pairwise summation.

var Float64Array = require( '@stdlib/array/float64' );

var x = new Float64Array( [ 1.0, -2.0, NaN, 2.0 ] );
var N = x.length;

var v = dnanmeanpw( N, x, 1 );
// returns ~0.3333

The function has the following parameters:

  • N: number of indexed elements.
  • x: input Float64Array.
  • stride: index increment for x.

The N and stride parameters determine which elements in x are accessed at runtime. For example, to compute the arithmetic mean of every other element in x,

var Float64Array = require( '@stdlib/array/float64' );
var floor = require( '@stdlib/math/base/special/floor' );

var x = new Float64Array( [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0, NaN ] );
var N = floor( x.length / 2 );

var v = dnanmeanpw( N, x, 2 );
// returns 1.25

Note that indexing is relative to the first index. To introduce an offset, use typed array views.

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, NaN ] );
var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element

var N = floor( x0.length / 2 );

var v = dnanmeanpw( N, x1, 2 );
// returns 1.25

dnanmeanpw.ndarray( N, x, stride, offset )

Computes the arithmetic mean of a double-precision floating-point strided array, ignoring NaN values and using pairwise summation and alternative indexing semantics.

var Float64Array = require( '@stdlib/array/float64' );

var x = new Float64Array( [ 1.0, -2.0, NaN, 2.0 ] );
var N = x.length;

var v = dnanmeanpw.ndarray( N, x, 1, 0 );
// returns ~0.33333

The function has the following additional parameters:

  • offset: starting index for x.

While 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 arithmetic mean for every other value in x starting from the second value

var Float64Array = require( '@stdlib/array/float64' );
var floor = require( '@stdlib/math/base/special/floor' );

var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0, NaN ] );
var N = floor( x.length / 2 );

var v = dnanmeanpw.ndarray( N, x, 2, 1 );
// returns 1.25

Notes

  • If N <= 0, both functions return NaN.
  • If every indexed element is NaN, both functions return NaN.
  • In general, pairwise summation is more numerically stable than ordinary recursive summation (i.e., "simple" summation), with slightly worse performance. While not the most numerically stable summation technique (e.g., compensated summation techniques such as the KahanBabuška-Neumaier algorithm are generally more numerically stable), pairwise summation strikes a reasonable balance between numerical stability and performance. If either numerical stability or performance is more desirable for your use case, consider alternative summation techniques.

Examples

var randu = require( '@stdlib/random/base/randu' );
var round = require( '@stdlib/math/base/special/round' );
var Float64Array = require( '@stdlib/array/float64' );
var dnanmeanpw = require( '@stdlib/stats/base/dnanmeanpw' );

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) - 50.0 );
    }
}
console.log( x );

var v = dnanmeanpw( x.length, x, 1 );
console.log( v );

References

  • Higham, Nicholas J. 1993. "The Accuracy of Floating Point Summation." SIAM Journal on Scientific Computing 14 (4): 78399. doi:10.1137/0914050.