diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/README.md b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/README.md
index 034dc4343c27..24d1aee9fcf1 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/README.md
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/README.md
@@ -20,7 +20,7 @@ limitations under the License.
 
 # sapxsumkbn2
 
-> Add a constant to each single-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
+> Add a scalar constant to each single-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
 
 <section class="intro">
 
@@ -36,17 +36,16 @@ limitations under the License.
 var sapxsumkbn2 = require( '@stdlib/blas/ext/base/sapxsumkbn2' );
 ```
 
-#### sapxsumkbn2( N, alpha, x, stride )
+#### sapxsumkbn2( N, alpha, x, strideX )
 
-Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 
 ```javascript
 var Float32Array = require( '@stdlib/array/float32' );
 
 var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
-var N = x.length;
 
-var v = sapxsumkbn2( N, 5.0, x, 1 );
+var v = sapxsumkbn2( x.length, 5.0, x, 1 );
 // returns 16.0
 ```
 
@@ -54,9 +53,9 @@ The function has the following parameters:
 
 -   **N**: number of indexed elements.
 -   **x**: input [`Float32Array`][@stdlib/array/float32].
--   **stride**: index increment for `x`.
+-   **strideX**: stride length.
 
-The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to access every other element in `x`,
+The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to access every other element:
 
 ```javascript
 var Float32Array = require( '@stdlib/array/float32' );
@@ -81,25 +80,24 @@ var v = sapxsumkbn2( 4, 5.0, x1, 2 );
 // returns 25.0
 ```
 
-#### sapxsumkbn2.ndarray( N, alpha, x, stride, offset )
+#### sapxsumkbn2.ndarray( N, alpha, x, strideX, offsetX )
 
-Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
+Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
 
 ```javascript
 var Float32Array = require( '@stdlib/array/float32' );
 
 var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
-var N = x.length;
 
-var v = sapxsumkbn2.ndarray( N, 5.0, x, 1, 0 );
+var v = sapxsumkbn2.ndarray( x.length, 5.0, x, 1, 0 );
 // returns 16.0
 ```
 
 The function has the following additional parameters:
 
--   **offset**: starting index for `x`.
+-   **offsetX**: starting index.
 
-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 access every other value in `x` starting from the second value
+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 access every other element starting from the second element:
 
 ```javascript
 var Float32Array = require( '@stdlib/array/float32' );
@@ -131,11 +129,12 @@ var v = sapxsumkbn2.ndarray( 4, 5.0, x, 2, 1 );
 <!-- eslint no-undef: "error" -->
 
 ```javascript
-var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory;
-var filledarrayBy = require( '@stdlib/array/filled-by' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var sapxsumkbn2 = require( '@stdlib/blas/ext/base/sapxsumkbn2' );
 
-var x = filledarrayBy( 10, 'float32', discreteUniform( 0, 100 ) );
+var x = discreteUniform( 10, -100, 100, {
+    'dtype': 'float32'
+});
 console.log( x );
 
 var v = sapxsumkbn2( x.length, 5.0, x, 1 );
@@ -146,8 +145,125 @@ console.log( v );
 
 <!-- /.examples -->
 
+<!-- C interface documentation. -->
+
 * * *
 
+<section class="c">
+
+## C APIs
+
+<!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<!-- C usage documentation. -->
+
+<section class="usage">
+
+### Usage
+
+```c
+#include "stdlib/blas/ext/base/sapxsumkbn2.h"
+```
+
+#### stdlib_strided_sapxsumkbn2( N, alpha, \*X, strideX )
+
+Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+
+```c
+const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f };
+
+float v = stdlib_strided_sapxsumkbn2( 4, 5.0f, x, 1 );
+// returns 30.0f
+```
+
+The function accepts the following arguments:
+
+-   **N**: `[in] CBLAS_INT` number of indexed elements.
+-   **alpha**: `[in] float` scalar constant.
+-   **X**: `[in] float*` input array.
+-   **strideX**: `[in] CBLAS_INT` stride length.
+
+```c
+float stdlib_strided_sapxsumkbn2( const CBLAS_INT N, const float alpha, const float *X, const CBLAS_INT strideX );
+```
+
+#### stdlib_strided_sapxsumkbn2_ndarray( N, alpha, \*X, strideX, offsetX )
+
+Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
+
+```c
+const float x[] = { 1.0f, 2.0f, 3.0f, 4.0f };
+
+float v = stdlib_strided_sapxsumkbn2_ndarray( 4, 5.0f, x, 1, 0 );
+// returns 30.0f
+```
+
+The function accepts the following arguments:
+
+-   **N**: `[in] CBLAS_INT` number of indexed elements.
+-   **alpha**: `[in] float` scalar constant.
+-   **X**: `[in] float*` input array.
+-   **strideX**: `[in] CBLAS_INT` stride length.
+-   **offsetX**: `[in] CBLAS_INT` starting index.
+
+```c
+float stdlib_strided_sapxsumkbn2_ndarray( const CBLAS_INT N, const float alpha, const float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );
+```
+
+</section>
+
+<!-- /.usage -->
+
+<!-- C API usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="notes">
+
+</section>
+
+<!-- /.notes -->
+
+<!-- C API usage examples. -->
+
+<section class="examples">
+
+### Examples
+
+```c
+#include "stdlib/blas/ext/base/sapxsumkbn2.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 indexed elements:
+    const int N = 8;
+
+    // Specify a stride:
+    const int strideX = 1;
+
+    // Compute the sum:
+    float v = stdlib_strided_sapxsumkbn2( N, 5.0f, x, strideX );
+
+    // Print the result:
+    printf( "Sum: %f\n", v );
+}
+```
+
+</section>
+
+<!-- /.examples -->
+
+</section>
+
+<!-- /.c -->
+
 <section class="references">
 
 ## References
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.js
index 097ef0f89db9..8b0acb7a170e 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.js
@@ -21,8 +21,7 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/base/uniform' ).factory;
-var filledarrayBy = require( '@stdlib/array/filled-by' );
+var uniform = require( '@stdlib/random/array/uniform' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var pkg = require( './../package.json' ).name;
@@ -31,7 +30,9 @@ var sapxsumkbn2 = require( './../lib/sapxsumkbn2.js' );
 
 // VARIABLES //
 
-var rand = uniform( -100.0, 100.0 );
+var options = {
+	'dtype': 'float32'
+};
 
 
 // FUNCTIONS //
@@ -44,7 +45,7 @@ var rand = uniform( -100.0, 100.0 );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float32', rand );
+	var x = uniform( len, -100, 100, options );
 	return benchmark;
 
 	function benchmark( b ) {
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.native.js
index 981a97127d15..98fff51fa97c 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.native.js
@@ -22,8 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/base/uniform' ).factory;
-var filledarrayBy = require( '@stdlib/array/filled-by' );
+var uniform = require( '@stdlib/random/array/uniform' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var tryRequire = require( '@stdlib/utils/try-require' );
@@ -36,7 +35,9 @@ var sapxsumkbn2 = tryRequire( resolve( __dirname, './../lib/sapxsumkbn2.native.j
 var opts = {
 	'skip': ( sapxsumkbn2 instanceof Error )
 };
-var rand = uniform( -100.0, 100.0 );
+var options = {
+	'dtype': 'float32'
+};
 
 
 // FUNCTIONS //
@@ -49,7 +50,7 @@ var rand = uniform( -100.0, 100.0 );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float32', rand );
+	var x = uniform( len, -100, 100, options );
 	return benchmark;
 
 	function benchmark( b ) {
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.js
index bfc4fadfe3c0..a0cf86d2b25e 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.js
@@ -21,8 +21,7 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/base/uniform' ).factory;
-var filledarrayBy = require( '@stdlib/array/filled-by' );
+var uniform = require( '@stdlib/random/array/uniform' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var pkg = require( './../package.json' ).name;
@@ -31,7 +30,9 @@ var sapxsumkbn2 = require( './../lib/ndarray.js' );
 
 // VARIABLES //
 
-var rand = uniform( -100.0, 100.0 );
+var options = {
+	'dtype': 'float32'
+};
 
 
 // FUNCTIONS //
@@ -44,7 +45,7 @@ var rand = uniform( -100.0, 100.0 );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float32', rand );
+	var x = uniform( len, -100, 100, options );
 	return benchmark;
 
 	function benchmark( b ) {
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.native.js
index dd827c8d9400..84bba45cef89 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/benchmark.ndarray.native.js
@@ -22,8 +22,7 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var uniform = require( '@stdlib/random/base/uniform' ).factory;
-var filledarrayBy = require( '@stdlib/array/filled-by' );
+var uniform = require( '@stdlib/random/array/uniform' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var pow = require( '@stdlib/math/base/special/pow' );
 var tryRequire = require( '@stdlib/utils/try-require' );
@@ -36,7 +35,9 @@ var sapxsumkbn2 = tryRequire( resolve( __dirname, './../lib/ndarray.native.js' )
 var opts = {
 	'skip': ( sapxsumkbn2 instanceof Error )
 };
-var rand = uniform( -100.0, 100.0 );
+var options = {
+	'dtype': 'float32'
+};
 
 
 // FUNCTIONS //
@@ -49,7 +50,7 @@ var rand = uniform( -100.0, 100.0 );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x = filledarrayBy( len, 'float32', rand );
+	var x = uniform( len, -100, 100, options );
 	return benchmark;
 
 	function benchmark( b ) {
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/c/benchmark.length.c
index 0b14204ec658..b338b06878b3 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/c/benchmark.length.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/benchmark/c/benchmark.length.c
@@ -94,7 +94,7 @@ static float rand_float( void ) {
 * @param len          array length
 * @return             elapsed time in seconds
 */
-static double benchmark( int iterations, int len ) {
+static double benchmark1( int iterations, int len ) {
 	double elapsed;
 	float x[ len ];
 	float v;
@@ -107,6 +107,7 @@ static double benchmark( int iterations, int len ) {
 	v = 0.0f;
 	t = tic();
 	for ( i = 0; i < iterations; i++ ) {
+		// cppcheck-suppress uninitvar
 		v = stdlib_strided_sapxsumkbn2( len, 5.0f, x, 1 );
 		if ( v != v ) {
 			printf( "should not return NaN\n" );
@@ -120,6 +121,40 @@ static double benchmark( int iterations, int len ) {
 	return elapsed;
 }
 
+/**
+* Runs a benchmark.
+*
+* @param iterations   number of iterations
+* @param len          array length
+* @return             elapsed time in seconds
+*/
+static double benchmark2( int iterations, int len ) {
+	double elapsed;
+	float x[ len ];
+	float v;
+	double t;
+	int i;
+
+	for ( i = 0; i < len; i++ ) {
+		x[ i ] = ( rand_float() * 20000.0f ) - 10000.0f;
+	}
+	v = 0.0f;
+	t = tic();
+	for ( i = 0; i < iterations; i++ ) {
+		// cppcheck-suppress uninitvar
+		v = stdlib_strided_sapxsumkbn2_ndarray( len, 5.0f, x, 1, 0 );
+		if ( v != v ) {
+			printf( "should not return NaN\n" );
+			break;
+		}
+	}
+	elapsed = tic() - t;
+	if ( v != v ) {
+		printf( "should not return NaN\n" );
+	}
+	return elapsed;
+}
+
 /**
 * Main execution sequence.
 */
@@ -142,7 +177,18 @@ int main( void ) {
 		for ( j = 0; j < REPEATS; j++ ) {
 			count += 1;
 			printf( "# c::%s:len=%d\n", NAME, len );
-			elapsed = benchmark( iter, len );
+			elapsed = benchmark1( iter, len );
+			print_results( iter, elapsed );
+			printf( "ok %d benchmark finished\n", count );
+		}
+	}
+	for ( i = MIN; i <= MAX; i++ ) {
+		len = pow( 10, i );
+		iter = ITERATIONS / pow( 10, i-1 );
+		for ( j = 0; j < REPEATS; j++ ) {
+			count += 1;
+			printf( "# c::%s:ndarray:len=%d\n", NAME, len );
+			elapsed = benchmark2( iter, len );
 			print_results( iter, elapsed );
 			printf( "ok %d benchmark finished\n", count );
 		}
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/repl.txt b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/repl.txt
index 10e574fca3f6..0e9811bd566c 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/repl.txt
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/repl.txt
@@ -1,11 +1,11 @@
 
-{{alias}}( N, alpha, x, stride )
-    Adds a constant to each single-precision floating-point strided array
-    element and computes the sum using a second-order iterative Kahan–Babuška
-    algorithm.
+{{alias}}( N, alpha, x, strideX )
+    Adds a scalar constant to each single-precision floating-point strided
+    array element and computes the sum using a second-order iterative
+    Kahan–Babuška algorithm.
 
-    The `N` and `stride` parameters determine which elements in the 
-    strided array are accessed at runtime.
+    The `N` and stride parameters determine which elements in the strided array
+    are accessed at runtime.
 
     Indexing is relative to the first index. To introduce an offset, use a typed
     array view.
@@ -18,13 +18,13 @@
         Number of indexed elements.
 
     alpha: number
-        Constant.
+        Scalar constant.
 
     x: Float32Array
         Input array.
 
-    stride: integer
-        Index increment.
+    strideX: integer
+        Stride length.
 
     Returns
     -------
@@ -38,7 +38,7 @@
     > {{alias}}( x.length, 5.0, x, 1 )
     16.0
 
-    // Using `N` and `stride` parameters:
+    // Using `N` and stride parameters:
     > x = new {{alias:@stdlib/array/float32}}( [ -2.0, 1.0, 1.0, -5.0, 2.0, -1.0 ] );
     > {{alias}}( 3, 5.0, x, 2 )
     16.0
@@ -50,13 +50,13 @@
     14.0
 
 
-{{alias}}.ndarray( N, alpha, x, stride, offset )
-    Adds a constant to each single-precision floating-point strided array
-    element and computes the sum using a second-order iterative Kahan–Babuška
-    algorithm and alternative indexing semantics.
+{{alias}}.ndarray( N, alpha, x, strideX, offsetX )
+    Adds a scalar constant to each single-precision floating-point strided
+    array element and computes the sum using a second-order iterative
+    Kahan–Babuška algorithm and alternative indexing semantics.
 
     While typed array views mandate a view offset based on the underlying
-    buffer, the `offset` parameter supports indexing semantics based on a
+    buffer, the offset parameter supports indexing semantics based on a
     starting index.
 
     Parameters
@@ -65,15 +65,15 @@
         Number of indexed elements.
 
     alpha: number
-        Constant.
+        Scalar constant.
 
     x: Float32Array
         Input array.
 
-    stride: integer
-        Index increment.
+    strideX: integer
+        Stride length.
 
-    offset: integer
+    offsetX: integer
         Starting index.
 
     Returns
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/types/index.d.ts b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/types/index.d.ts
index c4d69b8427d3..3fdb7e66f42a 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/types/index.d.ts
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/docs/types/index.d.ts
@@ -23,12 +23,12 @@
 */
 interface Routine {
 	/**
-	* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+	* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 	*
 	* @param N - number of indexed elements
-	* @param alpha - constant
+	* @param alpha - scalar constant
 	* @param x - input array
-	* @param stride - stride length
+	* @param strideX - stride length
 	* @returns sum
 	*
 	* @example
@@ -39,16 +39,16 @@ interface Routine {
 	* var v = sapxsumkbn2( x.length, 5.0, x, 1 );
 	* // returns 16.0
 	*/
-	( N: number, alpha: number, x: Float32Array, stride: number ): number;
+	( N: number, alpha: number, x: Float32Array, strideX: number ): number;
 
 	/**
-	* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
+	* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
 	*
 	* @param N - number of indexed elements
-	* @param alpha - constant
+	* @param alpha - scalar constant
 	* @param x - input array
-	* @param stride - stride length
-	* @param offset - starting index
+	* @param strideX - stride length
+	* @param offsetX - starting index
 	* @returns sum
 	*
 	* @example
@@ -59,16 +59,16 @@ interface Routine {
 	* var v = sapxsumkbn2.ndarray( x.length, 5.0, x, 1, 0 );
 	* // returns 16.0
 	*/
-	ndarray( N: number, alpha: number, x: Float32Array, stride: number, offset: number ): number;
+	ndarray( N: number, alpha: number, x: Float32Array, strideX: number, offsetX: number ): number;
 }
 
 /**
-* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 *
 * @param N - number of indexed elements
-* @param alpha - constant
+* @param alpha - scalar constant
 * @param x - input array
-* @param stride - stride length
+* @param strideX - stride length
 * @returns sum
 *
 * @example
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/c/example.c b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/c/example.c
index 6ad10b4e1e4d..220e47f462fc 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/c/example.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/c/example.c
@@ -17,22 +17,21 @@
 */
 
 #include "stdlib/blas/ext/base/sapxsumkbn2.h"
-#include <stdint.h>
 #include <stdio.h>
 
 int main( void ) {
 	// Create a strided array:
-	const float x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 };
+	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 int64_t N = 4;
+	// Specify the number of indexed elements:
+	const int N = 8;
 
-	// Specify the stride length:
-	const int64_t stride = 2;
+	// Specify a stride:
+	const int strideX = 1;
 
 	// Compute the sum:
-	float v = stdlib_strided_sapxsumkbn2( N, 5.0f, x, stride );
+	float v = stdlib_strided_sapxsumkbn2( N, 5.0f, x, strideX );
 
 	// Print the result:
-	printf( "sum: %f\n", v );
+	printf( "Sum: %f\n", v );
 }
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/index.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/index.js
index 5bc3a172a1d4..f94fe6e7d57c 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/index.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/examples/index.js
@@ -18,11 +18,12 @@
 
 'use strict';
 
-var discreteUniform = require( '@stdlib/random/base/discrete-uniform' ).factory;
-var filledarrayBy = require( '@stdlib/array/filled-by' );
+var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
 var sapxsumkbn2 = require( './../lib' );
 
-var x = filledarrayBy( 10, 'float32', discreteUniform( -100.0, 100.0 ) );
+var x = discreteUniform( 10, -100, 100, {
+	'dtype': 'float32'
+});
 console.log( x );
 
 var v = sapxsumkbn2( x.length, 5.0, x, 1 );
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/include/stdlib/blas/ext/base/sapxsumkbn2.h b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/include/stdlib/blas/ext/base/sapxsumkbn2.h
index bd485bb48c34..35a26c85b33a 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/include/stdlib/blas/ext/base/sapxsumkbn2.h
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/include/stdlib/blas/ext/base/sapxsumkbn2.h
@@ -19,7 +19,7 @@
 #ifndef STDLIB_BLAS_EXT_BASE_SAPXSUMKBN2_H
 #define STDLIB_BLAS_EXT_BASE_SAPXSUMKBN2_H
 
-#include <stdint.h>
+#include "stdlib/blas/base/shared.h"
 
 /*
 * If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler.
@@ -31,7 +31,12 @@ extern "C" {
 /**
 * Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 */
-float stdlib_strided_sapxsumkbn2( const int64_t N, const float alpha, const float *X, const int64_t stride );
+float API_SUFFIX(stdlib_strided_sapxsumkbn2)( const CBLAS_INT N, const float alpha, const float *X, const CBLAS_INT strideX );
+
+/**
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
+*/
+float API_SUFFIX(stdlib_strided_sapxsumkbn2_ndarray)( const CBLAS_INT N, const float alpha, const float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );
 
 #ifdef __cplusplus
 }
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/index.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/index.js
index bdc3abd5ab2b..156372a8b935 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/index.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/index.js
@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Add a constant to each single-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
+* Add a scalar constant to each single-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
 *
 * @module @stdlib/blas/ext/base/sapxsumkbn2
 *
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.js
index a192f1839905..a34513909179 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.js
@@ -27,7 +27,7 @@ var abs = require( '@stdlib/math/base/special/abs' );
 // MAIN //
 
 /**
-* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 *
 * ## Method
 *
@@ -38,10 +38,10 @@ var abs = require( '@stdlib/math/base/special/abs' );
 * -   Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x).
 *
 * @param {PositiveInteger} N - number of indexed elements
-* @param {number} alpha - constant
+* @param {number} alpha - scalar constant
 * @param {Float32Array} x - input array
-* @param {integer} stride - stride length
-* @param {NonNegativeInteger} offset - starting index
+* @param {integer} strideX - stride length
+* @param {NonNegativeInteger} offsetX - starting index
 * @returns {number} sum
 *
 * @example
@@ -52,7 +52,7 @@ var abs = require( '@stdlib/math/base/special/abs' );
 * var v = sapxsumkbn2( 4, 5.0, x, 2, 1 );
 * // returns 25.0
 */
-function sapxsumkbn2( N, alpha, x, stride, offset ) {
+function sapxsumkbn2( N, alpha, x, strideX, offsetX ) {
 	var sum;
 	var ccs;
 	var ix;
@@ -66,10 +66,10 @@ function sapxsumkbn2( N, alpha, x, stride, offset ) {
 	if ( N <= 0 ) {
 		return 0.0;
 	}
-	if ( N === 1 || stride === 0 ) {
-		return float64ToFloat32( alpha + x[ offset ] );
+	ix = offsetX;
+	if ( strideX === 0 ) {
+		return float64ToFloat32( N * float64ToFloat32( alpha + x[ ix ] ) );
 	}
-	ix = offset;
 	sum = 0.0;
 	ccs = 0.0; // second order correction term for lost low order bits
 	cs = 0.0; // first order correction term for lost low order bits
@@ -90,7 +90,7 @@ function sapxsumkbn2( N, alpha, x, stride, offset ) {
 		}
 		cs = t;
 		ccs = float64ToFloat32( ccs+cc );
-		ix += stride;
+		ix += strideX;
 	}
 	return float64ToFloat32( sum + float64ToFloat32( cs+ccs ) );
 }
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.native.js
index ee442324445a..c70b00819bac 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/ndarray.native.js
@@ -20,21 +20,19 @@
 
 // MODULES //
 
-var minViewBufferIndex = require( '@stdlib/strided/base/min-view-buffer-index' );
-var offsetView = require( '@stdlib/strided/base/offset-view' );
-var addon = require( './sapxsumkbn2.native.js' );
+var addon = require( './../src/addon.node' );
 
 
 // MAIN //
 
 /**
-* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 *
 * @param {PositiveInteger} N - number of indexed elements
-* @param {number} alpha - constant
+* @param {number} alpha - scalar constant
 * @param {Float32Array} x - input array
-* @param {integer} stride - stride length
-* @param {NonNegativeInteger} offset - starting index
+* @param {integer} strideX - stride length
+* @param {NonNegativeInteger} offsetX - starting index
 * @returns {number} sum
 *
 * @example
@@ -45,11 +43,8 @@ var addon = require( './sapxsumkbn2.native.js' );
 * var v = sapxsumkbn2( 4, 5.0, x, 2, 1 );
 * // returns 25.0
 */
-function sapxsumkbn2( N, alpha, x, stride, offset ) {
-	var view;
-	offset = minViewBufferIndex( N, stride, offset );
-	view = offsetView( x, offset );
-	return addon( N, alpha, view, stride );
+function sapxsumkbn2( N, alpha, x, strideX, offsetX ) {
+	return addon.ndarray( N, alpha, x, strideX, offsetX );
 }
 
 
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.js
index d7f78d5f48a6..7f9dc253cdda 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.js
@@ -20,14 +20,14 @@
 
 // MODULES //
 
-var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
-var abs = require( '@stdlib/math/base/special/abs' );
+var stride2offset = require( '@stdlib/strided/base/stride2offset' );
+var ndarray = require( './ndarray.js' );
 
 
 // MAIN //
 
 /**
-* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 *
 * ## Method
 *
@@ -38,65 +38,21 @@ var abs = require( '@stdlib/math/base/special/abs' );
 * -   Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x).
 *
 * @param {PositiveInteger} N - number of indexed elements
-* @param {number} alpha - constant
+* @param {number} alpha - scalar constant
 * @param {Float32Array} x - input array
-* @param {integer} stride - stride length
+* @param {integer} strideX - stride length
 * @returns {number} sum
 *
 * @example
 * var Float32Array = require( '@stdlib/array/float32' );
 *
 * var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
-* var N = x.length;
 *
-* var v = sapxsumkbn2( N, 5.0, x, 1 );
+* var v = sapxsumkbn2( x.length, 5.0, x, 1 );
 * // returns 16.0
 */
-function sapxsumkbn2( N, alpha, x, stride ) {
-	var sum;
-	var ccs;
-	var ix;
-	var cs;
-	var cc;
-	var v;
-	var t;
-	var c;
-	var i;
-
-	if ( N <= 0 ) {
-		return 0.0;
-	}
-	if ( N === 1 || stride === 0 ) {
-		return float64ToFloat32( alpha + x[ 0 ] );
-	}
-	if ( stride < 0 ) {
-		ix = (1-N) * stride;
-	} else {
-		ix = 0;
-	}
-	sum = 0.0;
-	ccs = 0.0; // second order correction term for lost low order bits
-	cs = 0.0; // first order correction term for lost low order bits
-	for ( i = 0; i < N; i++ ) {
-		v = float64ToFloat32( alpha + x[ ix ] );
-		t = float64ToFloat32( sum+v );
-		if ( abs( sum ) >= abs( v ) ) {
-			c = float64ToFloat32( float64ToFloat32( sum-t ) + v );
-		} else {
-			c = float64ToFloat32( float64ToFloat32( v-t ) + sum );
-		}
-		sum = t;
-		t = float64ToFloat32( cs+c );
-		if ( abs( cs ) >= abs( c ) ) {
-			cc = float64ToFloat32( float64ToFloat32( cs-t ) + c );
-		} else {
-			cc = float64ToFloat32( float64ToFloat32( c-t ) + cs );
-		}
-		cs = t;
-		ccs = float64ToFloat32( ccs+cc );
-		ix += stride;
-	}
-	return float64ToFloat32( sum + float64ToFloat32( cs+ccs ) );
+function sapxsumkbn2( N, alpha, x, strideX ) {
+	return ndarray( N, alpha, x, strideX, stride2offset( N, strideX ) );
 }
 
 
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.native.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.native.js
index 0fa9e8fed298..1ad03bb8f3c2 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/lib/sapxsumkbn2.native.js
@@ -26,25 +26,24 @@ var addon = require( './../src/addon.node' );
 // MAIN //
 
 /**
-* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 *
 * @param {PositiveInteger} N - number of indexed elements
-* @param {number} alpha - constant
+* @param {number} alpha - scalar constant
 * @param {Float32Array} x - input array
-* @param {integer} stride - stride length
+* @param {integer} strideX - stride length
 * @returns {number} sum
 *
 * @example
 * var Float32Array = require( '@stdlib/array/float32' );
 *
 * var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
-* var N = x.length;
 *
-* var v = sapxsumkbn2( N, 5.0, x, 1 );
+* var v = sapxsumkbn2( x.length, 5.0, x, 1 );
 * // returns 16.0
 */
-function sapxsumkbn2( N, alpha, x, stride ) {
-	return addon( N, alpha, x, stride );
+function sapxsumkbn2( N, alpha, x, strideX ) {
+	return addon( N, alpha, x, strideX );
 }
 
 
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/manifest.json b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/manifest.json
index caeb119f92c3..87473f7a3c2d 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/manifest.json
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/manifest.json
@@ -33,9 +33,7 @@
       "include": [
         "./include"
       ],
-      "libraries": [
-        "-lm"
-      ],
+      "libraries": [],
       "libpath": [],
       "dependencies": [
         "@stdlib/napi/export",
@@ -43,7 +41,10 @@
         "@stdlib/napi/argv-int64",
         "@stdlib/napi/argv-float",
         "@stdlib/napi/argv-strided-float32array",
-        "@stdlib/napi/create-double"
+        "@stdlib/napi/create-double",
+        "@stdlib/strided/base/stride2offset",
+        "@stdlib/blas/base/shared",
+        "@stdlib/math/base/special/absf"
       ]
     },
     {
@@ -54,11 +55,13 @@
       "include": [
         "./include"
       ],
-      "libraries": [
-        "-lm"
-      ],
+      "libraries": [],
       "libpath": [],
-      "dependencies": []
+      "dependencies": [
+        "@stdlib/strided/base/stride2offset",
+        "@stdlib/blas/base/shared",
+        "@stdlib/math/base/special/absf"
+      ]
     },
     {
       "task": "examples",
@@ -68,11 +71,13 @@
       "include": [
         "./include"
       ],
-      "libraries": [
-        "-lm"
-      ],
+      "libraries": [],
       "libpath": [],
-      "dependencies": []
+      "dependencies": [
+        "@stdlib/strided/base/stride2offset",
+        "@stdlib/blas/base/shared",
+        "@stdlib/math/base/special/absf"
+      ]
     }
   ]
 }
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/package.json b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/package.json
index c4a09119a3af..a679afec9eec 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/package.json
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/package.json
@@ -1,7 +1,7 @@
 {
   "name": "@stdlib/blas/ext/base/sapxsumkbn2",
   "version": "0.0.0",
-  "description": "Add a constant to each single-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.",
+  "description": "Add a scalar constant to each single-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.",
   "license": "Apache-2.0",
   "author": {
     "name": "The Stdlib Authors",
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/addon.c b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/addon.c
index 68cf8743a93d..464d8106e7f2 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/addon.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/addon.c
@@ -17,6 +17,7 @@
 */
 
 #include "stdlib/blas/ext/base/sapxsumkbn2.h"
+#include "stdlib/blas/base/shared.h"
 #include "stdlib/napi/export.h"
 #include "stdlib/napi/argv.h"
 #include "stdlib/napi/argv_int64.h"
@@ -35,11 +36,29 @@
 static napi_value addon( napi_env env, napi_callback_info info ) {
 	STDLIB_NAPI_ARGV( env, info, argv, argc, 4 );
 	STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 );
-	STDLIB_NAPI_ARGV_FLOAT( env, alpha, argv, 1)
-	STDLIB_NAPI_ARGV_INT64( env, stride, argv, 3 );
-	STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, stride, argv, 2 );
-	STDLIB_NAPI_CREATE_DOUBLE( env, (double)stdlib_strided_sapxsumkbn2( N, alpha, X, stride ), v );
+	STDLIB_NAPI_ARGV_FLOAT( env, alpha, argv, 1 );
+	STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 3 );
+	STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2 );
+	STDLIB_NAPI_CREATE_DOUBLE( env, (double)API_SUFFIX(stdlib_strided_sapxsumkbn2)( N, alpha, X, strideX ), v );
 	return v;
 }
 
-STDLIB_NAPI_MODULE_EXPORT_FCN( addon )
+/**
+* Receives JavaScript callback invocation data.
+*
+* @param env    environment under which the function is invoked
+* @param info   callback data
+* @return       Node-API value
+*/
+static napi_value addon_method( napi_env env, napi_callback_info info ) {
+	STDLIB_NAPI_ARGV( env, info, argv, argc, 5 );
+	STDLIB_NAPI_ARGV_INT64( env, N, argv, 0 );
+	STDLIB_NAPI_ARGV_FLOAT( env, alpha, argv, 1 );
+	STDLIB_NAPI_ARGV_INT64( env, strideX, argv, 3 );
+	STDLIB_NAPI_ARGV_INT64( env, offsetX, argv, 4 );
+	STDLIB_NAPI_ARGV_STRIDED_FLOAT32ARRAY( env, X, N, strideX, argv, 2 );
+	STDLIB_NAPI_CREATE_DOUBLE( env, (double)API_SUFFIX(stdlib_strided_sapxsumkbn2_ndarray)( N, alpha, X, strideX, offsetX ), v );
+	return v;
+}
+
+STDLIB_NAPI_MODULE_EXPORT_FCN_WITH_METHOD( addon, "ndarray", addon_method );
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/main.c b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/main.c
index c04137e41636..857046f0ad03 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/main.c
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/src/main.c
@@ -1,7 +1,7 @@
 /**
 * @license Apache-2.0
 *
-* Copyright (c) 2020 The Stdlib Authors.
+* Copyright (c) 2025 The Stdlib Authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
@@ -17,11 +17,12 @@
 */
 
 #include "stdlib/blas/ext/base/sapxsumkbn2.h"
-#include <stdint.h>
-#include <math.h>
+#include "stdlib/strided/base/stride2offset.h"
+#include "stdlib/blas/base/shared.h"
+#include "stdlib/math/base/special/absf.h"
 
 /**
-* Adds a constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.
 *
 * ## Method
 *
@@ -31,15 +32,38 @@
 *
 * -   Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x).
 *
-* @param N       number of indexed elements
-* @param alpha   constant
-* @param X       input array
-* @param stride  stride length
-* @return        output value
+* @param N        number of indexed elements
+* @param alpha    scalar constant
+* @param X        input array
+* @param strideX  stride length
+* @return         output value
 */
-float stdlib_strided_sapxsumkbn2( const int64_t N, const float alpha, const float *X, const int64_t stride ) {
-	int64_t ix;
-	int64_t i;
+float API_SUFFIX(stdlib_strided_sapxsumkbn2)( const CBLAS_INT N, const float alpha, const float *X, const CBLAS_INT strideX ) {
+	CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX );
+	return API_SUFFIX(stdlib_strided_sapxsumkbn2_ndarray)( N, alpha, X, strideX, ox );
+}
+
+/**
+* Adds a scalar constant to each single-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm and alternative indexing semantics.
+*
+* ## Method
+*
+* -   This implementation uses a second-order iterative Kahan–Babuška algorithm, as described by Klein (2005).
+*
+* ## References
+*
+* -   Klein, Andreas. 2005. "A Generalized Kahan-Babuška-Summation-Algorithm." _Computing_ 76 (3): 279–93. doi:[10.1007/s00607-005-0139-x](https://doi.org/10.1007/s00607-005-0139-x).
+*
+* @param N        number of indexed elements
+* @param alpha    scalar constant
+* @param X        input array
+* @param strideX  stride length
+* @param offsetX  starting index
+* @return         output value
+*/
+float API_SUFFIX(stdlib_strided_sapxsumkbn2_ndarray)( const CBLAS_INT N, const float alpha, const float *X, const CBLAS_INT strideX, const CBLAS_INT offsetX ) {
+	CBLAS_INT ix;
+	CBLAS_INT i;
 	float sum;
 	float ccs;
 	float cs;
@@ -51,13 +75,9 @@ float stdlib_strided_sapxsumkbn2( const int64_t N, const float alpha, const floa
 	if ( N <= 0 ) {
 		return 0.0f;
 	}
-	if ( N == 1 || stride == 0 ) {
-		return alpha + X[ 0 ];
-	}
-	if ( stride < 0 ) {
-		ix = (1-N) * stride;
-	} else {
-		ix = 0;
+	ix = offsetX;
+	if ( strideX == 0 ) {
+		return N * ( alpha + X[ ix ] );
 	}
 	sum = 0.0f;
 	ccs = 0.0f; // second order correction term for lost lower order bits
@@ -65,21 +85,21 @@ float stdlib_strided_sapxsumkbn2( const int64_t N, const float alpha, const floa
 	for ( i = 0; i < N; i++ ) {
 		v = alpha + X[ ix ];
 		t = sum + v;
-		if ( fabsf( sum ) >= fabsf( v ) ) {
+		if ( stdlib_base_absf( sum ) >= stdlib_base_absf( v ) ) {
 			c = (sum-t) + v;
 		} else {
 			c = (v-t) + sum;
 		}
 		sum = t;
 		t = cs + c;
-		if ( fabsf( cs ) >= fabsf( c ) ) {
+		if ( stdlib_base_absf( cs ) >= stdlib_base_absf( c ) ) {
 			cc = (cs-t) + c;
 		} else {
 			cc = (c-t) + cs;
 		}
 		cs = t;
 		ccs += cc;
-		ix += stride;
+		ix += strideX;
 	}
 	return sum + cs + ccs;
 }
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.js
index 5c28a6a0b0fa..aeb728363ca7 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.js
@@ -135,14 +135,14 @@ tape( 'the function supports a negative `stride` parameter', function test( t )
 	t.end();
 });
 
-tape( 'if provided a `stride` parameter equal to `0`, the function returns the first indexed element plus a constant', function test( t ) {
+tape( 'if provided a `stride` parameter equal to `0`, the function returns the first indexed element plus a constant repeated N times', function test( t ) {
 	var x;
 	var v;
 
 	x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] );
 
 	v = sapxsumkbn2( x.length, 5.0, x, 0, 0 );
-	t.strictEqual( v, 6.0, 'returns expected value' );
+	t.strictEqual( v, x.length * (x[0]+5.0), 'returns expected value' );
 
 	t.end();
 });
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.native.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.native.js
index 26b0dd373fdc..2dfbf39d71e4 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.ndarray.native.js
@@ -144,14 +144,14 @@ tape( 'the function supports a negative `stride` parameter', opts, function test
 	t.end();
 });
 
-tape( 'if provided a `stride` parameter equal to `0`, the function returns the first indexed element plus a constant', opts, function test( t ) {
+tape( 'if provided a `stride` parameter equal to `0`, the function returns the first indexed element plus a constant repeated N times', opts, function test( t ) {
 	var x;
 	var v;
 
 	x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] );
 
 	v = sapxsumkbn2( x.length, 5.0, x, 0, 0 );
-	t.strictEqual( v, 6.0, 'returns expected value' );
+	t.strictEqual( v, x.length * (x[0]+5.0), 'returns expected value' );
 
 	t.end();
 });
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.js
index 9005c44a6610..fcfecc1f93e4 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.js
@@ -135,14 +135,14 @@ tape( 'the function supports a negative `stride` parameter', function test( t )
 	t.end();
 });
 
-tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element plus a constant', function test( t ) {
+tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element plus a constant repeated N times', function test( t ) {
 	var x;
 	var v;
 
 	x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] );
 
 	v = sapxsumkbn2( x.length, 5.0, x, 0 );
-	t.strictEqual( v, 6.0, 'returns expected value' );
+	t.strictEqual( v, x.length * (x[0]+5.0), 'returns expected value' );
 
 	t.end();
 });
diff --git a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.native.js b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.native.js
index 1126ca1d397f..0194b4369983 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.native.js
+++ b/lib/node_modules/@stdlib/blas/ext/base/sapxsumkbn2/test/test.sapxsumkbn2.native.js
@@ -253,14 +253,14 @@ tape( 'the function supports a negative `stride` parameter', opts, function test
 	t.end();
 });
 
-tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element plus a constant', opts, function test( t ) {
+tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element plus a constant repeated N times', opts, function test( t ) {
 	var x;
 	var v;
 
 	x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] );
 
 	v = sapxsumkbn2( x.length, 5.0, x, 0 );
-	t.strictEqual( v, 6.0, 'returns expected value' );
+	t.strictEqual( v, x.length * (x[0]+5.0), 'returns expected value' );
 
 	t.end();
 });