Universality in numerical computation with random data. Case studies, analytic results and some speculations
Probability
2017-03-24 v1 Numerical Analysis
Exactly Solvable and Integrable Systems
Abstract
We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.
Cite
@article{arxiv.1703.08092,
title = {Universality in numerical computation with random data. Case studies, analytic results and some speculations},
author = {Percy Deift and Thomas Trogdon},
journal= {arXiv preprint arXiv:1703.08092},
year = {2017}
}