Various algorithms
-
Updated
Aug 19, 2018 - C++
Various algorithms
A demonstration of the use of SVD in image compression
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 arithmetic mean of a single-precision floating-point strided array 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 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 double-precision floating-point strided array using a second-order iterative 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 arithmetic mean of a double-precision floating-point strided array using an improved Kahan–Babuška algorithm.
Calculate the sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
Calculate the cumulative sum of double-precision floating-point strided array elements using an improved 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.
Calculate the sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
Calculate the cumulative sum of 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 a second-order iterative Kahan–Babuška algorithm.
Calculate the arithmetic mean of a single-precision floating-point strided array using an improved Kahan–Babuška algorithm.
Lightweight C# implementations of common "compensated sum" accumulators.
Add a description, image, and links to the kahan topic page so that developers can more easily learn about it.
To associate your repository with the kahan topic, visit your repo's landing page and select "manage topics."