Unknown

Dataset Information

0

Universality in numerical computations with random data.


ABSTRACT: The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance) is a random variable, called the halting time. Two-component universality is observed for the fluctuations of the halting time--i.e., the histogram for the halting times, centered by the sample average and scaled by the sample variance, collapses to a universal curve, independent of the input data distribution, as the dimension increases. Thus, up to two components--the sample average and the sample variance--the statistics for the halting time are universally prescribed. The case studies include six standard numerical algorithms as well as a model of neural computation and decision-making. A link to relevant software is provided for readers who would like to do computations of their own.

SUBMITTER: Deift PA 

PROVIDER: S-EPMC4210305 | biostudies-other | 2014 Oct

REPOSITORIES: biostudies-other

Similar Datasets

| S-EPMC6342955 | biostudies-literature
| S-EPMC7091028 | biostudies-literature
| S-EPMC4047472 | biostudies-literature
| S-EPMC1489924 | biostudies-literature
| S-EPMC2799005 | biostudies-other
| S-EPMC3852675 | biostudies-literature
| S-EPMC4360630 | biostudies-literature
| S-EPMC7612479 | biostudies-literature
| S-EPMC2830435 | biostudies-literature
| S-EPMC3738971 | biostudies-literature