@stdlib/blas-ext-base-gsumors
v0.2.2
Published
Calculate the sum of strided array elements using ordinary recursive summation.
Downloads
220
Readme
gsumors
Calculate the sum of strided array elements using ordinary recursive summation.
Installation
npm install @stdlib/blas-ext-base-gsumors
Usage
var gsumors = require( '@stdlib/blas-ext-base-gsumors' );
gsumors( N, x, stride )
Computes the sum of strided array elements using ordinary recursive summation.
var x = [ 1.0, -2.0, 2.0 ];
var N = x.length;
var v = gsumors( N, x, 1 );
// returns 1.0
The function has the following parameters:
- N: number of indexed elements.
- x: input
Array
ortyped array
. - stride: index increment for
x
.
The N
and stride
parameters determine which elements in x
are accessed at runtime. For example, to compute the sum of every other element in x
,
var floor = require( '@stdlib/math-base-special-floor' );
var x = [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 ];
var N = floor( x.length / 2 );
var v = gsumors( N, x, 2 );
// returns 5.0
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 ] );
var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
var N = floor( x0.length / 2 );
var v = gsumors( N, x1, 2 );
// returns 5.0
gsumors.ndarray( N, x, stride, offset )
Computes the sum of strided array elements using ordinary recursive summation and alternative indexing semantics.
var x = [ 1.0, -2.0, 2.0 ];
var N = x.length;
var v = gsumors.ndarray( N, x, 1, 0 );
// returns 1.0
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 sum of every other value in x
starting from the second value
var floor = require( '@stdlib/math-base-special-floor' );
var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
var N = floor( x.length / 2 );
var v = gsumors.ndarray( N, x, 2, 1 );
// returns 5.0
Notes
- If
N <= 0
, both functions return0.0
. - Ordinary recursive summation (i.e., a "simple" sum) is performant, but can incur significant numerical error. If performance is paramount and error tolerated, using ordinary recursive summation is acceptable; in all other cases, exercise due caution.
- Depending on the environment, the typed versions (
dsumors
,ssumors
, etc.) are likely to be significantly more performant.
Examples
var randu = require( '@stdlib/random-base-randu' );
var round = require( '@stdlib/math-base-special-round' );
var Float64Array = require( '@stdlib/array-float64' );
var gsumors = require( '@stdlib/blas-ext-base-gsumors' );
var x;
var i;
x = new Float64Array( 10 );
for ( i = 0; i < x.length; i++ ) {
x[ i ] = round( randu()*100.0 );
}
console.log( x );
var v = gsumors( x.length, x, 1 );
console.log( v );
See Also
@stdlib/blas-ext/base/dsumors
: calculate the sum of double-precision floating-point strided array elements using ordinary recursive summation.@stdlib/blas-ext/base/gnansumors
: calculate the sum of strided array elements, ignoring NaN values and using ordinary recursive summation.@stdlib/blas-ext/base/gsum
: calculate the sum of strided array elements.@stdlib/blas-ext/base/gsumkbn2
: calculate the sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.@stdlib/blas-ext/base/gsumpw
: calculate the sum of strided array elements using pairwise summation.@stdlib/blas-ext/base/ssumors
: calculate the sum of single-precision floating-point strided array elements using ordinary recursive summation.
Notice
This package is part of stdlib, a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
For more information on the project, filing bug reports and feature requests, and guidance on how to develop stdlib, see the main project repository.
Community
License
See LICENSE.
Copyright
Copyright © 2016-2024. The Stdlib Authors.