There are 0 repository under summation topic.
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
Adds a constant to each double-precision floating-point strided array element and computes the sum.
Add a constant to each double-precision floating-point strided array element and compute the sum 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.
Calculate the cumulative sum of double-precision floating-point strided array elements.
Calculate the cumulative sum of double-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 a second-order iterative Kahan–Babuška algorithm.
Calculate the sum of absolute values (L1 norm) of double-precision floating-point strided array elements, ignoring NaN values and using ordinary recursive summation.
Calculate the sum of double-precision floating-point strided array elements, ignoring NaN values.
Calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.
Calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and 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 double-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.
Calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using a second-order iterative Kahan–Babuška algorithm.
Calculate the sum of double-precision floating-point strided array elements.
Calculate the sum of double-precision floating-point strided array elements 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.
Calculate the cumulative sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.
Calculate the cumulative sum of single-precision floating-point strided array elements using pairwise summation.
Adds a constant to each single-precision floating-point strided array element and computes the sum using extended accumulation.
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using extended accumulation.
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using pairwise summation with extended accumulation.
Calculate the sum of single-precision floating-point strided array elements using extended accumulation.
Calculate the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation.
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values.
Calculate the sum of single-precision floating-point strided array elements, ignoring NaN values and using pairwise summation.
Calculate the sum of single-precision floating-point strided array elements.
Calculate the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.
Compute the sum of two single-precision floating-point numbers.
Element-wise addition of two strided arrays.