Skip to content

Latest commit

 

History

History

ssumkbn2

README.md

ssumkbn2

Calculate the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.

Usage

var ssumkbn2 = require( '@stdlib/blas/ext/base/ssumkbn2' );

ssumkbn2( N, x, strideX )

Computes the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.

var Float32Array = require( '@stdlib/array/float32' );

var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );

var v = ssumkbn2( x.length, x, 1 );
// returns 1.0

The function has the following parameters:

  • N: number of indexed elements.
  • x: input Float32Array.
  • strideX: stride length.

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:

var Float32Array = require( '@stdlib/array/float32' );

var x = new Float32Array( [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 ] );

var v = ssumkbn2( 4, x, 2 );
// returns 5.0

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

var Float32Array = require( '@stdlib/array/float32' );

var x0 = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
var x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element

var v = ssumkbn2( 4, x1, 2 );
// returns 5.0

ssumkbn2.ndarray( N, x, strideX, offsetX )

Computes the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.

var Float32Array = require( '@stdlib/array/float32' );

var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );

var v = ssumkbn2.ndarray( x.length, x, 1, 0 );
// returns 1.0

The function has the following additional parameters:

  • offsetX: starting index.

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 element starting from the second element:

var Float32Array = require( '@stdlib/array/float32' );

var x = new Float32Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );

var v = ssumkbn2.ndarray( 4, x, 2, 1 );
// returns 5.0

Notes

  • If N <= 0, both functions return 0.0.

Examples

var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
var ssumkbn2 = require( '@stdlib/blas/ext/base/ssumkbn2' );

var x = discreteUniform( 10, -100, 100, {
    'dtype': 'float32'
});
console.log( x );

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

C APIs

Usage

#include "stdlib/blas/ext/base/ssumkbn2.h"

stdlib_strided_ssumkbn2( N, *X, strideX )

Computes the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.

const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f };

float v = stdlib_strided_ssumkbn2( 4, x, 1 );
// returns 10.0f

The function accepts the following arguments:

  • N: [in] CBLAS_INT number of indexed elements.
  • X: [in] float* input array.
  • strideX: [in] CBLAS_INT stride length.
float stdlib_strided_ssumkbn2( const CBLAS_INT N, const float *X, const CBLAS_INT strideX );

stdlib_strided_ssumkbn2_ndarray( N, *X, strideX, offsetX )

Computes the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.

const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f };

float v = stdlib_strided_ssumkbn2_ndarray( 4, x, 1, 0 );
// returns 10.0f

The function accepts the following arguments:

  • N: [in] CBLAS_INT number of indexed elements.
  • X: [in] float* input array.
  • strideX: [in] CBLAS_INT stride length.
  • offsetX: [in] CBLAS_INT starting index.
float stdlib_strided_ssumkbn2_ndarray( const CBLAS_INT N, const float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );

Examples

#include "stdlib/blas/ext/base/ssumkbn2.h"
#include <stdio.h>

int main( void ) {
    // Create a strided array:
    const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f, 5.0f, 6.0f, 7.0f, 8.0f };

    // Specify the number of elements:
    const int N = 4;

    // Specify the stride length:
    const int strideX = 2;

    // Compute the sum:
    float v = stdlib_strided_ssumkbn2( N, x, strideX );

    // Print the result:
    printf( "Sum: %f\n", v );
}

References

  • Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." Computing 76 (3): 279–93. doi:10.1007/s00607-005-0139-x.

See Also

  • @stdlib/blas/ext/base/dsumkbn2: calculate the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
  • @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/snansumkbn2: calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using a second-order iterative Kahan–Babuška algorithm.
  • @stdlib/blas/ext/base/ssum: calculate the sum of single-precision floating-point strided array elements.
  • @stdlib/blas/ext/base/ssumkbn: calculate the sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
  • @stdlib/blas/ext/base/ssumors: calculate the sum of single-precision floating-point strided array elements using ordinary recursive summation.
  • @stdlib/blas/ext/base/ssumpw: calculate the sum of single-precision floating-point strided array elements using pairwise summation.