About stdlib...
We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.
The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.
When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.
To join us in bringing numerical computing to the web, get started by checking us out on GitHub, and please consider financially supporting stdlib. We greatly appreciate your continued support!
Calculate the sum of strided array elements using ordinary recursive summation.
import gsumors from 'https://cdn.jsdelivr.net/gh/stdlib-js/blas-ext-base-gsumors@esm/index.mjs';
You can also import the following named exports from the package:
import { ndarray } from 'https://cdn.jsdelivr.net/gh/stdlib-js/blas-ext-base-gsumors@esm/index.mjs';
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
,
import floor from 'https://cdn.jsdelivr.net/gh/stdlib-js/math-base-special-floor@esm/index.mjs';
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.
import Float64Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-float64@esm/index.mjs';
import floor from 'https://cdn.jsdelivr.net/gh/stdlib-js/math-base-special-floor@esm/index.mjs';
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
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
import floor from 'https://cdn.jsdelivr.net/gh/stdlib-js/math-base-special-floor@esm/index.mjs';
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
- 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.
<!DOCTYPE html>
<html lang="en">
<body>
<script type="module">
import randu from 'https://cdn.jsdelivr.net/gh/stdlib-js/random-base-randu@esm/index.mjs';
import round from 'https://cdn.jsdelivr.net/gh/stdlib-js/math-base-special-round@esm/index.mjs';
import Float64Array from 'https://cdn.jsdelivr.net/gh/stdlib-js/array-float64@esm/index.mjs';
import gsumors from 'https://cdn.jsdelivr.net/gh/stdlib-js/blas-ext-base-gsumors@esm/index.mjs';
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 );
</script>
</body>
</html>
@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.
This package is part of stdlib, a standard library 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.
See LICENSE.
Copyright © 2016-2024. The Stdlib Authors.