High performance algorithms in C#: SIMD/SSE, multi-core and faster
-
Updated
Feb 12, 2024 - C#
High performance algorithms in C#: SIMD/SSE, multi-core and faster
🐍 A Collection of Notes for Learning & Understanding Deep Learning / Machine Learning / Artificial Intelligence (AI) with TensorFlow 🐍
Sum and cumulative sum using the Kahan-Babuska-Neumaier algorithm
This repository contains 1,000 files, each containing 100,000 Integers ... your task is to sum all integers in all files
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values, using ordinary recursive summation with extended accumulation, and returning an extended precision result.
Calculator that simplifies your expressions to avoid rounding errors
Calculate the cumulative sum of double-precision floating-point strided array elements using a second-order iterative 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.
Preliminary code to test truncation algorithms for infinite series and their applications in Statistics.
Calculate the sum of single-precision floating-point strided array elements.
Calculate the cumulative sum of strided array elements.
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values, using ordinary recursive summation with extended accumulation, and returning an extended precision result.
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values, using extended accumulation, and returning an extended precision result.
Calculate the cumulative sum of single-precision floating-point strided array elements.
Calculate the cumulative sum of double-precision floating-point strided array elements.
Calculate the arithmetic mean of a double-precision floating-point strided array using pairwise summation.
Calculate the sum of strided array elements, ignoring NaN values and using pairwise summation.
Calculate the 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, ignoring NaN values.
Calculate the sum of absolute values (L1 norm) of double-precision floating-point strided array elements, ignoring NaN values and using ordinary recursive summation.
Add a description, image, and links to the summation topic page so that developers can more easily learn about it.
To associate your repository with the summation topic, visit your repo's landing page and select "manage topics."