pith. sign in

arxiv: 1706.10219 · v1 · pith:X6H2HUYZnew · submitted 2017-06-30 · 🧮 math.GM

Method of precision increase by averaging with application to numerical differentiation

classification 🧮 math.GM
keywords algorithmsnumericalprecisionalgorithmdifferentiationdistributionfiniteindependent
0
0 comments X
read the original abstract

If several independent algorithms for a computer-calculated quantity exist, then one can expect their results (which differ because of numerical errors) to follow approximately Gaussian distribution. The mean of this distribution, interpreted as the value of the quantity of interest, can be determined with better precision than what is the precision provided by a single algorithm. Often, with lack of enough independent algorithms, one can proceed differently: many practical algorithms introduce a bias using a parameter, e.g. a small but finite number to compute a limit or a large but finite number (cutoff) to approximate infinity. One may vary such parameter of a single algorithm and interpret the resulting numbers as generated by several algorithms. A numerical evidence for the validity of this approach is shown for differentiation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.