پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,230 |
| تعداد مقالات | 67,760 |
| تعداد مشاهده مقاله | 115,143,333 |
| تعداد دریافت فایل اصل مقاله | 89,904,940 |
Camparison of Numerically Stability of Two Algorithms for the Calculation of Variance | ||
| Journal of Sciences, Islamic Republic of Iran | ||
| مقاله 7، دوره 21، شماره 3، آذر 2010 اصل مقاله (273.6 K) | ||
| نویسنده | ||
| D Rostami | ||
| چکیده | ||
| In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better than the first Algorithm. Numerical experiments show the efficiency of Algorithm 2. | ||
| کلیدواژه‌ها | ||
| Computational statistics؛ Round off error؛ Error Analysis | ||
| عنوان مقاله [English] | ||
| Camparison of Numerically Stability of Two Algorithms for the Calculation of Variance | ||
| نویسندگان [English] | ||
| D Rosatmi | ||
| چکیده [English] | ||
| In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better than the first Algorithm. Numerical experiments show the efficiency of Algorithm 2. | ||
|
آمار تعداد مشاهده مقاله: 1,336 تعداد دریافت فایل اصل مقاله: 1,461 |
||