Applied Math Seminar: Intrinsic complexity and its scaling law: from approximation of random vectors and rand fields to high frequency waves

Seminar | March 7 | 11 a.m.-12 p.m. | 891 Evans Hall

 Hongkai Zhao, UC Irvine

 Department of Mathematics

We characterize the intrinsic complexity of a set in a metric space by the least dimension of a linear space that can approximate the set to a given tolerance. This is dual to the characterization using Kolmogorov n-width, the distance from the set to the best n-dimensional linear space. We study the approximation of random vectors (via principal component analysis a.k.a. singular value decomposition) and random fields (via Karhunen– Loève expansion) as well as the approximate separability of the Green’s function of the Helmholtz equation for high frequency waves. We provide lower bounds and upper bounds for the intrinsic complexity and its asymptotic scaling law.

 linlin@berkeley.edu