65 results for “topic:kahan”
Several common methods of matrix multiplication are implemented on CPU and Nvidia GPU using C++11 and CUDA.
Kahan Floating-Point (C++ implementation)
Calculate the cumulative sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
Add a constant to each strided array element and compute the sum using an improved Kahan–Babuška algorithm.
Calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.
Calculate the cumulative sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.
Calculate the sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
Calculate the arithmetic mean of a single-precision floating-point strided array using an improved Kahan–Babuška algorithm.
Add a constant to each double-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
Lightweight C# implementations of common "compensated sum" accumulators.
Calculate the cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
Add a constant to each double-precision floating-point strided array element and compute the sum using an improved Kahan–Babuška algorithm.
Welford algorithm for Go
Calculate the sum of strided array elements using an improved Kahan–Babuška algorithm.
Calculate the sum of strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.
Add a constant to each single-precision floating-point strided array element and compute the sum using an improved Kahan–Babuška algorithm.
Calculate the cumulative sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
Calculate the arithmetic mean of a double-precision floating-point strided array using a second-order iterative Kahan–Babuška algorithm.
Calculate the arithmetic mean of a double-precision floating-point strided array using an improved Kahan–Babuška algorithm.
Various algorithms
Calculate the cumulative sum of strided array elements using an improved Kahan–Babuška algorithm.
Add a constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.
Calculate the arithmetic mean of a single-precision floating-point strided array using a second-order iterative Kahan–Babuška algorithm.
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.
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.
Calculate the cumulative sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
Calculate the sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
Compute the sum of a one-dimensional single-precision floating-point ndarray, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm.
Calculate the cumulative sum of double-precision floating-point strided array elements ignoring NaN values and using an improved Kahan–Babuška algorithm.
Compute the sum of all elements in a one-dimensional double-precision floating-point ndarray using a second-order iterative Kahan–Babuška algorithm.