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

Preliminary code to test truncation algorithms for infinite series and their applications in Statistics.

Calculate the cumulative sum of strided array elements.

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 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.

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 double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.

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 cumulative sum of single-precision floating-point strided array elements using pairwise summation.

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 sum of double-precision floating-point strided array elements, ignoring NaN values and using a second-order iterative Kahan–Babuška algorithm.

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.