JSPM

Found 21 results for kbn

@stdlib/blas-ext-base-gsumkbn

Calculate the sum of strided array elements using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 39.66
  • Published

@stdlib/blas-ext-base-gcusumkbn2

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

  • v0.2.2
  • 27.99
  • Published

@stdlib/blas-ext-base-sapxsumkbn

Adds a constant to each single-precision floating-point strided array element and computes the sum using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 23.81
  • Published

@stdlib/blas-ext-base-gcusumkbn

Calculate the cumulative sum of strided array elements using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 22.40
  • Published

@stdlib/blas-ext-base-ssumkbn

Calculate the sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 21.18
  • Published

@stdlib/blas-ext-base-dapxsumkbn

Adds a constant to each double-precision floating-point strided array element and computes the sum using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 20.17
  • Published

@stdlib/blas-ext-base-dcusumkbn

Calculate the cumulative sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 19.68
  • Published

@stdlib/blas-ext-base-gapxsumkbn

Adds a constant to each strided array element and computes the sum using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 17.65
  • Published

@stdlib/stats-base-smeankbn2

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

  • v0.2.2
  • 17.09
  • Published

@stdlib/blas-ext-base-scusumkbn

Calculate the cumulative sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 16.56
  • Published

@stdlib/blas-ext-base-dsumkbn

Calculate the sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 16.49
  • Published

@stdlib/blas-ext-base-gapxsumkbn2

Adds a constant to each strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.

  • v0.2.2
  • 14.26
  • Published

@stdlib/stats-base-smeankbn

Calculate the arithmetic mean of a single-precision floating-point strided array using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 13.43
  • Published

@stdlib/blas-ext-base-dcusumkbn2

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

  • v0.2.2
  • 12.32
  • Published

@stdlib/blas-ext-base-scusumkbn2

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

  • v0.2.2
  • 11.94
  • Published

@stdlib/blas-ext-base-sapxsumkbn2

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.

  • v0.2.2
  • 11.94
  • Published

@stdlib/stats-base-dmeankbn2

Calculate the arithmetic mean of a double-precision floating-point strided array using a second-order iterative Kahan–Babuška algorithm.

  • v0.2.2
  • 11.90
  • Published

@stdlib/blas-ext-base-dapxsumkbn2

Adds a constant to each double-precision floating-point strided array element and computes the sum using a second-order iterative Kahan–Babuška algorithm.

  • v0.2.2
  • 11.07
  • Published

@stdlib/blas-ext-base-gnansumkbn

Calculate the sum of strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 10.34
  • Published

@stdlib/stats-base-dmeankbn

Calculate the arithmetic mean of a double-precision floating-point strided array using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 9.24
  • Published

@stdlib/blas-ext-base-snansumkbn

Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.

  • v0.2.2
  • 8.61
  • Published