time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

snanvariancech.c (3534B)


      1 /**
      2 * @license Apache-2.0
      3 *
      4 * Copyright (c) 2020 The Stdlib Authors.
      5 *
      6 * Licensed under the Apache License, Version 2.0 (the "License");
      7 * you may not use this file except in compliance with the License.
      8 * You may obtain a copy of the License at
      9 *
     10 *    http://www.apache.org/licenses/LICENSE-2.0
     11 *
     12 * Unless required by applicable law or agreed to in writing, software
     13 * distributed under the License is distributed on an "AS IS" BASIS,
     14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     15 * See the License for the specific language governing permissions and
     16 * limitations under the License.
     17 */
     18 
     19 #include "stdlib/stats/base/snanvariancech.h"
     20 #include <stdint.h>
     21 
     22 /**
     23 * Computes the variance of a single-precision floating-point strided array ignoring `NaN` values and using a one-pass trial mean algorithm.
     24 *
     25 * ## Method
     26 *
     27 * -   This implementation uses a one-pass trial mean approach, as suggested by Chan et al (1983).
     28 *
     29 * ## References
     30 *
     31 * -   Neely, Peter M. 1966. "Comparison of Several Algorithms for Computation of Means, Standard Deviations and Correlation Coefficients." _Communications of the ACM_ 9 (7). Association for Computing Machinery: 496–99. doi:[10.1145/365719.365958](https://doi.org/10.1145/365719.365958).
     32 * -   Ling, Robert F. 1974. "Comparison of Several Algorithms for Computing Sample Means and Variances." _Journal of the American Statistical Association_ 69 (348). American Statistical Association, Taylor & Francis, Ltd.: 859–66. doi:[10.2307/2286154](https://doi.org/10.2307/2286154).
     33 * -   Chan, Tony F., Gene H. Golub, and Randall J. LeVeque. 1983. "Algorithms for Computing the Sample Variance: Analysis and Recommendations." _The American Statistician_ 37 (3). American Statistical Association, Taylor & Francis, Ltd.: 242–47. doi:[10.1080/00031305.1983.10483115](https://doi.org/10.1080/00031305.1983.10483115).
     34 * -   Schubert, Erich, and Michael Gertz. 2018. "Numerically Stable Parallel Computation of (Co-)Variance." In _Proceedings of the 30th International Conference on Scientific and Statistical Database Management_. New York, NY, USA: Association for Computing Machinery. doi:[10.1145/3221269.3223036](https://doi.org/10.1145/3221269.3223036).
     35 *
     36 * @param N           number of indexed elements
     37 * @param correction  degrees of freedom adjustment
     38 * @param X           input array
     39 * @param stride      stride length
     40 * @return            output value
     41 */
     42 float stdlib_strided_snanvariancech( const int64_t N, const float correction, const float *X, const int64_t stride ) {
     43 	int64_t ix;
     44 	int64_t n;
     45 	int64_t i;
     46 	double dn;
     47 	double nc;
     48 	double dM;
     49 	float M2;
     50 	float mu;
     51 	float M;
     52 	float d;
     53 	float v;
     54 
     55 	if ( N <= 0 ) {
     56 		return 0.0f / 0.0f; // NaN
     57 	}
     58 	if ( N == 1 || stride == 0 ) {
     59 		v = X[ 0 ];
     60 		if ( v == v && (double)N-(double)correction > 0.0 ) {
     61 			return 0.0f;
     62 		}
     63 		return 0.0f / 0.0f; // NaN
     64 	}
     65 	if ( stride < 0 ) {
     66 		ix = (1-N) * stride;
     67 	} else {
     68 		ix = 0;
     69 	}
     70 	// Find an estimate for the mean...
     71 	for ( i = 0; i < N; i++ ) {
     72 		v = X[ ix ];
     73 		if ( v == v ) {
     74 			mu = v;
     75 			break;
     76 		}
     77 		ix += stride;
     78 	}
     79 	if ( i == N ) {
     80 		return 0.0f / 0.0f; // NaN
     81 	}
     82 	ix += stride;
     83 	i += 1;
     84 
     85 	// Compute the variance...
     86 	M2 = 0.0f;
     87 	M = 0.0f;
     88 	n = 1;
     89 	for (; i < N; i++ ) {
     90 		v = X[ ix ];
     91 		if ( v == v ) {
     92 			d = v - mu;
     93 			M2 += d * d;
     94 			M += d;
     95 			n += 1;
     96 		}
     97 		ix += stride;
     98 	}
     99 	dn = (double)n;
    100 	nc = dn - (double)correction;
    101 	if ( nc <= 0.0 ) {
    102 		return 0.0f / 0.0f; // NaN
    103 	}
    104 	dM = (double)M;
    105 	return (float)((double)M2/nc) - ( (float)(dM/dn) * (float)(dM/nc) );
    106 }