Skip to main content
Conference Proceedings

Universality in numerical computation with random data: Case Studies, Analytical Results and Some Speculations

Abel Symposia (2018) 13 221-231
DOI: 10.1007/978-3-030-01593-0_8
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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

CITATION STYLE

APA

Deift, P., & Trogdon, T. (2018). Universality in numerical computation with random data: Case Studies, Analytical Results and Some Speculations. In Abel Symposia (Vol. 13, pp. 221–231). Springer Heidelberg. https://doi.org/10.1007/978-3-030-01593-0_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free