Compute the sum of a one-dimensional ndarray, ignoring
NaNvalues and using pairwise summation.
var gnansumpw = require( '@stdlib/blas/ext/base/ndarray/gnansumpw' );Computes the sum of a one-dimensional ndarray, ignoring NaN values and using pairwise summation.
var ndarray = require( '@stdlib/ndarray/base/ctor' );
var xbuf = [ 1.0, -2.0, NaN, 2.0 ];
var x = new ndarray( 'generic', xbuf, [ 4 ], [ 1 ], 0, 'row-major' );
var v = gnansumpw( [ x ] );
// returns 1.0The function has the following parameters:
- arrays: array-like object containing a one-dimensional input ndarray.
- If provided an empty one-dimensional ndarray, the function returns
0.0. - 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 Kahan–Babuš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.
var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
var ndarray = require( '@stdlib/ndarray/base/ctor' );
var ndarray2array = require( '@stdlib/ndarray/to-array' );
var gnansumpw = require( '@stdlib/blas/ext/base/ndarray/gnansumpw' );
var xbuf = discreteUniform( 10, -50, 50, {
'dtype': 'generic'
});
var x = new ndarray( 'generic', xbuf, [ xbuf.length ], [ 1 ], 0, 'row-major' );
console.log( ndarray2array( x ) );
var v = gnansumpw( [ x ] );
console.log( v );