Calculate the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
npm install @stdlib/blas-ext-base-dsumkbn2We 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!
About stdlib...
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]
> Calculate the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
``bash`
npm install @stdlib/blas-ext-base-dsumkbn2
`javascript`
var dsumkbn2 = require( '@stdlib/blas-ext-base-dsumkbn2' );
#### dsumkbn2( N, x, strideX )
Computes the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
`javascript
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 1.0, -2.0, 2.0 ] );
var v = dsumkbn2( x.length, x, 1 );
// returns 1.0
`
The function has the following parameters:
- N: number of indexed elements.
- x: input [Float64Array][@stdlib/array/float64].x
- strideX: stride length for .
The N and stride parameters determine which elements in the strided array are accessed at runtime. For example, to compute the sum of every other element:
`javascript
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 ] );
var v = dsumkbn2( 4, x, 2 );
// returns 5.0
`
Note that indexing is relative to the first index. To introduce an offset, use [typed array][mdn-typed-array] views.
`javascript
var Float64Array = require( '@stdlib/array-float64' );
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 v = dsumkbn2( 4, x1, 2 );
// returns 5.0
`
#### dsumkbn2.ndarray( N, x, strideX, offsetX )
Computes the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
`javascript
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 1.0, -2.0, 2.0 ] );
var v = dsumkbn2.ndarray( x.length, x, 1, 0 );
// returns 1.0
`
The function has the following additional parameters:
- offsetX: starting index for x.
While [typed array][mdn-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 element starting from the second element:
`javascript
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
var v = dsumkbn2.ndarray( 4, x, 2, 1 );
// returns 5.0
`
- If N <= 0, both functions return 0.0.
`javascript
var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
var dsumkbn2 = require( '@stdlib/blas-ext-base-dsumkbn2' );
var x = discreteUniform( 10, -100, 100, {
'dtype': 'float64'
});
console.log( x );
var v = dsumkbn2( x.length, x, 1 );
console.log( v );
`
*
`c`
#include "stdlib/blas/ext/base/dsumkbn2.h"
#### stdlib_strided_dsumkbn2( N, \*X, strideX )
Computes the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
`c
const double x[] = { 1.0, 2.0, 3.0, 4.0 };
double v = stdlib_strided_dsumkbn2( 4, x, 1 );
// returns 10.0
`
The function accepts the following arguments:
- N: [in] CBLAS_INT number of indexed elements.[in] double*
- X: input array.[in] CBLAS_INT
- strideX: stride length for X.
`c`
double stdlib_strided_dsumkbn2( const CBLAS_INT N, const double *X, const CBLAS_INT strideX );
#### stdlib_strided_dsumkbn2_ndarray( N, \*X, strideX, offsetX )
Computes the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
`c
const double x[] = { 1.0, 2.0, 3.0, 4.0 };
double v = stdlib_strided_dsumkbn2_ndarray( 4, x, 1, 0 );
// returns 10.0
`
The function accepts the following arguments:
- N: [in] CBLAS_INT number of indexed elements.[in] double*
- X: input array.[in] CBLAS_INT
- strideX: stride length for X.[in] CBLAS_INT
- offsetX: starting index for X.
`c`
double stdlib_strided_dsumkbn2_ndarray( const CBLAS_INT N, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );
`c
#include "stdlib/blas/ext/base/dsumkbn2.h"
#include
int main( void ) {
// Create a strided array:
const double x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 };
// Specify the number of elements:
const int N = 4;
// Specify the stride length:
const int strideX = 2;
// Compute the sum:
double v = stdlib_strided_dsumkbn2( N, x, strideX );
// Print the result:
printf( "sum: %lf\n", v );
}
`
- Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x][@klein:2005a].
*
- [@stdlib/blas-ext/base/dnansumkbn2][@stdlib/blas/ext/base/dnansumkbn2]: calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using a second-order iterative Kahan–Babuška algorithm.
- [@stdlib/blas-ext/base/dsum][@stdlib/blas/ext/base/dsum]: calculate the sum of double-precision floating-point strided array elements.
- [@stdlib/blas-ext/base/dsumkbn][@stdlib/blas/ext/base/dsumkbn]: calculate the sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
- [@stdlib/blas-ext/base/dsumors][@stdlib/blas/ext/base/dsumors]: calculate the sum of double-precision floating-point strided array elements using ordinary recursive summation.
- [@stdlib/blas-ext/base/dsumpw][@stdlib/blas/ext/base/dsumpw]: calculate the sum of double-precision floating-point strided array elements using pairwise summation.
- [@stdlib/blas-ext/base/gsumkbn2][@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/ssumkbn2][@stdlib/blas/ext/base/ssumkbn2]: calculate the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
*
This package is part of [stdlib][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][stdlib], see the main project [repository][stdlib].
#### Community
[![Chat][chat-image]][chat-url]
---
See [LICENSE][stdlib-license].
Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors].
[npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base-dsumkbn2.svg
[npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base-dsumkbn2
[test-image]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/actions/workflows/test.yml/badge.svg?branch=v0.3.1
[test-url]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/actions/workflows/test.yml?query=branch:v0.3.1
[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-dsumkbn2/main.svg
[coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-dsumkbn2?branch=main
[chat-image]: https://img.shields.io/badge/zulip-join_chat-brightgreen.svg
[chat-url]: https://stdlib.zulipchat.com
[stdlib]: https://github.com/stdlib-js/stdlib
[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
[umd]: https://github.com/umdjs/umd
[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
[deno-url]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/tree/deno
[deno-readme]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/blob/deno/README.md
[umd-url]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/tree/umd
[umd-readme]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/blob/umd/README.md
[esm-url]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/tree/esm
[esm-readme]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/blob/esm/README.md
[branches-url]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2/blob/main/branches.md
[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/blas-ext-base-dsumkbn2/main/LICENSE
[@stdlib/array/float64]: https://www.npmjs.com/package/@stdlib/array-float64
[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
[@klein:2005a]: https://doi.org/10.1007/s00607-005-0139-x
[@stdlib/blas/ext/base/dnansumkbn2]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dnansumkbn2
[@stdlib/blas/ext/base/dsum]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dsum
[@stdlib/blas/ext/base/dsumkbn]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dsumkbn
[@stdlib/blas/ext/base/dsumors]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dsumors
[@stdlib/blas/ext/base/dsumpw]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dsumpw
[@stdlib/blas/ext/base/gsumkbn2]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gsumkbn2
[@stdlib/blas/ext/base/ssumkbn2]: https://www.npmjs.com/package/@stdlib/blas-ext-base-ssumkbn2