Calculate the standard deviation of a strided array using Welford's algorithm.
-
Updated
Apr 12, 2024 - JavaScript
Calculate the standard deviation of a strided array using Welford's algorithm.
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 arithmetic mean of a double-precision floating-point strided array using a two-pass error correction algorithm.
Calculate the sum of strided array elements, ignoring NaN values and using pairwise summation.
Calculate the standard deviation of a strided array.
Calculate the sum of 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 pairwise summation.
Calculate the minimum absolute value of a single-precision floating-point strided array.
Calculate the standard deviation of a single-precision floating-point strided array using a one-pass textbook algorithm.
Calculate the standard deviation of a double-precision floating-point strided array ignoring NaN values and using a one-pass algorithm proposed by Youngs and Cramer.
Evaluate the ramp function for each element in a single-precision floating-point strided array according to a strided mask array.
Calculate the sum of double-precision floating-point strided array elements, ignoring NaN values.
Calculate the variance of a single-precision floating-point strided array.
Calculate the arithmetic mean of a single-precision floating-point strided array using a two-pass error correction algorithm with extended accumulation and returning an extended precision result.
Calculate the minimum absolute value of a double-precision floating-point strided array, ignoring NaN values.
Compute the absolute value of each element retrieved from a strided input array via a callback function and assign each result to an element in a strided output array.
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.
Add a description, image, and links to the strided topic page so that developers can more easily learn about it.
To associate your repository with the strided topic, visit your repo's landing page and select "manage topics."